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_maxInArray_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:04:45,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:04:45,783 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:04:45,804 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:04:45,806 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:04:45,807 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:04:45,809 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:04:45,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:04:45,816 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:04:45,817 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:04:45,820 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:04:45,820 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:04:45,822 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:04:45,823 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:04:45,832 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:04:45,833 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:04:45,833 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:04:45,839 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:04:45,845 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:04:45,846 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:04:45,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:04:45,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:04:45,856 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:04:45,856 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:04:45,856 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:04:45,857 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:04:45,858 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:04:45,859 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:04:45,859 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:04:45,865 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:04:45,865 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:04:45,866 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:04:45,866 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:04:45,866 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:04:45,869 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:04:45,870 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:04:45,871 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 12:04:45,901 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:04:45,901 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:04:45,902 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:04:45,904 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:04:45,904 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:04:45,905 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:04:45,905 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:04:45,905 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:04:45,905 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:04:45,905 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:04:45,910 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:04:45,910 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:04:45,910 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:04:45,910 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:04:45,910 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:04:45,911 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:04:45,911 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:04:45,911 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:04:45,911 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:04:45,911 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:04:45,913 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:04:45,913 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:04:45,913 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:04:45,913 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:04:45,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:04:45,914 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:04:45,914 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:04:45,914 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:04:45,914 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:04:45,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:04:45,915 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:04:45,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:04:45,991 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:04:45,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:04:45,999 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:04:45,999 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:04:46,000 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_maxInArray_true-unreach-call_ground.i [2018-11-23 12:04:46,070 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844544084/80e87ebc9f5646089eeb0bac36e2c48d/FLAGcec0aa08a [2018-11-23 12:04:46,565 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:04:46,565 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_maxInArray_true-unreach-call_ground.i [2018-11-23 12:04:46,573 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844544084/80e87ebc9f5646089eeb0bac36e2c48d/FLAGcec0aa08a [2018-11-23 12:04:46,889 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844544084/80e87ebc9f5646089eeb0bac36e2c48d [2018-11-23 12:04:46,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:04:46,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:04:46,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:04:46,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:04:46,906 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:04:46,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:04:46" (1/1) ... [2018-11-23 12:04:46,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339f1d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:04:46, skipping insertion in model container [2018-11-23 12:04:46,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:04:46" (1/1) ... [2018-11-23 12:04:46,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:04:46,944 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:04:47,192 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:04:47,197 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:04:47,230 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:04:47,261 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:04:47,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:04:47 WrapperNode [2018-11-23 12:04:47,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:04:47,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:04:47,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:04:47,264 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:04:47,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:04:47" (1/1) ... [2018-11-23 12:04:47,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:04:47" (1/1) ... [2018-11-23 12:04:47,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:04:47,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:04:47,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:04:47,298 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:04:47,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:04:47" (1/1) ... [2018-11-23 12:04:47,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:04:47" (1/1) ... [2018-11-23 12:04:47,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:04:47" (1/1) ... [2018-11-23 12:04:47,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:04:47" (1/1) ... [2018-11-23 12:04:47,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:04:47" (1/1) ... [2018-11-23 12:04:47,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:04:47" (1/1) ... [2018-11-23 12:04:47,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:04:47" (1/1) ... [2018-11-23 12:04:47,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:04:47,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:04:47,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:04:47,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:04:47,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:04:47" (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 12:04:47,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:04:47,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:04:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:04:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:04:47,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:04:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:04:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:04:47,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:04:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:04:47,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:04:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:04:48,112 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:04:48,113 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:04:48,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:04:48 BoogieIcfgContainer [2018-11-23 12:04:48,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:04:48,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:04:48,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:04:48,118 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:04:48,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:04:46" (1/3) ... [2018-11-23 12:04:48,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1666408d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:04:48, skipping insertion in model container [2018-11-23 12:04:48,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:04:47" (2/3) ... [2018-11-23 12:04:48,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1666408d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:04:48, skipping insertion in model container [2018-11-23 12:04:48,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:04:48" (3/3) ... [2018-11-23 12:04:48,123 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_maxInArray_true-unreach-call_ground.i [2018-11-23 12:04:48,134 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:04:48,141 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:04:48,158 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:04:48,192 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:04:48,193 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:04:48,193 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:04:48,194 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:04:48,195 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:04:48,195 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:04:48,195 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:04:48,196 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:04:48,196 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:04:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 12:04:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:04:48,224 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:48,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:48,228 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:48,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:48,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1513105276, now seen corresponding path program 1 times [2018-11-23 12:04:48,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:48,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:48,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:48,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:48,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:48,409 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 12:04:48,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-23 12:04:48,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 12:04:48,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #55#return; {28#true} is VALID [2018-11-23 12:04:48,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret4 := main(); {28#true} is VALID [2018-11-23 12:04:48,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {28#true} is VALID [2018-11-23 12:04:48,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 12:04:48,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} havoc ~x~0;~x~0 := 0; {29#false} is VALID [2018-11-23 12:04:48,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {29#false} is VALID [2018-11-23 12:04:48,430 INFO L256 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {29#false} is VALID [2018-11-23 12:04:48,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 12:04:48,431 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2018-11-23 12:04:48,431 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 12:04:48,434 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 12:04:48,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:04:48,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:04:48,442 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:04:48,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:48,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:04:48,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:48,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:04:48,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:04:48,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:04:48,563 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 12:04:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:48,711 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 12:04:48,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:04:48,712 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:04:48,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:04:48,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 12:04:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:04:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 12:04:48,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2018-11-23 12:04:49,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:49,120 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:04:49,120 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:04:49,124 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 12:04:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:04:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:04:49,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:49,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:04:49,180 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:04:49,180 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:04:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:49,184 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:04:49,184 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:04:49,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:49,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:49,185 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:04:49,185 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:04:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:49,189 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:04:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:04:49,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:49,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:49,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:49,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:04:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 12:04:49,195 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-11-23 12:04:49,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:49,196 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 12:04:49,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:04:49,196 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:04:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:04:49,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:49,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:49,198 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:49,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:49,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1609256121, now seen corresponding path program 1 times [2018-11-23 12:04:49,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:49,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:49,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:49,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:49,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:49,284 INFO L256 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2018-11-23 12:04:49,284 INFO L273 TraceCheckUtils]: 1: Hoare triple {152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {152#true} is VALID [2018-11-23 12:04:49,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {152#true} assume true; {152#true} is VALID [2018-11-23 12:04:49,285 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} #55#return; {152#true} is VALID [2018-11-23 12:04:49,285 INFO L256 TraceCheckUtils]: 4: Hoare triple {152#true} call #t~ret4 := main(); {152#true} is VALID [2018-11-23 12:04:49,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {152#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {154#(= main_~i~0 0)} is VALID [2018-11-23 12:04:49,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {154#(= main_~i~0 0)} assume !(~i~0 < 100000); {153#false} is VALID [2018-11-23 12:04:49,289 INFO L273 TraceCheckUtils]: 7: Hoare triple {153#false} havoc ~x~0;~x~0 := 0; {153#false} is VALID [2018-11-23 12:04:49,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {153#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {153#false} is VALID [2018-11-23 12:04:49,290 INFO L256 TraceCheckUtils]: 9: Hoare triple {153#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {153#false} is VALID [2018-11-23 12:04:49,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {153#false} ~cond := #in~cond; {153#false} is VALID [2018-11-23 12:04:49,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {153#false} assume 0 == ~cond; {153#false} is VALID [2018-11-23 12:04:49,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {153#false} assume !false; {153#false} is VALID [2018-11-23 12:04:49,291 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 12:04:49,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:04:49,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:04:49,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:04:49,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:49,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:04:49,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:49,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:04:49,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:04:49,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:04:49,360 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 12:04:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:49,603 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:04:49,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:04:49,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:04:49,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:04:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 12:04:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:04:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 12:04:49,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-23 12:04:49,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:49,677 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:04:49,677 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 12:04:49,679 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 12:04:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 12:04:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-23 12:04:49,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:49,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2018-11-23 12:04:49,709 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2018-11-23 12:04:49,709 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2018-11-23 12:04:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:49,711 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 12:04:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 12:04:49,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:49,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:49,712 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2018-11-23 12:04:49,713 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2018-11-23 12:04:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:49,715 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 12:04:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 12:04:49,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:49,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:49,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:49,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:04:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 12:04:49,718 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2018-11-23 12:04:49,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:49,718 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 12:04:49,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:04:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 12:04:49,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:04:49,719 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:49,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:49,720 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:49,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:49,720 INFO L82 PathProgramCache]: Analyzing trace with hash -30491421, now seen corresponding path program 1 times [2018-11-23 12:04:49,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:49,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:49,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:49,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:49,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:49,840 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 12:04:49,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-23 12:04:49,841 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 12:04:49,841 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #55#return; {279#true} is VALID [2018-11-23 12:04:49,841 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret4 := main(); {279#true} is VALID [2018-11-23 12:04:49,857 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {281#(= main_~i~0 0)} is VALID [2018-11-23 12:04:49,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {281#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {281#(= main_~i~0 0)} is VALID [2018-11-23 12:04:49,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {281#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {281#(= main_~i~0 0)} is VALID [2018-11-23 12:04:49,902 INFO L273 TraceCheckUtils]: 8: Hoare triple {281#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {282#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:49,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {282#(<= main_~i~0 1)} assume !(~i~0 < 100000); {280#false} is VALID [2018-11-23 12:04:49,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {280#false} havoc ~x~0;~x~0 := 0; {280#false} is VALID [2018-11-23 12:04:49,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {280#false} is VALID [2018-11-23 12:04:49,919 INFO L256 TraceCheckUtils]: 12: Hoare triple {280#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {280#false} is VALID [2018-11-23 12:04:49,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-23 12:04:49,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2018-11-23 12:04:49,920 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 12:04:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:49,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:49,925 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 12:04:49,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:50,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:50,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 12:04:50,277 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-23 12:04:50,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 12:04:50,277 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #55#return; {279#true} is VALID [2018-11-23 12:04:50,278 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret4 := main(); {279#true} is VALID [2018-11-23 12:04:50,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {301#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:50,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {301#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {301#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:50,283 INFO L273 TraceCheckUtils]: 7: Hoare triple {301#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {301#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:50,284 INFO L273 TraceCheckUtils]: 8: Hoare triple {301#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {282#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:50,290 INFO L273 TraceCheckUtils]: 9: Hoare triple {282#(<= main_~i~0 1)} assume !(~i~0 < 100000); {280#false} is VALID [2018-11-23 12:04:50,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {280#false} havoc ~x~0;~x~0 := 0; {280#false} is VALID [2018-11-23 12:04:50,291 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {280#false} is VALID [2018-11-23 12:04:50,291 INFO L256 TraceCheckUtils]: 12: Hoare triple {280#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {280#false} is VALID [2018-11-23 12:04:50,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-23 12:04:50,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2018-11-23 12:04:50,292 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 12:04:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:50,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:50,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:04:50,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:04:50,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:50,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:04:50,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:50,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:04:50,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:04:50,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:04:50,355 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-11-23 12:04:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:50,725 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 12:04:50,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:04:50,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:04:50,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:04:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 12:04:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:04:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 12:04:50,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2018-11-23 12:04:50,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:50,898 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:04:50,898 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:04:50,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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 12:04:50,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:04:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 12:04:50,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:50,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-23 12:04:50,917 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-23 12:04:50,917 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-23 12:04:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:50,920 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:04:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:04:50,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:50,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:50,921 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-23 12:04:50,921 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-23 12:04:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:50,924 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:04:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:04:50,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:50,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:50,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:50,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:04:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 12:04:50,927 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 16 [2018-11-23 12:04:50,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:50,928 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 12:04:50,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:04:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:04:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:04:50,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:50,929 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:50,930 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:50,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:50,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1208509561, now seen corresponding path program 2 times [2018-11-23 12:04:50,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:50,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:50,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:50,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:50,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:51,100 INFO L256 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {467#true} is VALID [2018-11-23 12:04:51,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {467#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {467#true} is VALID [2018-11-23 12:04:51,101 INFO L273 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2018-11-23 12:04:51,101 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {467#true} {467#true} #55#return; {467#true} is VALID [2018-11-23 12:04:51,101 INFO L256 TraceCheckUtils]: 4: Hoare triple {467#true} call #t~ret4 := main(); {467#true} is VALID [2018-11-23 12:04:51,104 INFO L273 TraceCheckUtils]: 5: Hoare triple {467#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {469#(= main_~i~0 0)} is VALID [2018-11-23 12:04:51,105 INFO L273 TraceCheckUtils]: 6: Hoare triple {469#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {469#(= main_~i~0 0)} is VALID [2018-11-23 12:04:51,108 INFO L273 TraceCheckUtils]: 7: Hoare triple {469#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {469#(= main_~i~0 0)} is VALID [2018-11-23 12:04:51,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {469#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {470#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:51,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {470#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {470#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:51,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {470#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {470#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:51,115 INFO L273 TraceCheckUtils]: 11: Hoare triple {470#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {471#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:51,115 INFO L273 TraceCheckUtils]: 12: Hoare triple {471#(<= main_~i~0 2)} assume !(~i~0 < 100000); {468#false} is VALID [2018-11-23 12:04:51,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {468#false} havoc ~x~0;~x~0 := 0; {468#false} is VALID [2018-11-23 12:04:51,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {468#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {468#false} is VALID [2018-11-23 12:04:51,117 INFO L256 TraceCheckUtils]: 15: Hoare triple {468#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {468#false} is VALID [2018-11-23 12:04:51,117 INFO L273 TraceCheckUtils]: 16: Hoare triple {468#false} ~cond := #in~cond; {468#false} is VALID [2018-11-23 12:04:51,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {468#false} assume 0 == ~cond; {468#false} is VALID [2018-11-23 12:04:51,118 INFO L273 TraceCheckUtils]: 18: Hoare triple {468#false} assume !false; {468#false} is VALID [2018-11-23 12:04:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:51,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:51,120 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 12:04:51,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:04:51,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:04:51,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:51,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:51,309 INFO L256 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {467#true} is VALID [2018-11-23 12:04:51,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {467#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {467#true} is VALID [2018-11-23 12:04:51,310 INFO L273 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2018-11-23 12:04:51,310 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {467#true} {467#true} #55#return; {467#true} is VALID [2018-11-23 12:04:51,310 INFO L256 TraceCheckUtils]: 4: Hoare triple {467#true} call #t~ret4 := main(); {467#true} is VALID [2018-11-23 12:04:51,312 INFO L273 TraceCheckUtils]: 5: Hoare triple {467#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {490#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:51,313 INFO L273 TraceCheckUtils]: 6: Hoare triple {490#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {490#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:51,314 INFO L273 TraceCheckUtils]: 7: Hoare triple {490#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {490#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:51,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {490#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {470#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:51,340 INFO L273 TraceCheckUtils]: 9: Hoare triple {470#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {470#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:51,349 INFO L273 TraceCheckUtils]: 10: Hoare triple {470#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {470#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:51,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {470#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {471#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:51,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {471#(<= main_~i~0 2)} assume !(~i~0 < 100000); {468#false} is VALID [2018-11-23 12:04:51,352 INFO L273 TraceCheckUtils]: 13: Hoare triple {468#false} havoc ~x~0;~x~0 := 0; {468#false} is VALID [2018-11-23 12:04:51,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {468#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {468#false} is VALID [2018-11-23 12:04:51,352 INFO L256 TraceCheckUtils]: 15: Hoare triple {468#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {468#false} is VALID [2018-11-23 12:04:51,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {468#false} ~cond := #in~cond; {468#false} is VALID [2018-11-23 12:04:51,353 INFO L273 TraceCheckUtils]: 17: Hoare triple {468#false} assume 0 == ~cond; {468#false} is VALID [2018-11-23 12:04:51,353 INFO L273 TraceCheckUtils]: 18: Hoare triple {468#false} assume !false; {468#false} is VALID [2018-11-23 12:04:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:51,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:51,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:04:51,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 12:04:51,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:51,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:04:51,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:51,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:04:51,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:04:51,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:04:51,427 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2018-11-23 12:04:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:51,608 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 12:04:51,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:04:51,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 12:04:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:04:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 12:04:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:04:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 12:04:51,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2018-11-23 12:04:51,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:51,775 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:04:51,775 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:04:51,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:04:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:04:51,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 12:04:51,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:51,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 12:04:51,790 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 12:04:51,790 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 12:04:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:51,794 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:04:51,794 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:04:51,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:51,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:51,795 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 12:04:51,796 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 12:04:51,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:51,798 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:04:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:04:51,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:51,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:51,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:51,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:04:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:04:51,808 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2018-11-23 12:04:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:51,808 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:04:51,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:04:51,809 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:04:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:04:51,809 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:51,810 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:51,810 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:51,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:51,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1337822499, now seen corresponding path program 3 times [2018-11-23 12:04:51,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:51,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:51,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:51,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:51,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:51,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2018-11-23 12:04:51,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {679#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {679#true} is VALID [2018-11-23 12:04:51,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2018-11-23 12:04:51,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #55#return; {679#true} is VALID [2018-11-23 12:04:51,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {679#true} call #t~ret4 := main(); {679#true} is VALID [2018-11-23 12:04:51,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {679#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {681#(= main_~i~0 0)} is VALID [2018-11-23 12:04:51,945 INFO L273 TraceCheckUtils]: 6: Hoare triple {681#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {681#(= main_~i~0 0)} is VALID [2018-11-23 12:04:51,946 INFO L273 TraceCheckUtils]: 7: Hoare triple {681#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {681#(= main_~i~0 0)} is VALID [2018-11-23 12:04:51,946 INFO L273 TraceCheckUtils]: 8: Hoare triple {681#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {682#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:51,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {682#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {682#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:51,953 INFO L273 TraceCheckUtils]: 10: Hoare triple {682#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {682#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:51,955 INFO L273 TraceCheckUtils]: 11: Hoare triple {682#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {683#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:51,956 INFO L273 TraceCheckUtils]: 12: Hoare triple {683#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {683#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:51,957 INFO L273 TraceCheckUtils]: 13: Hoare triple {683#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {683#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:51,959 INFO L273 TraceCheckUtils]: 14: Hoare triple {683#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {684#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:51,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {684#(<= main_~i~0 3)} assume !(~i~0 < 100000); {680#false} is VALID [2018-11-23 12:04:51,960 INFO L273 TraceCheckUtils]: 16: Hoare triple {680#false} havoc ~x~0;~x~0 := 0; {680#false} is VALID [2018-11-23 12:04:51,961 INFO L273 TraceCheckUtils]: 17: Hoare triple {680#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {680#false} is VALID [2018-11-23 12:04:51,961 INFO L256 TraceCheckUtils]: 18: Hoare triple {680#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {680#false} is VALID [2018-11-23 12:04:51,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {680#false} ~cond := #in~cond; {680#false} is VALID [2018-11-23 12:04:51,962 INFO L273 TraceCheckUtils]: 20: Hoare triple {680#false} assume 0 == ~cond; {680#false} is VALID [2018-11-23 12:04:51,962 INFO L273 TraceCheckUtils]: 21: Hoare triple {680#false} assume !false; {680#false} is VALID [2018-11-23 12:04:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:51,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:51,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 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 12:04:51,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:04:51,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:04:51,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:52,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:52,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2018-11-23 12:04:52,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {679#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {679#true} is VALID [2018-11-23 12:04:52,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2018-11-23 12:04:52,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #55#return; {679#true} is VALID [2018-11-23 12:04:52,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {679#true} call #t~ret4 := main(); {679#true} is VALID [2018-11-23 12:04:52,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {679#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {703#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:52,128 INFO L273 TraceCheckUtils]: 6: Hoare triple {703#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {703#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:52,128 INFO L273 TraceCheckUtils]: 7: Hoare triple {703#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {703#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:52,129 INFO L273 TraceCheckUtils]: 8: Hoare triple {703#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {682#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:52,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {682#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {682#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:52,135 INFO L273 TraceCheckUtils]: 10: Hoare triple {682#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {682#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:52,136 INFO L273 TraceCheckUtils]: 11: Hoare triple {682#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {683#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:52,136 INFO L273 TraceCheckUtils]: 12: Hoare triple {683#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {683#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:52,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {683#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {683#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:52,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {683#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {684#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:52,140 INFO L273 TraceCheckUtils]: 15: Hoare triple {684#(<= main_~i~0 3)} assume !(~i~0 < 100000); {680#false} is VALID [2018-11-23 12:04:52,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {680#false} havoc ~x~0;~x~0 := 0; {680#false} is VALID [2018-11-23 12:04:52,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {680#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {680#false} is VALID [2018-11-23 12:04:52,141 INFO L256 TraceCheckUtils]: 18: Hoare triple {680#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {680#false} is VALID [2018-11-23 12:04:52,142 INFO L273 TraceCheckUtils]: 19: Hoare triple {680#false} ~cond := #in~cond; {680#false} is VALID [2018-11-23 12:04:52,142 INFO L273 TraceCheckUtils]: 20: Hoare triple {680#false} assume 0 == ~cond; {680#false} is VALID [2018-11-23 12:04:52,142 INFO L273 TraceCheckUtils]: 21: Hoare triple {680#false} assume !false; {680#false} is VALID [2018-11-23 12:04:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:52,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:52,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:04:52,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 12:04:52,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:52,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:04:52,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:52,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:04:52,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:04:52,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:04:52,200 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 7 states. [2018-11-23 12:04:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:52,385 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-23 12:04:52,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:04:52,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 12:04:52,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:04:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-23 12:04:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:04:52,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-23 12:04:52,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 50 transitions. [2018-11-23 12:04:52,501 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 12:04:52,502 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:04:52,502 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:04:52,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:04:52,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:04:52,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 12:04:52,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:52,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2018-11-23 12:04:52,523 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2018-11-23 12:04:52,523 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2018-11-23 12:04:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:52,526 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 12:04:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:04:52,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:52,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:52,528 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2018-11-23 12:04:52,528 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2018-11-23 12:04:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:52,530 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 12:04:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:04:52,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:52,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:52,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:52,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:04:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 12:04:52,533 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2018-11-23 12:04:52,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:52,534 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 12:04:52,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:04:52,534 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 12:04:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:04:52,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:52,535 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:52,536 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:52,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:52,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1113893945, now seen corresponding path program 4 times [2018-11-23 12:04:52,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:52,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:52,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:52,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:52,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:52,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {915#true} call ULTIMATE.init(); {915#true} is VALID [2018-11-23 12:04:52,687 INFO L273 TraceCheckUtils]: 1: Hoare triple {915#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {915#true} is VALID [2018-11-23 12:04:52,687 INFO L273 TraceCheckUtils]: 2: Hoare triple {915#true} assume true; {915#true} is VALID [2018-11-23 12:04:52,688 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {915#true} {915#true} #55#return; {915#true} is VALID [2018-11-23 12:04:52,688 INFO L256 TraceCheckUtils]: 4: Hoare triple {915#true} call #t~ret4 := main(); {915#true} is VALID [2018-11-23 12:04:52,693 INFO L273 TraceCheckUtils]: 5: Hoare triple {915#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {917#(= main_~i~0 0)} is VALID [2018-11-23 12:04:52,695 INFO L273 TraceCheckUtils]: 6: Hoare triple {917#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {917#(= main_~i~0 0)} is VALID [2018-11-23 12:04:52,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {917#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {917#(= main_~i~0 0)} is VALID [2018-11-23 12:04:52,697 INFO L273 TraceCheckUtils]: 8: Hoare triple {917#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {918#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:52,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {918#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {918#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:52,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {918#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {918#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:52,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {918#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {919#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:52,703 INFO L273 TraceCheckUtils]: 12: Hoare triple {919#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {919#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:52,704 INFO L273 TraceCheckUtils]: 13: Hoare triple {919#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {919#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:52,704 INFO L273 TraceCheckUtils]: 14: Hoare triple {919#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {920#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:52,705 INFO L273 TraceCheckUtils]: 15: Hoare triple {920#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {920#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:52,705 INFO L273 TraceCheckUtils]: 16: Hoare triple {920#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {920#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:52,706 INFO L273 TraceCheckUtils]: 17: Hoare triple {920#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {921#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:52,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {921#(<= main_~i~0 4)} assume !(~i~0 < 100000); {916#false} is VALID [2018-11-23 12:04:52,707 INFO L273 TraceCheckUtils]: 19: Hoare triple {916#false} havoc ~x~0;~x~0 := 0; {916#false} is VALID [2018-11-23 12:04:52,708 INFO L273 TraceCheckUtils]: 20: Hoare triple {916#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {916#false} is VALID [2018-11-23 12:04:52,708 INFO L256 TraceCheckUtils]: 21: Hoare triple {916#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {916#false} is VALID [2018-11-23 12:04:52,708 INFO L273 TraceCheckUtils]: 22: Hoare triple {916#false} ~cond := #in~cond; {916#false} is VALID [2018-11-23 12:04:52,709 INFO L273 TraceCheckUtils]: 23: Hoare triple {916#false} assume 0 == ~cond; {916#false} is VALID [2018-11-23 12:04:52,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {916#false} assume !false; {916#false} is VALID [2018-11-23 12:04:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:52,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:52,712 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 12:04:52,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:04:52,740 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:04:52,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:52,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:53,009 INFO L256 TraceCheckUtils]: 0: Hoare triple {915#true} call ULTIMATE.init(); {915#true} is VALID [2018-11-23 12:04:53,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {915#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {915#true} is VALID [2018-11-23 12:04:53,010 INFO L273 TraceCheckUtils]: 2: Hoare triple {915#true} assume true; {915#true} is VALID [2018-11-23 12:04:53,011 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {915#true} {915#true} #55#return; {915#true} is VALID [2018-11-23 12:04:53,011 INFO L256 TraceCheckUtils]: 4: Hoare triple {915#true} call #t~ret4 := main(); {915#true} is VALID [2018-11-23 12:04:53,012 INFO L273 TraceCheckUtils]: 5: Hoare triple {915#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {940#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:53,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {940#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {940#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:53,013 INFO L273 TraceCheckUtils]: 7: Hoare triple {940#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {940#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:53,014 INFO L273 TraceCheckUtils]: 8: Hoare triple {940#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {918#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:53,014 INFO L273 TraceCheckUtils]: 9: Hoare triple {918#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {918#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:53,015 INFO L273 TraceCheckUtils]: 10: Hoare triple {918#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {918#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:53,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {918#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {919#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:53,016 INFO L273 TraceCheckUtils]: 12: Hoare triple {919#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {919#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:53,017 INFO L273 TraceCheckUtils]: 13: Hoare triple {919#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {919#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:53,018 INFO L273 TraceCheckUtils]: 14: Hoare triple {919#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {920#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:53,019 INFO L273 TraceCheckUtils]: 15: Hoare triple {920#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {920#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:53,019 INFO L273 TraceCheckUtils]: 16: Hoare triple {920#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {920#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:53,020 INFO L273 TraceCheckUtils]: 17: Hoare triple {920#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {921#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:53,021 INFO L273 TraceCheckUtils]: 18: Hoare triple {921#(<= main_~i~0 4)} assume !(~i~0 < 100000); {916#false} is VALID [2018-11-23 12:04:53,022 INFO L273 TraceCheckUtils]: 19: Hoare triple {916#false} havoc ~x~0;~x~0 := 0; {916#false} is VALID [2018-11-23 12:04:53,022 INFO L273 TraceCheckUtils]: 20: Hoare triple {916#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {916#false} is VALID [2018-11-23 12:04:53,022 INFO L256 TraceCheckUtils]: 21: Hoare triple {916#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {916#false} is VALID [2018-11-23 12:04:53,023 INFO L273 TraceCheckUtils]: 22: Hoare triple {916#false} ~cond := #in~cond; {916#false} is VALID [2018-11-23 12:04:53,023 INFO L273 TraceCheckUtils]: 23: Hoare triple {916#false} assume 0 == ~cond; {916#false} is VALID [2018-11-23 12:04:53,024 INFO L273 TraceCheckUtils]: 24: Hoare triple {916#false} assume !false; {916#false} is VALID [2018-11-23 12:04:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:53,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:53,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:04:53,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 12:04:53,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:53,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:04:53,114 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 12:04:53,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:04:53,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:04:53,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:04:53,115 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 8 states. [2018-11-23 12:04:53,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:53,297 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:04:53,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:04:53,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 12:04:53,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:53,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:04:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2018-11-23 12:04:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:04:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2018-11-23 12:04:53,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2018-11-23 12:04:53,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:53,383 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:04:53,383 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:04:53,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:04:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:04:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 12:04:53,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:53,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 33 states. [2018-11-23 12:04:53,401 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 33 states. [2018-11-23 12:04:53,401 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 33 states. [2018-11-23 12:04:53,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:53,403 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 12:04:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 12:04:53,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:53,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:53,404 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 35 states. [2018-11-23 12:04:53,405 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 35 states. [2018-11-23 12:04:53,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:53,407 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 12:04:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 12:04:53,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:53,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:53,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:53,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:04:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 12:04:53,410 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 25 [2018-11-23 12:04:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:53,411 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 12:04:53,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:04:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 12:04:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:04:53,412 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:53,412 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:53,412 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:53,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:53,413 INFO L82 PathProgramCache]: Analyzing trace with hash 142552419, now seen corresponding path program 5 times [2018-11-23 12:04:53,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:53,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:53,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:53,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:53,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:53,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2018-11-23 12:04:53,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {1175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1175#true} is VALID [2018-11-23 12:04:53,754 INFO L273 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-23 12:04:53,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #55#return; {1175#true} is VALID [2018-11-23 12:04:53,755 INFO L256 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret4 := main(); {1175#true} is VALID [2018-11-23 12:04:53,756 INFO L273 TraceCheckUtils]: 5: Hoare triple {1175#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {1177#(= main_~i~0 0)} is VALID [2018-11-23 12:04:53,757 INFO L273 TraceCheckUtils]: 6: Hoare triple {1177#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1177#(= main_~i~0 0)} is VALID [2018-11-23 12:04:53,757 INFO L273 TraceCheckUtils]: 7: Hoare triple {1177#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1177#(= main_~i~0 0)} is VALID [2018-11-23 12:04:53,758 INFO L273 TraceCheckUtils]: 8: Hoare triple {1177#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1178#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:53,759 INFO L273 TraceCheckUtils]: 9: Hoare triple {1178#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1178#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:53,759 INFO L273 TraceCheckUtils]: 10: Hoare triple {1178#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1178#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:53,760 INFO L273 TraceCheckUtils]: 11: Hoare triple {1178#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1179#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:53,760 INFO L273 TraceCheckUtils]: 12: Hoare triple {1179#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1179#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:53,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {1179#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1179#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:53,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {1179#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1180#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:53,770 INFO L273 TraceCheckUtils]: 15: Hoare triple {1180#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1180#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:53,771 INFO L273 TraceCheckUtils]: 16: Hoare triple {1180#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1180#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:53,771 INFO L273 TraceCheckUtils]: 17: Hoare triple {1180#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1181#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:53,778 INFO L273 TraceCheckUtils]: 18: Hoare triple {1181#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1181#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:53,778 INFO L273 TraceCheckUtils]: 19: Hoare triple {1181#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1181#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:53,779 INFO L273 TraceCheckUtils]: 20: Hoare triple {1181#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1182#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:53,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {1182#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1176#false} is VALID [2018-11-23 12:04:53,780 INFO L273 TraceCheckUtils]: 22: Hoare triple {1176#false} havoc ~x~0;~x~0 := 0; {1176#false} is VALID [2018-11-23 12:04:53,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {1176#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1176#false} is VALID [2018-11-23 12:04:53,780 INFO L256 TraceCheckUtils]: 24: Hoare triple {1176#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {1176#false} is VALID [2018-11-23 12:04:53,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2018-11-23 12:04:53,781 INFO L273 TraceCheckUtils]: 26: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2018-11-23 12:04:53,781 INFO L273 TraceCheckUtils]: 27: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2018-11-23 12:04:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:53,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:53,783 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 12:04:53,800 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:04:53,857 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:04:53,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:53,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:54,023 INFO L256 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2018-11-23 12:04:54,023 INFO L273 TraceCheckUtils]: 1: Hoare triple {1175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1175#true} is VALID [2018-11-23 12:04:54,024 INFO L273 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-23 12:04:54,024 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #55#return; {1175#true} is VALID [2018-11-23 12:04:54,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret4 := main(); {1175#true} is VALID [2018-11-23 12:04:54,026 INFO L273 TraceCheckUtils]: 5: Hoare triple {1175#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {1201#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:54,027 INFO L273 TraceCheckUtils]: 6: Hoare triple {1201#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1201#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:54,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {1201#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1201#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:54,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {1201#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1178#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:54,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {1178#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1178#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:54,031 INFO L273 TraceCheckUtils]: 10: Hoare triple {1178#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1178#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:54,032 INFO L273 TraceCheckUtils]: 11: Hoare triple {1178#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1179#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:54,032 INFO L273 TraceCheckUtils]: 12: Hoare triple {1179#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1179#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:54,034 INFO L273 TraceCheckUtils]: 13: Hoare triple {1179#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1179#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:54,036 INFO L273 TraceCheckUtils]: 14: Hoare triple {1179#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1180#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:54,037 INFO L273 TraceCheckUtils]: 15: Hoare triple {1180#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1180#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:54,037 INFO L273 TraceCheckUtils]: 16: Hoare triple {1180#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1180#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:54,038 INFO L273 TraceCheckUtils]: 17: Hoare triple {1180#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1181#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:54,039 INFO L273 TraceCheckUtils]: 18: Hoare triple {1181#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1181#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:54,040 INFO L273 TraceCheckUtils]: 19: Hoare triple {1181#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1181#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:54,041 INFO L273 TraceCheckUtils]: 20: Hoare triple {1181#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1182#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:54,042 INFO L273 TraceCheckUtils]: 21: Hoare triple {1182#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1176#false} is VALID [2018-11-23 12:04:54,042 INFO L273 TraceCheckUtils]: 22: Hoare triple {1176#false} havoc ~x~0;~x~0 := 0; {1176#false} is VALID [2018-11-23 12:04:54,043 INFO L273 TraceCheckUtils]: 23: Hoare triple {1176#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1176#false} is VALID [2018-11-23 12:04:54,043 INFO L256 TraceCheckUtils]: 24: Hoare triple {1176#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {1176#false} is VALID [2018-11-23 12:04:54,043 INFO L273 TraceCheckUtils]: 25: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2018-11-23 12:04:54,044 INFO L273 TraceCheckUtils]: 26: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2018-11-23 12:04:54,044 INFO L273 TraceCheckUtils]: 27: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2018-11-23 12:04:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:54,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:54,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:04:54,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 12:04:54,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:54,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:04:54,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:54,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:04:54,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:04:54,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:04:54,119 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 9 states. [2018-11-23 12:04:54,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:54,321 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 12:04:54,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:04:54,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 12:04:54,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:04:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-23 12:04:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:04:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-23 12:04:54,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2018-11-23 12:04:54,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:54,413 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:04:54,413 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:04:54,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:04:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:04:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-23 12:04:54,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:54,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2018-11-23 12:04:54,457 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2018-11-23 12:04:54,457 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2018-11-23 12:04:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:54,460 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2018-11-23 12:04:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:04:54,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:54,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:54,461 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2018-11-23 12:04:54,461 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2018-11-23 12:04:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:54,463 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2018-11-23 12:04:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:04:54,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:54,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:54,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:54,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:04:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 12:04:54,466 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 28 [2018-11-23 12:04:54,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:54,467 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 12:04:54,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:04:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 12:04:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:04:54,468 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:54,468 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:54,469 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:54,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:54,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1898175495, now seen corresponding path program 6 times [2018-11-23 12:04:54,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:54,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:54,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:54,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:54,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:54,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {1459#true} call ULTIMATE.init(); {1459#true} is VALID [2018-11-23 12:04:54,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {1459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1459#true} is VALID [2018-11-23 12:04:54,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {1459#true} assume true; {1459#true} is VALID [2018-11-23 12:04:54,623 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1459#true} {1459#true} #55#return; {1459#true} is VALID [2018-11-23 12:04:54,623 INFO L256 TraceCheckUtils]: 4: Hoare triple {1459#true} call #t~ret4 := main(); {1459#true} is VALID [2018-11-23 12:04:54,625 INFO L273 TraceCheckUtils]: 5: Hoare triple {1459#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {1461#(= main_~i~0 0)} is VALID [2018-11-23 12:04:54,625 INFO L273 TraceCheckUtils]: 6: Hoare triple {1461#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1461#(= main_~i~0 0)} is VALID [2018-11-23 12:04:54,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {1461#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1461#(= main_~i~0 0)} is VALID [2018-11-23 12:04:54,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {1461#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1462#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:54,634 INFO L273 TraceCheckUtils]: 9: Hoare triple {1462#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1462#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:54,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {1462#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1462#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:54,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {1462#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1463#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:54,638 INFO L273 TraceCheckUtils]: 12: Hoare triple {1463#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1463#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:54,641 INFO L273 TraceCheckUtils]: 13: Hoare triple {1463#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1463#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:54,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {1463#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1464#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:54,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {1464#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1464#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:54,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {1464#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1464#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:54,646 INFO L273 TraceCheckUtils]: 17: Hoare triple {1464#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1465#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:54,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {1465#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1465#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:54,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {1465#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1465#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:54,652 INFO L273 TraceCheckUtils]: 20: Hoare triple {1465#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1466#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:54,653 INFO L273 TraceCheckUtils]: 21: Hoare triple {1466#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1466#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:54,653 INFO L273 TraceCheckUtils]: 22: Hoare triple {1466#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1466#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:54,654 INFO L273 TraceCheckUtils]: 23: Hoare triple {1466#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1467#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:54,658 INFO L273 TraceCheckUtils]: 24: Hoare triple {1467#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1460#false} is VALID [2018-11-23 12:04:54,658 INFO L273 TraceCheckUtils]: 25: Hoare triple {1460#false} havoc ~x~0;~x~0 := 0; {1460#false} is VALID [2018-11-23 12:04:54,658 INFO L273 TraceCheckUtils]: 26: Hoare triple {1460#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1460#false} is VALID [2018-11-23 12:04:54,659 INFO L256 TraceCheckUtils]: 27: Hoare triple {1460#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {1460#false} is VALID [2018-11-23 12:04:54,659 INFO L273 TraceCheckUtils]: 28: Hoare triple {1460#false} ~cond := #in~cond; {1460#false} is VALID [2018-11-23 12:04:54,659 INFO L273 TraceCheckUtils]: 29: Hoare triple {1460#false} assume 0 == ~cond; {1460#false} is VALID [2018-11-23 12:04:54,659 INFO L273 TraceCheckUtils]: 30: Hoare triple {1460#false} assume !false; {1460#false} is VALID [2018-11-23 12:04:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:54,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:54,660 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 12:04:54,680 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:04:54,722 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:04:54,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:54,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:54,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {1459#true} call ULTIMATE.init(); {1459#true} is VALID [2018-11-23 12:04:54,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {1459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1459#true} is VALID [2018-11-23 12:04:54,892 INFO L273 TraceCheckUtils]: 2: Hoare triple {1459#true} assume true; {1459#true} is VALID [2018-11-23 12:04:54,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1459#true} {1459#true} #55#return; {1459#true} is VALID [2018-11-23 12:04:54,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {1459#true} call #t~ret4 := main(); {1459#true} is VALID [2018-11-23 12:04:54,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {1459#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {1486#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:54,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {1486#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1486#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:54,895 INFO L273 TraceCheckUtils]: 7: Hoare triple {1486#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1486#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:54,896 INFO L273 TraceCheckUtils]: 8: Hoare triple {1486#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1462#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:54,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {1462#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1462#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:54,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {1462#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1462#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:54,899 INFO L273 TraceCheckUtils]: 11: Hoare triple {1462#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1463#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:54,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {1463#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1463#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:54,901 INFO L273 TraceCheckUtils]: 13: Hoare triple {1463#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1463#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:54,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {1463#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1464#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:54,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {1464#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1464#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:54,903 INFO L273 TraceCheckUtils]: 16: Hoare triple {1464#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1464#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:54,904 INFO L273 TraceCheckUtils]: 17: Hoare triple {1464#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1465#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:54,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {1465#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1465#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:54,906 INFO L273 TraceCheckUtils]: 19: Hoare triple {1465#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1465#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:54,907 INFO L273 TraceCheckUtils]: 20: Hoare triple {1465#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1466#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:54,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {1466#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1466#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:54,908 INFO L273 TraceCheckUtils]: 22: Hoare triple {1466#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1466#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:54,909 INFO L273 TraceCheckUtils]: 23: Hoare triple {1466#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1467#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:54,910 INFO L273 TraceCheckUtils]: 24: Hoare triple {1467#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1460#false} is VALID [2018-11-23 12:04:54,910 INFO L273 TraceCheckUtils]: 25: Hoare triple {1460#false} havoc ~x~0;~x~0 := 0; {1460#false} is VALID [2018-11-23 12:04:54,911 INFO L273 TraceCheckUtils]: 26: Hoare triple {1460#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1460#false} is VALID [2018-11-23 12:04:54,911 INFO L256 TraceCheckUtils]: 27: Hoare triple {1460#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {1460#false} is VALID [2018-11-23 12:04:54,911 INFO L273 TraceCheckUtils]: 28: Hoare triple {1460#false} ~cond := #in~cond; {1460#false} is VALID [2018-11-23 12:04:54,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {1460#false} assume 0 == ~cond; {1460#false} is VALID [2018-11-23 12:04:54,912 INFO L273 TraceCheckUtils]: 30: Hoare triple {1460#false} assume !false; {1460#false} is VALID [2018-11-23 12:04:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:54,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:54,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:04:54,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-23 12:04:54,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:54,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:04:55,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:55,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:04:55,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:04:55,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:04:55,015 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 10 states. [2018-11-23 12:04:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:55,484 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-23 12:04:55,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:04:55,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-23 12:04:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:04:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2018-11-23 12:04:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:04:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2018-11-23 12:04:55,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2018-11-23 12:04:55,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:55,661 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:04:55,662 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:04:55,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:04:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:04:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 12:04:55,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:55,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 39 states. [2018-11-23 12:04:55,740 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 39 states. [2018-11-23 12:04:55,740 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 39 states. [2018-11-23 12:04:55,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:55,742 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-23 12:04:55,742 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 12:04:55,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:55,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:55,743 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 41 states. [2018-11-23 12:04:55,743 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 41 states. [2018-11-23 12:04:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:55,745 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-23 12:04:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 12:04:55,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:55,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:55,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:55,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:04:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 12:04:55,749 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 31 [2018-11-23 12:04:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:55,749 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 12:04:55,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:04:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 12:04:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:04:55,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:55,750 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:55,751 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:55,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:55,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1961386589, now seen corresponding path program 7 times [2018-11-23 12:04:55,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:55,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:55,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:55,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:55,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:56,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {1767#true} call ULTIMATE.init(); {1767#true} is VALID [2018-11-23 12:04:56,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {1767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1767#true} is VALID [2018-11-23 12:04:56,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {1767#true} assume true; {1767#true} is VALID [2018-11-23 12:04:56,394 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1767#true} {1767#true} #55#return; {1767#true} is VALID [2018-11-23 12:04:56,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {1767#true} call #t~ret4 := main(); {1767#true} is VALID [2018-11-23 12:04:56,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {1767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {1769#(= main_~i~0 0)} is VALID [2018-11-23 12:04:56,396 INFO L273 TraceCheckUtils]: 6: Hoare triple {1769#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1769#(= main_~i~0 0)} is VALID [2018-11-23 12:04:56,398 INFO L273 TraceCheckUtils]: 7: Hoare triple {1769#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1769#(= main_~i~0 0)} is VALID [2018-11-23 12:04:56,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {1769#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1770#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:56,399 INFO L273 TraceCheckUtils]: 9: Hoare triple {1770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1770#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:56,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {1770#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1770#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:56,401 INFO L273 TraceCheckUtils]: 11: Hoare triple {1770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1771#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:56,402 INFO L273 TraceCheckUtils]: 12: Hoare triple {1771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1771#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:56,402 INFO L273 TraceCheckUtils]: 13: Hoare triple {1771#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1771#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:56,403 INFO L273 TraceCheckUtils]: 14: Hoare triple {1771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1772#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:56,422 INFO L273 TraceCheckUtils]: 15: Hoare triple {1772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1772#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:56,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {1772#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1772#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:56,444 INFO L273 TraceCheckUtils]: 17: Hoare triple {1772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1773#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:56,445 INFO L273 TraceCheckUtils]: 18: Hoare triple {1773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1773#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:56,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {1773#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1773#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:56,446 INFO L273 TraceCheckUtils]: 20: Hoare triple {1773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1774#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:56,447 INFO L273 TraceCheckUtils]: 21: Hoare triple {1774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1774#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:56,447 INFO L273 TraceCheckUtils]: 22: Hoare triple {1774#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1774#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:56,448 INFO L273 TraceCheckUtils]: 23: Hoare triple {1774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1775#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:56,449 INFO L273 TraceCheckUtils]: 24: Hoare triple {1775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1775#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:56,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {1775#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1775#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:56,450 INFO L273 TraceCheckUtils]: 26: Hoare triple {1775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {1776#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:56,451 INFO L273 TraceCheckUtils]: 27: Hoare triple {1776#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1768#false} is VALID [2018-11-23 12:04:56,452 INFO L273 TraceCheckUtils]: 28: Hoare triple {1768#false} havoc ~x~0;~x~0 := 0; {1768#false} is VALID [2018-11-23 12:04:56,452 INFO L273 TraceCheckUtils]: 29: Hoare triple {1768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1768#false} is VALID [2018-11-23 12:04:56,452 INFO L256 TraceCheckUtils]: 30: Hoare triple {1768#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {1768#false} is VALID [2018-11-23 12:04:56,453 INFO L273 TraceCheckUtils]: 31: Hoare triple {1768#false} ~cond := #in~cond; {1768#false} is VALID [2018-11-23 12:04:56,453 INFO L273 TraceCheckUtils]: 32: Hoare triple {1768#false} assume 0 == ~cond; {1768#false} is VALID [2018-11-23 12:04:56,453 INFO L273 TraceCheckUtils]: 33: Hoare triple {1768#false} assume !false; {1768#false} is VALID [2018-11-23 12:04:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:56,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:56,456 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 12:04:56,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:56,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:56,623 INFO L256 TraceCheckUtils]: 0: Hoare triple {1767#true} call ULTIMATE.init(); {1767#true} is VALID [2018-11-23 12:04:56,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {1767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1767#true} is VALID [2018-11-23 12:04:56,624 INFO L273 TraceCheckUtils]: 2: Hoare triple {1767#true} assume true; {1767#true} is VALID [2018-11-23 12:04:56,624 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1767#true} {1767#true} #55#return; {1767#true} is VALID [2018-11-23 12:04:56,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {1767#true} call #t~ret4 := main(); {1767#true} is VALID [2018-11-23 12:04:56,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {1767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {1795#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:56,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {1795#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1795#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:56,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {1795#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1795#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:56,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {1795#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1770#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:56,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {1770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1770#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:56,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {1770#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1770#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:56,674 INFO L273 TraceCheckUtils]: 11: Hoare triple {1770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1771#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:56,675 INFO L273 TraceCheckUtils]: 12: Hoare triple {1771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1771#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:56,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {1771#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1771#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:56,676 INFO L273 TraceCheckUtils]: 14: Hoare triple {1771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1772#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:56,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {1772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1772#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:56,677 INFO L273 TraceCheckUtils]: 16: Hoare triple {1772#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1772#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:56,677 INFO L273 TraceCheckUtils]: 17: Hoare triple {1772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1773#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:56,678 INFO L273 TraceCheckUtils]: 18: Hoare triple {1773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1773#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:56,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {1773#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1773#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:56,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {1773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1774#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:56,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {1774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1774#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:56,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {1774#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1774#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:56,684 INFO L273 TraceCheckUtils]: 23: Hoare triple {1774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1775#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:56,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {1775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1775#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:56,688 INFO L273 TraceCheckUtils]: 25: Hoare triple {1775#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1775#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:56,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {1775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {1776#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:56,690 INFO L273 TraceCheckUtils]: 27: Hoare triple {1776#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1768#false} is VALID [2018-11-23 12:04:56,691 INFO L273 TraceCheckUtils]: 28: Hoare triple {1768#false} havoc ~x~0;~x~0 := 0; {1768#false} is VALID [2018-11-23 12:04:56,691 INFO L273 TraceCheckUtils]: 29: Hoare triple {1768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1768#false} is VALID [2018-11-23 12:04:56,691 INFO L256 TraceCheckUtils]: 30: Hoare triple {1768#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {1768#false} is VALID [2018-11-23 12:04:56,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {1768#false} ~cond := #in~cond; {1768#false} is VALID [2018-11-23 12:04:56,691 INFO L273 TraceCheckUtils]: 32: Hoare triple {1768#false} assume 0 == ~cond; {1768#false} is VALID [2018-11-23 12:04:56,691 INFO L273 TraceCheckUtils]: 33: Hoare triple {1768#false} assume !false; {1768#false} is VALID [2018-11-23 12:04:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:56,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:56,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:04:56,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-23 12:04:56,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:56,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:04:56,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:56,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:04:56,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:04:56,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:04:56,764 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 11 states. [2018-11-23 12:04:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:57,049 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-23 12:04:57,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:04:57,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-23 12:04:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:04:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-11-23 12:04:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:04:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-11-23 12:04:57,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2018-11-23 12:04:57,205 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 12:04:57,206 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:04:57,206 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:04:57,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:04:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:04:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-23 12:04:57,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:57,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-23 12:04:57,314 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-23 12:04:57,315 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-23 12:04:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:57,317 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 12:04:57,317 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 12:04:57,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:57,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:57,317 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-23 12:04:57,318 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-23 12:04:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:57,319 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 12:04:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 12:04:57,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:57,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:57,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:57,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:57,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:04:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-11-23 12:04:57,321 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 34 [2018-11-23 12:04:57,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:57,322 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-11-23 12:04:57,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:04:57,322 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-11-23 12:04:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:04:57,323 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:57,323 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:57,323 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:57,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash 407555001, now seen corresponding path program 8 times [2018-11-23 12:04:57,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:57,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:57,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:57,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:57,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:57,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {2099#true} call ULTIMATE.init(); {2099#true} is VALID [2018-11-23 12:04:57,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {2099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2099#true} is VALID [2018-11-23 12:04:57,662 INFO L273 TraceCheckUtils]: 2: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-23 12:04:57,663 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2099#true} {2099#true} #55#return; {2099#true} is VALID [2018-11-23 12:04:57,663 INFO L256 TraceCheckUtils]: 4: Hoare triple {2099#true} call #t~ret4 := main(); {2099#true} is VALID [2018-11-23 12:04:57,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {2099#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {2101#(= main_~i~0 0)} is VALID [2018-11-23 12:04:57,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {2101#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2101#(= main_~i~0 0)} is VALID [2018-11-23 12:04:57,672 INFO L273 TraceCheckUtils]: 7: Hoare triple {2101#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2101#(= main_~i~0 0)} is VALID [2018-11-23 12:04:57,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {2101#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2102#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:57,675 INFO L273 TraceCheckUtils]: 9: Hoare triple {2102#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2102#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:57,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {2102#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2102#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:57,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {2102#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2103#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:57,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {2103#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2103#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:57,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {2103#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2103#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:57,677 INFO L273 TraceCheckUtils]: 14: Hoare triple {2103#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2104#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:57,678 INFO L273 TraceCheckUtils]: 15: Hoare triple {2104#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2104#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:57,678 INFO L273 TraceCheckUtils]: 16: Hoare triple {2104#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2104#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:57,679 INFO L273 TraceCheckUtils]: 17: Hoare triple {2104#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2105#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:57,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {2105#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2105#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:57,680 INFO L273 TraceCheckUtils]: 19: Hoare triple {2105#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2105#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:57,681 INFO L273 TraceCheckUtils]: 20: Hoare triple {2105#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2106#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:57,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {2106#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2106#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:57,682 INFO L273 TraceCheckUtils]: 22: Hoare triple {2106#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2106#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:57,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {2106#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2107#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:57,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {2107#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2107#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:57,684 INFO L273 TraceCheckUtils]: 25: Hoare triple {2107#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2107#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:57,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {2107#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2108#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:57,686 INFO L273 TraceCheckUtils]: 27: Hoare triple {2108#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2108#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:57,686 INFO L273 TraceCheckUtils]: 28: Hoare triple {2108#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2108#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:57,687 INFO L273 TraceCheckUtils]: 29: Hoare triple {2108#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2109#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:57,688 INFO L273 TraceCheckUtils]: 30: Hoare triple {2109#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2100#false} is VALID [2018-11-23 12:04:57,688 INFO L273 TraceCheckUtils]: 31: Hoare triple {2100#false} havoc ~x~0;~x~0 := 0; {2100#false} is VALID [2018-11-23 12:04:57,688 INFO L273 TraceCheckUtils]: 32: Hoare triple {2100#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2100#false} is VALID [2018-11-23 12:04:57,689 INFO L256 TraceCheckUtils]: 33: Hoare triple {2100#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {2100#false} is VALID [2018-11-23 12:04:57,689 INFO L273 TraceCheckUtils]: 34: Hoare triple {2100#false} ~cond := #in~cond; {2100#false} is VALID [2018-11-23 12:04:57,689 INFO L273 TraceCheckUtils]: 35: Hoare triple {2100#false} assume 0 == ~cond; {2100#false} is VALID [2018-11-23 12:04:57,689 INFO L273 TraceCheckUtils]: 36: Hoare triple {2100#false} assume !false; {2100#false} is VALID [2018-11-23 12:04:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:57,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:57,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:04:57,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:04:57,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:04:57,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:57,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:57,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {2099#true} call ULTIMATE.init(); {2099#true} is VALID [2018-11-23 12:04:57,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {2099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2099#true} is VALID [2018-11-23 12:04:57,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-23 12:04:57,938 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2099#true} {2099#true} #55#return; {2099#true} is VALID [2018-11-23 12:04:57,938 INFO L256 TraceCheckUtils]: 4: Hoare triple {2099#true} call #t~ret4 := main(); {2099#true} is VALID [2018-11-23 12:04:57,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {2099#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {2128#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:57,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {2128#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2128#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:57,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {2128#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2128#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:57,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {2128#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2102#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:57,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {2102#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2102#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:57,943 INFO L273 TraceCheckUtils]: 10: Hoare triple {2102#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2102#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:57,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {2102#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2103#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:57,944 INFO L273 TraceCheckUtils]: 12: Hoare triple {2103#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2103#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:57,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {2103#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2103#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:57,945 INFO L273 TraceCheckUtils]: 14: Hoare triple {2103#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2104#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:57,946 INFO L273 TraceCheckUtils]: 15: Hoare triple {2104#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2104#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:57,946 INFO L273 TraceCheckUtils]: 16: Hoare triple {2104#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2104#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:57,947 INFO L273 TraceCheckUtils]: 17: Hoare triple {2104#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2105#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:57,948 INFO L273 TraceCheckUtils]: 18: Hoare triple {2105#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2105#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:57,948 INFO L273 TraceCheckUtils]: 19: Hoare triple {2105#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2105#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:57,949 INFO L273 TraceCheckUtils]: 20: Hoare triple {2105#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2106#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:57,950 INFO L273 TraceCheckUtils]: 21: Hoare triple {2106#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2106#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:57,950 INFO L273 TraceCheckUtils]: 22: Hoare triple {2106#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2106#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:57,951 INFO L273 TraceCheckUtils]: 23: Hoare triple {2106#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2107#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:57,952 INFO L273 TraceCheckUtils]: 24: Hoare triple {2107#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2107#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:57,952 INFO L273 TraceCheckUtils]: 25: Hoare triple {2107#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2107#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:57,960 INFO L273 TraceCheckUtils]: 26: Hoare triple {2107#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2108#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:57,960 INFO L273 TraceCheckUtils]: 27: Hoare triple {2108#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2108#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:57,961 INFO L273 TraceCheckUtils]: 28: Hoare triple {2108#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2108#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:57,961 INFO L273 TraceCheckUtils]: 29: Hoare triple {2108#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2109#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:57,962 INFO L273 TraceCheckUtils]: 30: Hoare triple {2109#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2100#false} is VALID [2018-11-23 12:04:57,962 INFO L273 TraceCheckUtils]: 31: Hoare triple {2100#false} havoc ~x~0;~x~0 := 0; {2100#false} is VALID [2018-11-23 12:04:57,962 INFO L273 TraceCheckUtils]: 32: Hoare triple {2100#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2100#false} is VALID [2018-11-23 12:04:57,962 INFO L256 TraceCheckUtils]: 33: Hoare triple {2100#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {2100#false} is VALID [2018-11-23 12:04:57,962 INFO L273 TraceCheckUtils]: 34: Hoare triple {2100#false} ~cond := #in~cond; {2100#false} is VALID [2018-11-23 12:04:57,962 INFO L273 TraceCheckUtils]: 35: Hoare triple {2100#false} assume 0 == ~cond; {2100#false} is VALID [2018-11-23 12:04:57,963 INFO L273 TraceCheckUtils]: 36: Hoare triple {2100#false} assume !false; {2100#false} is VALID [2018-11-23 12:04:57,964 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:57,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:57,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:04:57,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 12:04:57,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:57,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:04:58,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:58,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:04:58,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:04:58,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:04:58,047 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 12 states. [2018-11-23 12:04:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:58,526 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2018-11-23 12:04:58,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:04:58,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 12:04:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:58,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:04:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:04:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:04:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:04:58,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:04:58,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:58,641 INFO L225 Difference]: With dead ends: 58 [2018-11-23 12:04:58,641 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:04:58,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:04:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:04:58,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-23 12:04:58,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:58,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2018-11-23 12:04:58,664 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2018-11-23 12:04:58,664 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2018-11-23 12:04:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:58,666 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-11-23 12:04:58,666 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-23 12:04:58,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:58,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:58,666 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2018-11-23 12:04:58,666 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2018-11-23 12:04:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:58,667 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-11-23 12:04:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-23 12:04:58,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:58,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:58,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:58,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:04:58,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-11-23 12:04:58,669 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 37 [2018-11-23 12:04:58,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:58,670 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-23 12:04:58,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:04:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2018-11-23 12:04:58,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:04:58,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:58,671 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:58,671 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:58,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:58,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1356145181, now seen corresponding path program 9 times [2018-11-23 12:04:58,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:58,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:58,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:58,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:58,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:58,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {2455#true} call ULTIMATE.init(); {2455#true} is VALID [2018-11-23 12:04:58,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {2455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2455#true} is VALID [2018-11-23 12:04:58,961 INFO L273 TraceCheckUtils]: 2: Hoare triple {2455#true} assume true; {2455#true} is VALID [2018-11-23 12:04:58,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2455#true} {2455#true} #55#return; {2455#true} is VALID [2018-11-23 12:04:58,962 INFO L256 TraceCheckUtils]: 4: Hoare triple {2455#true} call #t~ret4 := main(); {2455#true} is VALID [2018-11-23 12:04:58,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {2455#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {2457#(= main_~i~0 0)} is VALID [2018-11-23 12:04:58,963 INFO L273 TraceCheckUtils]: 6: Hoare triple {2457#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2457#(= main_~i~0 0)} is VALID [2018-11-23 12:04:58,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {2457#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2457#(= main_~i~0 0)} is VALID [2018-11-23 12:04:58,964 INFO L273 TraceCheckUtils]: 8: Hoare triple {2457#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2458#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:58,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {2458#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2458#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:58,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {2458#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2458#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:58,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {2458#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2459#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:58,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {2459#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2459#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:58,965 INFO L273 TraceCheckUtils]: 13: Hoare triple {2459#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2459#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:58,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {2459#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2460#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:58,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {2460#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2460#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:58,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {2460#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2460#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:58,968 INFO L273 TraceCheckUtils]: 17: Hoare triple {2460#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2461#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:58,969 INFO L273 TraceCheckUtils]: 18: Hoare triple {2461#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2461#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:58,969 INFO L273 TraceCheckUtils]: 19: Hoare triple {2461#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2461#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:58,970 INFO L273 TraceCheckUtils]: 20: Hoare triple {2461#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2462#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:58,971 INFO L273 TraceCheckUtils]: 21: Hoare triple {2462#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2462#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:58,971 INFO L273 TraceCheckUtils]: 22: Hoare triple {2462#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2462#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:58,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {2462#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2463#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:58,973 INFO L273 TraceCheckUtils]: 24: Hoare triple {2463#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2463#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:58,973 INFO L273 TraceCheckUtils]: 25: Hoare triple {2463#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2463#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:58,974 INFO L273 TraceCheckUtils]: 26: Hoare triple {2463#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2464#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:58,975 INFO L273 TraceCheckUtils]: 27: Hoare triple {2464#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2464#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:58,975 INFO L273 TraceCheckUtils]: 28: Hoare triple {2464#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2464#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:58,976 INFO L273 TraceCheckUtils]: 29: Hoare triple {2464#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2465#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:58,976 INFO L273 TraceCheckUtils]: 30: Hoare triple {2465#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2465#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:58,977 INFO L273 TraceCheckUtils]: 31: Hoare triple {2465#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2465#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:58,978 INFO L273 TraceCheckUtils]: 32: Hoare triple {2465#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {2466#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:58,979 INFO L273 TraceCheckUtils]: 33: Hoare triple {2466#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2456#false} is VALID [2018-11-23 12:04:58,979 INFO L273 TraceCheckUtils]: 34: Hoare triple {2456#false} havoc ~x~0;~x~0 := 0; {2456#false} is VALID [2018-11-23 12:04:58,979 INFO L273 TraceCheckUtils]: 35: Hoare triple {2456#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2456#false} is VALID [2018-11-23 12:04:58,979 INFO L256 TraceCheckUtils]: 36: Hoare triple {2456#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {2456#false} is VALID [2018-11-23 12:04:58,980 INFO L273 TraceCheckUtils]: 37: Hoare triple {2456#false} ~cond := #in~cond; {2456#false} is VALID [2018-11-23 12:04:58,980 INFO L273 TraceCheckUtils]: 38: Hoare triple {2456#false} assume 0 == ~cond; {2456#false} is VALID [2018-11-23 12:04:58,980 INFO L273 TraceCheckUtils]: 39: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2018-11-23 12:04:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:58,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:58,982 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 12:04:58,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:04:59,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 12:04:59,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:59,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:59,184 INFO L256 TraceCheckUtils]: 0: Hoare triple {2455#true} call ULTIMATE.init(); {2455#true} is VALID [2018-11-23 12:04:59,185 INFO L273 TraceCheckUtils]: 1: Hoare triple {2455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2455#true} is VALID [2018-11-23 12:04:59,185 INFO L273 TraceCheckUtils]: 2: Hoare triple {2455#true} assume true; {2455#true} is VALID [2018-11-23 12:04:59,185 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2455#true} {2455#true} #55#return; {2455#true} is VALID [2018-11-23 12:04:59,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {2455#true} call #t~ret4 := main(); {2455#true} is VALID [2018-11-23 12:04:59,186 INFO L273 TraceCheckUtils]: 5: Hoare triple {2455#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {2485#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:59,187 INFO L273 TraceCheckUtils]: 6: Hoare triple {2485#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2485#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:59,187 INFO L273 TraceCheckUtils]: 7: Hoare triple {2485#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2485#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:59,188 INFO L273 TraceCheckUtils]: 8: Hoare triple {2485#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2458#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:59,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {2458#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2458#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:59,189 INFO L273 TraceCheckUtils]: 10: Hoare triple {2458#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2458#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:59,189 INFO L273 TraceCheckUtils]: 11: Hoare triple {2458#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2459#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:59,190 INFO L273 TraceCheckUtils]: 12: Hoare triple {2459#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2459#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:59,190 INFO L273 TraceCheckUtils]: 13: Hoare triple {2459#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2459#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:59,191 INFO L273 TraceCheckUtils]: 14: Hoare triple {2459#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2460#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:59,192 INFO L273 TraceCheckUtils]: 15: Hoare triple {2460#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2460#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:59,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {2460#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2460#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:59,193 INFO L273 TraceCheckUtils]: 17: Hoare triple {2460#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2461#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:59,194 INFO L273 TraceCheckUtils]: 18: Hoare triple {2461#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2461#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:59,194 INFO L273 TraceCheckUtils]: 19: Hoare triple {2461#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2461#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:59,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {2461#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2462#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:59,196 INFO L273 TraceCheckUtils]: 21: Hoare triple {2462#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2462#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:59,212 INFO L273 TraceCheckUtils]: 22: Hoare triple {2462#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2462#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:59,213 INFO L273 TraceCheckUtils]: 23: Hoare triple {2462#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2463#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:59,214 INFO L273 TraceCheckUtils]: 24: Hoare triple {2463#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2463#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:59,214 INFO L273 TraceCheckUtils]: 25: Hoare triple {2463#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2463#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:59,215 INFO L273 TraceCheckUtils]: 26: Hoare triple {2463#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2464#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:59,215 INFO L273 TraceCheckUtils]: 27: Hoare triple {2464#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2464#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:59,215 INFO L273 TraceCheckUtils]: 28: Hoare triple {2464#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2464#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:59,216 INFO L273 TraceCheckUtils]: 29: Hoare triple {2464#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2465#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:59,216 INFO L273 TraceCheckUtils]: 30: Hoare triple {2465#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2465#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:59,216 INFO L273 TraceCheckUtils]: 31: Hoare triple {2465#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2465#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:59,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {2465#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {2466#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:59,218 INFO L273 TraceCheckUtils]: 33: Hoare triple {2466#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2456#false} is VALID [2018-11-23 12:04:59,218 INFO L273 TraceCheckUtils]: 34: Hoare triple {2456#false} havoc ~x~0;~x~0 := 0; {2456#false} is VALID [2018-11-23 12:04:59,218 INFO L273 TraceCheckUtils]: 35: Hoare triple {2456#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2456#false} is VALID [2018-11-23 12:04:59,218 INFO L256 TraceCheckUtils]: 36: Hoare triple {2456#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {2456#false} is VALID [2018-11-23 12:04:59,219 INFO L273 TraceCheckUtils]: 37: Hoare triple {2456#false} ~cond := #in~cond; {2456#false} is VALID [2018-11-23 12:04:59,219 INFO L273 TraceCheckUtils]: 38: Hoare triple {2456#false} assume 0 == ~cond; {2456#false} is VALID [2018-11-23 12:04:59,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2018-11-23 12:04:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:59,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:59,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:04:59,242 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 12:04:59,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:59,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:04:59,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:59,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:04:59,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:04:59,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:04:59,290 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 13 states. [2018-11-23 12:04:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:59,459 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-11-23 12:04:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:04:59,459 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 12:04:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:59,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:04:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 74 transitions. [2018-11-23 12:04:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:04:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 74 transitions. [2018-11-23 12:04:59,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 74 transitions. [2018-11-23 12:04:59,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:59,535 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:04:59,536 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:04:59,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:04:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:04:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-23 12:04:59,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:59,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 48 states. [2018-11-23 12:04:59,559 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 48 states. [2018-11-23 12:04:59,559 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 48 states. [2018-11-23 12:04:59,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:59,561 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-11-23 12:04:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2018-11-23 12:04:59,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:59,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:59,562 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 50 states. [2018-11-23 12:04:59,562 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 50 states. [2018-11-23 12:04:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:59,564 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-11-23 12:04:59,564 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2018-11-23 12:04:59,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:59,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:59,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:59,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:59,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:04:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-11-23 12:04:59,566 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 40 [2018-11-23 12:04:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:59,567 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-11-23 12:04:59,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:04:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 12:04:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:04:59,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:59,568 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:59,568 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:59,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:59,568 INFO L82 PathProgramCache]: Analyzing trace with hash 881632121, now seen corresponding path program 10 times [2018-11-23 12:04:59,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:59,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:59,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:59,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:59,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:00,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {2835#true} call ULTIMATE.init(); {2835#true} is VALID [2018-11-23 12:05:00,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {2835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2835#true} is VALID [2018-11-23 12:05:00,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {2835#true} assume true; {2835#true} is VALID [2018-11-23 12:05:00,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2835#true} {2835#true} #55#return; {2835#true} is VALID [2018-11-23 12:05:00,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {2835#true} call #t~ret4 := main(); {2835#true} is VALID [2018-11-23 12:05:00,041 INFO L273 TraceCheckUtils]: 5: Hoare triple {2835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {2837#(= main_~i~0 0)} is VALID [2018-11-23 12:05:00,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {2837#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2837#(= main_~i~0 0)} is VALID [2018-11-23 12:05:00,042 INFO L273 TraceCheckUtils]: 7: Hoare triple {2837#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2837#(= main_~i~0 0)} is VALID [2018-11-23 12:05:00,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {2837#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:00,043 INFO L273 TraceCheckUtils]: 9: Hoare triple {2838#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2838#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:00,043 INFO L273 TraceCheckUtils]: 10: Hoare triple {2838#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:00,044 INFO L273 TraceCheckUtils]: 11: Hoare triple {2838#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:00,044 INFO L273 TraceCheckUtils]: 12: Hoare triple {2839#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2839#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:00,045 INFO L273 TraceCheckUtils]: 13: Hoare triple {2839#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:00,046 INFO L273 TraceCheckUtils]: 14: Hoare triple {2839#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:00,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {2840#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2840#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:00,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {2840#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:00,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {2840#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:00,049 INFO L273 TraceCheckUtils]: 18: Hoare triple {2841#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2841#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:00,050 INFO L273 TraceCheckUtils]: 19: Hoare triple {2841#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:00,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {2841#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:00,051 INFO L273 TraceCheckUtils]: 21: Hoare triple {2842#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2842#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:00,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {2842#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:00,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {2842#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:00,053 INFO L273 TraceCheckUtils]: 24: Hoare triple {2843#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2843#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:00,054 INFO L273 TraceCheckUtils]: 25: Hoare triple {2843#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:00,055 INFO L273 TraceCheckUtils]: 26: Hoare triple {2843#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:00,056 INFO L273 TraceCheckUtils]: 27: Hoare triple {2844#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2844#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:00,056 INFO L273 TraceCheckUtils]: 28: Hoare triple {2844#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:00,057 INFO L273 TraceCheckUtils]: 29: Hoare triple {2844#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:00,058 INFO L273 TraceCheckUtils]: 30: Hoare triple {2845#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2845#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:00,058 INFO L273 TraceCheckUtils]: 31: Hoare triple {2845#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:00,059 INFO L273 TraceCheckUtils]: 32: Hoare triple {2845#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:00,060 INFO L273 TraceCheckUtils]: 33: Hoare triple {2846#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2846#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:00,061 INFO L273 TraceCheckUtils]: 34: Hoare triple {2846#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:00,061 INFO L273 TraceCheckUtils]: 35: Hoare triple {2846#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {2847#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:00,062 INFO L273 TraceCheckUtils]: 36: Hoare triple {2847#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2836#false} is VALID [2018-11-23 12:05:00,063 INFO L273 TraceCheckUtils]: 37: Hoare triple {2836#false} havoc ~x~0;~x~0 := 0; {2836#false} is VALID [2018-11-23 12:05:00,063 INFO L273 TraceCheckUtils]: 38: Hoare triple {2836#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2836#false} is VALID [2018-11-23 12:05:00,063 INFO L256 TraceCheckUtils]: 39: Hoare triple {2836#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {2836#false} is VALID [2018-11-23 12:05:00,063 INFO L273 TraceCheckUtils]: 40: Hoare triple {2836#false} ~cond := #in~cond; {2836#false} is VALID [2018-11-23 12:05:00,064 INFO L273 TraceCheckUtils]: 41: Hoare triple {2836#false} assume 0 == ~cond; {2836#false} is VALID [2018-11-23 12:05:00,064 INFO L273 TraceCheckUtils]: 42: Hoare triple {2836#false} assume !false; {2836#false} is VALID [2018-11-23 12:05:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:00,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:00,067 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 12:05:00,080 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:00,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:00,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:00,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:00,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {2835#true} call ULTIMATE.init(); {2835#true} is VALID [2018-11-23 12:05:00,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {2835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2835#true} is VALID [2018-11-23 12:05:00,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {2835#true} assume true; {2835#true} is VALID [2018-11-23 12:05:00,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2835#true} {2835#true} #55#return; {2835#true} is VALID [2018-11-23 12:05:00,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {2835#true} call #t~ret4 := main(); {2835#true} is VALID [2018-11-23 12:05:00,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {2835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {2866#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:00,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {2866#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2866#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:00,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {2866#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2866#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:00,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {2866#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:00,298 INFO L273 TraceCheckUtils]: 9: Hoare triple {2838#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2838#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:00,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {2838#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:00,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {2838#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:00,309 INFO L273 TraceCheckUtils]: 12: Hoare triple {2839#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2839#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:00,310 INFO L273 TraceCheckUtils]: 13: Hoare triple {2839#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:00,310 INFO L273 TraceCheckUtils]: 14: Hoare triple {2839#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:00,311 INFO L273 TraceCheckUtils]: 15: Hoare triple {2840#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2840#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:00,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {2840#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:00,311 INFO L273 TraceCheckUtils]: 17: Hoare triple {2840#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:00,312 INFO L273 TraceCheckUtils]: 18: Hoare triple {2841#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2841#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:00,312 INFO L273 TraceCheckUtils]: 19: Hoare triple {2841#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:00,313 INFO L273 TraceCheckUtils]: 20: Hoare triple {2841#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:00,313 INFO L273 TraceCheckUtils]: 21: Hoare triple {2842#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2842#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:00,313 INFO L273 TraceCheckUtils]: 22: Hoare triple {2842#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:00,314 INFO L273 TraceCheckUtils]: 23: Hoare triple {2842#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:00,315 INFO L273 TraceCheckUtils]: 24: Hoare triple {2843#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2843#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:00,315 INFO L273 TraceCheckUtils]: 25: Hoare triple {2843#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:00,316 INFO L273 TraceCheckUtils]: 26: Hoare triple {2843#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:00,317 INFO L273 TraceCheckUtils]: 27: Hoare triple {2844#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2844#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:00,317 INFO L273 TraceCheckUtils]: 28: Hoare triple {2844#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:00,318 INFO L273 TraceCheckUtils]: 29: Hoare triple {2844#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:00,320 INFO L273 TraceCheckUtils]: 30: Hoare triple {2845#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2845#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:00,320 INFO L273 TraceCheckUtils]: 31: Hoare triple {2845#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:00,321 INFO L273 TraceCheckUtils]: 32: Hoare triple {2845#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:00,322 INFO L273 TraceCheckUtils]: 33: Hoare triple {2846#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2846#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:00,322 INFO L273 TraceCheckUtils]: 34: Hoare triple {2846#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:00,323 INFO L273 TraceCheckUtils]: 35: Hoare triple {2846#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {2847#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:00,323 INFO L273 TraceCheckUtils]: 36: Hoare triple {2847#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2836#false} is VALID [2018-11-23 12:05:00,323 INFO L273 TraceCheckUtils]: 37: Hoare triple {2836#false} havoc ~x~0;~x~0 := 0; {2836#false} is VALID [2018-11-23 12:05:00,323 INFO L273 TraceCheckUtils]: 38: Hoare triple {2836#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2836#false} is VALID [2018-11-23 12:05:00,323 INFO L256 TraceCheckUtils]: 39: Hoare triple {2836#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {2836#false} is VALID [2018-11-23 12:05:00,324 INFO L273 TraceCheckUtils]: 40: Hoare triple {2836#false} ~cond := #in~cond; {2836#false} is VALID [2018-11-23 12:05:00,324 INFO L273 TraceCheckUtils]: 41: Hoare triple {2836#false} assume 0 == ~cond; {2836#false} is VALID [2018-11-23 12:05:00,324 INFO L273 TraceCheckUtils]: 42: Hoare triple {2836#false} assume !false; {2836#false} is VALID [2018-11-23 12:05:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:00,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:00,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:05:00,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-11-23 12:05:00,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:00,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:05:00,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:00,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:05:00,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:05:00,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:05:00,394 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 14 states. [2018-11-23 12:05:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:00,645 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2018-11-23 12:05:00,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:05:00,646 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-11-23 12:05:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:05:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-23 12:05:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:05:00,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-23 12:05:00,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2018-11-23 12:05:00,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:00,801 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:05:00,801 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 12:05:00,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:05:00,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 12:05:00,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-23 12:05:00,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:00,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 51 states. [2018-11-23 12:05:00,826 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 51 states. [2018-11-23 12:05:00,826 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 51 states. [2018-11-23 12:05:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:00,828 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2018-11-23 12:05:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 12:05:00,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:00,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:00,828 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 53 states. [2018-11-23 12:05:00,829 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 53 states. [2018-11-23 12:05:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:00,830 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2018-11-23 12:05:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 12:05:00,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:00,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:00,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:00,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:05:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2018-11-23 12:05:00,831 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 43 [2018-11-23 12:05:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:00,832 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-11-23 12:05:00,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:05:00,832 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-11-23 12:05:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:05:00,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:00,832 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:00,833 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:00,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:00,833 INFO L82 PathProgramCache]: Analyzing trace with hash 22867491, now seen corresponding path program 11 times [2018-11-23 12:05:00,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:00,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:00,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:00,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:00,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:01,101 INFO L256 TraceCheckUtils]: 0: Hoare triple {3239#true} call ULTIMATE.init(); {3239#true} is VALID [2018-11-23 12:05:01,102 INFO L273 TraceCheckUtils]: 1: Hoare triple {3239#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3239#true} is VALID [2018-11-23 12:05:01,102 INFO L273 TraceCheckUtils]: 2: Hoare triple {3239#true} assume true; {3239#true} is VALID [2018-11-23 12:05:01,102 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3239#true} {3239#true} #55#return; {3239#true} is VALID [2018-11-23 12:05:01,102 INFO L256 TraceCheckUtils]: 4: Hoare triple {3239#true} call #t~ret4 := main(); {3239#true} is VALID [2018-11-23 12:05:01,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {3239#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {3241#(= main_~i~0 0)} is VALID [2018-11-23 12:05:01,103 INFO L273 TraceCheckUtils]: 6: Hoare triple {3241#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3241#(= main_~i~0 0)} is VALID [2018-11-23 12:05:01,103 INFO L273 TraceCheckUtils]: 7: Hoare triple {3241#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3241#(= main_~i~0 0)} is VALID [2018-11-23 12:05:01,104 INFO L273 TraceCheckUtils]: 8: Hoare triple {3241#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3242#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:01,104 INFO L273 TraceCheckUtils]: 9: Hoare triple {3242#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3242#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:01,105 INFO L273 TraceCheckUtils]: 10: Hoare triple {3242#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3242#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:01,106 INFO L273 TraceCheckUtils]: 11: Hoare triple {3242#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3243#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:01,106 INFO L273 TraceCheckUtils]: 12: Hoare triple {3243#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3243#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:01,107 INFO L273 TraceCheckUtils]: 13: Hoare triple {3243#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3243#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:01,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {3243#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3244#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:01,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {3244#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3244#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:01,109 INFO L273 TraceCheckUtils]: 16: Hoare triple {3244#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3244#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:01,110 INFO L273 TraceCheckUtils]: 17: Hoare triple {3244#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3245#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:01,110 INFO L273 TraceCheckUtils]: 18: Hoare triple {3245#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3245#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:01,111 INFO L273 TraceCheckUtils]: 19: Hoare triple {3245#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3245#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:01,112 INFO L273 TraceCheckUtils]: 20: Hoare triple {3245#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3246#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:01,112 INFO L273 TraceCheckUtils]: 21: Hoare triple {3246#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3246#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:01,113 INFO L273 TraceCheckUtils]: 22: Hoare triple {3246#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3246#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:01,113 INFO L273 TraceCheckUtils]: 23: Hoare triple {3246#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3247#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:01,114 INFO L273 TraceCheckUtils]: 24: Hoare triple {3247#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3247#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:01,115 INFO L273 TraceCheckUtils]: 25: Hoare triple {3247#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3247#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:01,115 INFO L273 TraceCheckUtils]: 26: Hoare triple {3247#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3248#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:01,116 INFO L273 TraceCheckUtils]: 27: Hoare triple {3248#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3248#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:01,116 INFO L273 TraceCheckUtils]: 28: Hoare triple {3248#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3248#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:01,117 INFO L273 TraceCheckUtils]: 29: Hoare triple {3248#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3249#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:01,118 INFO L273 TraceCheckUtils]: 30: Hoare triple {3249#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3249#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:01,118 INFO L273 TraceCheckUtils]: 31: Hoare triple {3249#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3249#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:01,119 INFO L273 TraceCheckUtils]: 32: Hoare triple {3249#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3250#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:01,120 INFO L273 TraceCheckUtils]: 33: Hoare triple {3250#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3250#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:01,120 INFO L273 TraceCheckUtils]: 34: Hoare triple {3250#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3250#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:01,121 INFO L273 TraceCheckUtils]: 35: Hoare triple {3250#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3251#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:01,122 INFO L273 TraceCheckUtils]: 36: Hoare triple {3251#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3251#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:01,122 INFO L273 TraceCheckUtils]: 37: Hoare triple {3251#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3251#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:01,123 INFO L273 TraceCheckUtils]: 38: Hoare triple {3251#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {3252#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:01,124 INFO L273 TraceCheckUtils]: 39: Hoare triple {3252#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3240#false} is VALID [2018-11-23 12:05:01,124 INFO L273 TraceCheckUtils]: 40: Hoare triple {3240#false} havoc ~x~0;~x~0 := 0; {3240#false} is VALID [2018-11-23 12:05:01,124 INFO L273 TraceCheckUtils]: 41: Hoare triple {3240#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3240#false} is VALID [2018-11-23 12:05:01,124 INFO L256 TraceCheckUtils]: 42: Hoare triple {3240#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {3240#false} is VALID [2018-11-23 12:05:01,125 INFO L273 TraceCheckUtils]: 43: Hoare triple {3240#false} ~cond := #in~cond; {3240#false} is VALID [2018-11-23 12:05:01,125 INFO L273 TraceCheckUtils]: 44: Hoare triple {3240#false} assume 0 == ~cond; {3240#false} is VALID [2018-11-23 12:05:01,125 INFO L273 TraceCheckUtils]: 45: Hoare triple {3240#false} assume !false; {3240#false} is VALID [2018-11-23 12:05:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:01,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:01,128 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 12:05:01,143 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:01,201 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:05:01,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:01,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:01,486 INFO L256 TraceCheckUtils]: 0: Hoare triple {3239#true} call ULTIMATE.init(); {3239#true} is VALID [2018-11-23 12:05:01,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {3239#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3239#true} is VALID [2018-11-23 12:05:01,487 INFO L273 TraceCheckUtils]: 2: Hoare triple {3239#true} assume true; {3239#true} is VALID [2018-11-23 12:05:01,487 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3239#true} {3239#true} #55#return; {3239#true} is VALID [2018-11-23 12:05:01,487 INFO L256 TraceCheckUtils]: 4: Hoare triple {3239#true} call #t~ret4 := main(); {3239#true} is VALID [2018-11-23 12:05:01,488 INFO L273 TraceCheckUtils]: 5: Hoare triple {3239#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {3271#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:01,489 INFO L273 TraceCheckUtils]: 6: Hoare triple {3271#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3271#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:01,489 INFO L273 TraceCheckUtils]: 7: Hoare triple {3271#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3271#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:01,490 INFO L273 TraceCheckUtils]: 8: Hoare triple {3271#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3242#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:01,490 INFO L273 TraceCheckUtils]: 9: Hoare triple {3242#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3242#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:01,490 INFO L273 TraceCheckUtils]: 10: Hoare triple {3242#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3242#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:01,491 INFO L273 TraceCheckUtils]: 11: Hoare triple {3242#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3243#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:01,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {3243#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3243#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:01,492 INFO L273 TraceCheckUtils]: 13: Hoare triple {3243#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3243#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:01,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {3243#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3244#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:01,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {3244#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3244#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:01,494 INFO L273 TraceCheckUtils]: 16: Hoare triple {3244#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3244#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:01,494 INFO L273 TraceCheckUtils]: 17: Hoare triple {3244#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3245#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:01,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {3245#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3245#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:01,496 INFO L273 TraceCheckUtils]: 19: Hoare triple {3245#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3245#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:01,496 INFO L273 TraceCheckUtils]: 20: Hoare triple {3245#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3246#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:01,497 INFO L273 TraceCheckUtils]: 21: Hoare triple {3246#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3246#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:01,497 INFO L273 TraceCheckUtils]: 22: Hoare triple {3246#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3246#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:01,498 INFO L273 TraceCheckUtils]: 23: Hoare triple {3246#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3247#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:01,499 INFO L273 TraceCheckUtils]: 24: Hoare triple {3247#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3247#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:01,499 INFO L273 TraceCheckUtils]: 25: Hoare triple {3247#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3247#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:01,500 INFO L273 TraceCheckUtils]: 26: Hoare triple {3247#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3248#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:01,501 INFO L273 TraceCheckUtils]: 27: Hoare triple {3248#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3248#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:01,501 INFO L273 TraceCheckUtils]: 28: Hoare triple {3248#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3248#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:01,502 INFO L273 TraceCheckUtils]: 29: Hoare triple {3248#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3249#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:01,503 INFO L273 TraceCheckUtils]: 30: Hoare triple {3249#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3249#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:01,503 INFO L273 TraceCheckUtils]: 31: Hoare triple {3249#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3249#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:01,512 INFO L273 TraceCheckUtils]: 32: Hoare triple {3249#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3250#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:01,513 INFO L273 TraceCheckUtils]: 33: Hoare triple {3250#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3250#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:01,513 INFO L273 TraceCheckUtils]: 34: Hoare triple {3250#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3250#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:01,514 INFO L273 TraceCheckUtils]: 35: Hoare triple {3250#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3251#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:01,514 INFO L273 TraceCheckUtils]: 36: Hoare triple {3251#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3251#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:01,514 INFO L273 TraceCheckUtils]: 37: Hoare triple {3251#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3251#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:01,515 INFO L273 TraceCheckUtils]: 38: Hoare triple {3251#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {3252#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:01,515 INFO L273 TraceCheckUtils]: 39: Hoare triple {3252#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3240#false} is VALID [2018-11-23 12:05:01,516 INFO L273 TraceCheckUtils]: 40: Hoare triple {3240#false} havoc ~x~0;~x~0 := 0; {3240#false} is VALID [2018-11-23 12:05:01,516 INFO L273 TraceCheckUtils]: 41: Hoare triple {3240#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3240#false} is VALID [2018-11-23 12:05:01,516 INFO L256 TraceCheckUtils]: 42: Hoare triple {3240#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {3240#false} is VALID [2018-11-23 12:05:01,516 INFO L273 TraceCheckUtils]: 43: Hoare triple {3240#false} ~cond := #in~cond; {3240#false} is VALID [2018-11-23 12:05:01,516 INFO L273 TraceCheckUtils]: 44: Hoare triple {3240#false} assume 0 == ~cond; {3240#false} is VALID [2018-11-23 12:05:01,516 INFO L273 TraceCheckUtils]: 45: Hoare triple {3240#false} assume !false; {3240#false} is VALID [2018-11-23 12:05:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:01,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:01,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:05:01,539 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-23 12:05:01,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:01,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:05:01,587 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 12:05:01,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:05:01,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:05:01,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:05:01,589 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 15 states. [2018-11-23 12:05:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:01,955 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-23 12:05:01,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:05:01,956 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-23 12:05:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:05:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2018-11-23 12:05:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:05:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2018-11-23 12:05:01,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 82 transitions. [2018-11-23 12:05:02,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:02,074 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:05:02,074 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:05:02,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:05:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:05:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-23 12:05:02,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:02,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 54 states. [2018-11-23 12:05:02,114 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 54 states. [2018-11-23 12:05:02,115 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 54 states. [2018-11-23 12:05:02,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:02,116 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2018-11-23 12:05:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-23 12:05:02,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:02,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:02,116 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 56 states. [2018-11-23 12:05:02,116 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 56 states. [2018-11-23 12:05:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:02,118 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2018-11-23 12:05:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-23 12:05:02,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:02,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:02,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:02,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:02,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:05:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2018-11-23 12:05:02,120 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 46 [2018-11-23 12:05:02,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:02,120 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-11-23 12:05:02,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:05:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2018-11-23 12:05:02,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:05:02,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:02,121 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:02,121 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:02,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:02,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1685957433, now seen corresponding path program 12 times [2018-11-23 12:05:02,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:02,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:02,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:02,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:02,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:02,413 INFO L256 TraceCheckUtils]: 0: Hoare triple {3667#true} call ULTIMATE.init(); {3667#true} is VALID [2018-11-23 12:05:02,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {3667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3667#true} is VALID [2018-11-23 12:05:02,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {3667#true} assume true; {3667#true} is VALID [2018-11-23 12:05:02,414 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3667#true} {3667#true} #55#return; {3667#true} is VALID [2018-11-23 12:05:02,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {3667#true} call #t~ret4 := main(); {3667#true} is VALID [2018-11-23 12:05:02,420 INFO L273 TraceCheckUtils]: 5: Hoare triple {3667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {3669#(= main_~i~0 0)} is VALID [2018-11-23 12:05:02,420 INFO L273 TraceCheckUtils]: 6: Hoare triple {3669#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3669#(= main_~i~0 0)} is VALID [2018-11-23 12:05:02,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {3669#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3669#(= main_~i~0 0)} is VALID [2018-11-23 12:05:02,438 INFO L273 TraceCheckUtils]: 8: Hoare triple {3669#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3670#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:02,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {3670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3670#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:02,460 INFO L273 TraceCheckUtils]: 10: Hoare triple {3670#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3670#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:02,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {3670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3671#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:02,461 INFO L273 TraceCheckUtils]: 12: Hoare triple {3671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3671#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:02,461 INFO L273 TraceCheckUtils]: 13: Hoare triple {3671#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3671#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:02,464 INFO L273 TraceCheckUtils]: 14: Hoare triple {3671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3672#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:02,464 INFO L273 TraceCheckUtils]: 15: Hoare triple {3672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3672#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:02,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {3672#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3672#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:02,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {3672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3673#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:02,466 INFO L273 TraceCheckUtils]: 18: Hoare triple {3673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3673#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:02,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {3673#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3673#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:02,467 INFO L273 TraceCheckUtils]: 20: Hoare triple {3673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3674#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:02,468 INFO L273 TraceCheckUtils]: 21: Hoare triple {3674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3674#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:02,468 INFO L273 TraceCheckUtils]: 22: Hoare triple {3674#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3674#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:02,469 INFO L273 TraceCheckUtils]: 23: Hoare triple {3674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3675#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:02,470 INFO L273 TraceCheckUtils]: 24: Hoare triple {3675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3675#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:02,470 INFO L273 TraceCheckUtils]: 25: Hoare triple {3675#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3675#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:02,471 INFO L273 TraceCheckUtils]: 26: Hoare triple {3675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3676#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:02,472 INFO L273 TraceCheckUtils]: 27: Hoare triple {3676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3676#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:02,472 INFO L273 TraceCheckUtils]: 28: Hoare triple {3676#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3676#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:02,473 INFO L273 TraceCheckUtils]: 29: Hoare triple {3676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3677#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:02,474 INFO L273 TraceCheckUtils]: 30: Hoare triple {3677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3677#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:02,475 INFO L273 TraceCheckUtils]: 31: Hoare triple {3677#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3677#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:02,475 INFO L273 TraceCheckUtils]: 32: Hoare triple {3677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3678#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:02,476 INFO L273 TraceCheckUtils]: 33: Hoare triple {3678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3678#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:02,477 INFO L273 TraceCheckUtils]: 34: Hoare triple {3678#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3678#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:02,478 INFO L273 TraceCheckUtils]: 35: Hoare triple {3678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3679#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:02,478 INFO L273 TraceCheckUtils]: 36: Hoare triple {3679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3679#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:02,479 INFO L273 TraceCheckUtils]: 37: Hoare triple {3679#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3679#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:02,480 INFO L273 TraceCheckUtils]: 38: Hoare triple {3679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {3680#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:02,481 INFO L273 TraceCheckUtils]: 39: Hoare triple {3680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3680#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:02,481 INFO L273 TraceCheckUtils]: 40: Hoare triple {3680#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3680#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:02,482 INFO L273 TraceCheckUtils]: 41: Hoare triple {3680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {3681#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:02,483 INFO L273 TraceCheckUtils]: 42: Hoare triple {3681#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3668#false} is VALID [2018-11-23 12:05:02,483 INFO L273 TraceCheckUtils]: 43: Hoare triple {3668#false} havoc ~x~0;~x~0 := 0; {3668#false} is VALID [2018-11-23 12:05:02,484 INFO L273 TraceCheckUtils]: 44: Hoare triple {3668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3668#false} is VALID [2018-11-23 12:05:02,484 INFO L256 TraceCheckUtils]: 45: Hoare triple {3668#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {3668#false} is VALID [2018-11-23 12:05:02,484 INFO L273 TraceCheckUtils]: 46: Hoare triple {3668#false} ~cond := #in~cond; {3668#false} is VALID [2018-11-23 12:05:02,484 INFO L273 TraceCheckUtils]: 47: Hoare triple {3668#false} assume 0 == ~cond; {3668#false} is VALID [2018-11-23 12:05:02,485 INFO L273 TraceCheckUtils]: 48: Hoare triple {3668#false} assume !false; {3668#false} is VALID [2018-11-23 12:05:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:02,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:02,488 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 12:05:02,497 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:02,529 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:05:02,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:02,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:02,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {3667#true} call ULTIMATE.init(); {3667#true} is VALID [2018-11-23 12:05:02,698 INFO L273 TraceCheckUtils]: 1: Hoare triple {3667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3667#true} is VALID [2018-11-23 12:05:02,699 INFO L273 TraceCheckUtils]: 2: Hoare triple {3667#true} assume true; {3667#true} is VALID [2018-11-23 12:05:02,699 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3667#true} {3667#true} #55#return; {3667#true} is VALID [2018-11-23 12:05:02,699 INFO L256 TraceCheckUtils]: 4: Hoare triple {3667#true} call #t~ret4 := main(); {3667#true} is VALID [2018-11-23 12:05:02,700 INFO L273 TraceCheckUtils]: 5: Hoare triple {3667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {3700#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:02,701 INFO L273 TraceCheckUtils]: 6: Hoare triple {3700#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3700#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:02,701 INFO L273 TraceCheckUtils]: 7: Hoare triple {3700#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3700#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:02,702 INFO L273 TraceCheckUtils]: 8: Hoare triple {3700#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3670#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:02,702 INFO L273 TraceCheckUtils]: 9: Hoare triple {3670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3670#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:02,703 INFO L273 TraceCheckUtils]: 10: Hoare triple {3670#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3670#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:02,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {3670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3671#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:02,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {3671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3671#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:02,705 INFO L273 TraceCheckUtils]: 13: Hoare triple {3671#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3671#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:02,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {3671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3672#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:02,706 INFO L273 TraceCheckUtils]: 15: Hoare triple {3672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3672#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:02,707 INFO L273 TraceCheckUtils]: 16: Hoare triple {3672#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3672#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:02,708 INFO L273 TraceCheckUtils]: 17: Hoare triple {3672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3673#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:02,708 INFO L273 TraceCheckUtils]: 18: Hoare triple {3673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3673#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:02,709 INFO L273 TraceCheckUtils]: 19: Hoare triple {3673#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3673#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:02,710 INFO L273 TraceCheckUtils]: 20: Hoare triple {3673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3674#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:02,730 INFO L273 TraceCheckUtils]: 21: Hoare triple {3674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3674#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:02,743 INFO L273 TraceCheckUtils]: 22: Hoare triple {3674#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3674#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:02,759 INFO L273 TraceCheckUtils]: 23: Hoare triple {3674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3675#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:02,768 INFO L273 TraceCheckUtils]: 24: Hoare triple {3675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3675#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:02,784 INFO L273 TraceCheckUtils]: 25: Hoare triple {3675#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3675#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:02,793 INFO L273 TraceCheckUtils]: 26: Hoare triple {3675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3676#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:02,808 INFO L273 TraceCheckUtils]: 27: Hoare triple {3676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3676#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:02,822 INFO L273 TraceCheckUtils]: 28: Hoare triple {3676#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3676#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:02,824 INFO L273 TraceCheckUtils]: 29: Hoare triple {3676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3677#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:02,827 INFO L273 TraceCheckUtils]: 30: Hoare triple {3677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3677#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:02,827 INFO L273 TraceCheckUtils]: 31: Hoare triple {3677#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3677#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:02,829 INFO L273 TraceCheckUtils]: 32: Hoare triple {3677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3678#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:02,829 INFO L273 TraceCheckUtils]: 33: Hoare triple {3678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3678#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:02,831 INFO L273 TraceCheckUtils]: 34: Hoare triple {3678#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3678#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:02,831 INFO L273 TraceCheckUtils]: 35: Hoare triple {3678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3679#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:02,834 INFO L273 TraceCheckUtils]: 36: Hoare triple {3679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3679#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:02,834 INFO L273 TraceCheckUtils]: 37: Hoare triple {3679#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3679#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:02,835 INFO L273 TraceCheckUtils]: 38: Hoare triple {3679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {3680#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:02,835 INFO L273 TraceCheckUtils]: 39: Hoare triple {3680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3680#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:02,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {3680#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3680#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:02,836 INFO L273 TraceCheckUtils]: 41: Hoare triple {3680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {3681#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:02,836 INFO L273 TraceCheckUtils]: 42: Hoare triple {3681#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3668#false} is VALID [2018-11-23 12:05:02,837 INFO L273 TraceCheckUtils]: 43: Hoare triple {3668#false} havoc ~x~0;~x~0 := 0; {3668#false} is VALID [2018-11-23 12:05:02,837 INFO L273 TraceCheckUtils]: 44: Hoare triple {3668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3668#false} is VALID [2018-11-23 12:05:02,837 INFO L256 TraceCheckUtils]: 45: Hoare triple {3668#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {3668#false} is VALID [2018-11-23 12:05:02,837 INFO L273 TraceCheckUtils]: 46: Hoare triple {3668#false} ~cond := #in~cond; {3668#false} is VALID [2018-11-23 12:05:02,838 INFO L273 TraceCheckUtils]: 47: Hoare triple {3668#false} assume 0 == ~cond; {3668#false} is VALID [2018-11-23 12:05:02,838 INFO L273 TraceCheckUtils]: 48: Hoare triple {3668#false} assume !false; {3668#false} is VALID [2018-11-23 12:05:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:02,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:02,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:05:02,865 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-11-23 12:05:02,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:02,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:05:02,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:02,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:05:02,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:05:02,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:05:02,934 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand 16 states. [2018-11-23 12:05:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:03,295 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2018-11-23 12:05:03,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:05:03,295 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-11-23 12:05:03,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:05:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 86 transitions. [2018-11-23 12:05:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:05:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 86 transitions. [2018-11-23 12:05:03,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 86 transitions. [2018-11-23 12:05:03,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:03,915 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:05:03,915 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:05:03,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:05:03,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:05:03,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-23 12:05:03,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:03,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 57 states. [2018-11-23 12:05:03,937 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 57 states. [2018-11-23 12:05:03,937 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 57 states. [2018-11-23 12:05:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:03,939 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2018-11-23 12:05:03,939 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2018-11-23 12:05:03,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:03,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:03,939 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 59 states. [2018-11-23 12:05:03,940 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 59 states. [2018-11-23 12:05:03,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:03,941 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2018-11-23 12:05:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2018-11-23 12:05:03,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:03,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:03,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:03,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:05:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2018-11-23 12:05:03,943 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 49 [2018-11-23 12:05:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:03,944 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-11-23 12:05:03,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:05:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2018-11-23 12:05:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:05:03,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:03,945 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:03,945 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:03,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:03,946 INFO L82 PathProgramCache]: Analyzing trace with hash 55692899, now seen corresponding path program 13 times [2018-11-23 12:05:03,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:03,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:03,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:03,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:03,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:04,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {4119#true} call ULTIMATE.init(); {4119#true} is VALID [2018-11-23 12:05:04,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {4119#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4119#true} is VALID [2018-11-23 12:05:04,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {4119#true} assume true; {4119#true} is VALID [2018-11-23 12:05:04,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4119#true} {4119#true} #55#return; {4119#true} is VALID [2018-11-23 12:05:04,724 INFO L256 TraceCheckUtils]: 4: Hoare triple {4119#true} call #t~ret4 := main(); {4119#true} is VALID [2018-11-23 12:05:04,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {4119#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {4121#(= main_~i~0 0)} is VALID [2018-11-23 12:05:04,725 INFO L273 TraceCheckUtils]: 6: Hoare triple {4121#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4121#(= main_~i~0 0)} is VALID [2018-11-23 12:05:04,726 INFO L273 TraceCheckUtils]: 7: Hoare triple {4121#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4121#(= main_~i~0 0)} is VALID [2018-11-23 12:05:04,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {4121#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4122#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:04,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {4122#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4122#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:04,727 INFO L273 TraceCheckUtils]: 10: Hoare triple {4122#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4122#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:04,727 INFO L273 TraceCheckUtils]: 11: Hoare triple {4122#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4123#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:04,728 INFO L273 TraceCheckUtils]: 12: Hoare triple {4123#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4123#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:04,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {4123#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4123#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:04,729 INFO L273 TraceCheckUtils]: 14: Hoare triple {4123#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4124#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:04,730 INFO L273 TraceCheckUtils]: 15: Hoare triple {4124#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4124#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:04,730 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4124#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:04,731 INFO L273 TraceCheckUtils]: 17: Hoare triple {4124#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4125#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:04,732 INFO L273 TraceCheckUtils]: 18: Hoare triple {4125#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4125#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:04,732 INFO L273 TraceCheckUtils]: 19: Hoare triple {4125#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4125#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:04,733 INFO L273 TraceCheckUtils]: 20: Hoare triple {4125#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4126#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:04,734 INFO L273 TraceCheckUtils]: 21: Hoare triple {4126#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4126#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:04,735 INFO L273 TraceCheckUtils]: 22: Hoare triple {4126#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4126#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:04,735 INFO L273 TraceCheckUtils]: 23: Hoare triple {4126#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4127#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:04,736 INFO L273 TraceCheckUtils]: 24: Hoare triple {4127#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4127#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:04,737 INFO L273 TraceCheckUtils]: 25: Hoare triple {4127#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4127#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:04,738 INFO L273 TraceCheckUtils]: 26: Hoare triple {4127#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4128#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:04,738 INFO L273 TraceCheckUtils]: 27: Hoare triple {4128#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4128#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:04,739 INFO L273 TraceCheckUtils]: 28: Hoare triple {4128#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4128#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:04,740 INFO L273 TraceCheckUtils]: 29: Hoare triple {4128#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4129#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:04,740 INFO L273 TraceCheckUtils]: 30: Hoare triple {4129#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4129#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:04,741 INFO L273 TraceCheckUtils]: 31: Hoare triple {4129#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4129#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:04,742 INFO L273 TraceCheckUtils]: 32: Hoare triple {4129#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4130#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:04,743 INFO L273 TraceCheckUtils]: 33: Hoare triple {4130#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4130#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:04,743 INFO L273 TraceCheckUtils]: 34: Hoare triple {4130#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4130#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:04,744 INFO L273 TraceCheckUtils]: 35: Hoare triple {4130#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4131#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:04,745 INFO L273 TraceCheckUtils]: 36: Hoare triple {4131#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4131#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:04,745 INFO L273 TraceCheckUtils]: 37: Hoare triple {4131#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4131#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:04,746 INFO L273 TraceCheckUtils]: 38: Hoare triple {4131#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4132#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:04,747 INFO L273 TraceCheckUtils]: 39: Hoare triple {4132#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4132#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:04,748 INFO L273 TraceCheckUtils]: 40: Hoare triple {4132#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4132#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:04,748 INFO L273 TraceCheckUtils]: 41: Hoare triple {4132#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4133#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:04,749 INFO L273 TraceCheckUtils]: 42: Hoare triple {4133#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4133#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:04,750 INFO L273 TraceCheckUtils]: 43: Hoare triple {4133#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4133#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:04,751 INFO L273 TraceCheckUtils]: 44: Hoare triple {4133#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {4134#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:04,751 INFO L273 TraceCheckUtils]: 45: Hoare triple {4134#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4120#false} is VALID [2018-11-23 12:05:04,752 INFO L273 TraceCheckUtils]: 46: Hoare triple {4120#false} havoc ~x~0;~x~0 := 0; {4120#false} is VALID [2018-11-23 12:05:04,752 INFO L273 TraceCheckUtils]: 47: Hoare triple {4120#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4120#false} is VALID [2018-11-23 12:05:04,752 INFO L256 TraceCheckUtils]: 48: Hoare triple {4120#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {4120#false} is VALID [2018-11-23 12:05:04,752 INFO L273 TraceCheckUtils]: 49: Hoare triple {4120#false} ~cond := #in~cond; {4120#false} is VALID [2018-11-23 12:05:04,753 INFO L273 TraceCheckUtils]: 50: Hoare triple {4120#false} assume 0 == ~cond; {4120#false} is VALID [2018-11-23 12:05:04,753 INFO L273 TraceCheckUtils]: 51: Hoare triple {4120#false} assume !false; {4120#false} is VALID [2018-11-23 12:05:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:04,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:04,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:04,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:04,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:04,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {4119#true} call ULTIMATE.init(); {4119#true} is VALID [2018-11-23 12:05:04,962 INFO L273 TraceCheckUtils]: 1: Hoare triple {4119#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4119#true} is VALID [2018-11-23 12:05:04,962 INFO L273 TraceCheckUtils]: 2: Hoare triple {4119#true} assume true; {4119#true} is VALID [2018-11-23 12:05:04,962 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4119#true} {4119#true} #55#return; {4119#true} is VALID [2018-11-23 12:05:04,962 INFO L256 TraceCheckUtils]: 4: Hoare triple {4119#true} call #t~ret4 := main(); {4119#true} is VALID [2018-11-23 12:05:04,963 INFO L273 TraceCheckUtils]: 5: Hoare triple {4119#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {4153#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:04,964 INFO L273 TraceCheckUtils]: 6: Hoare triple {4153#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4153#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:04,964 INFO L273 TraceCheckUtils]: 7: Hoare triple {4153#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4153#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:04,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {4153#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4122#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:04,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {4122#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4122#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:04,988 INFO L273 TraceCheckUtils]: 10: Hoare triple {4122#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4122#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:04,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {4122#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4123#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:04,989 INFO L273 TraceCheckUtils]: 12: Hoare triple {4123#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4123#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:04,989 INFO L273 TraceCheckUtils]: 13: Hoare triple {4123#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4123#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:04,989 INFO L273 TraceCheckUtils]: 14: Hoare triple {4123#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4124#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:04,990 INFO L273 TraceCheckUtils]: 15: Hoare triple {4124#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4124#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:04,990 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4124#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:04,990 INFO L273 TraceCheckUtils]: 17: Hoare triple {4124#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4125#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:04,991 INFO L273 TraceCheckUtils]: 18: Hoare triple {4125#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4125#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:04,991 INFO L273 TraceCheckUtils]: 19: Hoare triple {4125#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4125#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:04,992 INFO L273 TraceCheckUtils]: 20: Hoare triple {4125#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4126#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:04,993 INFO L273 TraceCheckUtils]: 21: Hoare triple {4126#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4126#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:04,993 INFO L273 TraceCheckUtils]: 22: Hoare triple {4126#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4126#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:04,994 INFO L273 TraceCheckUtils]: 23: Hoare triple {4126#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4127#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:04,994 INFO L273 TraceCheckUtils]: 24: Hoare triple {4127#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4127#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:04,995 INFO L273 TraceCheckUtils]: 25: Hoare triple {4127#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4127#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:04,996 INFO L273 TraceCheckUtils]: 26: Hoare triple {4127#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4128#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:04,996 INFO L273 TraceCheckUtils]: 27: Hoare triple {4128#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4128#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:04,997 INFO L273 TraceCheckUtils]: 28: Hoare triple {4128#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4128#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:04,998 INFO L273 TraceCheckUtils]: 29: Hoare triple {4128#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4129#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:04,998 INFO L273 TraceCheckUtils]: 30: Hoare triple {4129#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4129#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:04,999 INFO L273 TraceCheckUtils]: 31: Hoare triple {4129#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4129#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:04,999 INFO L273 TraceCheckUtils]: 32: Hoare triple {4129#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4130#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:05,000 INFO L273 TraceCheckUtils]: 33: Hoare triple {4130#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4130#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:05,001 INFO L273 TraceCheckUtils]: 34: Hoare triple {4130#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4130#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:05,001 INFO L273 TraceCheckUtils]: 35: Hoare triple {4130#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4131#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:05,002 INFO L273 TraceCheckUtils]: 36: Hoare triple {4131#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4131#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:05,002 INFO L273 TraceCheckUtils]: 37: Hoare triple {4131#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4131#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:05,003 INFO L273 TraceCheckUtils]: 38: Hoare triple {4131#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4132#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:05,004 INFO L273 TraceCheckUtils]: 39: Hoare triple {4132#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4132#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:05,004 INFO L273 TraceCheckUtils]: 40: Hoare triple {4132#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4132#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:05,005 INFO L273 TraceCheckUtils]: 41: Hoare triple {4132#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4133#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:05,006 INFO L273 TraceCheckUtils]: 42: Hoare triple {4133#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4133#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:05,006 INFO L273 TraceCheckUtils]: 43: Hoare triple {4133#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4133#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:05,008 INFO L273 TraceCheckUtils]: 44: Hoare triple {4133#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {4134#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:05,008 INFO L273 TraceCheckUtils]: 45: Hoare triple {4134#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4120#false} is VALID [2018-11-23 12:05:05,009 INFO L273 TraceCheckUtils]: 46: Hoare triple {4120#false} havoc ~x~0;~x~0 := 0; {4120#false} is VALID [2018-11-23 12:05:05,009 INFO L273 TraceCheckUtils]: 47: Hoare triple {4120#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4120#false} is VALID [2018-11-23 12:05:05,009 INFO L256 TraceCheckUtils]: 48: Hoare triple {4120#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {4120#false} is VALID [2018-11-23 12:05:05,009 INFO L273 TraceCheckUtils]: 49: Hoare triple {4120#false} ~cond := #in~cond; {4120#false} is VALID [2018-11-23 12:05:05,010 INFO L273 TraceCheckUtils]: 50: Hoare triple {4120#false} assume 0 == ~cond; {4120#false} is VALID [2018-11-23 12:05:05,010 INFO L273 TraceCheckUtils]: 51: Hoare triple {4120#false} assume !false; {4120#false} is VALID [2018-11-23 12:05:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:05,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:05,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:05:05,031 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-23 12:05:05,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:05,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:05:05,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:05,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:05:05,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:05:05,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:05:05,084 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand 17 states. [2018-11-23 12:05:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:05,494 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2018-11-23 12:05:05,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:05:05,494 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-23 12:05:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:05:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 90 transitions. [2018-11-23 12:05:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:05:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 90 transitions. [2018-11-23 12:05:05,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 90 transitions. [2018-11-23 12:05:06,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:06,127 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:05:06,127 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:05:06,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:05:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:05:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-23 12:05:06,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:06,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 60 states. [2018-11-23 12:05:06,147 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 60 states. [2018-11-23 12:05:06,147 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 60 states. [2018-11-23 12:05:06,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:06,149 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2018-11-23 12:05:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-11-23 12:05:06,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:06,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:06,150 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 62 states. [2018-11-23 12:05:06,150 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 62 states. [2018-11-23 12:05:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:06,151 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2018-11-23 12:05:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-11-23 12:05:06,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:06,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:06,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:06,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:05:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2018-11-23 12:05:06,154 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 52 [2018-11-23 12:05:06,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:06,154 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2018-11-23 12:05:06,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:05:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2018-11-23 12:05:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:05:06,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:06,155 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:06,155 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:06,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:06,156 INFO L82 PathProgramCache]: Analyzing trace with hash 335143673, now seen corresponding path program 14 times [2018-11-23 12:05:06,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:06,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:06,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:06,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:06,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:06,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {4595#true} call ULTIMATE.init(); {4595#true} is VALID [2018-11-23 12:05:06,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {4595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4595#true} is VALID [2018-11-23 12:05:06,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {4595#true} assume true; {4595#true} is VALID [2018-11-23 12:05:06,824 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4595#true} {4595#true} #55#return; {4595#true} is VALID [2018-11-23 12:05:06,824 INFO L256 TraceCheckUtils]: 4: Hoare triple {4595#true} call #t~ret4 := main(); {4595#true} is VALID [2018-11-23 12:05:06,825 INFO L273 TraceCheckUtils]: 5: Hoare triple {4595#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {4597#(= main_~i~0 0)} is VALID [2018-11-23 12:05:06,825 INFO L273 TraceCheckUtils]: 6: Hoare triple {4597#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4597#(= main_~i~0 0)} is VALID [2018-11-23 12:05:06,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {4597#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4597#(= main_~i~0 0)} is VALID [2018-11-23 12:05:06,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {4597#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4598#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:06,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {4598#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4598#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:06,827 INFO L273 TraceCheckUtils]: 10: Hoare triple {4598#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4598#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:06,827 INFO L273 TraceCheckUtils]: 11: Hoare triple {4598#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4599#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:06,827 INFO L273 TraceCheckUtils]: 12: Hoare triple {4599#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4599#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:06,828 INFO L273 TraceCheckUtils]: 13: Hoare triple {4599#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4599#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:06,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {4599#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4600#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:06,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {4600#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4600#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:06,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {4600#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4600#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:06,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {4600#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4601#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:06,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {4601#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4601#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:06,831 INFO L273 TraceCheckUtils]: 19: Hoare triple {4601#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4601#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:06,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {4601#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4602#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:06,832 INFO L273 TraceCheckUtils]: 21: Hoare triple {4602#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4602#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:06,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {4602#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4602#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:06,834 INFO L273 TraceCheckUtils]: 23: Hoare triple {4602#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4603#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:06,834 INFO L273 TraceCheckUtils]: 24: Hoare triple {4603#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4603#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:06,835 INFO L273 TraceCheckUtils]: 25: Hoare triple {4603#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4603#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:06,835 INFO L273 TraceCheckUtils]: 26: Hoare triple {4603#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4604#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:06,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {4604#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4604#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:06,837 INFO L273 TraceCheckUtils]: 28: Hoare triple {4604#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4604#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:06,837 INFO L273 TraceCheckUtils]: 29: Hoare triple {4604#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4605#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:06,838 INFO L273 TraceCheckUtils]: 30: Hoare triple {4605#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4605#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:06,838 INFO L273 TraceCheckUtils]: 31: Hoare triple {4605#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4605#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:06,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {4605#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4606#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:06,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {4606#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4606#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:06,840 INFO L273 TraceCheckUtils]: 34: Hoare triple {4606#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4606#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:06,841 INFO L273 TraceCheckUtils]: 35: Hoare triple {4606#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4607#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:06,842 INFO L273 TraceCheckUtils]: 36: Hoare triple {4607#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4607#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:06,842 INFO L273 TraceCheckUtils]: 37: Hoare triple {4607#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4607#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:06,843 INFO L273 TraceCheckUtils]: 38: Hoare triple {4607#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4608#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:06,843 INFO L273 TraceCheckUtils]: 39: Hoare triple {4608#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4608#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:06,844 INFO L273 TraceCheckUtils]: 40: Hoare triple {4608#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4608#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:06,845 INFO L273 TraceCheckUtils]: 41: Hoare triple {4608#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4609#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:06,845 INFO L273 TraceCheckUtils]: 42: Hoare triple {4609#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4609#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:06,846 INFO L273 TraceCheckUtils]: 43: Hoare triple {4609#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4609#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:06,847 INFO L273 TraceCheckUtils]: 44: Hoare triple {4609#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {4610#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:06,847 INFO L273 TraceCheckUtils]: 45: Hoare triple {4610#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4610#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:06,848 INFO L273 TraceCheckUtils]: 46: Hoare triple {4610#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4610#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:06,848 INFO L273 TraceCheckUtils]: 47: Hoare triple {4610#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {4611#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:06,849 INFO L273 TraceCheckUtils]: 48: Hoare triple {4611#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4596#false} is VALID [2018-11-23 12:05:06,849 INFO L273 TraceCheckUtils]: 49: Hoare triple {4596#false} havoc ~x~0;~x~0 := 0; {4596#false} is VALID [2018-11-23 12:05:06,850 INFO L273 TraceCheckUtils]: 50: Hoare triple {4596#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4596#false} is VALID [2018-11-23 12:05:06,850 INFO L256 TraceCheckUtils]: 51: Hoare triple {4596#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {4596#false} is VALID [2018-11-23 12:05:06,850 INFO L273 TraceCheckUtils]: 52: Hoare triple {4596#false} ~cond := #in~cond; {4596#false} is VALID [2018-11-23 12:05:06,850 INFO L273 TraceCheckUtils]: 53: Hoare triple {4596#false} assume 0 == ~cond; {4596#false} is VALID [2018-11-23 12:05:06,850 INFO L273 TraceCheckUtils]: 54: Hoare triple {4596#false} assume !false; {4596#false} is VALID [2018-11-23 12:05:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:06,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:06,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:06,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:06,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:06,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:06,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:07,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {4595#true} call ULTIMATE.init(); {4595#true} is VALID [2018-11-23 12:05:07,091 INFO L273 TraceCheckUtils]: 1: Hoare triple {4595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4595#true} is VALID [2018-11-23 12:05:07,091 INFO L273 TraceCheckUtils]: 2: Hoare triple {4595#true} assume true; {4595#true} is VALID [2018-11-23 12:05:07,091 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4595#true} {4595#true} #55#return; {4595#true} is VALID [2018-11-23 12:05:07,092 INFO L256 TraceCheckUtils]: 4: Hoare triple {4595#true} call #t~ret4 := main(); {4595#true} is VALID [2018-11-23 12:05:07,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {4595#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {4630#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:07,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {4630#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4630#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:07,098 INFO L273 TraceCheckUtils]: 7: Hoare triple {4630#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4630#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:07,099 INFO L273 TraceCheckUtils]: 8: Hoare triple {4630#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4598#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:07,099 INFO L273 TraceCheckUtils]: 9: Hoare triple {4598#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4598#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:07,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {4598#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4598#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:07,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {4598#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4599#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:07,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {4599#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4599#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:07,100 INFO L273 TraceCheckUtils]: 13: Hoare triple {4599#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4599#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:07,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {4599#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4600#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:07,101 INFO L273 TraceCheckUtils]: 15: Hoare triple {4600#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4600#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:07,102 INFO L273 TraceCheckUtils]: 16: Hoare triple {4600#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4600#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:07,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {4600#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4601#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:07,103 INFO L273 TraceCheckUtils]: 18: Hoare triple {4601#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4601#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:07,104 INFO L273 TraceCheckUtils]: 19: Hoare triple {4601#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4601#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:07,105 INFO L273 TraceCheckUtils]: 20: Hoare triple {4601#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4602#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:07,105 INFO L273 TraceCheckUtils]: 21: Hoare triple {4602#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4602#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:07,106 INFO L273 TraceCheckUtils]: 22: Hoare triple {4602#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4602#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:07,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {4602#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4603#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:07,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {4603#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4603#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:07,108 INFO L273 TraceCheckUtils]: 25: Hoare triple {4603#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4603#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:07,108 INFO L273 TraceCheckUtils]: 26: Hoare triple {4603#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4604#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:07,109 INFO L273 TraceCheckUtils]: 27: Hoare triple {4604#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4604#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:07,109 INFO L273 TraceCheckUtils]: 28: Hoare triple {4604#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4604#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:07,110 INFO L273 TraceCheckUtils]: 29: Hoare triple {4604#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4605#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:07,111 INFO L273 TraceCheckUtils]: 30: Hoare triple {4605#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4605#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:07,111 INFO L273 TraceCheckUtils]: 31: Hoare triple {4605#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4605#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:07,112 INFO L273 TraceCheckUtils]: 32: Hoare triple {4605#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4606#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:07,113 INFO L273 TraceCheckUtils]: 33: Hoare triple {4606#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4606#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:07,113 INFO L273 TraceCheckUtils]: 34: Hoare triple {4606#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4606#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:07,114 INFO L273 TraceCheckUtils]: 35: Hoare triple {4606#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4607#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:07,114 INFO L273 TraceCheckUtils]: 36: Hoare triple {4607#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4607#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:07,115 INFO L273 TraceCheckUtils]: 37: Hoare triple {4607#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4607#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:07,116 INFO L273 TraceCheckUtils]: 38: Hoare triple {4607#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4608#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:07,116 INFO L273 TraceCheckUtils]: 39: Hoare triple {4608#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4608#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:07,117 INFO L273 TraceCheckUtils]: 40: Hoare triple {4608#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4608#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:07,118 INFO L273 TraceCheckUtils]: 41: Hoare triple {4608#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4609#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:07,118 INFO L273 TraceCheckUtils]: 42: Hoare triple {4609#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4609#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:07,119 INFO L273 TraceCheckUtils]: 43: Hoare triple {4609#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4609#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:07,119 INFO L273 TraceCheckUtils]: 44: Hoare triple {4609#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {4610#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:07,120 INFO L273 TraceCheckUtils]: 45: Hoare triple {4610#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4610#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:07,121 INFO L273 TraceCheckUtils]: 46: Hoare triple {4610#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4610#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:07,121 INFO L273 TraceCheckUtils]: 47: Hoare triple {4610#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {4611#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:07,122 INFO L273 TraceCheckUtils]: 48: Hoare triple {4611#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4596#false} is VALID [2018-11-23 12:05:07,122 INFO L273 TraceCheckUtils]: 49: Hoare triple {4596#false} havoc ~x~0;~x~0 := 0; {4596#false} is VALID [2018-11-23 12:05:07,122 INFO L273 TraceCheckUtils]: 50: Hoare triple {4596#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4596#false} is VALID [2018-11-23 12:05:07,123 INFO L256 TraceCheckUtils]: 51: Hoare triple {4596#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {4596#false} is VALID [2018-11-23 12:05:07,123 INFO L273 TraceCheckUtils]: 52: Hoare triple {4596#false} ~cond := #in~cond; {4596#false} is VALID [2018-11-23 12:05:07,123 INFO L273 TraceCheckUtils]: 53: Hoare triple {4596#false} assume 0 == ~cond; {4596#false} is VALID [2018-11-23 12:05:07,123 INFO L273 TraceCheckUtils]: 54: Hoare triple {4596#false} assume !false; {4596#false} is VALID [2018-11-23 12:05:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:07,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:07,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:05:07,146 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-23 12:05:07,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:07,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:05:07,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:07,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:05:07,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:05:07,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:05:07,204 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand 18 states. [2018-11-23 12:05:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:07,426 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2018-11-23 12:05:07,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:05:07,426 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-23 12:05:07,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:05:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2018-11-23 12:05:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:05:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2018-11-23 12:05:07,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2018-11-23 12:05:07,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:07,518 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:05:07,518 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:05:07,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:05:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:05:07,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 12:05:07,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:07,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 12:05:07,543 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 12:05:07,543 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 12:05:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:07,545 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2018-11-23 12:05:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2018-11-23 12:05:07,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:07,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:07,546 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 12:05:07,546 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 12:05:07,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:07,548 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2018-11-23 12:05:07,548 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2018-11-23 12:05:07,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:07,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:07,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:07,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:05:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2018-11-23 12:05:07,550 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 55 [2018-11-23 12:05:07,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:07,550 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2018-11-23 12:05:07,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:05:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2018-11-23 12:05:07,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:05:07,551 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:07,551 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:07,552 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:07,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:07,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1806532259, now seen corresponding path program 15 times [2018-11-23 12:05:07,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:07,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:07,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:07,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:07,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:08,527 INFO L256 TraceCheckUtils]: 0: Hoare triple {5095#true} call ULTIMATE.init(); {5095#true} is VALID [2018-11-23 12:05:08,527 INFO L273 TraceCheckUtils]: 1: Hoare triple {5095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5095#true} is VALID [2018-11-23 12:05:08,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {5095#true} assume true; {5095#true} is VALID [2018-11-23 12:05:08,528 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5095#true} {5095#true} #55#return; {5095#true} is VALID [2018-11-23 12:05:08,528 INFO L256 TraceCheckUtils]: 4: Hoare triple {5095#true} call #t~ret4 := main(); {5095#true} is VALID [2018-11-23 12:05:08,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {5095#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {5097#(= main_~i~0 0)} is VALID [2018-11-23 12:05:08,528 INFO L273 TraceCheckUtils]: 6: Hoare triple {5097#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5097#(= main_~i~0 0)} is VALID [2018-11-23 12:05:08,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {5097#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5097#(= main_~i~0 0)} is VALID [2018-11-23 12:05:08,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {5097#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5098#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:08,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {5098#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5098#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:08,530 INFO L273 TraceCheckUtils]: 10: Hoare triple {5098#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5098#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:08,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {5098#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5099#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:08,531 INFO L273 TraceCheckUtils]: 12: Hoare triple {5099#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5099#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:08,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {5099#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5099#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:08,533 INFO L273 TraceCheckUtils]: 14: Hoare triple {5099#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5100#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:08,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {5100#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5100#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:08,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {5100#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5100#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:08,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {5100#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5101#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:08,535 INFO L273 TraceCheckUtils]: 18: Hoare triple {5101#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5101#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:08,536 INFO L273 TraceCheckUtils]: 19: Hoare triple {5101#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5101#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:08,536 INFO L273 TraceCheckUtils]: 20: Hoare triple {5101#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5102#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:08,537 INFO L273 TraceCheckUtils]: 21: Hoare triple {5102#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5102#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:08,537 INFO L273 TraceCheckUtils]: 22: Hoare triple {5102#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5102#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:08,538 INFO L273 TraceCheckUtils]: 23: Hoare triple {5102#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5103#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:08,539 INFO L273 TraceCheckUtils]: 24: Hoare triple {5103#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5103#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:08,539 INFO L273 TraceCheckUtils]: 25: Hoare triple {5103#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5103#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:08,540 INFO L273 TraceCheckUtils]: 26: Hoare triple {5103#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5104#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:08,541 INFO L273 TraceCheckUtils]: 27: Hoare triple {5104#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5104#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:08,541 INFO L273 TraceCheckUtils]: 28: Hoare triple {5104#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5104#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:08,542 INFO L273 TraceCheckUtils]: 29: Hoare triple {5104#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5105#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:08,542 INFO L273 TraceCheckUtils]: 30: Hoare triple {5105#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5105#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:08,543 INFO L273 TraceCheckUtils]: 31: Hoare triple {5105#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5105#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:08,544 INFO L273 TraceCheckUtils]: 32: Hoare triple {5105#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5106#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:08,544 INFO L273 TraceCheckUtils]: 33: Hoare triple {5106#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5106#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:08,545 INFO L273 TraceCheckUtils]: 34: Hoare triple {5106#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5106#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:08,546 INFO L273 TraceCheckUtils]: 35: Hoare triple {5106#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5107#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:08,546 INFO L273 TraceCheckUtils]: 36: Hoare triple {5107#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5107#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:08,547 INFO L273 TraceCheckUtils]: 37: Hoare triple {5107#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5107#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:08,548 INFO L273 TraceCheckUtils]: 38: Hoare triple {5107#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5108#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:08,548 INFO L273 TraceCheckUtils]: 39: Hoare triple {5108#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5108#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:08,549 INFO L273 TraceCheckUtils]: 40: Hoare triple {5108#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5108#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:08,570 INFO L273 TraceCheckUtils]: 41: Hoare triple {5108#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5109#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:08,571 INFO L273 TraceCheckUtils]: 42: Hoare triple {5109#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5109#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:08,571 INFO L273 TraceCheckUtils]: 43: Hoare triple {5109#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5109#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:08,571 INFO L273 TraceCheckUtils]: 44: Hoare triple {5109#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5110#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:08,572 INFO L273 TraceCheckUtils]: 45: Hoare triple {5110#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5110#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:08,572 INFO L273 TraceCheckUtils]: 46: Hoare triple {5110#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5110#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:08,573 INFO L273 TraceCheckUtils]: 47: Hoare triple {5110#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {5111#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:08,573 INFO L273 TraceCheckUtils]: 48: Hoare triple {5111#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5111#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:08,573 INFO L273 TraceCheckUtils]: 49: Hoare triple {5111#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5111#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:08,574 INFO L273 TraceCheckUtils]: 50: Hoare triple {5111#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {5112#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:08,574 INFO L273 TraceCheckUtils]: 51: Hoare triple {5112#(<= main_~i~0 15)} assume !(~i~0 < 100000); {5096#false} is VALID [2018-11-23 12:05:08,574 INFO L273 TraceCheckUtils]: 52: Hoare triple {5096#false} havoc ~x~0;~x~0 := 0; {5096#false} is VALID [2018-11-23 12:05:08,574 INFO L273 TraceCheckUtils]: 53: Hoare triple {5096#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5096#false} is VALID [2018-11-23 12:05:08,575 INFO L256 TraceCheckUtils]: 54: Hoare triple {5096#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {5096#false} is VALID [2018-11-23 12:05:08,575 INFO L273 TraceCheckUtils]: 55: Hoare triple {5096#false} ~cond := #in~cond; {5096#false} is VALID [2018-11-23 12:05:08,575 INFO L273 TraceCheckUtils]: 56: Hoare triple {5096#false} assume 0 == ~cond; {5096#false} is VALID [2018-11-23 12:05:08,575 INFO L273 TraceCheckUtils]: 57: Hoare triple {5096#false} assume !false; {5096#false} is VALID [2018-11-23 12:05:08,578 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:08,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:08,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:08,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:08,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 12:05:08,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:08,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:08,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {5095#true} call ULTIMATE.init(); {5095#true} is VALID [2018-11-23 12:05:08,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {5095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5095#true} is VALID [2018-11-23 12:05:08,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {5095#true} assume true; {5095#true} is VALID [2018-11-23 12:05:08,785 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5095#true} {5095#true} #55#return; {5095#true} is VALID [2018-11-23 12:05:08,785 INFO L256 TraceCheckUtils]: 4: Hoare triple {5095#true} call #t~ret4 := main(); {5095#true} is VALID [2018-11-23 12:05:08,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {5095#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {5131#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:08,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {5131#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5131#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:08,786 INFO L273 TraceCheckUtils]: 7: Hoare triple {5131#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5131#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:08,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {5131#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5098#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:08,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {5098#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5098#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:08,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {5098#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5098#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:08,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {5098#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5099#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:08,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {5099#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5099#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:08,789 INFO L273 TraceCheckUtils]: 13: Hoare triple {5099#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5099#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:08,789 INFO L273 TraceCheckUtils]: 14: Hoare triple {5099#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5100#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:08,790 INFO L273 TraceCheckUtils]: 15: Hoare triple {5100#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5100#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:08,790 INFO L273 TraceCheckUtils]: 16: Hoare triple {5100#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5100#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:08,791 INFO L273 TraceCheckUtils]: 17: Hoare triple {5100#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5101#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:08,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {5101#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5101#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:08,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {5101#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5101#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:08,793 INFO L273 TraceCheckUtils]: 20: Hoare triple {5101#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5102#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:08,793 INFO L273 TraceCheckUtils]: 21: Hoare triple {5102#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5102#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:08,794 INFO L273 TraceCheckUtils]: 22: Hoare triple {5102#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5102#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:08,794 INFO L273 TraceCheckUtils]: 23: Hoare triple {5102#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5103#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:08,795 INFO L273 TraceCheckUtils]: 24: Hoare triple {5103#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5103#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:08,796 INFO L273 TraceCheckUtils]: 25: Hoare triple {5103#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5103#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:08,796 INFO L273 TraceCheckUtils]: 26: Hoare triple {5103#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5104#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:08,797 INFO L273 TraceCheckUtils]: 27: Hoare triple {5104#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5104#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:08,797 INFO L273 TraceCheckUtils]: 28: Hoare triple {5104#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5104#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:08,798 INFO L273 TraceCheckUtils]: 29: Hoare triple {5104#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5105#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:08,799 INFO L273 TraceCheckUtils]: 30: Hoare triple {5105#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5105#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:08,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {5105#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5105#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:08,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {5105#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5106#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:08,800 INFO L273 TraceCheckUtils]: 33: Hoare triple {5106#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5106#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:08,801 INFO L273 TraceCheckUtils]: 34: Hoare triple {5106#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5106#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:08,802 INFO L273 TraceCheckUtils]: 35: Hoare triple {5106#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5107#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:08,802 INFO L273 TraceCheckUtils]: 36: Hoare triple {5107#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5107#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:08,803 INFO L273 TraceCheckUtils]: 37: Hoare triple {5107#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5107#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:08,804 INFO L273 TraceCheckUtils]: 38: Hoare triple {5107#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5108#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:08,804 INFO L273 TraceCheckUtils]: 39: Hoare triple {5108#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5108#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:08,805 INFO L273 TraceCheckUtils]: 40: Hoare triple {5108#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5108#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:08,805 INFO L273 TraceCheckUtils]: 41: Hoare triple {5108#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5109#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:08,806 INFO L273 TraceCheckUtils]: 42: Hoare triple {5109#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5109#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:08,806 INFO L273 TraceCheckUtils]: 43: Hoare triple {5109#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5109#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:08,807 INFO L273 TraceCheckUtils]: 44: Hoare triple {5109#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5110#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:08,808 INFO L273 TraceCheckUtils]: 45: Hoare triple {5110#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5110#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:08,808 INFO L273 TraceCheckUtils]: 46: Hoare triple {5110#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5110#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:08,809 INFO L273 TraceCheckUtils]: 47: Hoare triple {5110#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {5111#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:08,810 INFO L273 TraceCheckUtils]: 48: Hoare triple {5111#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5111#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:08,810 INFO L273 TraceCheckUtils]: 49: Hoare triple {5111#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5111#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:08,811 INFO L273 TraceCheckUtils]: 50: Hoare triple {5111#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {5112#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:08,811 INFO L273 TraceCheckUtils]: 51: Hoare triple {5112#(<= main_~i~0 15)} assume !(~i~0 < 100000); {5096#false} is VALID [2018-11-23 12:05:08,812 INFO L273 TraceCheckUtils]: 52: Hoare triple {5096#false} havoc ~x~0;~x~0 := 0; {5096#false} is VALID [2018-11-23 12:05:08,812 INFO L273 TraceCheckUtils]: 53: Hoare triple {5096#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5096#false} is VALID [2018-11-23 12:05:08,812 INFO L256 TraceCheckUtils]: 54: Hoare triple {5096#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {5096#false} is VALID [2018-11-23 12:05:08,812 INFO L273 TraceCheckUtils]: 55: Hoare triple {5096#false} ~cond := #in~cond; {5096#false} is VALID [2018-11-23 12:05:08,813 INFO L273 TraceCheckUtils]: 56: Hoare triple {5096#false} assume 0 == ~cond; {5096#false} is VALID [2018-11-23 12:05:08,813 INFO L273 TraceCheckUtils]: 57: Hoare triple {5096#false} assume !false; {5096#false} is VALID [2018-11-23 12:05:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:08,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:08,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:05:08,835 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-11-23 12:05:08,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:08,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:05:08,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:08,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:05:08,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:05:08,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:05:08,895 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. Second operand 19 states. [2018-11-23 12:05:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:09,247 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2018-11-23 12:05:09,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:05:09,248 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-11-23 12:05:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:05:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 98 transitions. [2018-11-23 12:05:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:05:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 98 transitions. [2018-11-23 12:05:09,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 98 transitions. [2018-11-23 12:05:09,342 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 12:05:09,344 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:05:09,344 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 12:05:09,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:05:09,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 12:05:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-23 12:05:09,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:09,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 66 states. [2018-11-23 12:05:09,383 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 66 states. [2018-11-23 12:05:09,383 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 66 states. [2018-11-23 12:05:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:09,384 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2018-11-23 12:05:09,384 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-11-23 12:05:09,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:09,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:09,385 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 68 states. [2018-11-23 12:05:09,385 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 68 states. [2018-11-23 12:05:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:09,386 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2018-11-23 12:05:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-11-23 12:05:09,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:09,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:09,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:09,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:05:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2018-11-23 12:05:09,388 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 58 [2018-11-23 12:05:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:09,388 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2018-11-23 12:05:09,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:05:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2018-11-23 12:05:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:05:09,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:09,389 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:09,390 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:09,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:09,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1507674809, now seen corresponding path program 16 times [2018-11-23 12:05:09,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:09,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:09,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:09,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:09,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:09,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {5619#true} call ULTIMATE.init(); {5619#true} is VALID [2018-11-23 12:05:09,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {5619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5619#true} is VALID [2018-11-23 12:05:09,963 INFO L273 TraceCheckUtils]: 2: Hoare triple {5619#true} assume true; {5619#true} is VALID [2018-11-23 12:05:09,963 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5619#true} {5619#true} #55#return; {5619#true} is VALID [2018-11-23 12:05:09,963 INFO L256 TraceCheckUtils]: 4: Hoare triple {5619#true} call #t~ret4 := main(); {5619#true} is VALID [2018-11-23 12:05:09,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {5619#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {5621#(= main_~i~0 0)} is VALID [2018-11-23 12:05:09,965 INFO L273 TraceCheckUtils]: 6: Hoare triple {5621#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5621#(= main_~i~0 0)} is VALID [2018-11-23 12:05:09,965 INFO L273 TraceCheckUtils]: 7: Hoare triple {5621#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5621#(= main_~i~0 0)} is VALID [2018-11-23 12:05:09,966 INFO L273 TraceCheckUtils]: 8: Hoare triple {5621#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5622#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:09,966 INFO L273 TraceCheckUtils]: 9: Hoare triple {5622#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5622#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:09,967 INFO L273 TraceCheckUtils]: 10: Hoare triple {5622#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5622#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:09,967 INFO L273 TraceCheckUtils]: 11: Hoare triple {5622#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5623#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:09,967 INFO L273 TraceCheckUtils]: 12: Hoare triple {5623#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5623#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:09,968 INFO L273 TraceCheckUtils]: 13: Hoare triple {5623#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5623#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:09,968 INFO L273 TraceCheckUtils]: 14: Hoare triple {5623#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5624#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:09,969 INFO L273 TraceCheckUtils]: 15: Hoare triple {5624#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5624#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:09,969 INFO L273 TraceCheckUtils]: 16: Hoare triple {5624#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5624#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:09,970 INFO L273 TraceCheckUtils]: 17: Hoare triple {5624#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5625#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:09,971 INFO L273 TraceCheckUtils]: 18: Hoare triple {5625#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5625#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:09,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {5625#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5625#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:09,972 INFO L273 TraceCheckUtils]: 20: Hoare triple {5625#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5626#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:09,972 INFO L273 TraceCheckUtils]: 21: Hoare triple {5626#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5626#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:09,973 INFO L273 TraceCheckUtils]: 22: Hoare triple {5626#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5626#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:09,974 INFO L273 TraceCheckUtils]: 23: Hoare triple {5626#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5627#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:09,974 INFO L273 TraceCheckUtils]: 24: Hoare triple {5627#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5627#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:09,975 INFO L273 TraceCheckUtils]: 25: Hoare triple {5627#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5627#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:09,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {5627#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5628#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:09,976 INFO L273 TraceCheckUtils]: 27: Hoare triple {5628#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5628#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:09,977 INFO L273 TraceCheckUtils]: 28: Hoare triple {5628#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5628#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:09,977 INFO L273 TraceCheckUtils]: 29: Hoare triple {5628#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5629#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:09,978 INFO L273 TraceCheckUtils]: 30: Hoare triple {5629#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5629#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:09,978 INFO L273 TraceCheckUtils]: 31: Hoare triple {5629#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5629#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:09,979 INFO L273 TraceCheckUtils]: 32: Hoare triple {5629#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5630#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:09,980 INFO L273 TraceCheckUtils]: 33: Hoare triple {5630#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5630#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:09,980 INFO L273 TraceCheckUtils]: 34: Hoare triple {5630#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5630#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:09,981 INFO L273 TraceCheckUtils]: 35: Hoare triple {5630#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5631#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:09,981 INFO L273 TraceCheckUtils]: 36: Hoare triple {5631#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5631#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:09,982 INFO L273 TraceCheckUtils]: 37: Hoare triple {5631#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5631#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:09,983 INFO L273 TraceCheckUtils]: 38: Hoare triple {5631#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5632#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:09,983 INFO L273 TraceCheckUtils]: 39: Hoare triple {5632#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5632#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:09,984 INFO L273 TraceCheckUtils]: 40: Hoare triple {5632#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5632#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:09,985 INFO L273 TraceCheckUtils]: 41: Hoare triple {5632#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5633#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:09,985 INFO L273 TraceCheckUtils]: 42: Hoare triple {5633#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5633#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:09,986 INFO L273 TraceCheckUtils]: 43: Hoare triple {5633#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5633#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:09,986 INFO L273 TraceCheckUtils]: 44: Hoare triple {5633#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5634#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:09,987 INFO L273 TraceCheckUtils]: 45: Hoare triple {5634#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5634#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:09,988 INFO L273 TraceCheckUtils]: 46: Hoare triple {5634#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5634#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:09,988 INFO L273 TraceCheckUtils]: 47: Hoare triple {5634#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {5635#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:09,989 INFO L273 TraceCheckUtils]: 48: Hoare triple {5635#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5635#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:09,989 INFO L273 TraceCheckUtils]: 49: Hoare triple {5635#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5635#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:09,990 INFO L273 TraceCheckUtils]: 50: Hoare triple {5635#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {5636#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:09,991 INFO L273 TraceCheckUtils]: 51: Hoare triple {5636#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5636#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:09,991 INFO L273 TraceCheckUtils]: 52: Hoare triple {5636#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5636#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:09,992 INFO L273 TraceCheckUtils]: 53: Hoare triple {5636#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {5637#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:09,993 INFO L273 TraceCheckUtils]: 54: Hoare triple {5637#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5620#false} is VALID [2018-11-23 12:05:09,993 INFO L273 TraceCheckUtils]: 55: Hoare triple {5620#false} havoc ~x~0;~x~0 := 0; {5620#false} is VALID [2018-11-23 12:05:09,993 INFO L273 TraceCheckUtils]: 56: Hoare triple {5620#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5620#false} is VALID [2018-11-23 12:05:09,993 INFO L256 TraceCheckUtils]: 57: Hoare triple {5620#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {5620#false} is VALID [2018-11-23 12:05:09,994 INFO L273 TraceCheckUtils]: 58: Hoare triple {5620#false} ~cond := #in~cond; {5620#false} is VALID [2018-11-23 12:05:09,994 INFO L273 TraceCheckUtils]: 59: Hoare triple {5620#false} assume 0 == ~cond; {5620#false} is VALID [2018-11-23 12:05:09,994 INFO L273 TraceCheckUtils]: 60: Hoare triple {5620#false} assume !false; {5620#false} is VALID [2018-11-23 12:05:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:09,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:09,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:10,006 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:10,031 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:10,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:10,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:10,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {5619#true} call ULTIMATE.init(); {5619#true} is VALID [2018-11-23 12:05:10,206 INFO L273 TraceCheckUtils]: 1: Hoare triple {5619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5619#true} is VALID [2018-11-23 12:05:10,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {5619#true} assume true; {5619#true} is VALID [2018-11-23 12:05:10,206 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5619#true} {5619#true} #55#return; {5619#true} is VALID [2018-11-23 12:05:10,206 INFO L256 TraceCheckUtils]: 4: Hoare triple {5619#true} call #t~ret4 := main(); {5619#true} is VALID [2018-11-23 12:05:10,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {5619#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {5656#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:10,207 INFO L273 TraceCheckUtils]: 6: Hoare triple {5656#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5656#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:10,207 INFO L273 TraceCheckUtils]: 7: Hoare triple {5656#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5656#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:10,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {5656#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5622#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:10,208 INFO L273 TraceCheckUtils]: 9: Hoare triple {5622#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5622#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:10,208 INFO L273 TraceCheckUtils]: 10: Hoare triple {5622#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5622#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:10,209 INFO L273 TraceCheckUtils]: 11: Hoare triple {5622#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5623#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:10,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {5623#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5623#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:10,209 INFO L273 TraceCheckUtils]: 13: Hoare triple {5623#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5623#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:10,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {5623#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5624#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:10,211 INFO L273 TraceCheckUtils]: 15: Hoare triple {5624#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5624#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:10,211 INFO L273 TraceCheckUtils]: 16: Hoare triple {5624#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5624#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:10,212 INFO L273 TraceCheckUtils]: 17: Hoare triple {5624#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5625#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:10,212 INFO L273 TraceCheckUtils]: 18: Hoare triple {5625#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5625#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:10,213 INFO L273 TraceCheckUtils]: 19: Hoare triple {5625#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5625#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:10,214 INFO L273 TraceCheckUtils]: 20: Hoare triple {5625#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5626#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:10,214 INFO L273 TraceCheckUtils]: 21: Hoare triple {5626#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5626#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:10,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {5626#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5626#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:10,215 INFO L273 TraceCheckUtils]: 23: Hoare triple {5626#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5627#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:10,216 INFO L273 TraceCheckUtils]: 24: Hoare triple {5627#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5627#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:10,216 INFO L273 TraceCheckUtils]: 25: Hoare triple {5627#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5627#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:10,217 INFO L273 TraceCheckUtils]: 26: Hoare triple {5627#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5628#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:10,218 INFO L273 TraceCheckUtils]: 27: Hoare triple {5628#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5628#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:10,218 INFO L273 TraceCheckUtils]: 28: Hoare triple {5628#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5628#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:10,219 INFO L273 TraceCheckUtils]: 29: Hoare triple {5628#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5629#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:10,219 INFO L273 TraceCheckUtils]: 30: Hoare triple {5629#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5629#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:10,220 INFO L273 TraceCheckUtils]: 31: Hoare triple {5629#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5629#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:10,221 INFO L273 TraceCheckUtils]: 32: Hoare triple {5629#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5630#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:10,221 INFO L273 TraceCheckUtils]: 33: Hoare triple {5630#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5630#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:10,222 INFO L273 TraceCheckUtils]: 34: Hoare triple {5630#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5630#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:10,223 INFO L273 TraceCheckUtils]: 35: Hoare triple {5630#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5631#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:10,223 INFO L273 TraceCheckUtils]: 36: Hoare triple {5631#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5631#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:10,224 INFO L273 TraceCheckUtils]: 37: Hoare triple {5631#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5631#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:10,224 INFO L273 TraceCheckUtils]: 38: Hoare triple {5631#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5632#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:10,225 INFO L273 TraceCheckUtils]: 39: Hoare triple {5632#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5632#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:10,225 INFO L273 TraceCheckUtils]: 40: Hoare triple {5632#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5632#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:10,226 INFO L273 TraceCheckUtils]: 41: Hoare triple {5632#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5633#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:10,227 INFO L273 TraceCheckUtils]: 42: Hoare triple {5633#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5633#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:10,227 INFO L273 TraceCheckUtils]: 43: Hoare triple {5633#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5633#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:10,228 INFO L273 TraceCheckUtils]: 44: Hoare triple {5633#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5634#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:10,228 INFO L273 TraceCheckUtils]: 45: Hoare triple {5634#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5634#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:10,229 INFO L273 TraceCheckUtils]: 46: Hoare triple {5634#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5634#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:10,230 INFO L273 TraceCheckUtils]: 47: Hoare triple {5634#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {5635#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:10,230 INFO L273 TraceCheckUtils]: 48: Hoare triple {5635#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5635#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:10,231 INFO L273 TraceCheckUtils]: 49: Hoare triple {5635#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5635#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:10,231 INFO L273 TraceCheckUtils]: 50: Hoare triple {5635#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {5636#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:10,232 INFO L273 TraceCheckUtils]: 51: Hoare triple {5636#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5636#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:10,232 INFO L273 TraceCheckUtils]: 52: Hoare triple {5636#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5636#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:10,233 INFO L273 TraceCheckUtils]: 53: Hoare triple {5636#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {5637#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:10,234 INFO L273 TraceCheckUtils]: 54: Hoare triple {5637#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5620#false} is VALID [2018-11-23 12:05:10,234 INFO L273 TraceCheckUtils]: 55: Hoare triple {5620#false} havoc ~x~0;~x~0 := 0; {5620#false} is VALID [2018-11-23 12:05:10,234 INFO L273 TraceCheckUtils]: 56: Hoare triple {5620#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5620#false} is VALID [2018-11-23 12:05:10,234 INFO L256 TraceCheckUtils]: 57: Hoare triple {5620#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {5620#false} is VALID [2018-11-23 12:05:10,234 INFO L273 TraceCheckUtils]: 58: Hoare triple {5620#false} ~cond := #in~cond; {5620#false} is VALID [2018-11-23 12:05:10,235 INFO L273 TraceCheckUtils]: 59: Hoare triple {5620#false} assume 0 == ~cond; {5620#false} is VALID [2018-11-23 12:05:10,235 INFO L273 TraceCheckUtils]: 60: Hoare triple {5620#false} assume !false; {5620#false} is VALID [2018-11-23 12:05:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:10,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:10,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:05:10,258 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-11-23 12:05:10,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:10,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:05:10,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:10,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:05:10,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:05:10,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:05:10,319 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 20 states. [2018-11-23 12:05:10,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:10,606 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-11-23 12:05:10,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:05:10,606 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-11-23 12:05:10,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:05:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 102 transitions. [2018-11-23 12:05:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:05:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 102 transitions. [2018-11-23 12:05:10,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 102 transitions. [2018-11-23 12:05:10,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:10,700 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:05:10,700 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 12:05:10,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:05:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 12:05:10,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-11-23 12:05:10,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:10,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 69 states. [2018-11-23 12:05:10,721 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 69 states. [2018-11-23 12:05:10,721 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 69 states. [2018-11-23 12:05:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:10,722 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2018-11-23 12:05:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-11-23 12:05:10,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:10,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:10,723 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 71 states. [2018-11-23 12:05:10,723 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 71 states. [2018-11-23 12:05:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:10,724 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2018-11-23 12:05:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-11-23 12:05:10,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:10,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:10,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:10,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:10,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:05:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2018-11-23 12:05:10,726 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 61 [2018-11-23 12:05:10,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:10,726 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2018-11-23 12:05:10,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:05:10,727 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2018-11-23 12:05:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:05:10,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:10,727 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:10,728 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:10,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:10,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1712586467, now seen corresponding path program 17 times [2018-11-23 12:05:10,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:10,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:10,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:10,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:10,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:11,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {6167#true} call ULTIMATE.init(); {6167#true} is VALID [2018-11-23 12:05:11,673 INFO L273 TraceCheckUtils]: 1: Hoare triple {6167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6167#true} is VALID [2018-11-23 12:05:11,673 INFO L273 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2018-11-23 12:05:11,673 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #55#return; {6167#true} is VALID [2018-11-23 12:05:11,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret4 := main(); {6167#true} is VALID [2018-11-23 12:05:11,674 INFO L273 TraceCheckUtils]: 5: Hoare triple {6167#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {6169#(= main_~i~0 0)} is VALID [2018-11-23 12:05:11,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {6169#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6169#(= main_~i~0 0)} is VALID [2018-11-23 12:05:11,676 INFO L273 TraceCheckUtils]: 7: Hoare triple {6169#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6169#(= main_~i~0 0)} is VALID [2018-11-23 12:05:11,678 INFO L273 TraceCheckUtils]: 8: Hoare triple {6169#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6170#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:11,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {6170#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6170#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:11,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {6170#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6170#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:11,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {6170#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6171#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:11,684 INFO L273 TraceCheckUtils]: 12: Hoare triple {6171#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6171#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:11,686 INFO L273 TraceCheckUtils]: 13: Hoare triple {6171#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6171#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:11,686 INFO L273 TraceCheckUtils]: 14: Hoare triple {6171#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6172#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:11,689 INFO L273 TraceCheckUtils]: 15: Hoare triple {6172#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6172#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:11,689 INFO L273 TraceCheckUtils]: 16: Hoare triple {6172#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6172#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:11,692 INFO L273 TraceCheckUtils]: 17: Hoare triple {6172#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6173#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:11,692 INFO L273 TraceCheckUtils]: 18: Hoare triple {6173#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6173#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:11,695 INFO L273 TraceCheckUtils]: 19: Hoare triple {6173#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6173#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:11,695 INFO L273 TraceCheckUtils]: 20: Hoare triple {6173#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6174#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:11,698 INFO L273 TraceCheckUtils]: 21: Hoare triple {6174#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6174#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:11,698 INFO L273 TraceCheckUtils]: 22: Hoare triple {6174#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6174#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:11,700 INFO L273 TraceCheckUtils]: 23: Hoare triple {6174#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6175#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:11,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {6175#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6175#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:11,702 INFO L273 TraceCheckUtils]: 25: Hoare triple {6175#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6175#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:11,702 INFO L273 TraceCheckUtils]: 26: Hoare triple {6175#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6176#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:11,703 INFO L273 TraceCheckUtils]: 27: Hoare triple {6176#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6176#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:11,704 INFO L273 TraceCheckUtils]: 28: Hoare triple {6176#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6176#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:11,704 INFO L273 TraceCheckUtils]: 29: Hoare triple {6176#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6177#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:11,706 INFO L273 TraceCheckUtils]: 30: Hoare triple {6177#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6177#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:11,706 INFO L273 TraceCheckUtils]: 31: Hoare triple {6177#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6177#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:11,708 INFO L273 TraceCheckUtils]: 32: Hoare triple {6177#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6178#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:11,708 INFO L273 TraceCheckUtils]: 33: Hoare triple {6178#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6178#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:11,710 INFO L273 TraceCheckUtils]: 34: Hoare triple {6178#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6178#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:11,710 INFO L273 TraceCheckUtils]: 35: Hoare triple {6178#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6179#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:11,712 INFO L273 TraceCheckUtils]: 36: Hoare triple {6179#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6179#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:11,712 INFO L273 TraceCheckUtils]: 37: Hoare triple {6179#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6179#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:11,714 INFO L273 TraceCheckUtils]: 38: Hoare triple {6179#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6180#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:11,714 INFO L273 TraceCheckUtils]: 39: Hoare triple {6180#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6180#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:11,716 INFO L273 TraceCheckUtils]: 40: Hoare triple {6180#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6180#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:11,716 INFO L273 TraceCheckUtils]: 41: Hoare triple {6180#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6181#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:11,719 INFO L273 TraceCheckUtils]: 42: Hoare triple {6181#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6181#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:11,719 INFO L273 TraceCheckUtils]: 43: Hoare triple {6181#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6181#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:11,722 INFO L273 TraceCheckUtils]: 44: Hoare triple {6181#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6182#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:11,722 INFO L273 TraceCheckUtils]: 45: Hoare triple {6182#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6182#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:11,725 INFO L273 TraceCheckUtils]: 46: Hoare triple {6182#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6182#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:11,725 INFO L273 TraceCheckUtils]: 47: Hoare triple {6182#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6183#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:11,728 INFO L273 TraceCheckUtils]: 48: Hoare triple {6183#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6183#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:11,728 INFO L273 TraceCheckUtils]: 49: Hoare triple {6183#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6183#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:11,731 INFO L273 TraceCheckUtils]: 50: Hoare triple {6183#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6184#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:11,731 INFO L273 TraceCheckUtils]: 51: Hoare triple {6184#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6184#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:11,734 INFO L273 TraceCheckUtils]: 52: Hoare triple {6184#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6184#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:11,736 INFO L273 TraceCheckUtils]: 53: Hoare triple {6184#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {6185#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:11,736 INFO L273 TraceCheckUtils]: 54: Hoare triple {6185#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6185#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:11,739 INFO L273 TraceCheckUtils]: 55: Hoare triple {6185#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6185#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:11,739 INFO L273 TraceCheckUtils]: 56: Hoare triple {6185#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {6186#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:11,742 INFO L273 TraceCheckUtils]: 57: Hoare triple {6186#(<= main_~i~0 17)} assume !(~i~0 < 100000); {6168#false} is VALID [2018-11-23 12:05:11,742 INFO L273 TraceCheckUtils]: 58: Hoare triple {6168#false} havoc ~x~0;~x~0 := 0; {6168#false} is VALID [2018-11-23 12:05:11,742 INFO L273 TraceCheckUtils]: 59: Hoare triple {6168#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6168#false} is VALID [2018-11-23 12:05:11,742 INFO L256 TraceCheckUtils]: 60: Hoare triple {6168#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {6168#false} is VALID [2018-11-23 12:05:11,742 INFO L273 TraceCheckUtils]: 61: Hoare triple {6168#false} ~cond := #in~cond; {6168#false} is VALID [2018-11-23 12:05:11,742 INFO L273 TraceCheckUtils]: 62: Hoare triple {6168#false} assume 0 == ~cond; {6168#false} is VALID [2018-11-23 12:05:11,743 INFO L273 TraceCheckUtils]: 63: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2018-11-23 12:05:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:11,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:11,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:11,754 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:11,794 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 12:05:11,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:11,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:12,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {6167#true} call ULTIMATE.init(); {6167#true} is VALID [2018-11-23 12:05:12,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {6167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6167#true} is VALID [2018-11-23 12:05:12,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2018-11-23 12:05:12,168 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #55#return; {6167#true} is VALID [2018-11-23 12:05:12,168 INFO L256 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret4 := main(); {6167#true} is VALID [2018-11-23 12:05:12,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {6167#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {6205#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:12,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {6205#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6205#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:12,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {6205#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6205#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:12,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {6205#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6170#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:12,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {6170#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6170#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:12,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {6170#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6170#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:12,172 INFO L273 TraceCheckUtils]: 11: Hoare triple {6170#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6171#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:12,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {6171#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6171#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:12,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {6171#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6171#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:12,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {6171#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6172#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:12,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {6172#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6172#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:12,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {6172#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6172#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:12,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {6172#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6173#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:12,195 INFO L273 TraceCheckUtils]: 18: Hoare triple {6173#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6173#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:12,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {6173#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6173#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:12,217 INFO L273 TraceCheckUtils]: 20: Hoare triple {6173#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6174#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:12,226 INFO L273 TraceCheckUtils]: 21: Hoare triple {6174#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6174#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:12,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {6174#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6174#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:12,248 INFO L273 TraceCheckUtils]: 23: Hoare triple {6174#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6175#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:12,248 INFO L273 TraceCheckUtils]: 24: Hoare triple {6175#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6175#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:12,254 INFO L273 TraceCheckUtils]: 25: Hoare triple {6175#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6175#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:12,254 INFO L273 TraceCheckUtils]: 26: Hoare triple {6175#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6176#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:12,255 INFO L273 TraceCheckUtils]: 27: Hoare triple {6176#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6176#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:12,255 INFO L273 TraceCheckUtils]: 28: Hoare triple {6176#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6176#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:12,256 INFO L273 TraceCheckUtils]: 29: Hoare triple {6176#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6177#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:12,256 INFO L273 TraceCheckUtils]: 30: Hoare triple {6177#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6177#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:12,256 INFO L273 TraceCheckUtils]: 31: Hoare triple {6177#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6177#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:12,257 INFO L273 TraceCheckUtils]: 32: Hoare triple {6177#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6178#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:12,257 INFO L273 TraceCheckUtils]: 33: Hoare triple {6178#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6178#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:12,257 INFO L273 TraceCheckUtils]: 34: Hoare triple {6178#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6178#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:12,258 INFO L273 TraceCheckUtils]: 35: Hoare triple {6178#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6179#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:12,259 INFO L273 TraceCheckUtils]: 36: Hoare triple {6179#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6179#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:12,260 INFO L273 TraceCheckUtils]: 37: Hoare triple {6179#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6179#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:12,260 INFO L273 TraceCheckUtils]: 38: Hoare triple {6179#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6180#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:12,261 INFO L273 TraceCheckUtils]: 39: Hoare triple {6180#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6180#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:12,262 INFO L273 TraceCheckUtils]: 40: Hoare triple {6180#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6180#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:12,263 INFO L273 TraceCheckUtils]: 41: Hoare triple {6180#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6181#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:12,263 INFO L273 TraceCheckUtils]: 42: Hoare triple {6181#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6181#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:12,264 INFO L273 TraceCheckUtils]: 43: Hoare triple {6181#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6181#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:12,265 INFO L273 TraceCheckUtils]: 44: Hoare triple {6181#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6182#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:12,265 INFO L273 TraceCheckUtils]: 45: Hoare triple {6182#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6182#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:12,266 INFO L273 TraceCheckUtils]: 46: Hoare triple {6182#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6182#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:12,267 INFO L273 TraceCheckUtils]: 47: Hoare triple {6182#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6183#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:12,267 INFO L273 TraceCheckUtils]: 48: Hoare triple {6183#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6183#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:12,268 INFO L273 TraceCheckUtils]: 49: Hoare triple {6183#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6183#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:12,269 INFO L273 TraceCheckUtils]: 50: Hoare triple {6183#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6184#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:12,269 INFO L273 TraceCheckUtils]: 51: Hoare triple {6184#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6184#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:12,270 INFO L273 TraceCheckUtils]: 52: Hoare triple {6184#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6184#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:12,271 INFO L273 TraceCheckUtils]: 53: Hoare triple {6184#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {6185#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:12,272 INFO L273 TraceCheckUtils]: 54: Hoare triple {6185#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6185#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:12,272 INFO L273 TraceCheckUtils]: 55: Hoare triple {6185#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6185#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:12,273 INFO L273 TraceCheckUtils]: 56: Hoare triple {6185#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {6186#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:12,274 INFO L273 TraceCheckUtils]: 57: Hoare triple {6186#(<= main_~i~0 17)} assume !(~i~0 < 100000); {6168#false} is VALID [2018-11-23 12:05:12,274 INFO L273 TraceCheckUtils]: 58: Hoare triple {6168#false} havoc ~x~0;~x~0 := 0; {6168#false} is VALID [2018-11-23 12:05:12,274 INFO L273 TraceCheckUtils]: 59: Hoare triple {6168#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6168#false} is VALID [2018-11-23 12:05:12,275 INFO L256 TraceCheckUtils]: 60: Hoare triple {6168#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {6168#false} is VALID [2018-11-23 12:05:12,275 INFO L273 TraceCheckUtils]: 61: Hoare triple {6168#false} ~cond := #in~cond; {6168#false} is VALID [2018-11-23 12:05:12,275 INFO L273 TraceCheckUtils]: 62: Hoare triple {6168#false} assume 0 == ~cond; {6168#false} is VALID [2018-11-23 12:05:12,275 INFO L273 TraceCheckUtils]: 63: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2018-11-23 12:05:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:12,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:12,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:05:12,301 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-11-23 12:05:12,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:12,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:05:12,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:12,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:05:12,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:05:12,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:05:12,378 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand 21 states. [2018-11-23 12:05:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:12,775 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2018-11-23 12:05:12,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:05:12,776 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-11-23 12:05:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:05:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 106 transitions. [2018-11-23 12:05:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:05:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 106 transitions. [2018-11-23 12:05:12,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 106 transitions. [2018-11-23 12:05:12,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:12,953 INFO L225 Difference]: With dead ends: 85 [2018-11-23 12:05:12,953 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:05:12,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:05:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:05:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-23 12:05:12,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:12,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 72 states. [2018-11-23 12:05:12,999 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 72 states. [2018-11-23 12:05:12,999 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 72 states. [2018-11-23 12:05:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:13,000 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2018-11-23 12:05:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2018-11-23 12:05:13,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:13,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:13,000 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 74 states. [2018-11-23 12:05:13,001 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 74 states. [2018-11-23 12:05:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:13,001 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2018-11-23 12:05:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2018-11-23 12:05:13,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:13,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:13,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:13,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:05:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2018-11-23 12:05:13,004 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 64 [2018-11-23 12:05:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:13,004 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2018-11-23 12:05:13,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:05:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2018-11-23 12:05:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:05:13,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:13,005 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:13,005 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:13,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:13,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1207704967, now seen corresponding path program 18 times [2018-11-23 12:05:13,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:13,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:13,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:13,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:13,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:13,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {6739#true} call ULTIMATE.init(); {6739#true} is VALID [2018-11-23 12:05:13,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {6739#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6739#true} is VALID [2018-11-23 12:05:13,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {6739#true} assume true; {6739#true} is VALID [2018-11-23 12:05:13,407 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6739#true} {6739#true} #55#return; {6739#true} is VALID [2018-11-23 12:05:13,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {6739#true} call #t~ret4 := main(); {6739#true} is VALID [2018-11-23 12:05:13,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {6739#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {6741#(= main_~i~0 0)} is VALID [2018-11-23 12:05:13,408 INFO L273 TraceCheckUtils]: 6: Hoare triple {6741#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6741#(= main_~i~0 0)} is VALID [2018-11-23 12:05:13,409 INFO L273 TraceCheckUtils]: 7: Hoare triple {6741#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6741#(= main_~i~0 0)} is VALID [2018-11-23 12:05:13,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {6741#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6742#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:13,410 INFO L273 TraceCheckUtils]: 9: Hoare triple {6742#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6742#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:13,410 INFO L273 TraceCheckUtils]: 10: Hoare triple {6742#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6742#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:13,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {6742#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6743#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:13,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {6743#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6743#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:13,411 INFO L273 TraceCheckUtils]: 13: Hoare triple {6743#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6743#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:13,412 INFO L273 TraceCheckUtils]: 14: Hoare triple {6743#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6744#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:13,412 INFO L273 TraceCheckUtils]: 15: Hoare triple {6744#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6744#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:13,413 INFO L273 TraceCheckUtils]: 16: Hoare triple {6744#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6744#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:13,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {6744#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6745#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:13,414 INFO L273 TraceCheckUtils]: 18: Hoare triple {6745#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6745#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:13,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {6745#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6745#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:13,415 INFO L273 TraceCheckUtils]: 20: Hoare triple {6745#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6746#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:13,416 INFO L273 TraceCheckUtils]: 21: Hoare triple {6746#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6746#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:13,417 INFO L273 TraceCheckUtils]: 22: Hoare triple {6746#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6746#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:13,417 INFO L273 TraceCheckUtils]: 23: Hoare triple {6746#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6747#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:13,418 INFO L273 TraceCheckUtils]: 24: Hoare triple {6747#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6747#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:13,418 INFO L273 TraceCheckUtils]: 25: Hoare triple {6747#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6747#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:13,419 INFO L273 TraceCheckUtils]: 26: Hoare triple {6747#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6748#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:13,419 INFO L273 TraceCheckUtils]: 27: Hoare triple {6748#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6748#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:13,420 INFO L273 TraceCheckUtils]: 28: Hoare triple {6748#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6748#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:13,421 INFO L273 TraceCheckUtils]: 29: Hoare triple {6748#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6749#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:13,421 INFO L273 TraceCheckUtils]: 30: Hoare triple {6749#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6749#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:13,422 INFO L273 TraceCheckUtils]: 31: Hoare triple {6749#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6749#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:13,422 INFO L273 TraceCheckUtils]: 32: Hoare triple {6749#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6750#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:13,423 INFO L273 TraceCheckUtils]: 33: Hoare triple {6750#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6750#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:13,423 INFO L273 TraceCheckUtils]: 34: Hoare triple {6750#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6750#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:13,424 INFO L273 TraceCheckUtils]: 35: Hoare triple {6750#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6751#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:13,425 INFO L273 TraceCheckUtils]: 36: Hoare triple {6751#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6751#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:13,425 INFO L273 TraceCheckUtils]: 37: Hoare triple {6751#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6751#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:13,426 INFO L273 TraceCheckUtils]: 38: Hoare triple {6751#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6752#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:13,426 INFO L273 TraceCheckUtils]: 39: Hoare triple {6752#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6752#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:13,427 INFO L273 TraceCheckUtils]: 40: Hoare triple {6752#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6752#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:13,428 INFO L273 TraceCheckUtils]: 41: Hoare triple {6752#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6753#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:13,428 INFO L273 TraceCheckUtils]: 42: Hoare triple {6753#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6753#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:13,429 INFO L273 TraceCheckUtils]: 43: Hoare triple {6753#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6753#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:13,429 INFO L273 TraceCheckUtils]: 44: Hoare triple {6753#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6754#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:13,430 INFO L273 TraceCheckUtils]: 45: Hoare triple {6754#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6754#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:13,430 INFO L273 TraceCheckUtils]: 46: Hoare triple {6754#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6754#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:13,431 INFO L273 TraceCheckUtils]: 47: Hoare triple {6754#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6755#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:13,432 INFO L273 TraceCheckUtils]: 48: Hoare triple {6755#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6755#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:13,432 INFO L273 TraceCheckUtils]: 49: Hoare triple {6755#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6755#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:13,433 INFO L273 TraceCheckUtils]: 50: Hoare triple {6755#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6756#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:13,433 INFO L273 TraceCheckUtils]: 51: Hoare triple {6756#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6756#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:13,434 INFO L273 TraceCheckUtils]: 52: Hoare triple {6756#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6756#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:13,435 INFO L273 TraceCheckUtils]: 53: Hoare triple {6756#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {6757#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:13,435 INFO L273 TraceCheckUtils]: 54: Hoare triple {6757#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6757#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:13,436 INFO L273 TraceCheckUtils]: 55: Hoare triple {6757#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6757#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:13,437 INFO L273 TraceCheckUtils]: 56: Hoare triple {6757#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {6758#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:13,437 INFO L273 TraceCheckUtils]: 57: Hoare triple {6758#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6758#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:13,438 INFO L273 TraceCheckUtils]: 58: Hoare triple {6758#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6758#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:13,438 INFO L273 TraceCheckUtils]: 59: Hoare triple {6758#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {6759#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:13,439 INFO L273 TraceCheckUtils]: 60: Hoare triple {6759#(<= main_~i~0 18)} assume !(~i~0 < 100000); {6740#false} is VALID [2018-11-23 12:05:13,439 INFO L273 TraceCheckUtils]: 61: Hoare triple {6740#false} havoc ~x~0;~x~0 := 0; {6740#false} is VALID [2018-11-23 12:05:13,439 INFO L273 TraceCheckUtils]: 62: Hoare triple {6740#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6740#false} is VALID [2018-11-23 12:05:13,439 INFO L256 TraceCheckUtils]: 63: Hoare triple {6740#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {6740#false} is VALID [2018-11-23 12:05:13,440 INFO L273 TraceCheckUtils]: 64: Hoare triple {6740#false} ~cond := #in~cond; {6740#false} is VALID [2018-11-23 12:05:13,440 INFO L273 TraceCheckUtils]: 65: Hoare triple {6740#false} assume 0 == ~cond; {6740#false} is VALID [2018-11-23 12:05:13,440 INFO L273 TraceCheckUtils]: 66: Hoare triple {6740#false} assume !false; {6740#false} is VALID [2018-11-23 12:05:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:13,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:13,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:13,453 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:13,693 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:05:13,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:13,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:13,922 INFO L256 TraceCheckUtils]: 0: Hoare triple {6739#true} call ULTIMATE.init(); {6739#true} is VALID [2018-11-23 12:05:13,922 INFO L273 TraceCheckUtils]: 1: Hoare triple {6739#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6739#true} is VALID [2018-11-23 12:05:13,922 INFO L273 TraceCheckUtils]: 2: Hoare triple {6739#true} assume true; {6739#true} is VALID [2018-11-23 12:05:13,922 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6739#true} {6739#true} #55#return; {6739#true} is VALID [2018-11-23 12:05:13,923 INFO L256 TraceCheckUtils]: 4: Hoare triple {6739#true} call #t~ret4 := main(); {6739#true} is VALID [2018-11-23 12:05:13,923 INFO L273 TraceCheckUtils]: 5: Hoare triple {6739#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {6778#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:13,923 INFO L273 TraceCheckUtils]: 6: Hoare triple {6778#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6778#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:13,924 INFO L273 TraceCheckUtils]: 7: Hoare triple {6778#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6778#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:13,924 INFO L273 TraceCheckUtils]: 8: Hoare triple {6778#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6742#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:13,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {6742#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6742#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:13,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {6742#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6742#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:13,925 INFO L273 TraceCheckUtils]: 11: Hoare triple {6742#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6743#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:13,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {6743#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6743#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:13,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {6743#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6743#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:13,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {6743#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6744#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:13,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {6744#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6744#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:13,928 INFO L273 TraceCheckUtils]: 16: Hoare triple {6744#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6744#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:13,928 INFO L273 TraceCheckUtils]: 17: Hoare triple {6744#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6745#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:13,929 INFO L273 TraceCheckUtils]: 18: Hoare triple {6745#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6745#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:13,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {6745#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6745#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:13,930 INFO L273 TraceCheckUtils]: 20: Hoare triple {6745#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6746#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:13,931 INFO L273 TraceCheckUtils]: 21: Hoare triple {6746#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6746#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:13,931 INFO L273 TraceCheckUtils]: 22: Hoare triple {6746#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6746#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:13,932 INFO L273 TraceCheckUtils]: 23: Hoare triple {6746#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6747#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:13,932 INFO L273 TraceCheckUtils]: 24: Hoare triple {6747#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6747#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:13,933 INFO L273 TraceCheckUtils]: 25: Hoare triple {6747#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6747#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:13,933 INFO L273 TraceCheckUtils]: 26: Hoare triple {6747#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6748#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:13,934 INFO L273 TraceCheckUtils]: 27: Hoare triple {6748#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6748#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:13,934 INFO L273 TraceCheckUtils]: 28: Hoare triple {6748#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6748#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:13,935 INFO L273 TraceCheckUtils]: 29: Hoare triple {6748#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6749#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:13,936 INFO L273 TraceCheckUtils]: 30: Hoare triple {6749#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6749#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:13,936 INFO L273 TraceCheckUtils]: 31: Hoare triple {6749#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6749#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:13,937 INFO L273 TraceCheckUtils]: 32: Hoare triple {6749#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6750#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:13,938 INFO L273 TraceCheckUtils]: 33: Hoare triple {6750#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6750#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:13,938 INFO L273 TraceCheckUtils]: 34: Hoare triple {6750#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6750#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:13,939 INFO L273 TraceCheckUtils]: 35: Hoare triple {6750#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6751#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:13,939 INFO L273 TraceCheckUtils]: 36: Hoare triple {6751#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6751#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:13,940 INFO L273 TraceCheckUtils]: 37: Hoare triple {6751#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6751#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:13,940 INFO L273 TraceCheckUtils]: 38: Hoare triple {6751#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6752#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:13,941 INFO L273 TraceCheckUtils]: 39: Hoare triple {6752#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6752#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:13,941 INFO L273 TraceCheckUtils]: 40: Hoare triple {6752#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6752#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:13,942 INFO L273 TraceCheckUtils]: 41: Hoare triple {6752#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6753#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:13,943 INFO L273 TraceCheckUtils]: 42: Hoare triple {6753#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6753#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:13,943 INFO L273 TraceCheckUtils]: 43: Hoare triple {6753#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6753#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:13,944 INFO L273 TraceCheckUtils]: 44: Hoare triple {6753#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6754#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:13,945 INFO L273 TraceCheckUtils]: 45: Hoare triple {6754#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6754#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:13,945 INFO L273 TraceCheckUtils]: 46: Hoare triple {6754#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6754#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:13,946 INFO L273 TraceCheckUtils]: 47: Hoare triple {6754#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6755#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:13,946 INFO L273 TraceCheckUtils]: 48: Hoare triple {6755#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6755#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:13,947 INFO L273 TraceCheckUtils]: 49: Hoare triple {6755#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6755#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:13,947 INFO L273 TraceCheckUtils]: 50: Hoare triple {6755#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6756#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:13,948 INFO L273 TraceCheckUtils]: 51: Hoare triple {6756#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6756#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:13,948 INFO L273 TraceCheckUtils]: 52: Hoare triple {6756#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6756#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:13,949 INFO L273 TraceCheckUtils]: 53: Hoare triple {6756#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {6757#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:13,950 INFO L273 TraceCheckUtils]: 54: Hoare triple {6757#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6757#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:13,950 INFO L273 TraceCheckUtils]: 55: Hoare triple {6757#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6757#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:13,951 INFO L273 TraceCheckUtils]: 56: Hoare triple {6757#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {6758#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:13,952 INFO L273 TraceCheckUtils]: 57: Hoare triple {6758#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6758#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:13,952 INFO L273 TraceCheckUtils]: 58: Hoare triple {6758#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6758#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:13,953 INFO L273 TraceCheckUtils]: 59: Hoare triple {6758#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {6759#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:13,953 INFO L273 TraceCheckUtils]: 60: Hoare triple {6759#(<= main_~i~0 18)} assume !(~i~0 < 100000); {6740#false} is VALID [2018-11-23 12:05:13,954 INFO L273 TraceCheckUtils]: 61: Hoare triple {6740#false} havoc ~x~0;~x~0 := 0; {6740#false} is VALID [2018-11-23 12:05:13,954 INFO L273 TraceCheckUtils]: 62: Hoare triple {6740#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6740#false} is VALID [2018-11-23 12:05:13,954 INFO L256 TraceCheckUtils]: 63: Hoare triple {6740#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {6740#false} is VALID [2018-11-23 12:05:13,954 INFO L273 TraceCheckUtils]: 64: Hoare triple {6740#false} ~cond := #in~cond; {6740#false} is VALID [2018-11-23 12:05:13,954 INFO L273 TraceCheckUtils]: 65: Hoare triple {6740#false} assume 0 == ~cond; {6740#false} is VALID [2018-11-23 12:05:13,954 INFO L273 TraceCheckUtils]: 66: Hoare triple {6740#false} assume !false; {6740#false} is VALID [2018-11-23 12:05:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:13,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:13,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:05:13,978 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-11-23 12:05:13,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:13,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:05:14,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:14,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:05:14,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:05:14,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:05:14,046 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 22 states. [2018-11-23 12:05:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:14,778 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2018-11-23 12:05:14,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:05:14,778 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-11-23 12:05:14,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:05:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2018-11-23 12:05:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:05:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2018-11-23 12:05:14,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 110 transitions. [2018-11-23 12:05:15,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:15,179 INFO L225 Difference]: With dead ends: 88 [2018-11-23 12:05:15,180 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:05:15,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:05:15,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:05:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:05:15,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:15,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 12:05:15,214 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 12:05:15,214 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 12:05:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:15,216 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2018-11-23 12:05:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-11-23 12:05:15,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:15,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:15,217 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 12:05:15,217 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 12:05:15,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:15,218 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2018-11-23 12:05:15,218 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-11-23 12:05:15,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:15,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:15,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:15,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:05:15,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2018-11-23 12:05:15,220 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 67 [2018-11-23 12:05:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:15,221 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2018-11-23 12:05:15,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:05:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2018-11-23 12:05:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:05:15,221 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:15,221 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:15,222 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:15,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:15,222 INFO L82 PathProgramCache]: Analyzing trace with hash -752267485, now seen corresponding path program 19 times [2018-11-23 12:05:15,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:15,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:15,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:15,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:15,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:15,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {7335#true} call ULTIMATE.init(); {7335#true} is VALID [2018-11-23 12:05:15,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {7335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7335#true} is VALID [2018-11-23 12:05:15,671 INFO L273 TraceCheckUtils]: 2: Hoare triple {7335#true} assume true; {7335#true} is VALID [2018-11-23 12:05:15,671 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7335#true} {7335#true} #55#return; {7335#true} is VALID [2018-11-23 12:05:15,671 INFO L256 TraceCheckUtils]: 4: Hoare triple {7335#true} call #t~ret4 := main(); {7335#true} is VALID [2018-11-23 12:05:15,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {7335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {7337#(= main_~i~0 0)} is VALID [2018-11-23 12:05:15,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {7337#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7337#(= main_~i~0 0)} is VALID [2018-11-23 12:05:15,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {7337#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7337#(= main_~i~0 0)} is VALID [2018-11-23 12:05:15,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {7337#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7338#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:15,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {7338#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7338#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:15,674 INFO L273 TraceCheckUtils]: 10: Hoare triple {7338#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7338#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:15,675 INFO L273 TraceCheckUtils]: 11: Hoare triple {7338#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7339#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:15,675 INFO L273 TraceCheckUtils]: 12: Hoare triple {7339#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7339#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:15,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {7339#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7339#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:15,676 INFO L273 TraceCheckUtils]: 14: Hoare triple {7339#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7340#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:15,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {7340#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7340#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:15,677 INFO L273 TraceCheckUtils]: 16: Hoare triple {7340#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7340#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:15,677 INFO L273 TraceCheckUtils]: 17: Hoare triple {7340#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7341#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:15,678 INFO L273 TraceCheckUtils]: 18: Hoare triple {7341#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7341#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:15,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {7341#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7341#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:15,679 INFO L273 TraceCheckUtils]: 20: Hoare triple {7341#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7342#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:15,680 INFO L273 TraceCheckUtils]: 21: Hoare triple {7342#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7342#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:15,680 INFO L273 TraceCheckUtils]: 22: Hoare triple {7342#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7342#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:15,681 INFO L273 TraceCheckUtils]: 23: Hoare triple {7342#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7343#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:15,681 INFO L273 TraceCheckUtils]: 24: Hoare triple {7343#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7343#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:15,682 INFO L273 TraceCheckUtils]: 25: Hoare triple {7343#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7343#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:15,683 INFO L273 TraceCheckUtils]: 26: Hoare triple {7343#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7344#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:15,683 INFO L273 TraceCheckUtils]: 27: Hoare triple {7344#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7344#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:15,684 INFO L273 TraceCheckUtils]: 28: Hoare triple {7344#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7344#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:15,684 INFO L273 TraceCheckUtils]: 29: Hoare triple {7344#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7345#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:15,685 INFO L273 TraceCheckUtils]: 30: Hoare triple {7345#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7345#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:15,685 INFO L273 TraceCheckUtils]: 31: Hoare triple {7345#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7345#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:15,686 INFO L273 TraceCheckUtils]: 32: Hoare triple {7345#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7346#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:15,687 INFO L273 TraceCheckUtils]: 33: Hoare triple {7346#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7346#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:15,687 INFO L273 TraceCheckUtils]: 34: Hoare triple {7346#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7346#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:15,688 INFO L273 TraceCheckUtils]: 35: Hoare triple {7346#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7347#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:15,689 INFO L273 TraceCheckUtils]: 36: Hoare triple {7347#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7347#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:15,689 INFO L273 TraceCheckUtils]: 37: Hoare triple {7347#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7347#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:15,690 INFO L273 TraceCheckUtils]: 38: Hoare triple {7347#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7348#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:15,690 INFO L273 TraceCheckUtils]: 39: Hoare triple {7348#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7348#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:15,691 INFO L273 TraceCheckUtils]: 40: Hoare triple {7348#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7348#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:15,692 INFO L273 TraceCheckUtils]: 41: Hoare triple {7348#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7349#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:15,692 INFO L273 TraceCheckUtils]: 42: Hoare triple {7349#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7349#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:15,693 INFO L273 TraceCheckUtils]: 43: Hoare triple {7349#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7349#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:15,693 INFO L273 TraceCheckUtils]: 44: Hoare triple {7349#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7350#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:15,694 INFO L273 TraceCheckUtils]: 45: Hoare triple {7350#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7350#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:15,694 INFO L273 TraceCheckUtils]: 46: Hoare triple {7350#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7350#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:15,695 INFO L273 TraceCheckUtils]: 47: Hoare triple {7350#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7351#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:15,696 INFO L273 TraceCheckUtils]: 48: Hoare triple {7351#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7351#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:15,696 INFO L273 TraceCheckUtils]: 49: Hoare triple {7351#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7351#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:15,697 INFO L273 TraceCheckUtils]: 50: Hoare triple {7351#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7352#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:15,697 INFO L273 TraceCheckUtils]: 51: Hoare triple {7352#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7352#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:15,698 INFO L273 TraceCheckUtils]: 52: Hoare triple {7352#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7352#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:15,699 INFO L273 TraceCheckUtils]: 53: Hoare triple {7352#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7353#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:15,699 INFO L273 TraceCheckUtils]: 54: Hoare triple {7353#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7353#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:15,700 INFO L273 TraceCheckUtils]: 55: Hoare triple {7353#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7353#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:15,700 INFO L273 TraceCheckUtils]: 56: Hoare triple {7353#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {7354#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:15,701 INFO L273 TraceCheckUtils]: 57: Hoare triple {7354#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7354#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:15,701 INFO L273 TraceCheckUtils]: 58: Hoare triple {7354#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7354#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:15,702 INFO L273 TraceCheckUtils]: 59: Hoare triple {7354#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {7355#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:15,703 INFO L273 TraceCheckUtils]: 60: Hoare triple {7355#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7355#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:15,703 INFO L273 TraceCheckUtils]: 61: Hoare triple {7355#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7355#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:15,704 INFO L273 TraceCheckUtils]: 62: Hoare triple {7355#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {7356#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:15,705 INFO L273 TraceCheckUtils]: 63: Hoare triple {7356#(<= main_~i~0 19)} assume !(~i~0 < 100000); {7336#false} is VALID [2018-11-23 12:05:15,705 INFO L273 TraceCheckUtils]: 64: Hoare triple {7336#false} havoc ~x~0;~x~0 := 0; {7336#false} is VALID [2018-11-23 12:05:15,705 INFO L273 TraceCheckUtils]: 65: Hoare triple {7336#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7336#false} is VALID [2018-11-23 12:05:15,705 INFO L256 TraceCheckUtils]: 66: Hoare triple {7336#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {7336#false} is VALID [2018-11-23 12:05:15,706 INFO L273 TraceCheckUtils]: 67: Hoare triple {7336#false} ~cond := #in~cond; {7336#false} is VALID [2018-11-23 12:05:15,706 INFO L273 TraceCheckUtils]: 68: Hoare triple {7336#false} assume 0 == ~cond; {7336#false} is VALID [2018-11-23 12:05:15,706 INFO L273 TraceCheckUtils]: 69: Hoare triple {7336#false} assume !false; {7336#false} is VALID [2018-11-23 12:05:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:15,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:15,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:15,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:15,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:16,092 INFO L256 TraceCheckUtils]: 0: Hoare triple {7335#true} call ULTIMATE.init(); {7335#true} is VALID [2018-11-23 12:05:16,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {7335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7335#true} is VALID [2018-11-23 12:05:16,093 INFO L273 TraceCheckUtils]: 2: Hoare triple {7335#true} assume true; {7335#true} is VALID [2018-11-23 12:05:16,093 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7335#true} {7335#true} #55#return; {7335#true} is VALID [2018-11-23 12:05:16,093 INFO L256 TraceCheckUtils]: 4: Hoare triple {7335#true} call #t~ret4 := main(); {7335#true} is VALID [2018-11-23 12:05:16,094 INFO L273 TraceCheckUtils]: 5: Hoare triple {7335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {7375#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:16,094 INFO L273 TraceCheckUtils]: 6: Hoare triple {7375#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7375#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:16,094 INFO L273 TraceCheckUtils]: 7: Hoare triple {7375#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7375#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:16,095 INFO L273 TraceCheckUtils]: 8: Hoare triple {7375#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7338#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:16,095 INFO L273 TraceCheckUtils]: 9: Hoare triple {7338#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7338#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:16,096 INFO L273 TraceCheckUtils]: 10: Hoare triple {7338#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7338#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:16,096 INFO L273 TraceCheckUtils]: 11: Hoare triple {7338#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7339#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:16,096 INFO L273 TraceCheckUtils]: 12: Hoare triple {7339#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7339#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:16,097 INFO L273 TraceCheckUtils]: 13: Hoare triple {7339#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7339#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:16,097 INFO L273 TraceCheckUtils]: 14: Hoare triple {7339#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7340#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:16,098 INFO L273 TraceCheckUtils]: 15: Hoare triple {7340#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7340#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:16,098 INFO L273 TraceCheckUtils]: 16: Hoare triple {7340#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7340#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:16,099 INFO L273 TraceCheckUtils]: 17: Hoare triple {7340#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7341#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:16,100 INFO L273 TraceCheckUtils]: 18: Hoare triple {7341#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7341#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:16,100 INFO L273 TraceCheckUtils]: 19: Hoare triple {7341#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7341#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:16,101 INFO L273 TraceCheckUtils]: 20: Hoare triple {7341#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7342#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:16,101 INFO L273 TraceCheckUtils]: 21: Hoare triple {7342#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7342#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:16,102 INFO L273 TraceCheckUtils]: 22: Hoare triple {7342#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7342#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:16,103 INFO L273 TraceCheckUtils]: 23: Hoare triple {7342#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7343#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:16,103 INFO L273 TraceCheckUtils]: 24: Hoare triple {7343#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7343#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:16,104 INFO L273 TraceCheckUtils]: 25: Hoare triple {7343#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7343#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:16,104 INFO L273 TraceCheckUtils]: 26: Hoare triple {7343#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7344#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:16,105 INFO L273 TraceCheckUtils]: 27: Hoare triple {7344#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7344#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:16,106 INFO L273 TraceCheckUtils]: 28: Hoare triple {7344#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7344#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:16,106 INFO L273 TraceCheckUtils]: 29: Hoare triple {7344#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7345#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:16,107 INFO L273 TraceCheckUtils]: 30: Hoare triple {7345#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7345#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:16,107 INFO L273 TraceCheckUtils]: 31: Hoare triple {7345#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7345#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:16,108 INFO L273 TraceCheckUtils]: 32: Hoare triple {7345#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7346#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:16,109 INFO L273 TraceCheckUtils]: 33: Hoare triple {7346#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7346#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:16,109 INFO L273 TraceCheckUtils]: 34: Hoare triple {7346#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7346#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:16,110 INFO L273 TraceCheckUtils]: 35: Hoare triple {7346#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7347#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:16,110 INFO L273 TraceCheckUtils]: 36: Hoare triple {7347#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7347#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:16,111 INFO L273 TraceCheckUtils]: 37: Hoare triple {7347#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7347#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:16,112 INFO L273 TraceCheckUtils]: 38: Hoare triple {7347#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7348#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:16,112 INFO L273 TraceCheckUtils]: 39: Hoare triple {7348#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7348#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:16,113 INFO L273 TraceCheckUtils]: 40: Hoare triple {7348#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7348#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:16,113 INFO L273 TraceCheckUtils]: 41: Hoare triple {7348#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7349#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:16,114 INFO L273 TraceCheckUtils]: 42: Hoare triple {7349#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7349#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:16,114 INFO L273 TraceCheckUtils]: 43: Hoare triple {7349#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7349#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:16,115 INFO L273 TraceCheckUtils]: 44: Hoare triple {7349#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7350#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:16,116 INFO L273 TraceCheckUtils]: 45: Hoare triple {7350#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7350#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:16,116 INFO L273 TraceCheckUtils]: 46: Hoare triple {7350#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7350#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:16,117 INFO L273 TraceCheckUtils]: 47: Hoare triple {7350#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7351#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:16,117 INFO L273 TraceCheckUtils]: 48: Hoare triple {7351#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7351#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:16,118 INFO L273 TraceCheckUtils]: 49: Hoare triple {7351#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7351#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:16,119 INFO L273 TraceCheckUtils]: 50: Hoare triple {7351#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7352#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:16,119 INFO L273 TraceCheckUtils]: 51: Hoare triple {7352#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7352#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:16,120 INFO L273 TraceCheckUtils]: 52: Hoare triple {7352#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7352#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:16,121 INFO L273 TraceCheckUtils]: 53: Hoare triple {7352#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7353#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:16,121 INFO L273 TraceCheckUtils]: 54: Hoare triple {7353#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7353#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:16,122 INFO L273 TraceCheckUtils]: 55: Hoare triple {7353#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7353#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:16,122 INFO L273 TraceCheckUtils]: 56: Hoare triple {7353#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {7354#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:16,123 INFO L273 TraceCheckUtils]: 57: Hoare triple {7354#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7354#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:16,123 INFO L273 TraceCheckUtils]: 58: Hoare triple {7354#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7354#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:16,124 INFO L273 TraceCheckUtils]: 59: Hoare triple {7354#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {7355#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:16,125 INFO L273 TraceCheckUtils]: 60: Hoare triple {7355#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7355#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:16,125 INFO L273 TraceCheckUtils]: 61: Hoare triple {7355#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7355#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:16,126 INFO L273 TraceCheckUtils]: 62: Hoare triple {7355#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {7356#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:16,127 INFO L273 TraceCheckUtils]: 63: Hoare triple {7356#(<= main_~i~0 19)} assume !(~i~0 < 100000); {7336#false} is VALID [2018-11-23 12:05:16,127 INFO L273 TraceCheckUtils]: 64: Hoare triple {7336#false} havoc ~x~0;~x~0 := 0; {7336#false} is VALID [2018-11-23 12:05:16,127 INFO L273 TraceCheckUtils]: 65: Hoare triple {7336#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7336#false} is VALID [2018-11-23 12:05:16,127 INFO L256 TraceCheckUtils]: 66: Hoare triple {7336#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {7336#false} is VALID [2018-11-23 12:05:16,128 INFO L273 TraceCheckUtils]: 67: Hoare triple {7336#false} ~cond := #in~cond; {7336#false} is VALID [2018-11-23 12:05:16,128 INFO L273 TraceCheckUtils]: 68: Hoare triple {7336#false} assume 0 == ~cond; {7336#false} is VALID [2018-11-23 12:05:16,128 INFO L273 TraceCheckUtils]: 69: Hoare triple {7336#false} assume !false; {7336#false} is VALID [2018-11-23 12:05:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:16,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:16,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:05:16,151 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-11-23 12:05:16,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:16,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:05:16,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:16,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:05:16,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:05:16,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:05:16,225 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand 23 states. [2018-11-23 12:05:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:16,877 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2018-11-23 12:05:16,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:05:16,877 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-11-23 12:05:16,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:05:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 114 transitions. [2018-11-23 12:05:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:05:16,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 114 transitions. [2018-11-23 12:05:16,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 114 transitions. [2018-11-23 12:05:17,021 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 12:05:17,022 INFO L225 Difference]: With dead ends: 91 [2018-11-23 12:05:17,023 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 12:05:17,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:05:17,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 12:05:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-23 12:05:17,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:17,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 78 states. [2018-11-23 12:05:17,043 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 78 states. [2018-11-23 12:05:17,043 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 78 states. [2018-11-23 12:05:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:17,045 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-23 12:05:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2018-11-23 12:05:17,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:17,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:17,046 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 80 states. [2018-11-23 12:05:17,046 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 80 states. [2018-11-23 12:05:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:17,048 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-23 12:05:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2018-11-23 12:05:17,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:17,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:17,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:17,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 12:05:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2018-11-23 12:05:17,050 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 70 [2018-11-23 12:05:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:17,050 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2018-11-23 12:05:17,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:05:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2018-11-23 12:05:17,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:05:17,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:17,051 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:17,052 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:17,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:17,052 INFO L82 PathProgramCache]: Analyzing trace with hash -615929287, now seen corresponding path program 20 times [2018-11-23 12:05:17,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:17,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:17,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:17,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:17,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:17,576 INFO L256 TraceCheckUtils]: 0: Hoare triple {7955#true} call ULTIMATE.init(); {7955#true} is VALID [2018-11-23 12:05:17,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {7955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7955#true} is VALID [2018-11-23 12:05:17,577 INFO L273 TraceCheckUtils]: 2: Hoare triple {7955#true} assume true; {7955#true} is VALID [2018-11-23 12:05:17,577 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7955#true} {7955#true} #55#return; {7955#true} is VALID [2018-11-23 12:05:17,577 INFO L256 TraceCheckUtils]: 4: Hoare triple {7955#true} call #t~ret4 := main(); {7955#true} is VALID [2018-11-23 12:05:17,578 INFO L273 TraceCheckUtils]: 5: Hoare triple {7955#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {7957#(= main_~i~0 0)} is VALID [2018-11-23 12:05:17,579 INFO L273 TraceCheckUtils]: 6: Hoare triple {7957#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7957#(= main_~i~0 0)} is VALID [2018-11-23 12:05:17,579 INFO L273 TraceCheckUtils]: 7: Hoare triple {7957#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7957#(= main_~i~0 0)} is VALID [2018-11-23 12:05:17,590 INFO L273 TraceCheckUtils]: 8: Hoare triple {7957#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7958#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,590 INFO L273 TraceCheckUtils]: 9: Hoare triple {7958#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7958#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {7958#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7958#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {7958#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7959#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {7959#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7959#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,592 INFO L273 TraceCheckUtils]: 13: Hoare triple {7959#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7959#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,592 INFO L273 TraceCheckUtils]: 14: Hoare triple {7959#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7960#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,593 INFO L273 TraceCheckUtils]: 15: Hoare triple {7960#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7960#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,593 INFO L273 TraceCheckUtils]: 16: Hoare triple {7960#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7960#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,594 INFO L273 TraceCheckUtils]: 17: Hoare triple {7960#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7961#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,595 INFO L273 TraceCheckUtils]: 18: Hoare triple {7961#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7961#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,595 INFO L273 TraceCheckUtils]: 19: Hoare triple {7961#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7961#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,596 INFO L273 TraceCheckUtils]: 20: Hoare triple {7961#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7962#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:17,596 INFO L273 TraceCheckUtils]: 21: Hoare triple {7962#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7962#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:17,597 INFO L273 TraceCheckUtils]: 22: Hoare triple {7962#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7962#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:17,598 INFO L273 TraceCheckUtils]: 23: Hoare triple {7962#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7963#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:17,598 INFO L273 TraceCheckUtils]: 24: Hoare triple {7963#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7963#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:17,599 INFO L273 TraceCheckUtils]: 25: Hoare triple {7963#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7963#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:17,599 INFO L273 TraceCheckUtils]: 26: Hoare triple {7963#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7964#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:17,600 INFO L273 TraceCheckUtils]: 27: Hoare triple {7964#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7964#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:17,601 INFO L273 TraceCheckUtils]: 28: Hoare triple {7964#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7964#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:17,601 INFO L273 TraceCheckUtils]: 29: Hoare triple {7964#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7965#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:17,602 INFO L273 TraceCheckUtils]: 30: Hoare triple {7965#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7965#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:17,602 INFO L273 TraceCheckUtils]: 31: Hoare triple {7965#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7965#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:17,603 INFO L273 TraceCheckUtils]: 32: Hoare triple {7965#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7966#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:17,604 INFO L273 TraceCheckUtils]: 33: Hoare triple {7966#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7966#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:17,604 INFO L273 TraceCheckUtils]: 34: Hoare triple {7966#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7966#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:17,605 INFO L273 TraceCheckUtils]: 35: Hoare triple {7966#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7967#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:17,605 INFO L273 TraceCheckUtils]: 36: Hoare triple {7967#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7967#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:17,606 INFO L273 TraceCheckUtils]: 37: Hoare triple {7967#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7967#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:17,607 INFO L273 TraceCheckUtils]: 38: Hoare triple {7967#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7968#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:17,607 INFO L273 TraceCheckUtils]: 39: Hoare triple {7968#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7968#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:17,608 INFO L273 TraceCheckUtils]: 40: Hoare triple {7968#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7968#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:17,608 INFO L273 TraceCheckUtils]: 41: Hoare triple {7968#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7969#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:17,609 INFO L273 TraceCheckUtils]: 42: Hoare triple {7969#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7969#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:17,610 INFO L273 TraceCheckUtils]: 43: Hoare triple {7969#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7969#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:17,610 INFO L273 TraceCheckUtils]: 44: Hoare triple {7969#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7970#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:17,611 INFO L273 TraceCheckUtils]: 45: Hoare triple {7970#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7970#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:17,611 INFO L273 TraceCheckUtils]: 46: Hoare triple {7970#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7970#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:17,612 INFO L273 TraceCheckUtils]: 47: Hoare triple {7970#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7971#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:17,613 INFO L273 TraceCheckUtils]: 48: Hoare triple {7971#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7971#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:17,613 INFO L273 TraceCheckUtils]: 49: Hoare triple {7971#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7971#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:17,614 INFO L273 TraceCheckUtils]: 50: Hoare triple {7971#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7972#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:17,614 INFO L273 TraceCheckUtils]: 51: Hoare triple {7972#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7972#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:17,615 INFO L273 TraceCheckUtils]: 52: Hoare triple {7972#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7972#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:17,616 INFO L273 TraceCheckUtils]: 53: Hoare triple {7972#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7973#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:17,616 INFO L273 TraceCheckUtils]: 54: Hoare triple {7973#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7973#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:17,617 INFO L273 TraceCheckUtils]: 55: Hoare triple {7973#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7973#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:17,617 INFO L273 TraceCheckUtils]: 56: Hoare triple {7973#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {7974#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:17,618 INFO L273 TraceCheckUtils]: 57: Hoare triple {7974#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7974#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:17,619 INFO L273 TraceCheckUtils]: 58: Hoare triple {7974#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7974#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:17,619 INFO L273 TraceCheckUtils]: 59: Hoare triple {7974#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {7975#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:17,620 INFO L273 TraceCheckUtils]: 60: Hoare triple {7975#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7975#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:17,620 INFO L273 TraceCheckUtils]: 61: Hoare triple {7975#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7975#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:17,621 INFO L273 TraceCheckUtils]: 62: Hoare triple {7975#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {7976#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:17,622 INFO L273 TraceCheckUtils]: 63: Hoare triple {7976#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7976#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:17,622 INFO L273 TraceCheckUtils]: 64: Hoare triple {7976#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7976#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:17,623 INFO L273 TraceCheckUtils]: 65: Hoare triple {7976#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {7977#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:17,624 INFO L273 TraceCheckUtils]: 66: Hoare triple {7977#(<= main_~i~0 20)} assume !(~i~0 < 100000); {7956#false} is VALID [2018-11-23 12:05:17,624 INFO L273 TraceCheckUtils]: 67: Hoare triple {7956#false} havoc ~x~0;~x~0 := 0; {7956#false} is VALID [2018-11-23 12:05:17,624 INFO L273 TraceCheckUtils]: 68: Hoare triple {7956#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7956#false} is VALID [2018-11-23 12:05:17,624 INFO L256 TraceCheckUtils]: 69: Hoare triple {7956#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {7956#false} is VALID [2018-11-23 12:05:17,624 INFO L273 TraceCheckUtils]: 70: Hoare triple {7956#false} ~cond := #in~cond; {7956#false} is VALID [2018-11-23 12:05:17,625 INFO L273 TraceCheckUtils]: 71: Hoare triple {7956#false} assume 0 == ~cond; {7956#false} is VALID [2018-11-23 12:05:17,625 INFO L273 TraceCheckUtils]: 72: Hoare triple {7956#false} assume !false; {7956#false} is VALID [2018-11-23 12:05:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:17,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:17,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:17,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:17,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:17,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:17,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:17,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {7955#true} call ULTIMATE.init(); {7955#true} is VALID [2018-11-23 12:05:17,863 INFO L273 TraceCheckUtils]: 1: Hoare triple {7955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7955#true} is VALID [2018-11-23 12:05:17,863 INFO L273 TraceCheckUtils]: 2: Hoare triple {7955#true} assume true; {7955#true} is VALID [2018-11-23 12:05:17,864 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7955#true} {7955#true} #55#return; {7955#true} is VALID [2018-11-23 12:05:17,864 INFO L256 TraceCheckUtils]: 4: Hoare triple {7955#true} call #t~ret4 := main(); {7955#true} is VALID [2018-11-23 12:05:17,864 INFO L273 TraceCheckUtils]: 5: Hoare triple {7955#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {7996#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:17,865 INFO L273 TraceCheckUtils]: 6: Hoare triple {7996#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7996#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:17,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {7996#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7996#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:17,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {7996#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7958#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,866 INFO L273 TraceCheckUtils]: 9: Hoare triple {7958#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7958#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,866 INFO L273 TraceCheckUtils]: 10: Hoare triple {7958#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7958#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:17,867 INFO L273 TraceCheckUtils]: 11: Hoare triple {7958#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7959#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,867 INFO L273 TraceCheckUtils]: 12: Hoare triple {7959#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7959#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,867 INFO L273 TraceCheckUtils]: 13: Hoare triple {7959#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7959#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:17,868 INFO L273 TraceCheckUtils]: 14: Hoare triple {7959#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7960#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,869 INFO L273 TraceCheckUtils]: 15: Hoare triple {7960#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7960#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,869 INFO L273 TraceCheckUtils]: 16: Hoare triple {7960#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7960#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:17,870 INFO L273 TraceCheckUtils]: 17: Hoare triple {7960#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7961#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,870 INFO L273 TraceCheckUtils]: 18: Hoare triple {7961#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7961#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,871 INFO L273 TraceCheckUtils]: 19: Hoare triple {7961#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7961#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:17,872 INFO L273 TraceCheckUtils]: 20: Hoare triple {7961#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7962#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:17,872 INFO L273 TraceCheckUtils]: 21: Hoare triple {7962#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7962#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:17,873 INFO L273 TraceCheckUtils]: 22: Hoare triple {7962#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7962#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:17,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {7962#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7963#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:17,874 INFO L273 TraceCheckUtils]: 24: Hoare triple {7963#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7963#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:17,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {7963#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7963#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:17,875 INFO L273 TraceCheckUtils]: 26: Hoare triple {7963#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7964#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:17,876 INFO L273 TraceCheckUtils]: 27: Hoare triple {7964#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7964#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:17,876 INFO L273 TraceCheckUtils]: 28: Hoare triple {7964#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7964#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:17,877 INFO L273 TraceCheckUtils]: 29: Hoare triple {7964#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7965#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:17,878 INFO L273 TraceCheckUtils]: 30: Hoare triple {7965#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7965#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:17,878 INFO L273 TraceCheckUtils]: 31: Hoare triple {7965#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7965#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:17,879 INFO L273 TraceCheckUtils]: 32: Hoare triple {7965#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7966#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:17,879 INFO L273 TraceCheckUtils]: 33: Hoare triple {7966#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7966#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:17,880 INFO L273 TraceCheckUtils]: 34: Hoare triple {7966#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7966#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:17,881 INFO L273 TraceCheckUtils]: 35: Hoare triple {7966#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7967#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:17,881 INFO L273 TraceCheckUtils]: 36: Hoare triple {7967#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7967#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:17,882 INFO L273 TraceCheckUtils]: 37: Hoare triple {7967#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7967#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:17,883 INFO L273 TraceCheckUtils]: 38: Hoare triple {7967#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7968#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:17,883 INFO L273 TraceCheckUtils]: 39: Hoare triple {7968#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7968#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:17,884 INFO L273 TraceCheckUtils]: 40: Hoare triple {7968#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7968#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:17,884 INFO L273 TraceCheckUtils]: 41: Hoare triple {7968#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7969#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:17,885 INFO L273 TraceCheckUtils]: 42: Hoare triple {7969#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7969#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:17,888 INFO L273 TraceCheckUtils]: 43: Hoare triple {7969#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7969#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:17,888 INFO L273 TraceCheckUtils]: 44: Hoare triple {7969#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7970#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:17,889 INFO L273 TraceCheckUtils]: 45: Hoare triple {7970#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7970#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:17,889 INFO L273 TraceCheckUtils]: 46: Hoare triple {7970#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7970#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:17,889 INFO L273 TraceCheckUtils]: 47: Hoare triple {7970#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7971#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:17,890 INFO L273 TraceCheckUtils]: 48: Hoare triple {7971#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7971#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:17,890 INFO L273 TraceCheckUtils]: 49: Hoare triple {7971#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7971#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:17,890 INFO L273 TraceCheckUtils]: 50: Hoare triple {7971#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7972#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:17,891 INFO L273 TraceCheckUtils]: 51: Hoare triple {7972#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7972#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:17,891 INFO L273 TraceCheckUtils]: 52: Hoare triple {7972#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7972#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:17,891 INFO L273 TraceCheckUtils]: 53: Hoare triple {7972#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7973#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:17,892 INFO L273 TraceCheckUtils]: 54: Hoare triple {7973#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7973#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:17,892 INFO L273 TraceCheckUtils]: 55: Hoare triple {7973#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7973#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:17,893 INFO L273 TraceCheckUtils]: 56: Hoare triple {7973#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {7974#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:17,893 INFO L273 TraceCheckUtils]: 57: Hoare triple {7974#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7974#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:17,894 INFO L273 TraceCheckUtils]: 58: Hoare triple {7974#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7974#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:17,895 INFO L273 TraceCheckUtils]: 59: Hoare triple {7974#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {7975#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:17,895 INFO L273 TraceCheckUtils]: 60: Hoare triple {7975#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7975#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:17,896 INFO L273 TraceCheckUtils]: 61: Hoare triple {7975#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7975#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:17,896 INFO L273 TraceCheckUtils]: 62: Hoare triple {7975#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {7976#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:17,897 INFO L273 TraceCheckUtils]: 63: Hoare triple {7976#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7976#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:17,897 INFO L273 TraceCheckUtils]: 64: Hoare triple {7976#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {7976#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:17,898 INFO L273 TraceCheckUtils]: 65: Hoare triple {7976#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {7977#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:17,899 INFO L273 TraceCheckUtils]: 66: Hoare triple {7977#(<= main_~i~0 20)} assume !(~i~0 < 100000); {7956#false} is VALID [2018-11-23 12:05:17,899 INFO L273 TraceCheckUtils]: 67: Hoare triple {7956#false} havoc ~x~0;~x~0 := 0; {7956#false} is VALID [2018-11-23 12:05:17,899 INFO L273 TraceCheckUtils]: 68: Hoare triple {7956#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7956#false} is VALID [2018-11-23 12:05:17,899 INFO L256 TraceCheckUtils]: 69: Hoare triple {7956#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {7956#false} is VALID [2018-11-23 12:05:17,900 INFO L273 TraceCheckUtils]: 70: Hoare triple {7956#false} ~cond := #in~cond; {7956#false} is VALID [2018-11-23 12:05:17,900 INFO L273 TraceCheckUtils]: 71: Hoare triple {7956#false} assume 0 == ~cond; {7956#false} is VALID [2018-11-23 12:05:17,900 INFO L273 TraceCheckUtils]: 72: Hoare triple {7956#false} assume !false; {7956#false} is VALID [2018-11-23 12:05:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:17,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:17,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:05:17,924 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-11-23 12:05:17,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:17,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:05:17,998 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 12:05:17,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:05:17,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:05:17,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:05:18,000 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand 24 states. [2018-11-23 12:05:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:18,385 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2018-11-23 12:05:18,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:05:18,385 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-11-23 12:05:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:05:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2018-11-23 12:05:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:05:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2018-11-23 12:05:18,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 118 transitions. [2018-11-23 12:05:18,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:18,500 INFO L225 Difference]: With dead ends: 94 [2018-11-23 12:05:18,500 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:05:18,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:05:18,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:05:18,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 12:05:18,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:18,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 12:05:18,544 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 12:05:18,544 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 12:05:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:18,546 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2018-11-23 12:05:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2018-11-23 12:05:18,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:18,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:18,546 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 12:05:18,546 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 12:05:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:18,547 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2018-11-23 12:05:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2018-11-23 12:05:18,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:18,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:18,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:18,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:05:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2018-11-23 12:05:18,549 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 73 [2018-11-23 12:05:18,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:18,550 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2018-11-23 12:05:18,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:05:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2018-11-23 12:05:18,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:05:18,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:18,551 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:18,551 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:18,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:18,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2003734685, now seen corresponding path program 21 times [2018-11-23 12:05:18,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:18,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:18,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:18,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:18,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:18,911 INFO L256 TraceCheckUtils]: 0: Hoare triple {8599#true} call ULTIMATE.init(); {8599#true} is VALID [2018-11-23 12:05:18,912 INFO L273 TraceCheckUtils]: 1: Hoare triple {8599#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8599#true} is VALID [2018-11-23 12:05:18,912 INFO L273 TraceCheckUtils]: 2: Hoare triple {8599#true} assume true; {8599#true} is VALID [2018-11-23 12:05:18,912 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8599#true} {8599#true} #55#return; {8599#true} is VALID [2018-11-23 12:05:18,912 INFO L256 TraceCheckUtils]: 4: Hoare triple {8599#true} call #t~ret4 := main(); {8599#true} is VALID [2018-11-23 12:05:18,913 INFO L273 TraceCheckUtils]: 5: Hoare triple {8599#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {8601#(= main_~i~0 0)} is VALID [2018-11-23 12:05:18,913 INFO L273 TraceCheckUtils]: 6: Hoare triple {8601#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8601#(= main_~i~0 0)} is VALID [2018-11-23 12:05:18,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {8601#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8601#(= main_~i~0 0)} is VALID [2018-11-23 12:05:18,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {8601#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {8602#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:18,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {8602#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8602#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:18,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {8602#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8602#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:18,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {8602#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8603#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:18,915 INFO L273 TraceCheckUtils]: 12: Hoare triple {8603#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8603#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:18,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {8603#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8603#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:18,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {8603#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8604#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:18,916 INFO L273 TraceCheckUtils]: 15: Hoare triple {8604#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8604#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:18,917 INFO L273 TraceCheckUtils]: 16: Hoare triple {8604#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8604#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:18,918 INFO L273 TraceCheckUtils]: 17: Hoare triple {8604#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8605#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:18,918 INFO L273 TraceCheckUtils]: 18: Hoare triple {8605#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8605#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:18,919 INFO L273 TraceCheckUtils]: 19: Hoare triple {8605#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8605#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:18,919 INFO L273 TraceCheckUtils]: 20: Hoare triple {8605#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8606#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:18,920 INFO L273 TraceCheckUtils]: 21: Hoare triple {8606#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8606#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:18,920 INFO L273 TraceCheckUtils]: 22: Hoare triple {8606#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8606#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:18,921 INFO L273 TraceCheckUtils]: 23: Hoare triple {8606#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8607#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:18,922 INFO L273 TraceCheckUtils]: 24: Hoare triple {8607#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8607#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:18,922 INFO L273 TraceCheckUtils]: 25: Hoare triple {8607#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8607#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:18,923 INFO L273 TraceCheckUtils]: 26: Hoare triple {8607#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8608#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:18,924 INFO L273 TraceCheckUtils]: 27: Hoare triple {8608#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8608#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:18,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {8608#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8608#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:18,925 INFO L273 TraceCheckUtils]: 29: Hoare triple {8608#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8609#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:18,925 INFO L273 TraceCheckUtils]: 30: Hoare triple {8609#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8609#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:18,926 INFO L273 TraceCheckUtils]: 31: Hoare triple {8609#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8609#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:18,927 INFO L273 TraceCheckUtils]: 32: Hoare triple {8609#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8610#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:18,927 INFO L273 TraceCheckUtils]: 33: Hoare triple {8610#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8610#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:18,928 INFO L273 TraceCheckUtils]: 34: Hoare triple {8610#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8610#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:18,928 INFO L273 TraceCheckUtils]: 35: Hoare triple {8610#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8611#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:18,929 INFO L273 TraceCheckUtils]: 36: Hoare triple {8611#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8611#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:18,929 INFO L273 TraceCheckUtils]: 37: Hoare triple {8611#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8611#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:18,930 INFO L273 TraceCheckUtils]: 38: Hoare triple {8611#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8612#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:18,931 INFO L273 TraceCheckUtils]: 39: Hoare triple {8612#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8612#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:18,931 INFO L273 TraceCheckUtils]: 40: Hoare triple {8612#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8612#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:18,932 INFO L273 TraceCheckUtils]: 41: Hoare triple {8612#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8613#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:18,933 INFO L273 TraceCheckUtils]: 42: Hoare triple {8613#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8613#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:18,933 INFO L273 TraceCheckUtils]: 43: Hoare triple {8613#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8613#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:18,934 INFO L273 TraceCheckUtils]: 44: Hoare triple {8613#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {8614#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:18,934 INFO L273 TraceCheckUtils]: 45: Hoare triple {8614#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8614#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:18,935 INFO L273 TraceCheckUtils]: 46: Hoare triple {8614#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8614#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:18,936 INFO L273 TraceCheckUtils]: 47: Hoare triple {8614#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {8615#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:18,936 INFO L273 TraceCheckUtils]: 48: Hoare triple {8615#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8615#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:18,937 INFO L273 TraceCheckUtils]: 49: Hoare triple {8615#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8615#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:18,937 INFO L273 TraceCheckUtils]: 50: Hoare triple {8615#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {8616#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:18,938 INFO L273 TraceCheckUtils]: 51: Hoare triple {8616#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8616#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:18,938 INFO L273 TraceCheckUtils]: 52: Hoare triple {8616#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8616#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:18,939 INFO L273 TraceCheckUtils]: 53: Hoare triple {8616#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {8617#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:18,940 INFO L273 TraceCheckUtils]: 54: Hoare triple {8617#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8617#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:18,940 INFO L273 TraceCheckUtils]: 55: Hoare triple {8617#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8617#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:18,941 INFO L273 TraceCheckUtils]: 56: Hoare triple {8617#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {8618#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:18,942 INFO L273 TraceCheckUtils]: 57: Hoare triple {8618#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8618#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:18,942 INFO L273 TraceCheckUtils]: 58: Hoare triple {8618#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8618#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:18,943 INFO L273 TraceCheckUtils]: 59: Hoare triple {8618#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {8619#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:18,943 INFO L273 TraceCheckUtils]: 60: Hoare triple {8619#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8619#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:18,944 INFO L273 TraceCheckUtils]: 61: Hoare triple {8619#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8619#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:18,945 INFO L273 TraceCheckUtils]: 62: Hoare triple {8619#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {8620#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:18,945 INFO L273 TraceCheckUtils]: 63: Hoare triple {8620#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8620#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:18,946 INFO L273 TraceCheckUtils]: 64: Hoare triple {8620#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8620#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:18,946 INFO L273 TraceCheckUtils]: 65: Hoare triple {8620#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {8621#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:18,947 INFO L273 TraceCheckUtils]: 66: Hoare triple {8621#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8621#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:18,947 INFO L273 TraceCheckUtils]: 67: Hoare triple {8621#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8621#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:18,948 INFO L273 TraceCheckUtils]: 68: Hoare triple {8621#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {8622#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:18,949 INFO L273 TraceCheckUtils]: 69: Hoare triple {8622#(<= main_~i~0 21)} assume !(~i~0 < 100000); {8600#false} is VALID [2018-11-23 12:05:18,949 INFO L273 TraceCheckUtils]: 70: Hoare triple {8600#false} havoc ~x~0;~x~0 := 0; {8600#false} is VALID [2018-11-23 12:05:18,949 INFO L273 TraceCheckUtils]: 71: Hoare triple {8600#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8600#false} is VALID [2018-11-23 12:05:18,950 INFO L256 TraceCheckUtils]: 72: Hoare triple {8600#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {8600#false} is VALID [2018-11-23 12:05:18,950 INFO L273 TraceCheckUtils]: 73: Hoare triple {8600#false} ~cond := #in~cond; {8600#false} is VALID [2018-11-23 12:05:18,950 INFO L273 TraceCheckUtils]: 74: Hoare triple {8600#false} assume 0 == ~cond; {8600#false} is VALID [2018-11-23 12:05:18,950 INFO L273 TraceCheckUtils]: 75: Hoare triple {8600#false} assume !false; {8600#false} is VALID [2018-11-23 12:05:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:18,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:18,955 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:18,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:19,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 12:05:19,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:19,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:19,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {8599#true} call ULTIMATE.init(); {8599#true} is VALID [2018-11-23 12:05:19,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {8599#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8599#true} is VALID [2018-11-23 12:05:19,296 INFO L273 TraceCheckUtils]: 2: Hoare triple {8599#true} assume true; {8599#true} is VALID [2018-11-23 12:05:19,296 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8599#true} {8599#true} #55#return; {8599#true} is VALID [2018-11-23 12:05:19,297 INFO L256 TraceCheckUtils]: 4: Hoare triple {8599#true} call #t~ret4 := main(); {8599#true} is VALID [2018-11-23 12:05:19,297 INFO L273 TraceCheckUtils]: 5: Hoare triple {8599#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {8641#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:19,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {8641#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8641#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:19,298 INFO L273 TraceCheckUtils]: 7: Hoare triple {8641#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8641#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:19,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {8641#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {8602#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:19,299 INFO L273 TraceCheckUtils]: 9: Hoare triple {8602#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8602#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:19,299 INFO L273 TraceCheckUtils]: 10: Hoare triple {8602#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8602#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:19,300 INFO L273 TraceCheckUtils]: 11: Hoare triple {8602#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8603#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:19,300 INFO L273 TraceCheckUtils]: 12: Hoare triple {8603#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8603#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:19,301 INFO L273 TraceCheckUtils]: 13: Hoare triple {8603#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8603#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:19,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {8603#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8604#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:19,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {8604#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8604#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:19,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {8604#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8604#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:19,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {8604#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8605#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:19,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {8605#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8605#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:19,304 INFO L273 TraceCheckUtils]: 19: Hoare triple {8605#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8605#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:19,305 INFO L273 TraceCheckUtils]: 20: Hoare triple {8605#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8606#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:19,306 INFO L273 TraceCheckUtils]: 21: Hoare triple {8606#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8606#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:19,306 INFO L273 TraceCheckUtils]: 22: Hoare triple {8606#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8606#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:19,307 INFO L273 TraceCheckUtils]: 23: Hoare triple {8606#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8607#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:19,307 INFO L273 TraceCheckUtils]: 24: Hoare triple {8607#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8607#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:19,308 INFO L273 TraceCheckUtils]: 25: Hoare triple {8607#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8607#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:19,309 INFO L273 TraceCheckUtils]: 26: Hoare triple {8607#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8608#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:19,309 INFO L273 TraceCheckUtils]: 27: Hoare triple {8608#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8608#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:19,310 INFO L273 TraceCheckUtils]: 28: Hoare triple {8608#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8608#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:19,310 INFO L273 TraceCheckUtils]: 29: Hoare triple {8608#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8609#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:19,311 INFO L273 TraceCheckUtils]: 30: Hoare triple {8609#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8609#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:19,311 INFO L273 TraceCheckUtils]: 31: Hoare triple {8609#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8609#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:19,312 INFO L273 TraceCheckUtils]: 32: Hoare triple {8609#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8610#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:19,313 INFO L273 TraceCheckUtils]: 33: Hoare triple {8610#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8610#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:19,313 INFO L273 TraceCheckUtils]: 34: Hoare triple {8610#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8610#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:19,314 INFO L273 TraceCheckUtils]: 35: Hoare triple {8610#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8611#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:19,314 INFO L273 TraceCheckUtils]: 36: Hoare triple {8611#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8611#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:19,315 INFO L273 TraceCheckUtils]: 37: Hoare triple {8611#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8611#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:19,316 INFO L273 TraceCheckUtils]: 38: Hoare triple {8611#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8612#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:19,316 INFO L273 TraceCheckUtils]: 39: Hoare triple {8612#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8612#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:19,317 INFO L273 TraceCheckUtils]: 40: Hoare triple {8612#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8612#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:19,318 INFO L273 TraceCheckUtils]: 41: Hoare triple {8612#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8613#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:19,318 INFO L273 TraceCheckUtils]: 42: Hoare triple {8613#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8613#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:19,319 INFO L273 TraceCheckUtils]: 43: Hoare triple {8613#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8613#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:19,319 INFO L273 TraceCheckUtils]: 44: Hoare triple {8613#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {8614#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:19,320 INFO L273 TraceCheckUtils]: 45: Hoare triple {8614#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8614#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:19,320 INFO L273 TraceCheckUtils]: 46: Hoare triple {8614#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8614#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:19,321 INFO L273 TraceCheckUtils]: 47: Hoare triple {8614#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {8615#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:19,322 INFO L273 TraceCheckUtils]: 48: Hoare triple {8615#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8615#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:19,322 INFO L273 TraceCheckUtils]: 49: Hoare triple {8615#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8615#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:19,323 INFO L273 TraceCheckUtils]: 50: Hoare triple {8615#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {8616#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:19,323 INFO L273 TraceCheckUtils]: 51: Hoare triple {8616#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8616#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:19,324 INFO L273 TraceCheckUtils]: 52: Hoare triple {8616#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8616#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:19,325 INFO L273 TraceCheckUtils]: 53: Hoare triple {8616#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {8617#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:19,325 INFO L273 TraceCheckUtils]: 54: Hoare triple {8617#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8617#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:19,326 INFO L273 TraceCheckUtils]: 55: Hoare triple {8617#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8617#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:19,327 INFO L273 TraceCheckUtils]: 56: Hoare triple {8617#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {8618#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:19,327 INFO L273 TraceCheckUtils]: 57: Hoare triple {8618#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8618#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:19,328 INFO L273 TraceCheckUtils]: 58: Hoare triple {8618#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8618#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:19,328 INFO L273 TraceCheckUtils]: 59: Hoare triple {8618#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {8619#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:19,329 INFO L273 TraceCheckUtils]: 60: Hoare triple {8619#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8619#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:19,329 INFO L273 TraceCheckUtils]: 61: Hoare triple {8619#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8619#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:19,330 INFO L273 TraceCheckUtils]: 62: Hoare triple {8619#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {8620#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:19,331 INFO L273 TraceCheckUtils]: 63: Hoare triple {8620#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8620#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:19,331 INFO L273 TraceCheckUtils]: 64: Hoare triple {8620#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8620#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:19,332 INFO L273 TraceCheckUtils]: 65: Hoare triple {8620#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {8621#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:19,332 INFO L273 TraceCheckUtils]: 66: Hoare triple {8621#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8621#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:19,333 INFO L273 TraceCheckUtils]: 67: Hoare triple {8621#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8621#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:19,334 INFO L273 TraceCheckUtils]: 68: Hoare triple {8621#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {8622#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:19,334 INFO L273 TraceCheckUtils]: 69: Hoare triple {8622#(<= main_~i~0 21)} assume !(~i~0 < 100000); {8600#false} is VALID [2018-11-23 12:05:19,335 INFO L273 TraceCheckUtils]: 70: Hoare triple {8600#false} havoc ~x~0;~x~0 := 0; {8600#false} is VALID [2018-11-23 12:05:19,335 INFO L273 TraceCheckUtils]: 71: Hoare triple {8600#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8600#false} is VALID [2018-11-23 12:05:19,335 INFO L256 TraceCheckUtils]: 72: Hoare triple {8600#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {8600#false} is VALID [2018-11-23 12:05:19,335 INFO L273 TraceCheckUtils]: 73: Hoare triple {8600#false} ~cond := #in~cond; {8600#false} is VALID [2018-11-23 12:05:19,335 INFO L273 TraceCheckUtils]: 74: Hoare triple {8600#false} assume 0 == ~cond; {8600#false} is VALID [2018-11-23 12:05:19,336 INFO L273 TraceCheckUtils]: 75: Hoare triple {8600#false} assume !false; {8600#false} is VALID [2018-11-23 12:05:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:19,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:19,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 12:05:19,366 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-11-23 12:05:19,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:19,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:05:19,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:19,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:05:19,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:05:19,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:05:19,471 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand 25 states. [2018-11-23 12:05:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:19,864 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2018-11-23 12:05:19,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:05:19,864 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-11-23 12:05:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:05:19,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 122 transitions. [2018-11-23 12:05:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:05:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 122 transitions. [2018-11-23 12:05:19,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 122 transitions. [2018-11-23 12:05:20,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:20,104 INFO L225 Difference]: With dead ends: 97 [2018-11-23 12:05:20,104 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 12:05:20,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:05:20,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 12:05:20,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-11-23 12:05:20,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:20,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 84 states. [2018-11-23 12:05:20,125 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 84 states. [2018-11-23 12:05:20,125 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 84 states. [2018-11-23 12:05:20,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:20,128 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2018-11-23 12:05:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-11-23 12:05:20,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:20,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:20,129 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 86 states. [2018-11-23 12:05:20,129 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 86 states. [2018-11-23 12:05:20,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:20,130 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2018-11-23 12:05:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-11-23 12:05:20,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:20,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:20,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:20,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:20,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 12:05:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2018-11-23 12:05:20,133 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 76 [2018-11-23 12:05:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:20,133 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2018-11-23 12:05:20,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:05:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2018-11-23 12:05:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 12:05:20,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:20,134 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:20,134 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:20,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1535812089, now seen corresponding path program 22 times [2018-11-23 12:05:20,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:20,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:20,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:20,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:20,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:20,595 INFO L256 TraceCheckUtils]: 0: Hoare triple {9267#true} call ULTIMATE.init(); {9267#true} is VALID [2018-11-23 12:05:20,595 INFO L273 TraceCheckUtils]: 1: Hoare triple {9267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9267#true} is VALID [2018-11-23 12:05:20,596 INFO L273 TraceCheckUtils]: 2: Hoare triple {9267#true} assume true; {9267#true} is VALID [2018-11-23 12:05:20,596 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9267#true} {9267#true} #55#return; {9267#true} is VALID [2018-11-23 12:05:20,596 INFO L256 TraceCheckUtils]: 4: Hoare triple {9267#true} call #t~ret4 := main(); {9267#true} is VALID [2018-11-23 12:05:20,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {9267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {9269#(= main_~i~0 0)} is VALID [2018-11-23 12:05:20,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {9269#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9269#(= main_~i~0 0)} is VALID [2018-11-23 12:05:20,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {9269#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9269#(= main_~i~0 0)} is VALID [2018-11-23 12:05:20,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {9269#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {9270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,598 INFO L273 TraceCheckUtils]: 9: Hoare triple {9270#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {9270#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {9270#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,600 INFO L273 TraceCheckUtils]: 12: Hoare triple {9271#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,600 INFO L273 TraceCheckUtils]: 13: Hoare triple {9271#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,601 INFO L273 TraceCheckUtils]: 14: Hoare triple {9271#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,601 INFO L273 TraceCheckUtils]: 15: Hoare triple {9272#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,602 INFO L273 TraceCheckUtils]: 16: Hoare triple {9272#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,603 INFO L273 TraceCheckUtils]: 17: Hoare triple {9272#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,603 INFO L273 TraceCheckUtils]: 18: Hoare triple {9273#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,604 INFO L273 TraceCheckUtils]: 19: Hoare triple {9273#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,604 INFO L273 TraceCheckUtils]: 20: Hoare triple {9273#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,605 INFO L273 TraceCheckUtils]: 21: Hoare triple {9274#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {9274#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,606 INFO L273 TraceCheckUtils]: 23: Hoare triple {9274#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {9275#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,607 INFO L273 TraceCheckUtils]: 25: Hoare triple {9275#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,608 INFO L273 TraceCheckUtils]: 26: Hoare triple {9275#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {9276#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,609 INFO L273 TraceCheckUtils]: 28: Hoare triple {9276#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,610 INFO L273 TraceCheckUtils]: 29: Hoare triple {9276#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:20,610 INFO L273 TraceCheckUtils]: 30: Hoare triple {9277#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:20,611 INFO L273 TraceCheckUtils]: 31: Hoare triple {9277#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:20,612 INFO L273 TraceCheckUtils]: 32: Hoare triple {9277#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:20,612 INFO L273 TraceCheckUtils]: 33: Hoare triple {9278#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:20,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {9278#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:20,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {9278#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:20,614 INFO L273 TraceCheckUtils]: 36: Hoare triple {9279#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:20,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {9279#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:20,615 INFO L273 TraceCheckUtils]: 38: Hoare triple {9279#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:20,616 INFO L273 TraceCheckUtils]: 39: Hoare triple {9280#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:20,616 INFO L273 TraceCheckUtils]: 40: Hoare triple {9280#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:20,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {9280#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:20,618 INFO L273 TraceCheckUtils]: 42: Hoare triple {9281#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:20,618 INFO L273 TraceCheckUtils]: 43: Hoare triple {9281#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:20,619 INFO L273 TraceCheckUtils]: 44: Hoare triple {9281#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:20,619 INFO L273 TraceCheckUtils]: 45: Hoare triple {9282#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:20,620 INFO L273 TraceCheckUtils]: 46: Hoare triple {9282#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:20,621 INFO L273 TraceCheckUtils]: 47: Hoare triple {9282#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:20,621 INFO L273 TraceCheckUtils]: 48: Hoare triple {9283#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:20,622 INFO L273 TraceCheckUtils]: 49: Hoare triple {9283#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:20,622 INFO L273 TraceCheckUtils]: 50: Hoare triple {9283#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:20,623 INFO L273 TraceCheckUtils]: 51: Hoare triple {9284#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:20,623 INFO L273 TraceCheckUtils]: 52: Hoare triple {9284#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:20,624 INFO L273 TraceCheckUtils]: 53: Hoare triple {9284#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:20,625 INFO L273 TraceCheckUtils]: 54: Hoare triple {9285#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:20,625 INFO L273 TraceCheckUtils]: 55: Hoare triple {9285#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:20,626 INFO L273 TraceCheckUtils]: 56: Hoare triple {9285#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:20,627 INFO L273 TraceCheckUtils]: 57: Hoare triple {9286#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:20,627 INFO L273 TraceCheckUtils]: 58: Hoare triple {9286#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:20,628 INFO L273 TraceCheckUtils]: 59: Hoare triple {9286#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {9287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:20,628 INFO L273 TraceCheckUtils]: 60: Hoare triple {9287#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:20,629 INFO L273 TraceCheckUtils]: 61: Hoare triple {9287#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:20,630 INFO L273 TraceCheckUtils]: 62: Hoare triple {9287#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {9288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:20,630 INFO L273 TraceCheckUtils]: 63: Hoare triple {9288#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:20,635 INFO L273 TraceCheckUtils]: 64: Hoare triple {9288#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:20,635 INFO L273 TraceCheckUtils]: 65: Hoare triple {9288#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {9289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:20,636 INFO L273 TraceCheckUtils]: 66: Hoare triple {9289#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:20,636 INFO L273 TraceCheckUtils]: 67: Hoare triple {9289#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:20,636 INFO L273 TraceCheckUtils]: 68: Hoare triple {9289#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {9290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:20,637 INFO L273 TraceCheckUtils]: 69: Hoare triple {9290#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:20,637 INFO L273 TraceCheckUtils]: 70: Hoare triple {9290#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:20,637 INFO L273 TraceCheckUtils]: 71: Hoare triple {9290#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {9291#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:20,638 INFO L273 TraceCheckUtils]: 72: Hoare triple {9291#(<= main_~i~0 22)} assume !(~i~0 < 100000); {9268#false} is VALID [2018-11-23 12:05:20,638 INFO L273 TraceCheckUtils]: 73: Hoare triple {9268#false} havoc ~x~0;~x~0 := 0; {9268#false} is VALID [2018-11-23 12:05:20,638 INFO L273 TraceCheckUtils]: 74: Hoare triple {9268#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9268#false} is VALID [2018-11-23 12:05:20,638 INFO L256 TraceCheckUtils]: 75: Hoare triple {9268#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {9268#false} is VALID [2018-11-23 12:05:20,638 INFO L273 TraceCheckUtils]: 76: Hoare triple {9268#false} ~cond := #in~cond; {9268#false} is VALID [2018-11-23 12:05:20,638 INFO L273 TraceCheckUtils]: 77: Hoare triple {9268#false} assume 0 == ~cond; {9268#false} is VALID [2018-11-23 12:05:20,639 INFO L273 TraceCheckUtils]: 78: Hoare triple {9268#false} assume !false; {9268#false} is VALID [2018-11-23 12:05:20,643 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:20,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:20,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:20,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:20,689 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:20,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:20,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:20,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {9267#true} call ULTIMATE.init(); {9267#true} is VALID [2018-11-23 12:05:20,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {9267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9267#true} is VALID [2018-11-23 12:05:20,965 INFO L273 TraceCheckUtils]: 2: Hoare triple {9267#true} assume true; {9267#true} is VALID [2018-11-23 12:05:20,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9267#true} {9267#true} #55#return; {9267#true} is VALID [2018-11-23 12:05:20,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {9267#true} call #t~ret4 := main(); {9267#true} is VALID [2018-11-23 12:05:20,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {9267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {9310#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:20,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {9310#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9310#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:20,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {9310#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9310#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:20,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {9310#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {9270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {9270#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {9270#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,969 INFO L273 TraceCheckUtils]: 11: Hoare triple {9270#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,969 INFO L273 TraceCheckUtils]: 12: Hoare triple {9271#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,970 INFO L273 TraceCheckUtils]: 13: Hoare triple {9271#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,970 INFO L273 TraceCheckUtils]: 14: Hoare triple {9271#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,971 INFO L273 TraceCheckUtils]: 15: Hoare triple {9272#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,971 INFO L273 TraceCheckUtils]: 16: Hoare triple {9272#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,972 INFO L273 TraceCheckUtils]: 17: Hoare triple {9272#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {9273#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,973 INFO L273 TraceCheckUtils]: 19: Hoare triple {9273#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,974 INFO L273 TraceCheckUtils]: 20: Hoare triple {9273#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,974 INFO L273 TraceCheckUtils]: 21: Hoare triple {9274#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,975 INFO L273 TraceCheckUtils]: 22: Hoare triple {9274#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,975 INFO L273 TraceCheckUtils]: 23: Hoare triple {9274#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,976 INFO L273 TraceCheckUtils]: 24: Hoare triple {9275#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,976 INFO L273 TraceCheckUtils]: 25: Hoare triple {9275#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,977 INFO L273 TraceCheckUtils]: 26: Hoare triple {9275#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,978 INFO L273 TraceCheckUtils]: 27: Hoare triple {9276#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,978 INFO L273 TraceCheckUtils]: 28: Hoare triple {9276#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,979 INFO L273 TraceCheckUtils]: 29: Hoare triple {9276#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:20,980 INFO L273 TraceCheckUtils]: 30: Hoare triple {9277#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:20,980 INFO L273 TraceCheckUtils]: 31: Hoare triple {9277#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:20,981 INFO L273 TraceCheckUtils]: 32: Hoare triple {9277#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:20,981 INFO L273 TraceCheckUtils]: 33: Hoare triple {9278#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:20,982 INFO L273 TraceCheckUtils]: 34: Hoare triple {9278#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:20,983 INFO L273 TraceCheckUtils]: 35: Hoare triple {9278#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:20,983 INFO L273 TraceCheckUtils]: 36: Hoare triple {9279#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:20,984 INFO L273 TraceCheckUtils]: 37: Hoare triple {9279#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:20,984 INFO L273 TraceCheckUtils]: 38: Hoare triple {9279#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:20,985 INFO L273 TraceCheckUtils]: 39: Hoare triple {9280#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:20,985 INFO L273 TraceCheckUtils]: 40: Hoare triple {9280#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:20,986 INFO L273 TraceCheckUtils]: 41: Hoare triple {9280#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:20,987 INFO L273 TraceCheckUtils]: 42: Hoare triple {9281#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:20,987 INFO L273 TraceCheckUtils]: 43: Hoare triple {9281#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:20,988 INFO L273 TraceCheckUtils]: 44: Hoare triple {9281#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:20,988 INFO L273 TraceCheckUtils]: 45: Hoare triple {9282#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:20,989 INFO L273 TraceCheckUtils]: 46: Hoare triple {9282#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:20,990 INFO L273 TraceCheckUtils]: 47: Hoare triple {9282#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:20,990 INFO L273 TraceCheckUtils]: 48: Hoare triple {9283#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:20,991 INFO L273 TraceCheckUtils]: 49: Hoare triple {9283#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:20,992 INFO L273 TraceCheckUtils]: 50: Hoare triple {9283#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:20,992 INFO L273 TraceCheckUtils]: 51: Hoare triple {9284#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:20,993 INFO L273 TraceCheckUtils]: 52: Hoare triple {9284#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:20,993 INFO L273 TraceCheckUtils]: 53: Hoare triple {9284#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:20,994 INFO L273 TraceCheckUtils]: 54: Hoare triple {9285#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:20,994 INFO L273 TraceCheckUtils]: 55: Hoare triple {9285#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:20,995 INFO L273 TraceCheckUtils]: 56: Hoare triple {9285#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:20,996 INFO L273 TraceCheckUtils]: 57: Hoare triple {9286#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:20,996 INFO L273 TraceCheckUtils]: 58: Hoare triple {9286#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:20,997 INFO L273 TraceCheckUtils]: 59: Hoare triple {9286#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {9287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:20,997 INFO L273 TraceCheckUtils]: 60: Hoare triple {9287#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:20,998 INFO L273 TraceCheckUtils]: 61: Hoare triple {9287#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:20,999 INFO L273 TraceCheckUtils]: 62: Hoare triple {9287#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {9288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:20,999 INFO L273 TraceCheckUtils]: 63: Hoare triple {9288#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:21,000 INFO L273 TraceCheckUtils]: 64: Hoare triple {9288#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:21,000 INFO L273 TraceCheckUtils]: 65: Hoare triple {9288#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {9289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:21,001 INFO L273 TraceCheckUtils]: 66: Hoare triple {9289#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:21,002 INFO L273 TraceCheckUtils]: 67: Hoare triple {9289#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:21,002 INFO L273 TraceCheckUtils]: 68: Hoare triple {9289#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {9290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:21,003 INFO L273 TraceCheckUtils]: 69: Hoare triple {9290#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:21,003 INFO L273 TraceCheckUtils]: 70: Hoare triple {9290#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:21,004 INFO L273 TraceCheckUtils]: 71: Hoare triple {9290#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {9291#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:21,005 INFO L273 TraceCheckUtils]: 72: Hoare triple {9291#(<= main_~i~0 22)} assume !(~i~0 < 100000); {9268#false} is VALID [2018-11-23 12:05:21,005 INFO L273 TraceCheckUtils]: 73: Hoare triple {9268#false} havoc ~x~0;~x~0 := 0; {9268#false} is VALID [2018-11-23 12:05:21,005 INFO L273 TraceCheckUtils]: 74: Hoare triple {9268#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9268#false} is VALID [2018-11-23 12:05:21,005 INFO L256 TraceCheckUtils]: 75: Hoare triple {9268#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {9268#false} is VALID [2018-11-23 12:05:21,006 INFO L273 TraceCheckUtils]: 76: Hoare triple {9268#false} ~cond := #in~cond; {9268#false} is VALID [2018-11-23 12:05:21,006 INFO L273 TraceCheckUtils]: 77: Hoare triple {9268#false} assume 0 == ~cond; {9268#false} is VALID [2018-11-23 12:05:21,006 INFO L273 TraceCheckUtils]: 78: Hoare triple {9268#false} assume !false; {9268#false} is VALID [2018-11-23 12:05:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:21,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:21,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:05:21,030 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-11-23 12:05:21,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:21,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:05:21,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:21,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:05:21,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:05:21,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:05:21,113 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand 26 states. [2018-11-23 12:05:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:21,959 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2018-11-23 12:05:21,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:05:21,959 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-11-23 12:05:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:05:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 126 transitions. [2018-11-23 12:05:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:05:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 126 transitions. [2018-11-23 12:05:21,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 126 transitions. [2018-11-23 12:05:22,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:22,123 INFO L225 Difference]: With dead ends: 100 [2018-11-23 12:05:22,123 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 12:05:22,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:05:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 12:05:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-11-23 12:05:22,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:22,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 87 states. [2018-11-23 12:05:22,145 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 87 states. [2018-11-23 12:05:22,145 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 87 states. [2018-11-23 12:05:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:22,147 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-23 12:05:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-11-23 12:05:22,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:22,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:22,148 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 89 states. [2018-11-23 12:05:22,148 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 89 states. [2018-11-23 12:05:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:22,149 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-23 12:05:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-11-23 12:05:22,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:22,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:22,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:22,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:05:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2018-11-23 12:05:22,152 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 79 [2018-11-23 12:05:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:22,152 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2018-11-23 12:05:22,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:05:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2018-11-23 12:05:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 12:05:22,153 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:22,153 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:22,154 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:22,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:22,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1863295069, now seen corresponding path program 23 times [2018-11-23 12:05:22,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:22,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:22,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:22,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:22,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:22,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {9959#true} call ULTIMATE.init(); {9959#true} is VALID [2018-11-23 12:05:22,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {9959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9959#true} is VALID [2018-11-23 12:05:22,580 INFO L273 TraceCheckUtils]: 2: Hoare triple {9959#true} assume true; {9959#true} is VALID [2018-11-23 12:05:22,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9959#true} {9959#true} #55#return; {9959#true} is VALID [2018-11-23 12:05:22,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {9959#true} call #t~ret4 := main(); {9959#true} is VALID [2018-11-23 12:05:22,581 INFO L273 TraceCheckUtils]: 5: Hoare triple {9959#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {9961#(= main_~i~0 0)} is VALID [2018-11-23 12:05:22,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {9961#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9961#(= main_~i~0 0)} is VALID [2018-11-23 12:05:22,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {9961#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9961#(= main_~i~0 0)} is VALID [2018-11-23 12:05:22,582 INFO L273 TraceCheckUtils]: 8: Hoare triple {9961#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {9962#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {9962#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9962#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,582 INFO L273 TraceCheckUtils]: 10: Hoare triple {9962#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9962#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,583 INFO L273 TraceCheckUtils]: 11: Hoare triple {9962#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9963#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {9963#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9963#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,584 INFO L273 TraceCheckUtils]: 13: Hoare triple {9963#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9963#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,584 INFO L273 TraceCheckUtils]: 14: Hoare triple {9963#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9964#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:22,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {9964#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9964#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:22,585 INFO L273 TraceCheckUtils]: 16: Hoare triple {9964#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9964#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:22,586 INFO L273 TraceCheckUtils]: 17: Hoare triple {9964#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9965#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:22,586 INFO L273 TraceCheckUtils]: 18: Hoare triple {9965#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9965#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:22,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {9965#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9965#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:22,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {9965#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9966#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:22,588 INFO L273 TraceCheckUtils]: 21: Hoare triple {9966#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9966#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:22,589 INFO L273 TraceCheckUtils]: 22: Hoare triple {9966#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9966#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:22,589 INFO L273 TraceCheckUtils]: 23: Hoare triple {9966#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9967#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:22,590 INFO L273 TraceCheckUtils]: 24: Hoare triple {9967#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9967#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:22,590 INFO L273 TraceCheckUtils]: 25: Hoare triple {9967#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9967#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:22,591 INFO L273 TraceCheckUtils]: 26: Hoare triple {9967#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9968#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:22,592 INFO L273 TraceCheckUtils]: 27: Hoare triple {9968#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9968#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:22,592 INFO L273 TraceCheckUtils]: 28: Hoare triple {9968#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9968#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:22,593 INFO L273 TraceCheckUtils]: 29: Hoare triple {9968#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9969#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:22,593 INFO L273 TraceCheckUtils]: 30: Hoare triple {9969#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9969#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:22,594 INFO L273 TraceCheckUtils]: 31: Hoare triple {9969#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9969#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:22,595 INFO L273 TraceCheckUtils]: 32: Hoare triple {9969#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9970#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:22,595 INFO L273 TraceCheckUtils]: 33: Hoare triple {9970#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9970#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:22,596 INFO L273 TraceCheckUtils]: 34: Hoare triple {9970#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9970#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:22,596 INFO L273 TraceCheckUtils]: 35: Hoare triple {9970#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9971#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:22,597 INFO L273 TraceCheckUtils]: 36: Hoare triple {9971#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9971#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:22,598 INFO L273 TraceCheckUtils]: 37: Hoare triple {9971#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9971#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:22,598 INFO L273 TraceCheckUtils]: 38: Hoare triple {9971#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9972#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:22,599 INFO L273 TraceCheckUtils]: 39: Hoare triple {9972#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9972#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:22,599 INFO L273 TraceCheckUtils]: 40: Hoare triple {9972#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9972#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:22,600 INFO L273 TraceCheckUtils]: 41: Hoare triple {9972#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9973#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:22,601 INFO L273 TraceCheckUtils]: 42: Hoare triple {9973#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9973#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:22,601 INFO L273 TraceCheckUtils]: 43: Hoare triple {9973#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9973#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:22,602 INFO L273 TraceCheckUtils]: 44: Hoare triple {9973#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9974#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:22,602 INFO L273 TraceCheckUtils]: 45: Hoare triple {9974#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9974#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:22,603 INFO L273 TraceCheckUtils]: 46: Hoare triple {9974#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9974#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:22,604 INFO L273 TraceCheckUtils]: 47: Hoare triple {9974#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9975#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:22,604 INFO L273 TraceCheckUtils]: 48: Hoare triple {9975#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9975#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:22,605 INFO L273 TraceCheckUtils]: 49: Hoare triple {9975#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9975#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:22,606 INFO L273 TraceCheckUtils]: 50: Hoare triple {9975#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9976#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:22,606 INFO L273 TraceCheckUtils]: 51: Hoare triple {9976#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9976#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:22,607 INFO L273 TraceCheckUtils]: 52: Hoare triple {9976#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9976#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:22,607 INFO L273 TraceCheckUtils]: 53: Hoare triple {9976#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9977#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:22,608 INFO L273 TraceCheckUtils]: 54: Hoare triple {9977#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9977#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:22,608 INFO L273 TraceCheckUtils]: 55: Hoare triple {9977#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9977#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:22,609 INFO L273 TraceCheckUtils]: 56: Hoare triple {9977#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9978#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:22,610 INFO L273 TraceCheckUtils]: 57: Hoare triple {9978#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9978#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:22,610 INFO L273 TraceCheckUtils]: 58: Hoare triple {9978#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9978#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:22,611 INFO L273 TraceCheckUtils]: 59: Hoare triple {9978#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {9979#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:22,611 INFO L273 TraceCheckUtils]: 60: Hoare triple {9979#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9979#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:22,612 INFO L273 TraceCheckUtils]: 61: Hoare triple {9979#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9979#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:22,613 INFO L273 TraceCheckUtils]: 62: Hoare triple {9979#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {9980#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:22,613 INFO L273 TraceCheckUtils]: 63: Hoare triple {9980#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9980#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:22,614 INFO L273 TraceCheckUtils]: 64: Hoare triple {9980#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9980#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:22,615 INFO L273 TraceCheckUtils]: 65: Hoare triple {9980#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {9981#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:22,615 INFO L273 TraceCheckUtils]: 66: Hoare triple {9981#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9981#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:22,616 INFO L273 TraceCheckUtils]: 67: Hoare triple {9981#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9981#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:22,616 INFO L273 TraceCheckUtils]: 68: Hoare triple {9981#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {9982#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:22,617 INFO L273 TraceCheckUtils]: 69: Hoare triple {9982#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9982#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:22,617 INFO L273 TraceCheckUtils]: 70: Hoare triple {9982#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9982#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:22,618 INFO L273 TraceCheckUtils]: 71: Hoare triple {9982#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {9983#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:22,619 INFO L273 TraceCheckUtils]: 72: Hoare triple {9983#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9983#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:22,619 INFO L273 TraceCheckUtils]: 73: Hoare triple {9983#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9983#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:22,620 INFO L273 TraceCheckUtils]: 74: Hoare triple {9983#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {9984#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:22,621 INFO L273 TraceCheckUtils]: 75: Hoare triple {9984#(<= main_~i~0 23)} assume !(~i~0 < 100000); {9960#false} is VALID [2018-11-23 12:05:22,621 INFO L273 TraceCheckUtils]: 76: Hoare triple {9960#false} havoc ~x~0;~x~0 := 0; {9960#false} is VALID [2018-11-23 12:05:22,621 INFO L273 TraceCheckUtils]: 77: Hoare triple {9960#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9960#false} is VALID [2018-11-23 12:05:22,621 INFO L256 TraceCheckUtils]: 78: Hoare triple {9960#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {9960#false} is VALID [2018-11-23 12:05:22,622 INFO L273 TraceCheckUtils]: 79: Hoare triple {9960#false} ~cond := #in~cond; {9960#false} is VALID [2018-11-23 12:05:22,622 INFO L273 TraceCheckUtils]: 80: Hoare triple {9960#false} assume 0 == ~cond; {9960#false} is VALID [2018-11-23 12:05:22,622 INFO L273 TraceCheckUtils]: 81: Hoare triple {9960#false} assume !false; {9960#false} is VALID [2018-11-23 12:05:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:22,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:22,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:22,637 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:22,700 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 12:05:22,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:22,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:22,941 INFO L256 TraceCheckUtils]: 0: Hoare triple {9959#true} call ULTIMATE.init(); {9959#true} is VALID [2018-11-23 12:05:22,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {9959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9959#true} is VALID [2018-11-23 12:05:22,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {9959#true} assume true; {9959#true} is VALID [2018-11-23 12:05:22,942 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9959#true} {9959#true} #55#return; {9959#true} is VALID [2018-11-23 12:05:22,942 INFO L256 TraceCheckUtils]: 4: Hoare triple {9959#true} call #t~ret4 := main(); {9959#true} is VALID [2018-11-23 12:05:22,943 INFO L273 TraceCheckUtils]: 5: Hoare triple {9959#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {10003#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:22,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {10003#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10003#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:22,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {10003#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10003#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:22,944 INFO L273 TraceCheckUtils]: 8: Hoare triple {10003#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {9962#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,944 INFO L273 TraceCheckUtils]: 9: Hoare triple {9962#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9962#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,945 INFO L273 TraceCheckUtils]: 10: Hoare triple {9962#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9962#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {9962#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9963#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,946 INFO L273 TraceCheckUtils]: 12: Hoare triple {9963#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9963#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,946 INFO L273 TraceCheckUtils]: 13: Hoare triple {9963#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9963#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,947 INFO L273 TraceCheckUtils]: 14: Hoare triple {9963#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9964#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:22,947 INFO L273 TraceCheckUtils]: 15: Hoare triple {9964#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9964#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:22,948 INFO L273 TraceCheckUtils]: 16: Hoare triple {9964#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9964#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:22,949 INFO L273 TraceCheckUtils]: 17: Hoare triple {9964#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9965#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:22,949 INFO L273 TraceCheckUtils]: 18: Hoare triple {9965#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9965#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:22,950 INFO L273 TraceCheckUtils]: 19: Hoare triple {9965#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9965#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:22,950 INFO L273 TraceCheckUtils]: 20: Hoare triple {9965#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9966#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:22,951 INFO L273 TraceCheckUtils]: 21: Hoare triple {9966#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9966#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:22,951 INFO L273 TraceCheckUtils]: 22: Hoare triple {9966#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9966#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:22,952 INFO L273 TraceCheckUtils]: 23: Hoare triple {9966#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9967#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:22,953 INFO L273 TraceCheckUtils]: 24: Hoare triple {9967#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9967#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:22,953 INFO L273 TraceCheckUtils]: 25: Hoare triple {9967#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9967#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:22,954 INFO L273 TraceCheckUtils]: 26: Hoare triple {9967#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9968#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:22,954 INFO L273 TraceCheckUtils]: 27: Hoare triple {9968#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9968#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:22,955 INFO L273 TraceCheckUtils]: 28: Hoare triple {9968#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9968#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:22,956 INFO L273 TraceCheckUtils]: 29: Hoare triple {9968#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9969#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:22,956 INFO L273 TraceCheckUtils]: 30: Hoare triple {9969#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9969#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:22,957 INFO L273 TraceCheckUtils]: 31: Hoare triple {9969#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9969#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:22,958 INFO L273 TraceCheckUtils]: 32: Hoare triple {9969#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9970#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:22,958 INFO L273 TraceCheckUtils]: 33: Hoare triple {9970#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9970#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:22,959 INFO L273 TraceCheckUtils]: 34: Hoare triple {9970#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9970#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:22,959 INFO L273 TraceCheckUtils]: 35: Hoare triple {9970#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9971#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:22,960 INFO L273 TraceCheckUtils]: 36: Hoare triple {9971#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9971#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:22,960 INFO L273 TraceCheckUtils]: 37: Hoare triple {9971#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9971#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:22,961 INFO L273 TraceCheckUtils]: 38: Hoare triple {9971#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9972#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:22,962 INFO L273 TraceCheckUtils]: 39: Hoare triple {9972#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9972#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:22,962 INFO L273 TraceCheckUtils]: 40: Hoare triple {9972#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9972#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:22,963 INFO L273 TraceCheckUtils]: 41: Hoare triple {9972#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9973#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:22,963 INFO L273 TraceCheckUtils]: 42: Hoare triple {9973#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9973#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:22,964 INFO L273 TraceCheckUtils]: 43: Hoare triple {9973#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9973#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:22,965 INFO L273 TraceCheckUtils]: 44: Hoare triple {9973#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9974#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:22,965 INFO L273 TraceCheckUtils]: 45: Hoare triple {9974#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9974#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:22,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {9974#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9974#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:22,966 INFO L273 TraceCheckUtils]: 47: Hoare triple {9974#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9975#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:22,967 INFO L273 TraceCheckUtils]: 48: Hoare triple {9975#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9975#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:22,968 INFO L273 TraceCheckUtils]: 49: Hoare triple {9975#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9975#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:22,968 INFO L273 TraceCheckUtils]: 50: Hoare triple {9975#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9976#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:22,969 INFO L273 TraceCheckUtils]: 51: Hoare triple {9976#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9976#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:22,969 INFO L273 TraceCheckUtils]: 52: Hoare triple {9976#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9976#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:22,970 INFO L273 TraceCheckUtils]: 53: Hoare triple {9976#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9977#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:22,971 INFO L273 TraceCheckUtils]: 54: Hoare triple {9977#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9977#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:22,971 INFO L273 TraceCheckUtils]: 55: Hoare triple {9977#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9977#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:22,972 INFO L273 TraceCheckUtils]: 56: Hoare triple {9977#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9978#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:22,972 INFO L273 TraceCheckUtils]: 57: Hoare triple {9978#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9978#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:22,973 INFO L273 TraceCheckUtils]: 58: Hoare triple {9978#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9978#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:22,974 INFO L273 TraceCheckUtils]: 59: Hoare triple {9978#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {9979#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:22,974 INFO L273 TraceCheckUtils]: 60: Hoare triple {9979#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9979#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:22,975 INFO L273 TraceCheckUtils]: 61: Hoare triple {9979#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9979#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:22,975 INFO L273 TraceCheckUtils]: 62: Hoare triple {9979#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {9980#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:22,976 INFO L273 TraceCheckUtils]: 63: Hoare triple {9980#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9980#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:22,977 INFO L273 TraceCheckUtils]: 64: Hoare triple {9980#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9980#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:22,977 INFO L273 TraceCheckUtils]: 65: Hoare triple {9980#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {9981#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:22,978 INFO L273 TraceCheckUtils]: 66: Hoare triple {9981#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9981#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:22,978 INFO L273 TraceCheckUtils]: 67: Hoare triple {9981#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9981#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:22,979 INFO L273 TraceCheckUtils]: 68: Hoare triple {9981#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {9982#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:22,980 INFO L273 TraceCheckUtils]: 69: Hoare triple {9982#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9982#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:22,980 INFO L273 TraceCheckUtils]: 70: Hoare triple {9982#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9982#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:22,981 INFO L273 TraceCheckUtils]: 71: Hoare triple {9982#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {9983#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:22,981 INFO L273 TraceCheckUtils]: 72: Hoare triple {9983#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9983#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:22,982 INFO L273 TraceCheckUtils]: 73: Hoare triple {9983#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9983#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:22,983 INFO L273 TraceCheckUtils]: 74: Hoare triple {9983#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {9984#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:22,983 INFO L273 TraceCheckUtils]: 75: Hoare triple {9984#(<= main_~i~0 23)} assume !(~i~0 < 100000); {9960#false} is VALID [2018-11-23 12:05:22,984 INFO L273 TraceCheckUtils]: 76: Hoare triple {9960#false} havoc ~x~0;~x~0 := 0; {9960#false} is VALID [2018-11-23 12:05:22,984 INFO L273 TraceCheckUtils]: 77: Hoare triple {9960#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9960#false} is VALID [2018-11-23 12:05:22,984 INFO L256 TraceCheckUtils]: 78: Hoare triple {9960#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {9960#false} is VALID [2018-11-23 12:05:22,984 INFO L273 TraceCheckUtils]: 79: Hoare triple {9960#false} ~cond := #in~cond; {9960#false} is VALID [2018-11-23 12:05:22,984 INFO L273 TraceCheckUtils]: 80: Hoare triple {9960#false} assume 0 == ~cond; {9960#false} is VALID [2018-11-23 12:05:22,985 INFO L273 TraceCheckUtils]: 81: Hoare triple {9960#false} assume !false; {9960#false} is VALID [2018-11-23 12:05:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:23,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:23,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 12:05:23,009 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-11-23 12:05:23,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:23,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:05:23,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:23,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:05:23,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:05:23,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:05:23,094 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand 27 states. [2018-11-23 12:05:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,374 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2018-11-23 12:05:23,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:05:23,374 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-11-23 12:05:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:05:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-23 12:05:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:05:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-23 12:05:23,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 130 transitions. [2018-11-23 12:05:23,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:23,500 INFO L225 Difference]: With dead ends: 103 [2018-11-23 12:05:23,500 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 12:05:23,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:05:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 12:05:23,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-23 12:05:23,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:23,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 90 states. [2018-11-23 12:05:23,521 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 90 states. [2018-11-23 12:05:23,521 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 90 states. [2018-11-23 12:05:23,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,522 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2018-11-23 12:05:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2018-11-23 12:05:23,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:23,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:23,523 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 92 states. [2018-11-23 12:05:23,523 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 92 states. [2018-11-23 12:05:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,525 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2018-11-23 12:05:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2018-11-23 12:05:23,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:23,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:23,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:23,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 12:05:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2018-11-23 12:05:23,527 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 82 [2018-11-23 12:05:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:23,527 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2018-11-23 12:05:23,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:05:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2018-11-23 12:05:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 12:05:23,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:23,528 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:23,529 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:23,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:23,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2074266041, now seen corresponding path program 24 times [2018-11-23 12:05:23,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:23,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:23,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:23,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:24,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {10675#true} call ULTIMATE.init(); {10675#true} is VALID [2018-11-23 12:05:24,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {10675#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10675#true} is VALID [2018-11-23 12:05:24,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {10675#true} assume true; {10675#true} is VALID [2018-11-23 12:05:24,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10675#true} {10675#true} #55#return; {10675#true} is VALID [2018-11-23 12:05:24,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {10675#true} call #t~ret4 := main(); {10675#true} is VALID [2018-11-23 12:05:24,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {10675#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {10677#(= main_~i~0 0)} is VALID [2018-11-23 12:05:24,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {10677#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10677#(= main_~i~0 0)} is VALID [2018-11-23 12:05:24,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {10677#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10677#(= main_~i~0 0)} is VALID [2018-11-23 12:05:24,527 INFO L273 TraceCheckUtils]: 8: Hoare triple {10677#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {10678#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {10678#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10678#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {10678#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10678#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {10678#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {10679#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {10679#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10679#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {10679#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10679#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {10679#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {10680#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {10680#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10680#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {10680#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10680#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,532 INFO L273 TraceCheckUtils]: 17: Hoare triple {10680#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {10681#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,533 INFO L273 TraceCheckUtils]: 18: Hoare triple {10681#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10681#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,533 INFO L273 TraceCheckUtils]: 19: Hoare triple {10681#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10681#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,534 INFO L273 TraceCheckUtils]: 20: Hoare triple {10681#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {10682#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:24,534 INFO L273 TraceCheckUtils]: 21: Hoare triple {10682#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10682#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:24,535 INFO L273 TraceCheckUtils]: 22: Hoare triple {10682#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10682#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:24,535 INFO L273 TraceCheckUtils]: 23: Hoare triple {10682#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {10683#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:24,536 INFO L273 TraceCheckUtils]: 24: Hoare triple {10683#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10683#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:24,536 INFO L273 TraceCheckUtils]: 25: Hoare triple {10683#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10683#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:24,537 INFO L273 TraceCheckUtils]: 26: Hoare triple {10683#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {10684#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:24,538 INFO L273 TraceCheckUtils]: 27: Hoare triple {10684#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10684#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:24,538 INFO L273 TraceCheckUtils]: 28: Hoare triple {10684#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10684#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:24,539 INFO L273 TraceCheckUtils]: 29: Hoare triple {10684#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {10685#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:24,539 INFO L273 TraceCheckUtils]: 30: Hoare triple {10685#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10685#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:24,540 INFO L273 TraceCheckUtils]: 31: Hoare triple {10685#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10685#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:24,540 INFO L273 TraceCheckUtils]: 32: Hoare triple {10685#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {10686#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:24,541 INFO L273 TraceCheckUtils]: 33: Hoare triple {10686#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10686#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:24,541 INFO L273 TraceCheckUtils]: 34: Hoare triple {10686#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10686#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:24,542 INFO L273 TraceCheckUtils]: 35: Hoare triple {10686#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {10687#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:24,543 INFO L273 TraceCheckUtils]: 36: Hoare triple {10687#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10687#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:24,543 INFO L273 TraceCheckUtils]: 37: Hoare triple {10687#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10687#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:24,544 INFO L273 TraceCheckUtils]: 38: Hoare triple {10687#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {10688#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:24,544 INFO L273 TraceCheckUtils]: 39: Hoare triple {10688#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10688#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:24,545 INFO L273 TraceCheckUtils]: 40: Hoare triple {10688#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10688#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:24,545 INFO L273 TraceCheckUtils]: 41: Hoare triple {10688#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {10689#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:24,546 INFO L273 TraceCheckUtils]: 42: Hoare triple {10689#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10689#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:24,546 INFO L273 TraceCheckUtils]: 43: Hoare triple {10689#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10689#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:24,547 INFO L273 TraceCheckUtils]: 44: Hoare triple {10689#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {10690#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:24,548 INFO L273 TraceCheckUtils]: 45: Hoare triple {10690#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10690#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:24,548 INFO L273 TraceCheckUtils]: 46: Hoare triple {10690#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10690#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:24,549 INFO L273 TraceCheckUtils]: 47: Hoare triple {10690#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {10691#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:24,549 INFO L273 TraceCheckUtils]: 48: Hoare triple {10691#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10691#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:24,550 INFO L273 TraceCheckUtils]: 49: Hoare triple {10691#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10691#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:24,551 INFO L273 TraceCheckUtils]: 50: Hoare triple {10691#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {10692#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:24,551 INFO L273 TraceCheckUtils]: 51: Hoare triple {10692#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10692#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:24,551 INFO L273 TraceCheckUtils]: 52: Hoare triple {10692#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10692#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:24,552 INFO L273 TraceCheckUtils]: 53: Hoare triple {10692#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {10693#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:24,553 INFO L273 TraceCheckUtils]: 54: Hoare triple {10693#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10693#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:24,553 INFO L273 TraceCheckUtils]: 55: Hoare triple {10693#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10693#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:24,554 INFO L273 TraceCheckUtils]: 56: Hoare triple {10693#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {10694#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:24,554 INFO L273 TraceCheckUtils]: 57: Hoare triple {10694#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10694#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:24,555 INFO L273 TraceCheckUtils]: 58: Hoare triple {10694#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10694#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:24,556 INFO L273 TraceCheckUtils]: 59: Hoare triple {10694#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {10695#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:24,556 INFO L273 TraceCheckUtils]: 60: Hoare triple {10695#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10695#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:24,556 INFO L273 TraceCheckUtils]: 61: Hoare triple {10695#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10695#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:24,557 INFO L273 TraceCheckUtils]: 62: Hoare triple {10695#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {10696#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:24,558 INFO L273 TraceCheckUtils]: 63: Hoare triple {10696#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10696#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:24,558 INFO L273 TraceCheckUtils]: 64: Hoare triple {10696#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10696#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:24,559 INFO L273 TraceCheckUtils]: 65: Hoare triple {10696#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {10697#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:24,559 INFO L273 TraceCheckUtils]: 66: Hoare triple {10697#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10697#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:24,560 INFO L273 TraceCheckUtils]: 67: Hoare triple {10697#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10697#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:24,561 INFO L273 TraceCheckUtils]: 68: Hoare triple {10697#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {10698#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:24,561 INFO L273 TraceCheckUtils]: 69: Hoare triple {10698#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10698#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:24,561 INFO L273 TraceCheckUtils]: 70: Hoare triple {10698#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10698#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:24,562 INFO L273 TraceCheckUtils]: 71: Hoare triple {10698#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {10699#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:24,563 INFO L273 TraceCheckUtils]: 72: Hoare triple {10699#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10699#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:24,563 INFO L273 TraceCheckUtils]: 73: Hoare triple {10699#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10699#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:24,564 INFO L273 TraceCheckUtils]: 74: Hoare triple {10699#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {10700#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:24,564 INFO L273 TraceCheckUtils]: 75: Hoare triple {10700#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10700#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:24,565 INFO L273 TraceCheckUtils]: 76: Hoare triple {10700#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10700#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:24,566 INFO L273 TraceCheckUtils]: 77: Hoare triple {10700#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {10701#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:24,566 INFO L273 TraceCheckUtils]: 78: Hoare triple {10701#(<= main_~i~0 24)} assume !(~i~0 < 100000); {10676#false} is VALID [2018-11-23 12:05:24,566 INFO L273 TraceCheckUtils]: 79: Hoare triple {10676#false} havoc ~x~0;~x~0 := 0; {10676#false} is VALID [2018-11-23 12:05:24,567 INFO L273 TraceCheckUtils]: 80: Hoare triple {10676#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10676#false} is VALID [2018-11-23 12:05:24,567 INFO L256 TraceCheckUtils]: 81: Hoare triple {10676#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {10676#false} is VALID [2018-11-23 12:05:24,567 INFO L273 TraceCheckUtils]: 82: Hoare triple {10676#false} ~cond := #in~cond; {10676#false} is VALID [2018-11-23 12:05:24,567 INFO L273 TraceCheckUtils]: 83: Hoare triple {10676#false} assume 0 == ~cond; {10676#false} is VALID [2018-11-23 12:05:24,567 INFO L273 TraceCheckUtils]: 84: Hoare triple {10676#false} assume !false; {10676#false} is VALID [2018-11-23 12:05:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:24,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:24,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:24,583 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:24,642 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 12:05:24,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:24,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:24,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {10675#true} call ULTIMATE.init(); {10675#true} is VALID [2018-11-23 12:05:24,895 INFO L273 TraceCheckUtils]: 1: Hoare triple {10675#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10675#true} is VALID [2018-11-23 12:05:24,895 INFO L273 TraceCheckUtils]: 2: Hoare triple {10675#true} assume true; {10675#true} is VALID [2018-11-23 12:05:24,896 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10675#true} {10675#true} #55#return; {10675#true} is VALID [2018-11-23 12:05:24,896 INFO L256 TraceCheckUtils]: 4: Hoare triple {10675#true} call #t~ret4 := main(); {10675#true} is VALID [2018-11-23 12:05:24,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {10675#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {10720#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:24,897 INFO L273 TraceCheckUtils]: 6: Hoare triple {10720#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10720#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:24,898 INFO L273 TraceCheckUtils]: 7: Hoare triple {10720#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10720#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:24,898 INFO L273 TraceCheckUtils]: 8: Hoare triple {10720#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {10678#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,898 INFO L273 TraceCheckUtils]: 9: Hoare triple {10678#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10678#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,899 INFO L273 TraceCheckUtils]: 10: Hoare triple {10678#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10678#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,899 INFO L273 TraceCheckUtils]: 11: Hoare triple {10678#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {10679#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,899 INFO L273 TraceCheckUtils]: 12: Hoare triple {10679#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10679#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,900 INFO L273 TraceCheckUtils]: 13: Hoare triple {10679#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10679#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,900 INFO L273 TraceCheckUtils]: 14: Hoare triple {10679#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {10680#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,901 INFO L273 TraceCheckUtils]: 15: Hoare triple {10680#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10680#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,901 INFO L273 TraceCheckUtils]: 16: Hoare triple {10680#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10680#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {10680#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {10681#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,902 INFO L273 TraceCheckUtils]: 18: Hoare triple {10681#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10681#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,903 INFO L273 TraceCheckUtils]: 19: Hoare triple {10681#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10681#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,904 INFO L273 TraceCheckUtils]: 20: Hoare triple {10681#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {10682#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:24,904 INFO L273 TraceCheckUtils]: 21: Hoare triple {10682#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10682#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:24,905 INFO L273 TraceCheckUtils]: 22: Hoare triple {10682#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10682#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:24,905 INFO L273 TraceCheckUtils]: 23: Hoare triple {10682#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {10683#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:24,906 INFO L273 TraceCheckUtils]: 24: Hoare triple {10683#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10683#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:24,906 INFO L273 TraceCheckUtils]: 25: Hoare triple {10683#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10683#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:24,907 INFO L273 TraceCheckUtils]: 26: Hoare triple {10683#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {10684#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:24,908 INFO L273 TraceCheckUtils]: 27: Hoare triple {10684#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10684#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:24,908 INFO L273 TraceCheckUtils]: 28: Hoare triple {10684#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10684#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:24,909 INFO L273 TraceCheckUtils]: 29: Hoare triple {10684#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {10685#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:24,909 INFO L273 TraceCheckUtils]: 30: Hoare triple {10685#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10685#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:24,910 INFO L273 TraceCheckUtils]: 31: Hoare triple {10685#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10685#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:24,911 INFO L273 TraceCheckUtils]: 32: Hoare triple {10685#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {10686#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:24,911 INFO L273 TraceCheckUtils]: 33: Hoare triple {10686#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10686#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:24,912 INFO L273 TraceCheckUtils]: 34: Hoare triple {10686#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10686#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:24,912 INFO L273 TraceCheckUtils]: 35: Hoare triple {10686#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {10687#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:24,913 INFO L273 TraceCheckUtils]: 36: Hoare triple {10687#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10687#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:24,914 INFO L273 TraceCheckUtils]: 37: Hoare triple {10687#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10687#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:24,914 INFO L273 TraceCheckUtils]: 38: Hoare triple {10687#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {10688#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:24,915 INFO L273 TraceCheckUtils]: 39: Hoare triple {10688#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10688#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:24,915 INFO L273 TraceCheckUtils]: 40: Hoare triple {10688#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10688#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:24,916 INFO L273 TraceCheckUtils]: 41: Hoare triple {10688#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {10689#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:24,917 INFO L273 TraceCheckUtils]: 42: Hoare triple {10689#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10689#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:24,917 INFO L273 TraceCheckUtils]: 43: Hoare triple {10689#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10689#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:24,918 INFO L273 TraceCheckUtils]: 44: Hoare triple {10689#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {10690#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:24,918 INFO L273 TraceCheckUtils]: 45: Hoare triple {10690#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10690#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:24,919 INFO L273 TraceCheckUtils]: 46: Hoare triple {10690#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10690#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:24,920 INFO L273 TraceCheckUtils]: 47: Hoare triple {10690#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {10691#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:24,920 INFO L273 TraceCheckUtils]: 48: Hoare triple {10691#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10691#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:24,921 INFO L273 TraceCheckUtils]: 49: Hoare triple {10691#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10691#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:24,921 INFO L273 TraceCheckUtils]: 50: Hoare triple {10691#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {10692#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:24,922 INFO L273 TraceCheckUtils]: 51: Hoare triple {10692#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10692#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:24,922 INFO L273 TraceCheckUtils]: 52: Hoare triple {10692#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10692#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:24,923 INFO L273 TraceCheckUtils]: 53: Hoare triple {10692#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {10693#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:24,924 INFO L273 TraceCheckUtils]: 54: Hoare triple {10693#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10693#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:24,924 INFO L273 TraceCheckUtils]: 55: Hoare triple {10693#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10693#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:24,925 INFO L273 TraceCheckUtils]: 56: Hoare triple {10693#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {10694#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:24,925 INFO L273 TraceCheckUtils]: 57: Hoare triple {10694#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10694#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:24,926 INFO L273 TraceCheckUtils]: 58: Hoare triple {10694#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10694#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:24,927 INFO L273 TraceCheckUtils]: 59: Hoare triple {10694#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {10695#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:24,927 INFO L273 TraceCheckUtils]: 60: Hoare triple {10695#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10695#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:24,928 INFO L273 TraceCheckUtils]: 61: Hoare triple {10695#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10695#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:24,928 INFO L273 TraceCheckUtils]: 62: Hoare triple {10695#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {10696#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:24,929 INFO L273 TraceCheckUtils]: 63: Hoare triple {10696#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10696#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:24,929 INFO L273 TraceCheckUtils]: 64: Hoare triple {10696#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10696#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:24,930 INFO L273 TraceCheckUtils]: 65: Hoare triple {10696#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {10697#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:24,931 INFO L273 TraceCheckUtils]: 66: Hoare triple {10697#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10697#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:24,931 INFO L273 TraceCheckUtils]: 67: Hoare triple {10697#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10697#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:24,932 INFO L273 TraceCheckUtils]: 68: Hoare triple {10697#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {10698#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:24,933 INFO L273 TraceCheckUtils]: 69: Hoare triple {10698#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10698#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:24,933 INFO L273 TraceCheckUtils]: 70: Hoare triple {10698#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10698#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:24,934 INFO L273 TraceCheckUtils]: 71: Hoare triple {10698#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {10699#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:24,934 INFO L273 TraceCheckUtils]: 72: Hoare triple {10699#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10699#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:24,935 INFO L273 TraceCheckUtils]: 73: Hoare triple {10699#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10699#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:24,936 INFO L273 TraceCheckUtils]: 74: Hoare triple {10699#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {10700#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:24,936 INFO L273 TraceCheckUtils]: 75: Hoare triple {10700#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10700#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:24,937 INFO L273 TraceCheckUtils]: 76: Hoare triple {10700#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {10700#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:24,937 INFO L273 TraceCheckUtils]: 77: Hoare triple {10700#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {10701#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:24,938 INFO L273 TraceCheckUtils]: 78: Hoare triple {10701#(<= main_~i~0 24)} assume !(~i~0 < 100000); {10676#false} is VALID [2018-11-23 12:05:24,938 INFO L273 TraceCheckUtils]: 79: Hoare triple {10676#false} havoc ~x~0;~x~0 := 0; {10676#false} is VALID [2018-11-23 12:05:24,938 INFO L273 TraceCheckUtils]: 80: Hoare triple {10676#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10676#false} is VALID [2018-11-23 12:05:24,939 INFO L256 TraceCheckUtils]: 81: Hoare triple {10676#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {10676#false} is VALID [2018-11-23 12:05:24,939 INFO L273 TraceCheckUtils]: 82: Hoare triple {10676#false} ~cond := #in~cond; {10676#false} is VALID [2018-11-23 12:05:24,939 INFO L273 TraceCheckUtils]: 83: Hoare triple {10676#false} assume 0 == ~cond; {10676#false} is VALID [2018-11-23 12:05:24,939 INFO L273 TraceCheckUtils]: 84: Hoare triple {10676#false} assume !false; {10676#false} is VALID [2018-11-23 12:05:24,944 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:24,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:24,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 12:05:24,965 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-11-23 12:05:24,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:24,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:05:25,049 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 12:05:25,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:05:25,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:05:25,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:05:25,051 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand 28 states. [2018-11-23 12:05:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:25,579 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2018-11-23 12:05:25,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:05:25,580 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-11-23 12:05:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:05:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 134 transitions. [2018-11-23 12:05:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:05:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 134 transitions. [2018-11-23 12:05:25,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 134 transitions. [2018-11-23 12:05:25,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:25,721 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:05:25,721 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:05:25,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:05:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:05:25,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-23 12:05:25,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:25,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 93 states. [2018-11-23 12:05:25,754 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 93 states. [2018-11-23 12:05:25,754 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 93 states. [2018-11-23 12:05:25,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:25,757 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2018-11-23 12:05:25,758 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2018-11-23 12:05:25,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:25,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:25,759 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 95 states. [2018-11-23 12:05:25,759 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 95 states. [2018-11-23 12:05:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:25,761 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2018-11-23 12:05:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2018-11-23 12:05:25,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:25,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:25,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:25,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 12:05:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 119 transitions. [2018-11-23 12:05:25,764 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 119 transitions. Word has length 85 [2018-11-23 12:05:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:25,765 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 119 transitions. [2018-11-23 12:05:25,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:05:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 119 transitions. [2018-11-23 12:05:25,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 12:05:25,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:25,766 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:25,767 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:25,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:25,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1810505699, now seen corresponding path program 25 times [2018-11-23 12:05:25,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:25,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:25,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:25,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:25,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:27,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {11415#true} call ULTIMATE.init(); {11415#true} is VALID [2018-11-23 12:05:27,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {11415#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11415#true} is VALID [2018-11-23 12:05:27,000 INFO L273 TraceCheckUtils]: 2: Hoare triple {11415#true} assume true; {11415#true} is VALID [2018-11-23 12:05:27,000 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11415#true} {11415#true} #55#return; {11415#true} is VALID [2018-11-23 12:05:27,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {11415#true} call #t~ret4 := main(); {11415#true} is VALID [2018-11-23 12:05:27,002 INFO L273 TraceCheckUtils]: 5: Hoare triple {11415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {11417#(= main_~i~0 0)} is VALID [2018-11-23 12:05:27,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {11417#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11417#(= main_~i~0 0)} is VALID [2018-11-23 12:05:27,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {11417#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11417#(= main_~i~0 0)} is VALID [2018-11-23 12:05:27,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {11417#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {11418#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {11418#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11418#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {11418#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11418#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {11418#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {11419#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {11419#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11419#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {11419#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11419#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,012 INFO L273 TraceCheckUtils]: 14: Hoare triple {11419#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {11420#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,014 INFO L273 TraceCheckUtils]: 15: Hoare triple {11420#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11420#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,014 INFO L273 TraceCheckUtils]: 16: Hoare triple {11420#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11420#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,016 INFO L273 TraceCheckUtils]: 17: Hoare triple {11420#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {11421#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,016 INFO L273 TraceCheckUtils]: 18: Hoare triple {11421#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11421#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,019 INFO L273 TraceCheckUtils]: 19: Hoare triple {11421#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11421#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,019 INFO L273 TraceCheckUtils]: 20: Hoare triple {11421#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {11422#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {11422#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11422#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,022 INFO L273 TraceCheckUtils]: 22: Hoare triple {11422#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11422#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,024 INFO L273 TraceCheckUtils]: 23: Hoare triple {11422#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {11423#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,024 INFO L273 TraceCheckUtils]: 24: Hoare triple {11423#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11423#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,026 INFO L273 TraceCheckUtils]: 25: Hoare triple {11423#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11423#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,026 INFO L273 TraceCheckUtils]: 26: Hoare triple {11423#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {11424#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,028 INFO L273 TraceCheckUtils]: 27: Hoare triple {11424#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11424#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,028 INFO L273 TraceCheckUtils]: 28: Hoare triple {11424#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11424#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,030 INFO L273 TraceCheckUtils]: 29: Hoare triple {11424#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {11425#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:27,033 INFO L273 TraceCheckUtils]: 30: Hoare triple {11425#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11425#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:27,036 INFO L273 TraceCheckUtils]: 31: Hoare triple {11425#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11425#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:27,038 INFO L273 TraceCheckUtils]: 32: Hoare triple {11425#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {11426#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:27,038 INFO L273 TraceCheckUtils]: 33: Hoare triple {11426#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11426#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:27,040 INFO L273 TraceCheckUtils]: 34: Hoare triple {11426#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11426#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:27,040 INFO L273 TraceCheckUtils]: 35: Hoare triple {11426#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {11427#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:27,042 INFO L273 TraceCheckUtils]: 36: Hoare triple {11427#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11427#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:27,042 INFO L273 TraceCheckUtils]: 37: Hoare triple {11427#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11427#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:27,044 INFO L273 TraceCheckUtils]: 38: Hoare triple {11427#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {11428#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:27,044 INFO L273 TraceCheckUtils]: 39: Hoare triple {11428#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11428#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:27,047 INFO L273 TraceCheckUtils]: 40: Hoare triple {11428#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11428#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:27,047 INFO L273 TraceCheckUtils]: 41: Hoare triple {11428#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {11429#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:27,049 INFO L273 TraceCheckUtils]: 42: Hoare triple {11429#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11429#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:27,049 INFO L273 TraceCheckUtils]: 43: Hoare triple {11429#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11429#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:27,052 INFO L273 TraceCheckUtils]: 44: Hoare triple {11429#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {11430#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:27,052 INFO L273 TraceCheckUtils]: 45: Hoare triple {11430#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11430#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:27,054 INFO L273 TraceCheckUtils]: 46: Hoare triple {11430#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11430#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:27,054 INFO L273 TraceCheckUtils]: 47: Hoare triple {11430#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {11431#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:27,057 INFO L273 TraceCheckUtils]: 48: Hoare triple {11431#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11431#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:27,057 INFO L273 TraceCheckUtils]: 49: Hoare triple {11431#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11431#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:27,059 INFO L273 TraceCheckUtils]: 50: Hoare triple {11431#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {11432#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:27,059 INFO L273 TraceCheckUtils]: 51: Hoare triple {11432#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11432#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:27,061 INFO L273 TraceCheckUtils]: 52: Hoare triple {11432#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11432#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:27,061 INFO L273 TraceCheckUtils]: 53: Hoare triple {11432#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {11433#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:27,064 INFO L273 TraceCheckUtils]: 54: Hoare triple {11433#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11433#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:27,064 INFO L273 TraceCheckUtils]: 55: Hoare triple {11433#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11433#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:27,067 INFO L273 TraceCheckUtils]: 56: Hoare triple {11433#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {11434#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:27,067 INFO L273 TraceCheckUtils]: 57: Hoare triple {11434#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11434#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:27,069 INFO L273 TraceCheckUtils]: 58: Hoare triple {11434#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11434#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:27,069 INFO L273 TraceCheckUtils]: 59: Hoare triple {11434#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {11435#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:27,071 INFO L273 TraceCheckUtils]: 60: Hoare triple {11435#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11435#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:27,071 INFO L273 TraceCheckUtils]: 61: Hoare triple {11435#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11435#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:27,073 INFO L273 TraceCheckUtils]: 62: Hoare triple {11435#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {11436#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:27,073 INFO L273 TraceCheckUtils]: 63: Hoare triple {11436#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11436#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:27,075 INFO L273 TraceCheckUtils]: 64: Hoare triple {11436#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11436#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:27,075 INFO L273 TraceCheckUtils]: 65: Hoare triple {11436#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {11437#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:27,077 INFO L273 TraceCheckUtils]: 66: Hoare triple {11437#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11437#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:27,077 INFO L273 TraceCheckUtils]: 67: Hoare triple {11437#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11437#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:27,079 INFO L273 TraceCheckUtils]: 68: Hoare triple {11437#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {11438#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:27,079 INFO L273 TraceCheckUtils]: 69: Hoare triple {11438#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11438#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:27,082 INFO L273 TraceCheckUtils]: 70: Hoare triple {11438#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11438#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:27,082 INFO L273 TraceCheckUtils]: 71: Hoare triple {11438#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {11439#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:27,084 INFO L273 TraceCheckUtils]: 72: Hoare triple {11439#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11439#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:27,084 INFO L273 TraceCheckUtils]: 73: Hoare triple {11439#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11439#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:27,086 INFO L273 TraceCheckUtils]: 74: Hoare triple {11439#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {11440#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:27,086 INFO L273 TraceCheckUtils]: 75: Hoare triple {11440#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11440#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:27,088 INFO L273 TraceCheckUtils]: 76: Hoare triple {11440#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11440#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:27,088 INFO L273 TraceCheckUtils]: 77: Hoare triple {11440#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {11441#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:27,090 INFO L273 TraceCheckUtils]: 78: Hoare triple {11441#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11441#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:27,090 INFO L273 TraceCheckUtils]: 79: Hoare triple {11441#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11441#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:27,092 INFO L273 TraceCheckUtils]: 80: Hoare triple {11441#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {11442#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:27,092 INFO L273 TraceCheckUtils]: 81: Hoare triple {11442#(<= main_~i~0 25)} assume !(~i~0 < 100000); {11416#false} is VALID [2018-11-23 12:05:27,092 INFO L273 TraceCheckUtils]: 82: Hoare triple {11416#false} havoc ~x~0;~x~0 := 0; {11416#false} is VALID [2018-11-23 12:05:27,092 INFO L273 TraceCheckUtils]: 83: Hoare triple {11416#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11416#false} is VALID [2018-11-23 12:05:27,092 INFO L256 TraceCheckUtils]: 84: Hoare triple {11416#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {11416#false} is VALID [2018-11-23 12:05:27,093 INFO L273 TraceCheckUtils]: 85: Hoare triple {11416#false} ~cond := #in~cond; {11416#false} is VALID [2018-11-23 12:05:27,093 INFO L273 TraceCheckUtils]: 86: Hoare triple {11416#false} assume 0 == ~cond; {11416#false} is VALID [2018-11-23 12:05:27,093 INFO L273 TraceCheckUtils]: 87: Hoare triple {11416#false} assume !false; {11416#false} is VALID [2018-11-23 12:05:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:27,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:27,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:27,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:27,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:27,450 INFO L256 TraceCheckUtils]: 0: Hoare triple {11415#true} call ULTIMATE.init(); {11415#true} is VALID [2018-11-23 12:05:27,451 INFO L273 TraceCheckUtils]: 1: Hoare triple {11415#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11415#true} is VALID [2018-11-23 12:05:27,451 INFO L273 TraceCheckUtils]: 2: Hoare triple {11415#true} assume true; {11415#true} is VALID [2018-11-23 12:05:27,451 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11415#true} {11415#true} #55#return; {11415#true} is VALID [2018-11-23 12:05:27,451 INFO L256 TraceCheckUtils]: 4: Hoare triple {11415#true} call #t~ret4 := main(); {11415#true} is VALID [2018-11-23 12:05:27,452 INFO L273 TraceCheckUtils]: 5: Hoare triple {11415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {11461#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:27,452 INFO L273 TraceCheckUtils]: 6: Hoare triple {11461#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11461#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:27,453 INFO L273 TraceCheckUtils]: 7: Hoare triple {11461#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11461#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:27,453 INFO L273 TraceCheckUtils]: 8: Hoare triple {11461#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {11418#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,453 INFO L273 TraceCheckUtils]: 9: Hoare triple {11418#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11418#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,454 INFO L273 TraceCheckUtils]: 10: Hoare triple {11418#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11418#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,454 INFO L273 TraceCheckUtils]: 11: Hoare triple {11418#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {11419#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,455 INFO L273 TraceCheckUtils]: 12: Hoare triple {11419#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11419#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,455 INFO L273 TraceCheckUtils]: 13: Hoare triple {11419#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11419#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,456 INFO L273 TraceCheckUtils]: 14: Hoare triple {11419#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {11420#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,456 INFO L273 TraceCheckUtils]: 15: Hoare triple {11420#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11420#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {11420#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11420#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,458 INFO L273 TraceCheckUtils]: 17: Hoare triple {11420#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {11421#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,458 INFO L273 TraceCheckUtils]: 18: Hoare triple {11421#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11421#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {11421#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11421#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,459 INFO L273 TraceCheckUtils]: 20: Hoare triple {11421#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {11422#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,460 INFO L273 TraceCheckUtils]: 21: Hoare triple {11422#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11422#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,460 INFO L273 TraceCheckUtils]: 22: Hoare triple {11422#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11422#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,461 INFO L273 TraceCheckUtils]: 23: Hoare triple {11422#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {11423#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,462 INFO L273 TraceCheckUtils]: 24: Hoare triple {11423#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11423#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,462 INFO L273 TraceCheckUtils]: 25: Hoare triple {11423#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11423#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,463 INFO L273 TraceCheckUtils]: 26: Hoare triple {11423#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {11424#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,463 INFO L273 TraceCheckUtils]: 27: Hoare triple {11424#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11424#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,464 INFO L273 TraceCheckUtils]: 28: Hoare triple {11424#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11424#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,464 INFO L273 TraceCheckUtils]: 29: Hoare triple {11424#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {11425#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:27,465 INFO L273 TraceCheckUtils]: 30: Hoare triple {11425#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11425#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:27,465 INFO L273 TraceCheckUtils]: 31: Hoare triple {11425#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11425#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:27,466 INFO L273 TraceCheckUtils]: 32: Hoare triple {11425#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {11426#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:27,467 INFO L273 TraceCheckUtils]: 33: Hoare triple {11426#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11426#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:27,467 INFO L273 TraceCheckUtils]: 34: Hoare triple {11426#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11426#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:27,468 INFO L273 TraceCheckUtils]: 35: Hoare triple {11426#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {11427#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:27,468 INFO L273 TraceCheckUtils]: 36: Hoare triple {11427#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11427#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:27,469 INFO L273 TraceCheckUtils]: 37: Hoare triple {11427#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11427#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:27,469 INFO L273 TraceCheckUtils]: 38: Hoare triple {11427#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {11428#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:27,470 INFO L273 TraceCheckUtils]: 39: Hoare triple {11428#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11428#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:27,470 INFO L273 TraceCheckUtils]: 40: Hoare triple {11428#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11428#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:27,471 INFO L273 TraceCheckUtils]: 41: Hoare triple {11428#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {11429#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:27,472 INFO L273 TraceCheckUtils]: 42: Hoare triple {11429#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11429#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:27,472 INFO L273 TraceCheckUtils]: 43: Hoare triple {11429#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11429#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:27,473 INFO L273 TraceCheckUtils]: 44: Hoare triple {11429#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {11430#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:27,473 INFO L273 TraceCheckUtils]: 45: Hoare triple {11430#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11430#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:27,474 INFO L273 TraceCheckUtils]: 46: Hoare triple {11430#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11430#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:27,474 INFO L273 TraceCheckUtils]: 47: Hoare triple {11430#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {11431#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:27,475 INFO L273 TraceCheckUtils]: 48: Hoare triple {11431#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11431#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:27,475 INFO L273 TraceCheckUtils]: 49: Hoare triple {11431#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11431#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:27,476 INFO L273 TraceCheckUtils]: 50: Hoare triple {11431#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {11432#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:27,477 INFO L273 TraceCheckUtils]: 51: Hoare triple {11432#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11432#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:27,477 INFO L273 TraceCheckUtils]: 52: Hoare triple {11432#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11432#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:27,478 INFO L273 TraceCheckUtils]: 53: Hoare triple {11432#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {11433#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:27,478 INFO L273 TraceCheckUtils]: 54: Hoare triple {11433#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11433#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:27,479 INFO L273 TraceCheckUtils]: 55: Hoare triple {11433#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11433#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:27,480 INFO L273 TraceCheckUtils]: 56: Hoare triple {11433#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {11434#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:27,480 INFO L273 TraceCheckUtils]: 57: Hoare triple {11434#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11434#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:27,481 INFO L273 TraceCheckUtils]: 58: Hoare triple {11434#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11434#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:27,481 INFO L273 TraceCheckUtils]: 59: Hoare triple {11434#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {11435#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:27,482 INFO L273 TraceCheckUtils]: 60: Hoare triple {11435#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11435#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:27,482 INFO L273 TraceCheckUtils]: 61: Hoare triple {11435#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11435#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:27,483 INFO L273 TraceCheckUtils]: 62: Hoare triple {11435#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {11436#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:27,484 INFO L273 TraceCheckUtils]: 63: Hoare triple {11436#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11436#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:27,484 INFO L273 TraceCheckUtils]: 64: Hoare triple {11436#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11436#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:27,485 INFO L273 TraceCheckUtils]: 65: Hoare triple {11436#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {11437#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:27,485 INFO L273 TraceCheckUtils]: 66: Hoare triple {11437#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11437#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:27,486 INFO L273 TraceCheckUtils]: 67: Hoare triple {11437#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11437#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:27,487 INFO L273 TraceCheckUtils]: 68: Hoare triple {11437#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {11438#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:27,487 INFO L273 TraceCheckUtils]: 69: Hoare triple {11438#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11438#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:27,488 INFO L273 TraceCheckUtils]: 70: Hoare triple {11438#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11438#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:27,488 INFO L273 TraceCheckUtils]: 71: Hoare triple {11438#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {11439#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:27,489 INFO L273 TraceCheckUtils]: 72: Hoare triple {11439#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11439#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:27,489 INFO L273 TraceCheckUtils]: 73: Hoare triple {11439#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11439#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:27,490 INFO L273 TraceCheckUtils]: 74: Hoare triple {11439#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {11440#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:27,491 INFO L273 TraceCheckUtils]: 75: Hoare triple {11440#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11440#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:27,491 INFO L273 TraceCheckUtils]: 76: Hoare triple {11440#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11440#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:27,492 INFO L273 TraceCheckUtils]: 77: Hoare triple {11440#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {11441#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:27,492 INFO L273 TraceCheckUtils]: 78: Hoare triple {11441#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11441#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:27,493 INFO L273 TraceCheckUtils]: 79: Hoare triple {11441#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11441#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:27,493 INFO L273 TraceCheckUtils]: 80: Hoare triple {11441#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {11442#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:27,494 INFO L273 TraceCheckUtils]: 81: Hoare triple {11442#(<= main_~i~0 25)} assume !(~i~0 < 100000); {11416#false} is VALID [2018-11-23 12:05:27,494 INFO L273 TraceCheckUtils]: 82: Hoare triple {11416#false} havoc ~x~0;~x~0 := 0; {11416#false} is VALID [2018-11-23 12:05:27,495 INFO L273 TraceCheckUtils]: 83: Hoare triple {11416#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11416#false} is VALID [2018-11-23 12:05:27,495 INFO L256 TraceCheckUtils]: 84: Hoare triple {11416#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {11416#false} is VALID [2018-11-23 12:05:27,495 INFO L273 TraceCheckUtils]: 85: Hoare triple {11416#false} ~cond := #in~cond; {11416#false} is VALID [2018-11-23 12:05:27,495 INFO L273 TraceCheckUtils]: 86: Hoare triple {11416#false} assume 0 == ~cond; {11416#false} is VALID [2018-11-23 12:05:27,495 INFO L273 TraceCheckUtils]: 87: Hoare triple {11416#false} assume !false; {11416#false} is VALID [2018-11-23 12:05:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:27,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:27,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:05:27,522 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-11-23 12:05:27,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:27,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:05:27,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:27,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:05:27,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:05:27,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:05:27,610 INFO L87 Difference]: Start difference. First operand 93 states and 119 transitions. Second operand 29 states. [2018-11-23 12:05:28,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:28,243 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2018-11-23 12:05:28,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:05:28,243 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-11-23 12:05:28,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:05:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 138 transitions. [2018-11-23 12:05:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:05:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 138 transitions. [2018-11-23 12:05:28,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 138 transitions. [2018-11-23 12:05:28,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:28,375 INFO L225 Difference]: With dead ends: 109 [2018-11-23 12:05:28,375 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 12:05:28,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:05:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 12:05:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-23 12:05:28,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:28,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 96 states. [2018-11-23 12:05:28,409 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 96 states. [2018-11-23 12:05:28,409 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 96 states. [2018-11-23 12:05:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:28,411 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2018-11-23 12:05:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2018-11-23 12:05:28,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:28,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:28,411 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 98 states. [2018-11-23 12:05:28,411 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 98 states. [2018-11-23 12:05:28,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:28,412 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2018-11-23 12:05:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2018-11-23 12:05:28,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:28,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:28,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:28,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 12:05:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2018-11-23 12:05:28,414 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 88 [2018-11-23 12:05:28,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:28,415 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2018-11-23 12:05:28,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:05:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2018-11-23 12:05:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 12:05:28,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:28,416 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:28,416 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:28,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:28,416 INFO L82 PathProgramCache]: Analyzing trace with hash -378658439, now seen corresponding path program 26 times [2018-11-23 12:05:28,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:28,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:28,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:28,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:28,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:29,683 INFO L256 TraceCheckUtils]: 0: Hoare triple {12179#true} call ULTIMATE.init(); {12179#true} is VALID [2018-11-23 12:05:29,684 INFO L273 TraceCheckUtils]: 1: Hoare triple {12179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12179#true} is VALID [2018-11-23 12:05:29,684 INFO L273 TraceCheckUtils]: 2: Hoare triple {12179#true} assume true; {12179#true} is VALID [2018-11-23 12:05:29,684 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12179#true} {12179#true} #55#return; {12179#true} is VALID [2018-11-23 12:05:29,685 INFO L256 TraceCheckUtils]: 4: Hoare triple {12179#true} call #t~ret4 := main(); {12179#true} is VALID [2018-11-23 12:05:29,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {12179#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {12181#(= main_~i~0 0)} is VALID [2018-11-23 12:05:29,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {12181#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12181#(= main_~i~0 0)} is VALID [2018-11-23 12:05:29,686 INFO L273 TraceCheckUtils]: 7: Hoare triple {12181#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12181#(= main_~i~0 0)} is VALID [2018-11-23 12:05:29,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {12181#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {12182#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,687 INFO L273 TraceCheckUtils]: 9: Hoare triple {12182#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12182#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {12182#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12182#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {12182#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12183#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,688 INFO L273 TraceCheckUtils]: 12: Hoare triple {12183#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12183#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {12183#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12183#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {12183#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12184#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,689 INFO L273 TraceCheckUtils]: 15: Hoare triple {12184#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12184#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {12184#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12184#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,690 INFO L273 TraceCheckUtils]: 17: Hoare triple {12184#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12185#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,691 INFO L273 TraceCheckUtils]: 18: Hoare triple {12185#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12185#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,691 INFO L273 TraceCheckUtils]: 19: Hoare triple {12185#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12185#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,692 INFO L273 TraceCheckUtils]: 20: Hoare triple {12185#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12186#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,693 INFO L273 TraceCheckUtils]: 21: Hoare triple {12186#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12186#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,693 INFO L273 TraceCheckUtils]: 22: Hoare triple {12186#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12186#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,694 INFO L273 TraceCheckUtils]: 23: Hoare triple {12186#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12187#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,694 INFO L273 TraceCheckUtils]: 24: Hoare triple {12187#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12187#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,695 INFO L273 TraceCheckUtils]: 25: Hoare triple {12187#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12187#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,696 INFO L273 TraceCheckUtils]: 26: Hoare triple {12187#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12188#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,696 INFO L273 TraceCheckUtils]: 27: Hoare triple {12188#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12188#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,697 INFO L273 TraceCheckUtils]: 28: Hoare triple {12188#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12188#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,698 INFO L273 TraceCheckUtils]: 29: Hoare triple {12188#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12189#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,698 INFO L273 TraceCheckUtils]: 30: Hoare triple {12189#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12189#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,699 INFO L273 TraceCheckUtils]: 31: Hoare triple {12189#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12189#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,699 INFO L273 TraceCheckUtils]: 32: Hoare triple {12189#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12190#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:29,700 INFO L273 TraceCheckUtils]: 33: Hoare triple {12190#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12190#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:29,700 INFO L273 TraceCheckUtils]: 34: Hoare triple {12190#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12190#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:29,701 INFO L273 TraceCheckUtils]: 35: Hoare triple {12190#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12191#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:29,702 INFO L273 TraceCheckUtils]: 36: Hoare triple {12191#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12191#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:29,702 INFO L273 TraceCheckUtils]: 37: Hoare triple {12191#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12191#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:29,703 INFO L273 TraceCheckUtils]: 38: Hoare triple {12191#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12192#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:29,703 INFO L273 TraceCheckUtils]: 39: Hoare triple {12192#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12192#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:29,704 INFO L273 TraceCheckUtils]: 40: Hoare triple {12192#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12192#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:29,705 INFO L273 TraceCheckUtils]: 41: Hoare triple {12192#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12193#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:29,705 INFO L273 TraceCheckUtils]: 42: Hoare triple {12193#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12193#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:29,706 INFO L273 TraceCheckUtils]: 43: Hoare triple {12193#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12193#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:29,706 INFO L273 TraceCheckUtils]: 44: Hoare triple {12193#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12194#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:29,707 INFO L273 TraceCheckUtils]: 45: Hoare triple {12194#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12194#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:29,708 INFO L273 TraceCheckUtils]: 46: Hoare triple {12194#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12194#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:29,708 INFO L273 TraceCheckUtils]: 47: Hoare triple {12194#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12195#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:29,709 INFO L273 TraceCheckUtils]: 48: Hoare triple {12195#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12195#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:29,709 INFO L273 TraceCheckUtils]: 49: Hoare triple {12195#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12195#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:29,710 INFO L273 TraceCheckUtils]: 50: Hoare triple {12195#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12196#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:29,711 INFO L273 TraceCheckUtils]: 51: Hoare triple {12196#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12196#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:29,711 INFO L273 TraceCheckUtils]: 52: Hoare triple {12196#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12196#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:29,712 INFO L273 TraceCheckUtils]: 53: Hoare triple {12196#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12197#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:29,712 INFO L273 TraceCheckUtils]: 54: Hoare triple {12197#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12197#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:29,713 INFO L273 TraceCheckUtils]: 55: Hoare triple {12197#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12197#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:29,714 INFO L273 TraceCheckUtils]: 56: Hoare triple {12197#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12198#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:29,714 INFO L273 TraceCheckUtils]: 57: Hoare triple {12198#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12198#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:29,715 INFO L273 TraceCheckUtils]: 58: Hoare triple {12198#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12198#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:29,715 INFO L273 TraceCheckUtils]: 59: Hoare triple {12198#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12199#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:29,716 INFO L273 TraceCheckUtils]: 60: Hoare triple {12199#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12199#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:29,716 INFO L273 TraceCheckUtils]: 61: Hoare triple {12199#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12199#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:29,719 INFO L273 TraceCheckUtils]: 62: Hoare triple {12199#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12200#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:29,720 INFO L273 TraceCheckUtils]: 63: Hoare triple {12200#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12200#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:29,721 INFO L273 TraceCheckUtils]: 64: Hoare triple {12200#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12200#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:29,721 INFO L273 TraceCheckUtils]: 65: Hoare triple {12200#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12201#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:29,721 INFO L273 TraceCheckUtils]: 66: Hoare triple {12201#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12201#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:29,722 INFO L273 TraceCheckUtils]: 67: Hoare triple {12201#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12201#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:29,722 INFO L273 TraceCheckUtils]: 68: Hoare triple {12201#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {12202#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:29,722 INFO L273 TraceCheckUtils]: 69: Hoare triple {12202#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12202#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:29,723 INFO L273 TraceCheckUtils]: 70: Hoare triple {12202#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12202#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:29,724 INFO L273 TraceCheckUtils]: 71: Hoare triple {12202#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {12203#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:29,724 INFO L273 TraceCheckUtils]: 72: Hoare triple {12203#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12203#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:29,725 INFO L273 TraceCheckUtils]: 73: Hoare triple {12203#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12203#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:29,725 INFO L273 TraceCheckUtils]: 74: Hoare triple {12203#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {12204#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:29,726 INFO L273 TraceCheckUtils]: 75: Hoare triple {12204#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12204#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:29,726 INFO L273 TraceCheckUtils]: 76: Hoare triple {12204#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12204#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:29,727 INFO L273 TraceCheckUtils]: 77: Hoare triple {12204#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {12205#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:29,728 INFO L273 TraceCheckUtils]: 78: Hoare triple {12205#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12205#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:29,728 INFO L273 TraceCheckUtils]: 79: Hoare triple {12205#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12205#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:29,729 INFO L273 TraceCheckUtils]: 80: Hoare triple {12205#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {12206#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:29,730 INFO L273 TraceCheckUtils]: 81: Hoare triple {12206#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12206#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:29,730 INFO L273 TraceCheckUtils]: 82: Hoare triple {12206#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12206#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:29,731 INFO L273 TraceCheckUtils]: 83: Hoare triple {12206#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {12207#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:29,731 INFO L273 TraceCheckUtils]: 84: Hoare triple {12207#(<= main_~i~0 26)} assume !(~i~0 < 100000); {12180#false} is VALID [2018-11-23 12:05:29,732 INFO L273 TraceCheckUtils]: 85: Hoare triple {12180#false} havoc ~x~0;~x~0 := 0; {12180#false} is VALID [2018-11-23 12:05:29,732 INFO L273 TraceCheckUtils]: 86: Hoare triple {12180#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12180#false} is VALID [2018-11-23 12:05:29,732 INFO L256 TraceCheckUtils]: 87: Hoare triple {12180#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {12180#false} is VALID [2018-11-23 12:05:29,732 INFO L273 TraceCheckUtils]: 88: Hoare triple {12180#false} ~cond := #in~cond; {12180#false} is VALID [2018-11-23 12:05:29,733 INFO L273 TraceCheckUtils]: 89: Hoare triple {12180#false} assume 0 == ~cond; {12180#false} is VALID [2018-11-23 12:05:29,733 INFO L273 TraceCheckUtils]: 90: Hoare triple {12180#false} assume !false; {12180#false} is VALID [2018-11-23 12:05:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:29,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:29,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:29,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:29,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:29,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:29,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:30,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {12179#true} call ULTIMATE.init(); {12179#true} is VALID [2018-11-23 12:05:30,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {12179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12179#true} is VALID [2018-11-23 12:05:30,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {12179#true} assume true; {12179#true} is VALID [2018-11-23 12:05:30,019 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12179#true} {12179#true} #55#return; {12179#true} is VALID [2018-11-23 12:05:30,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {12179#true} call #t~ret4 := main(); {12179#true} is VALID [2018-11-23 12:05:30,020 INFO L273 TraceCheckUtils]: 5: Hoare triple {12179#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {12226#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:30,021 INFO L273 TraceCheckUtils]: 6: Hoare triple {12226#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12226#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:30,021 INFO L273 TraceCheckUtils]: 7: Hoare triple {12226#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12226#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:30,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {12226#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {12182#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:30,048 INFO L273 TraceCheckUtils]: 9: Hoare triple {12182#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12182#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:30,048 INFO L273 TraceCheckUtils]: 10: Hoare triple {12182#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12182#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:30,049 INFO L273 TraceCheckUtils]: 11: Hoare triple {12182#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12183#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:30,049 INFO L273 TraceCheckUtils]: 12: Hoare triple {12183#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12183#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:30,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {12183#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12183#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:30,050 INFO L273 TraceCheckUtils]: 14: Hoare triple {12183#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12184#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:30,050 INFO L273 TraceCheckUtils]: 15: Hoare triple {12184#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12184#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:30,050 INFO L273 TraceCheckUtils]: 16: Hoare triple {12184#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12184#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:30,051 INFO L273 TraceCheckUtils]: 17: Hoare triple {12184#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12185#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:30,051 INFO L273 TraceCheckUtils]: 18: Hoare triple {12185#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12185#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:30,051 INFO L273 TraceCheckUtils]: 19: Hoare triple {12185#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12185#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:30,052 INFO L273 TraceCheckUtils]: 20: Hoare triple {12185#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12186#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:30,052 INFO L273 TraceCheckUtils]: 21: Hoare triple {12186#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12186#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:30,053 INFO L273 TraceCheckUtils]: 22: Hoare triple {12186#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12186#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:30,054 INFO L273 TraceCheckUtils]: 23: Hoare triple {12186#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12187#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:30,054 INFO L273 TraceCheckUtils]: 24: Hoare triple {12187#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12187#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:30,055 INFO L273 TraceCheckUtils]: 25: Hoare triple {12187#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12187#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:30,055 INFO L273 TraceCheckUtils]: 26: Hoare triple {12187#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12188#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:30,056 INFO L273 TraceCheckUtils]: 27: Hoare triple {12188#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12188#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:30,056 INFO L273 TraceCheckUtils]: 28: Hoare triple {12188#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12188#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:30,057 INFO L273 TraceCheckUtils]: 29: Hoare triple {12188#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12189#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:30,058 INFO L273 TraceCheckUtils]: 30: Hoare triple {12189#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12189#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:30,058 INFO L273 TraceCheckUtils]: 31: Hoare triple {12189#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12189#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:30,059 INFO L273 TraceCheckUtils]: 32: Hoare triple {12189#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12190#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:30,059 INFO L273 TraceCheckUtils]: 33: Hoare triple {12190#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12190#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:30,060 INFO L273 TraceCheckUtils]: 34: Hoare triple {12190#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12190#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:30,064 INFO L273 TraceCheckUtils]: 35: Hoare triple {12190#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12191#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:30,064 INFO L273 TraceCheckUtils]: 36: Hoare triple {12191#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12191#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:30,065 INFO L273 TraceCheckUtils]: 37: Hoare triple {12191#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12191#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:30,066 INFO L273 TraceCheckUtils]: 38: Hoare triple {12191#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12192#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:30,066 INFO L273 TraceCheckUtils]: 39: Hoare triple {12192#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12192#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:30,066 INFO L273 TraceCheckUtils]: 40: Hoare triple {12192#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12192#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:30,067 INFO L273 TraceCheckUtils]: 41: Hoare triple {12192#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12193#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:30,067 INFO L273 TraceCheckUtils]: 42: Hoare triple {12193#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12193#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:30,067 INFO L273 TraceCheckUtils]: 43: Hoare triple {12193#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12193#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:30,068 INFO L273 TraceCheckUtils]: 44: Hoare triple {12193#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12194#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:30,068 INFO L273 TraceCheckUtils]: 45: Hoare triple {12194#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12194#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:30,068 INFO L273 TraceCheckUtils]: 46: Hoare triple {12194#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12194#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:30,069 INFO L273 TraceCheckUtils]: 47: Hoare triple {12194#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12195#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:30,070 INFO L273 TraceCheckUtils]: 48: Hoare triple {12195#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12195#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:30,070 INFO L273 TraceCheckUtils]: 49: Hoare triple {12195#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12195#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:30,071 INFO L273 TraceCheckUtils]: 50: Hoare triple {12195#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12196#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:30,071 INFO L273 TraceCheckUtils]: 51: Hoare triple {12196#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12196#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:30,072 INFO L273 TraceCheckUtils]: 52: Hoare triple {12196#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12196#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:30,073 INFO L273 TraceCheckUtils]: 53: Hoare triple {12196#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12197#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:30,073 INFO L273 TraceCheckUtils]: 54: Hoare triple {12197#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12197#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:30,074 INFO L273 TraceCheckUtils]: 55: Hoare triple {12197#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12197#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:30,074 INFO L273 TraceCheckUtils]: 56: Hoare triple {12197#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12198#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:30,075 INFO L273 TraceCheckUtils]: 57: Hoare triple {12198#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12198#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:30,075 INFO L273 TraceCheckUtils]: 58: Hoare triple {12198#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12198#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:30,076 INFO L273 TraceCheckUtils]: 59: Hoare triple {12198#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12199#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:30,077 INFO L273 TraceCheckUtils]: 60: Hoare triple {12199#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12199#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:30,077 INFO L273 TraceCheckUtils]: 61: Hoare triple {12199#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12199#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:30,078 INFO L273 TraceCheckUtils]: 62: Hoare triple {12199#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12200#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:30,078 INFO L273 TraceCheckUtils]: 63: Hoare triple {12200#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12200#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:30,079 INFO L273 TraceCheckUtils]: 64: Hoare triple {12200#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12200#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:30,080 INFO L273 TraceCheckUtils]: 65: Hoare triple {12200#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12201#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:30,080 INFO L273 TraceCheckUtils]: 66: Hoare triple {12201#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12201#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:30,081 INFO L273 TraceCheckUtils]: 67: Hoare triple {12201#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12201#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:30,081 INFO L273 TraceCheckUtils]: 68: Hoare triple {12201#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {12202#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:30,082 INFO L273 TraceCheckUtils]: 69: Hoare triple {12202#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12202#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:30,083 INFO L273 TraceCheckUtils]: 70: Hoare triple {12202#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12202#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:30,083 INFO L273 TraceCheckUtils]: 71: Hoare triple {12202#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {12203#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:30,084 INFO L273 TraceCheckUtils]: 72: Hoare triple {12203#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12203#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:30,084 INFO L273 TraceCheckUtils]: 73: Hoare triple {12203#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12203#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:30,085 INFO L273 TraceCheckUtils]: 74: Hoare triple {12203#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {12204#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:30,086 INFO L273 TraceCheckUtils]: 75: Hoare triple {12204#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12204#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:30,086 INFO L273 TraceCheckUtils]: 76: Hoare triple {12204#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12204#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:30,087 INFO L273 TraceCheckUtils]: 77: Hoare triple {12204#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {12205#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:30,087 INFO L273 TraceCheckUtils]: 78: Hoare triple {12205#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12205#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:30,088 INFO L273 TraceCheckUtils]: 79: Hoare triple {12205#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12205#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:30,089 INFO L273 TraceCheckUtils]: 80: Hoare triple {12205#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {12206#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:30,089 INFO L273 TraceCheckUtils]: 81: Hoare triple {12206#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12206#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:30,090 INFO L273 TraceCheckUtils]: 82: Hoare triple {12206#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12206#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:30,090 INFO L273 TraceCheckUtils]: 83: Hoare triple {12206#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {12207#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:30,091 INFO L273 TraceCheckUtils]: 84: Hoare triple {12207#(<= main_~i~0 26)} assume !(~i~0 < 100000); {12180#false} is VALID [2018-11-23 12:05:30,091 INFO L273 TraceCheckUtils]: 85: Hoare triple {12180#false} havoc ~x~0;~x~0 := 0; {12180#false} is VALID [2018-11-23 12:05:30,092 INFO L273 TraceCheckUtils]: 86: Hoare triple {12180#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12180#false} is VALID [2018-11-23 12:05:30,092 INFO L256 TraceCheckUtils]: 87: Hoare triple {12180#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {12180#false} is VALID [2018-11-23 12:05:30,092 INFO L273 TraceCheckUtils]: 88: Hoare triple {12180#false} ~cond := #in~cond; {12180#false} is VALID [2018-11-23 12:05:30,092 INFO L273 TraceCheckUtils]: 89: Hoare triple {12180#false} assume 0 == ~cond; {12180#false} is VALID [2018-11-23 12:05:30,092 INFO L273 TraceCheckUtils]: 90: Hoare triple {12180#false} assume !false; {12180#false} is VALID [2018-11-23 12:05:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:30,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:30,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:05:30,119 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-23 12:05:30,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:30,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:05:30,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:30,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:05:30,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:05:30,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:05:30,212 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand 30 states. [2018-11-23 12:05:30,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:30,899 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2018-11-23 12:05:30,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:05:30,899 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-23 12:05:30,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:05:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 142 transitions. [2018-11-23 12:05:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:05:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 142 transitions. [2018-11-23 12:05:30,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 142 transitions. [2018-11-23 12:05:31,319 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 12:05:31,321 INFO L225 Difference]: With dead ends: 112 [2018-11-23 12:05:31,321 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:05:31,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:05:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:05:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-23 12:05:31,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:31,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2018-11-23 12:05:31,377 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2018-11-23 12:05:31,377 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2018-11-23 12:05:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:31,378 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2018-11-23 12:05:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2018-11-23 12:05:31,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:31,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:31,379 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2018-11-23 12:05:31,379 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2018-11-23 12:05:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:31,381 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2018-11-23 12:05:31,381 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2018-11-23 12:05:31,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:31,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:31,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:31,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 12:05:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2018-11-23 12:05:31,383 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 91 [2018-11-23 12:05:31,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:31,384 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2018-11-23 12:05:31,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:05:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2018-11-23 12:05:31,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 12:05:31,384 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:31,385 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:31,385 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:31,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:31,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1310896163, now seen corresponding path program 27 times [2018-11-23 12:05:31,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:31,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:31,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:31,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:31,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:32,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {12967#true} call ULTIMATE.init(); {12967#true} is VALID [2018-11-23 12:05:32,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {12967#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12967#true} is VALID [2018-11-23 12:05:32,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {12967#true} assume true; {12967#true} is VALID [2018-11-23 12:05:32,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12967#true} {12967#true} #55#return; {12967#true} is VALID [2018-11-23 12:05:32,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {12967#true} call #t~ret4 := main(); {12967#true} is VALID [2018-11-23 12:05:32,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {12967#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {12969#(= main_~i~0 0)} is VALID [2018-11-23 12:05:32,477 INFO L273 TraceCheckUtils]: 6: Hoare triple {12969#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12969#(= main_~i~0 0)} is VALID [2018-11-23 12:05:32,477 INFO L273 TraceCheckUtils]: 7: Hoare triple {12969#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12969#(= main_~i~0 0)} is VALID [2018-11-23 12:05:32,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {12969#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {12970#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:32,478 INFO L273 TraceCheckUtils]: 9: Hoare triple {12970#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12970#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:32,479 INFO L273 TraceCheckUtils]: 10: Hoare triple {12970#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12970#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:32,480 INFO L273 TraceCheckUtils]: 11: Hoare triple {12970#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12971#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:32,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {12971#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12971#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:32,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {12971#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12971#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:32,481 INFO L273 TraceCheckUtils]: 14: Hoare triple {12971#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12972#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:32,482 INFO L273 TraceCheckUtils]: 15: Hoare triple {12972#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12972#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:32,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {12972#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12972#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:32,483 INFO L273 TraceCheckUtils]: 17: Hoare triple {12972#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12973#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:32,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {12973#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12973#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:32,484 INFO L273 TraceCheckUtils]: 19: Hoare triple {12973#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12973#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:32,485 INFO L273 TraceCheckUtils]: 20: Hoare triple {12973#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12974#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:32,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {12974#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12974#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:32,486 INFO L273 TraceCheckUtils]: 22: Hoare triple {12974#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12974#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:32,487 INFO L273 TraceCheckUtils]: 23: Hoare triple {12974#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12975#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:32,487 INFO L273 TraceCheckUtils]: 24: Hoare triple {12975#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12975#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:32,488 INFO L273 TraceCheckUtils]: 25: Hoare triple {12975#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12975#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:32,489 INFO L273 TraceCheckUtils]: 26: Hoare triple {12975#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12976#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:32,489 INFO L273 TraceCheckUtils]: 27: Hoare triple {12976#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12976#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:32,490 INFO L273 TraceCheckUtils]: 28: Hoare triple {12976#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12976#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:32,490 INFO L273 TraceCheckUtils]: 29: Hoare triple {12976#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12977#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:32,491 INFO L273 TraceCheckUtils]: 30: Hoare triple {12977#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12977#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:32,491 INFO L273 TraceCheckUtils]: 31: Hoare triple {12977#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12977#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:32,492 INFO L273 TraceCheckUtils]: 32: Hoare triple {12977#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12978#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:32,493 INFO L273 TraceCheckUtils]: 33: Hoare triple {12978#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12978#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:32,493 INFO L273 TraceCheckUtils]: 34: Hoare triple {12978#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12978#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:32,494 INFO L273 TraceCheckUtils]: 35: Hoare triple {12978#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12979#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:32,495 INFO L273 TraceCheckUtils]: 36: Hoare triple {12979#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12979#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:32,495 INFO L273 TraceCheckUtils]: 37: Hoare triple {12979#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12979#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:32,496 INFO L273 TraceCheckUtils]: 38: Hoare triple {12979#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12980#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:32,496 INFO L273 TraceCheckUtils]: 39: Hoare triple {12980#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12980#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:32,497 INFO L273 TraceCheckUtils]: 40: Hoare triple {12980#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12980#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:32,498 INFO L273 TraceCheckUtils]: 41: Hoare triple {12980#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12981#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:32,498 INFO L273 TraceCheckUtils]: 42: Hoare triple {12981#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12981#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:32,499 INFO L273 TraceCheckUtils]: 43: Hoare triple {12981#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12981#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:32,499 INFO L273 TraceCheckUtils]: 44: Hoare triple {12981#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12982#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:32,500 INFO L273 TraceCheckUtils]: 45: Hoare triple {12982#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12982#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:32,500 INFO L273 TraceCheckUtils]: 46: Hoare triple {12982#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12982#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:32,501 INFO L273 TraceCheckUtils]: 47: Hoare triple {12982#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12983#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:32,502 INFO L273 TraceCheckUtils]: 48: Hoare triple {12983#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12983#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:32,502 INFO L273 TraceCheckUtils]: 49: Hoare triple {12983#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12983#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:32,503 INFO L273 TraceCheckUtils]: 50: Hoare triple {12983#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12984#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:32,503 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12984#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:32,504 INFO L273 TraceCheckUtils]: 52: Hoare triple {12984#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12984#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:32,505 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12985#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:32,505 INFO L273 TraceCheckUtils]: 54: Hoare triple {12985#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12985#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:32,506 INFO L273 TraceCheckUtils]: 55: Hoare triple {12985#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12985#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:32,507 INFO L273 TraceCheckUtils]: 56: Hoare triple {12985#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12986#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:32,507 INFO L273 TraceCheckUtils]: 57: Hoare triple {12986#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12986#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:32,508 INFO L273 TraceCheckUtils]: 58: Hoare triple {12986#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12986#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:32,508 INFO L273 TraceCheckUtils]: 59: Hoare triple {12986#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12987#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:32,509 INFO L273 TraceCheckUtils]: 60: Hoare triple {12987#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12987#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:32,509 INFO L273 TraceCheckUtils]: 61: Hoare triple {12987#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12987#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:32,510 INFO L273 TraceCheckUtils]: 62: Hoare triple {12987#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12988#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:32,511 INFO L273 TraceCheckUtils]: 63: Hoare triple {12988#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12988#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:32,511 INFO L273 TraceCheckUtils]: 64: Hoare triple {12988#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12988#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:32,512 INFO L273 TraceCheckUtils]: 65: Hoare triple {12988#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12989#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:32,512 INFO L273 TraceCheckUtils]: 66: Hoare triple {12989#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12989#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:32,513 INFO L273 TraceCheckUtils]: 67: Hoare triple {12989#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12989#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:32,514 INFO L273 TraceCheckUtils]: 68: Hoare triple {12989#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {12990#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:32,514 INFO L273 TraceCheckUtils]: 69: Hoare triple {12990#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12990#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:32,515 INFO L273 TraceCheckUtils]: 70: Hoare triple {12990#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12990#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:32,515 INFO L273 TraceCheckUtils]: 71: Hoare triple {12990#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {12991#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:32,516 INFO L273 TraceCheckUtils]: 72: Hoare triple {12991#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12991#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:32,517 INFO L273 TraceCheckUtils]: 73: Hoare triple {12991#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12991#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:32,517 INFO L273 TraceCheckUtils]: 74: Hoare triple {12991#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {12992#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:32,518 INFO L273 TraceCheckUtils]: 75: Hoare triple {12992#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12992#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:32,518 INFO L273 TraceCheckUtils]: 76: Hoare triple {12992#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12992#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:32,519 INFO L273 TraceCheckUtils]: 77: Hoare triple {12992#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {12993#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:32,520 INFO L273 TraceCheckUtils]: 78: Hoare triple {12993#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12993#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:32,520 INFO L273 TraceCheckUtils]: 79: Hoare triple {12993#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12993#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:32,521 INFO L273 TraceCheckUtils]: 80: Hoare triple {12993#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {12994#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:32,521 INFO L273 TraceCheckUtils]: 81: Hoare triple {12994#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12994#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:32,522 INFO L273 TraceCheckUtils]: 82: Hoare triple {12994#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12994#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:32,523 INFO L273 TraceCheckUtils]: 83: Hoare triple {12994#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {12995#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:32,523 INFO L273 TraceCheckUtils]: 84: Hoare triple {12995#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12995#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:32,524 INFO L273 TraceCheckUtils]: 85: Hoare triple {12995#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12995#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:32,524 INFO L273 TraceCheckUtils]: 86: Hoare triple {12995#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {12996#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:32,525 INFO L273 TraceCheckUtils]: 87: Hoare triple {12996#(<= main_~i~0 27)} assume !(~i~0 < 100000); {12968#false} is VALID [2018-11-23 12:05:32,525 INFO L273 TraceCheckUtils]: 88: Hoare triple {12968#false} havoc ~x~0;~x~0 := 0; {12968#false} is VALID [2018-11-23 12:05:32,526 INFO L273 TraceCheckUtils]: 89: Hoare triple {12968#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12968#false} is VALID [2018-11-23 12:05:32,526 INFO L256 TraceCheckUtils]: 90: Hoare triple {12968#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {12968#false} is VALID [2018-11-23 12:05:32,526 INFO L273 TraceCheckUtils]: 91: Hoare triple {12968#false} ~cond := #in~cond; {12968#false} is VALID [2018-11-23 12:05:32,526 INFO L273 TraceCheckUtils]: 92: Hoare triple {12968#false} assume 0 == ~cond; {12968#false} is VALID [2018-11-23 12:05:32,526 INFO L273 TraceCheckUtils]: 93: Hoare triple {12968#false} assume !false; {12968#false} is VALID [2018-11-23 12:05:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:32,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:32,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:32,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:32,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-23 12:05:32,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:32,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:32,840 INFO L256 TraceCheckUtils]: 0: Hoare triple {12967#true} call ULTIMATE.init(); {12967#true} is VALID [2018-11-23 12:05:32,841 INFO L273 TraceCheckUtils]: 1: Hoare triple {12967#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12967#true} is VALID [2018-11-23 12:05:32,841 INFO L273 TraceCheckUtils]: 2: Hoare triple {12967#true} assume true; {12967#true} is VALID [2018-11-23 12:05:32,841 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12967#true} {12967#true} #55#return; {12967#true} is VALID [2018-11-23 12:05:32,842 INFO L256 TraceCheckUtils]: 4: Hoare triple {12967#true} call #t~ret4 := main(); {12967#true} is VALID [2018-11-23 12:05:32,842 INFO L273 TraceCheckUtils]: 5: Hoare triple {12967#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {13015#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:32,843 INFO L273 TraceCheckUtils]: 6: Hoare triple {13015#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13015#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:32,843 INFO L273 TraceCheckUtils]: 7: Hoare triple {13015#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13015#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:32,844 INFO L273 TraceCheckUtils]: 8: Hoare triple {13015#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {12970#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:32,844 INFO L273 TraceCheckUtils]: 9: Hoare triple {12970#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12970#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:32,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {12970#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12970#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:32,845 INFO L273 TraceCheckUtils]: 11: Hoare triple {12970#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12971#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:32,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {12971#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12971#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:32,846 INFO L273 TraceCheckUtils]: 13: Hoare triple {12971#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12971#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:32,846 INFO L273 TraceCheckUtils]: 14: Hoare triple {12971#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12972#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:32,847 INFO L273 TraceCheckUtils]: 15: Hoare triple {12972#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12972#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:32,847 INFO L273 TraceCheckUtils]: 16: Hoare triple {12972#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12972#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:32,848 INFO L273 TraceCheckUtils]: 17: Hoare triple {12972#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12973#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:32,849 INFO L273 TraceCheckUtils]: 18: Hoare triple {12973#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12973#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:32,849 INFO L273 TraceCheckUtils]: 19: Hoare triple {12973#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12973#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:32,850 INFO L273 TraceCheckUtils]: 20: Hoare triple {12973#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12974#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:32,850 INFO L273 TraceCheckUtils]: 21: Hoare triple {12974#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12974#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:32,851 INFO L273 TraceCheckUtils]: 22: Hoare triple {12974#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12974#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:32,852 INFO L273 TraceCheckUtils]: 23: Hoare triple {12974#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12975#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:32,852 INFO L273 TraceCheckUtils]: 24: Hoare triple {12975#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12975#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:32,853 INFO L273 TraceCheckUtils]: 25: Hoare triple {12975#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12975#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:32,854 INFO L273 TraceCheckUtils]: 26: Hoare triple {12975#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12976#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:32,854 INFO L273 TraceCheckUtils]: 27: Hoare triple {12976#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12976#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:32,855 INFO L273 TraceCheckUtils]: 28: Hoare triple {12976#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12976#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:32,855 INFO L273 TraceCheckUtils]: 29: Hoare triple {12976#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12977#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:32,856 INFO L273 TraceCheckUtils]: 30: Hoare triple {12977#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12977#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:32,856 INFO L273 TraceCheckUtils]: 31: Hoare triple {12977#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12977#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:32,857 INFO L273 TraceCheckUtils]: 32: Hoare triple {12977#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12978#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:32,858 INFO L273 TraceCheckUtils]: 33: Hoare triple {12978#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12978#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:32,858 INFO L273 TraceCheckUtils]: 34: Hoare triple {12978#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12978#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:32,859 INFO L273 TraceCheckUtils]: 35: Hoare triple {12978#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12979#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:32,860 INFO L273 TraceCheckUtils]: 36: Hoare triple {12979#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12979#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:32,860 INFO L273 TraceCheckUtils]: 37: Hoare triple {12979#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12979#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:32,861 INFO L273 TraceCheckUtils]: 38: Hoare triple {12979#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12980#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:32,861 INFO L273 TraceCheckUtils]: 39: Hoare triple {12980#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12980#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:32,862 INFO L273 TraceCheckUtils]: 40: Hoare triple {12980#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12980#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:32,863 INFO L273 TraceCheckUtils]: 41: Hoare triple {12980#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12981#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:32,863 INFO L273 TraceCheckUtils]: 42: Hoare triple {12981#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12981#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:32,864 INFO L273 TraceCheckUtils]: 43: Hoare triple {12981#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12981#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:32,864 INFO L273 TraceCheckUtils]: 44: Hoare triple {12981#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12982#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:32,865 INFO L273 TraceCheckUtils]: 45: Hoare triple {12982#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12982#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:32,865 INFO L273 TraceCheckUtils]: 46: Hoare triple {12982#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12982#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:32,866 INFO L273 TraceCheckUtils]: 47: Hoare triple {12982#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12983#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:32,867 INFO L273 TraceCheckUtils]: 48: Hoare triple {12983#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12983#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:32,867 INFO L273 TraceCheckUtils]: 49: Hoare triple {12983#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12983#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:32,868 INFO L273 TraceCheckUtils]: 50: Hoare triple {12983#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12984#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:32,868 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12984#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:32,869 INFO L273 TraceCheckUtils]: 52: Hoare triple {12984#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12984#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:32,870 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12985#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:32,870 INFO L273 TraceCheckUtils]: 54: Hoare triple {12985#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12985#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:32,871 INFO L273 TraceCheckUtils]: 55: Hoare triple {12985#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12985#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:32,871 INFO L273 TraceCheckUtils]: 56: Hoare triple {12985#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12986#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:32,872 INFO L273 TraceCheckUtils]: 57: Hoare triple {12986#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12986#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:32,873 INFO L273 TraceCheckUtils]: 58: Hoare triple {12986#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12986#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:32,873 INFO L273 TraceCheckUtils]: 59: Hoare triple {12986#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12987#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:32,874 INFO L273 TraceCheckUtils]: 60: Hoare triple {12987#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12987#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:32,874 INFO L273 TraceCheckUtils]: 61: Hoare triple {12987#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12987#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:32,875 INFO L273 TraceCheckUtils]: 62: Hoare triple {12987#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12988#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:32,876 INFO L273 TraceCheckUtils]: 63: Hoare triple {12988#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12988#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:32,876 INFO L273 TraceCheckUtils]: 64: Hoare triple {12988#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12988#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:32,877 INFO L273 TraceCheckUtils]: 65: Hoare triple {12988#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12989#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:32,877 INFO L273 TraceCheckUtils]: 66: Hoare triple {12989#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12989#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:32,878 INFO L273 TraceCheckUtils]: 67: Hoare triple {12989#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12989#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:32,879 INFO L273 TraceCheckUtils]: 68: Hoare triple {12989#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {12990#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:32,879 INFO L273 TraceCheckUtils]: 69: Hoare triple {12990#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12990#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:32,880 INFO L273 TraceCheckUtils]: 70: Hoare triple {12990#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12990#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:32,880 INFO L273 TraceCheckUtils]: 71: Hoare triple {12990#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {12991#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:32,881 INFO L273 TraceCheckUtils]: 72: Hoare triple {12991#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12991#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:32,882 INFO L273 TraceCheckUtils]: 73: Hoare triple {12991#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12991#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:32,882 INFO L273 TraceCheckUtils]: 74: Hoare triple {12991#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {12992#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:32,883 INFO L273 TraceCheckUtils]: 75: Hoare triple {12992#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12992#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:32,883 INFO L273 TraceCheckUtils]: 76: Hoare triple {12992#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12992#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:32,884 INFO L273 TraceCheckUtils]: 77: Hoare triple {12992#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {12993#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:32,885 INFO L273 TraceCheckUtils]: 78: Hoare triple {12993#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12993#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:32,885 INFO L273 TraceCheckUtils]: 79: Hoare triple {12993#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12993#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:32,886 INFO L273 TraceCheckUtils]: 80: Hoare triple {12993#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {12994#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:32,886 INFO L273 TraceCheckUtils]: 81: Hoare triple {12994#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12994#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:32,887 INFO L273 TraceCheckUtils]: 82: Hoare triple {12994#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12994#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:32,888 INFO L273 TraceCheckUtils]: 83: Hoare triple {12994#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {12995#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:32,888 INFO L273 TraceCheckUtils]: 84: Hoare triple {12995#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12995#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:32,889 INFO L273 TraceCheckUtils]: 85: Hoare triple {12995#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {12995#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:32,889 INFO L273 TraceCheckUtils]: 86: Hoare triple {12995#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {12996#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:32,890 INFO L273 TraceCheckUtils]: 87: Hoare triple {12996#(<= main_~i~0 27)} assume !(~i~0 < 100000); {12968#false} is VALID [2018-11-23 12:05:32,890 INFO L273 TraceCheckUtils]: 88: Hoare triple {12968#false} havoc ~x~0;~x~0 := 0; {12968#false} is VALID [2018-11-23 12:05:32,891 INFO L273 TraceCheckUtils]: 89: Hoare triple {12968#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12968#false} is VALID [2018-11-23 12:05:32,891 INFO L256 TraceCheckUtils]: 90: Hoare triple {12968#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {12968#false} is VALID [2018-11-23 12:05:32,891 INFO L273 TraceCheckUtils]: 91: Hoare triple {12968#false} ~cond := #in~cond; {12968#false} is VALID [2018-11-23 12:05:32,891 INFO L273 TraceCheckUtils]: 92: Hoare triple {12968#false} assume 0 == ~cond; {12968#false} is VALID [2018-11-23 12:05:32,891 INFO L273 TraceCheckUtils]: 93: Hoare triple {12968#false} assume !false; {12968#false} is VALID [2018-11-23 12:05:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:32,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:32,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 12:05:32,918 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2018-11-23 12:05:32,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:32,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:05:33,012 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 12:05:33,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:05:33,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:05:33,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:05:33,014 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand 31 states. [2018-11-23 12:05:34,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:34,489 INFO L93 Difference]: Finished difference Result 115 states and 146 transitions. [2018-11-23 12:05:34,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:05:34,489 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2018-11-23 12:05:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:05:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 146 transitions. [2018-11-23 12:05:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:05:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 146 transitions. [2018-11-23 12:05:34,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 146 transitions. [2018-11-23 12:05:34,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:34,648 INFO L225 Difference]: With dead ends: 115 [2018-11-23 12:05:34,649 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 12:05:34,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:05:34,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 12:05:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-23 12:05:34,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:34,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 102 states. [2018-11-23 12:05:34,673 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 102 states. [2018-11-23 12:05:34,673 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 102 states. [2018-11-23 12:05:34,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:34,675 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2018-11-23 12:05:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2018-11-23 12:05:34,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:34,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:34,676 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 104 states. [2018-11-23 12:05:34,676 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 104 states. [2018-11-23 12:05:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:34,678 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2018-11-23 12:05:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2018-11-23 12:05:34,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:34,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:34,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:34,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 12:05:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2018-11-23 12:05:34,681 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 94 [2018-11-23 12:05:34,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:34,681 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2018-11-23 12:05:34,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:05:34,682 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2018-11-23 12:05:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 12:05:34,682 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:34,682 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:34,683 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:34,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:34,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2110302521, now seen corresponding path program 28 times [2018-11-23 12:05:34,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:34,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:34,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:34,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:34,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:35,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {13779#true} call ULTIMATE.init(); {13779#true} is VALID [2018-11-23 12:05:35,737 INFO L273 TraceCheckUtils]: 1: Hoare triple {13779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13779#true} is VALID [2018-11-23 12:05:35,737 INFO L273 TraceCheckUtils]: 2: Hoare triple {13779#true} assume true; {13779#true} is VALID [2018-11-23 12:05:35,738 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13779#true} {13779#true} #55#return; {13779#true} is VALID [2018-11-23 12:05:35,738 INFO L256 TraceCheckUtils]: 4: Hoare triple {13779#true} call #t~ret4 := main(); {13779#true} is VALID [2018-11-23 12:05:35,738 INFO L273 TraceCheckUtils]: 5: Hoare triple {13779#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {13781#(= main_~i~0 0)} is VALID [2018-11-23 12:05:35,739 INFO L273 TraceCheckUtils]: 6: Hoare triple {13781#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13781#(= main_~i~0 0)} is VALID [2018-11-23 12:05:35,739 INFO L273 TraceCheckUtils]: 7: Hoare triple {13781#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13781#(= main_~i~0 0)} is VALID [2018-11-23 12:05:35,740 INFO L273 TraceCheckUtils]: 8: Hoare triple {13781#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {13782#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:35,740 INFO L273 TraceCheckUtils]: 9: Hoare triple {13782#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13782#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:35,740 INFO L273 TraceCheckUtils]: 10: Hoare triple {13782#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13782#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:35,741 INFO L273 TraceCheckUtils]: 11: Hoare triple {13782#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {13783#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,741 INFO L273 TraceCheckUtils]: 12: Hoare triple {13783#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13783#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {13783#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13783#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {13783#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {13784#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {13784#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13784#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,745 INFO L273 TraceCheckUtils]: 16: Hoare triple {13784#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13784#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,745 INFO L273 TraceCheckUtils]: 17: Hoare triple {13784#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {13785#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,746 INFO L273 TraceCheckUtils]: 18: Hoare triple {13785#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13785#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,746 INFO L273 TraceCheckUtils]: 19: Hoare triple {13785#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13785#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,747 INFO L273 TraceCheckUtils]: 20: Hoare triple {13785#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {13786#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,747 INFO L273 TraceCheckUtils]: 21: Hoare triple {13786#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13786#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,747 INFO L273 TraceCheckUtils]: 22: Hoare triple {13786#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13786#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,748 INFO L273 TraceCheckUtils]: 23: Hoare triple {13786#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {13787#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,748 INFO L273 TraceCheckUtils]: 24: Hoare triple {13787#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13787#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,749 INFO L273 TraceCheckUtils]: 25: Hoare triple {13787#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13787#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,749 INFO L273 TraceCheckUtils]: 26: Hoare triple {13787#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {13788#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,750 INFO L273 TraceCheckUtils]: 27: Hoare triple {13788#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13788#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,751 INFO L273 TraceCheckUtils]: 28: Hoare triple {13788#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13788#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,751 INFO L273 TraceCheckUtils]: 29: Hoare triple {13788#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {13789#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,752 INFO L273 TraceCheckUtils]: 30: Hoare triple {13789#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13789#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,752 INFO L273 TraceCheckUtils]: 31: Hoare triple {13789#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13789#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,753 INFO L273 TraceCheckUtils]: 32: Hoare triple {13789#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {13790#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {13790#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13790#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,754 INFO L273 TraceCheckUtils]: 34: Hoare triple {13790#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13790#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,755 INFO L273 TraceCheckUtils]: 35: Hoare triple {13790#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {13791#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,755 INFO L273 TraceCheckUtils]: 36: Hoare triple {13791#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13791#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,756 INFO L273 TraceCheckUtils]: 37: Hoare triple {13791#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13791#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,757 INFO L273 TraceCheckUtils]: 38: Hoare triple {13791#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {13792#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,757 INFO L273 TraceCheckUtils]: 39: Hoare triple {13792#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13792#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,758 INFO L273 TraceCheckUtils]: 40: Hoare triple {13792#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13792#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,758 INFO L273 TraceCheckUtils]: 41: Hoare triple {13792#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {13793#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:35,759 INFO L273 TraceCheckUtils]: 42: Hoare triple {13793#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13793#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:35,759 INFO L273 TraceCheckUtils]: 43: Hoare triple {13793#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13793#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:35,760 INFO L273 TraceCheckUtils]: 44: Hoare triple {13793#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {13794#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:35,761 INFO L273 TraceCheckUtils]: 45: Hoare triple {13794#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13794#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:35,761 INFO L273 TraceCheckUtils]: 46: Hoare triple {13794#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13794#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:35,762 INFO L273 TraceCheckUtils]: 47: Hoare triple {13794#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {13795#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:35,763 INFO L273 TraceCheckUtils]: 48: Hoare triple {13795#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13795#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:35,763 INFO L273 TraceCheckUtils]: 49: Hoare triple {13795#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13795#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:35,764 INFO L273 TraceCheckUtils]: 50: Hoare triple {13795#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {13796#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:35,764 INFO L273 TraceCheckUtils]: 51: Hoare triple {13796#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13796#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:35,765 INFO L273 TraceCheckUtils]: 52: Hoare triple {13796#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13796#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:35,766 INFO L273 TraceCheckUtils]: 53: Hoare triple {13796#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {13797#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:35,766 INFO L273 TraceCheckUtils]: 54: Hoare triple {13797#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13797#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:35,767 INFO L273 TraceCheckUtils]: 55: Hoare triple {13797#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13797#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:35,767 INFO L273 TraceCheckUtils]: 56: Hoare triple {13797#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {13798#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:35,768 INFO L273 TraceCheckUtils]: 57: Hoare triple {13798#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13798#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:35,768 INFO L273 TraceCheckUtils]: 58: Hoare triple {13798#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13798#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:35,769 INFO L273 TraceCheckUtils]: 59: Hoare triple {13798#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {13799#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:35,770 INFO L273 TraceCheckUtils]: 60: Hoare triple {13799#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13799#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:35,770 INFO L273 TraceCheckUtils]: 61: Hoare triple {13799#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13799#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:35,771 INFO L273 TraceCheckUtils]: 62: Hoare triple {13799#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {13800#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:35,772 INFO L273 TraceCheckUtils]: 63: Hoare triple {13800#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13800#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:35,772 INFO L273 TraceCheckUtils]: 64: Hoare triple {13800#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13800#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:35,773 INFO L273 TraceCheckUtils]: 65: Hoare triple {13800#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {13801#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:35,773 INFO L273 TraceCheckUtils]: 66: Hoare triple {13801#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13801#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:35,774 INFO L273 TraceCheckUtils]: 67: Hoare triple {13801#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13801#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:35,775 INFO L273 TraceCheckUtils]: 68: Hoare triple {13801#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {13802#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:35,775 INFO L273 TraceCheckUtils]: 69: Hoare triple {13802#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13802#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:35,776 INFO L273 TraceCheckUtils]: 70: Hoare triple {13802#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13802#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:35,776 INFO L273 TraceCheckUtils]: 71: Hoare triple {13802#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {13803#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:35,777 INFO L273 TraceCheckUtils]: 72: Hoare triple {13803#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13803#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:35,777 INFO L273 TraceCheckUtils]: 73: Hoare triple {13803#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13803#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:35,778 INFO L273 TraceCheckUtils]: 74: Hoare triple {13803#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {13804#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:35,779 INFO L273 TraceCheckUtils]: 75: Hoare triple {13804#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13804#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:35,779 INFO L273 TraceCheckUtils]: 76: Hoare triple {13804#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13804#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:35,780 INFO L273 TraceCheckUtils]: 77: Hoare triple {13804#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {13805#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:35,780 INFO L273 TraceCheckUtils]: 78: Hoare triple {13805#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13805#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:35,781 INFO L273 TraceCheckUtils]: 79: Hoare triple {13805#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13805#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:35,782 INFO L273 TraceCheckUtils]: 80: Hoare triple {13805#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {13806#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:35,782 INFO L273 TraceCheckUtils]: 81: Hoare triple {13806#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13806#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:35,783 INFO L273 TraceCheckUtils]: 82: Hoare triple {13806#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13806#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:35,783 INFO L273 TraceCheckUtils]: 83: Hoare triple {13806#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {13807#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:35,784 INFO L273 TraceCheckUtils]: 84: Hoare triple {13807#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13807#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:35,785 INFO L273 TraceCheckUtils]: 85: Hoare triple {13807#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13807#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:35,785 INFO L273 TraceCheckUtils]: 86: Hoare triple {13807#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {13808#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:35,786 INFO L273 TraceCheckUtils]: 87: Hoare triple {13808#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13808#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:35,786 INFO L273 TraceCheckUtils]: 88: Hoare triple {13808#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13808#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:35,787 INFO L273 TraceCheckUtils]: 89: Hoare triple {13808#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {13809#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:35,788 INFO L273 TraceCheckUtils]: 90: Hoare triple {13809#(<= main_~i~0 28)} assume !(~i~0 < 100000); {13780#false} is VALID [2018-11-23 12:05:35,788 INFO L273 TraceCheckUtils]: 91: Hoare triple {13780#false} havoc ~x~0;~x~0 := 0; {13780#false} is VALID [2018-11-23 12:05:35,788 INFO L273 TraceCheckUtils]: 92: Hoare triple {13780#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13780#false} is VALID [2018-11-23 12:05:35,788 INFO L256 TraceCheckUtils]: 93: Hoare triple {13780#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {13780#false} is VALID [2018-11-23 12:05:35,789 INFO L273 TraceCheckUtils]: 94: Hoare triple {13780#false} ~cond := #in~cond; {13780#false} is VALID [2018-11-23 12:05:35,789 INFO L273 TraceCheckUtils]: 95: Hoare triple {13780#false} assume 0 == ~cond; {13780#false} is VALID [2018-11-23 12:05:35,789 INFO L273 TraceCheckUtils]: 96: Hoare triple {13780#false} assume !false; {13780#false} is VALID [2018-11-23 12:05:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:35,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:35,796 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:35,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:35,851 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:35,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:35,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:36,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {13779#true} call ULTIMATE.init(); {13779#true} is VALID [2018-11-23 12:05:36,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {13779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13779#true} is VALID [2018-11-23 12:05:36,120 INFO L273 TraceCheckUtils]: 2: Hoare triple {13779#true} assume true; {13779#true} is VALID [2018-11-23 12:05:36,120 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13779#true} {13779#true} #55#return; {13779#true} is VALID [2018-11-23 12:05:36,120 INFO L256 TraceCheckUtils]: 4: Hoare triple {13779#true} call #t~ret4 := main(); {13779#true} is VALID [2018-11-23 12:05:36,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {13779#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {13828#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:36,121 INFO L273 TraceCheckUtils]: 6: Hoare triple {13828#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13828#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:36,122 INFO L273 TraceCheckUtils]: 7: Hoare triple {13828#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13828#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:36,122 INFO L273 TraceCheckUtils]: 8: Hoare triple {13828#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {13782#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:36,123 INFO L273 TraceCheckUtils]: 9: Hoare triple {13782#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13782#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:36,123 INFO L273 TraceCheckUtils]: 10: Hoare triple {13782#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13782#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:36,123 INFO L273 TraceCheckUtils]: 11: Hoare triple {13782#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {13783#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:36,124 INFO L273 TraceCheckUtils]: 12: Hoare triple {13783#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13783#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:36,124 INFO L273 TraceCheckUtils]: 13: Hoare triple {13783#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13783#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:36,125 INFO L273 TraceCheckUtils]: 14: Hoare triple {13783#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {13784#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:36,126 INFO L273 TraceCheckUtils]: 15: Hoare triple {13784#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13784#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:36,126 INFO L273 TraceCheckUtils]: 16: Hoare triple {13784#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13784#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:36,127 INFO L273 TraceCheckUtils]: 17: Hoare triple {13784#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {13785#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:36,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {13785#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13785#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:36,128 INFO L273 TraceCheckUtils]: 19: Hoare triple {13785#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13785#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:36,129 INFO L273 TraceCheckUtils]: 20: Hoare triple {13785#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {13786#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:36,129 INFO L273 TraceCheckUtils]: 21: Hoare triple {13786#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13786#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:36,130 INFO L273 TraceCheckUtils]: 22: Hoare triple {13786#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13786#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:36,130 INFO L273 TraceCheckUtils]: 23: Hoare triple {13786#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {13787#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:36,131 INFO L273 TraceCheckUtils]: 24: Hoare triple {13787#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13787#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:36,131 INFO L273 TraceCheckUtils]: 25: Hoare triple {13787#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13787#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:36,132 INFO L273 TraceCheckUtils]: 26: Hoare triple {13787#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {13788#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:36,133 INFO L273 TraceCheckUtils]: 27: Hoare triple {13788#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13788#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:36,133 INFO L273 TraceCheckUtils]: 28: Hoare triple {13788#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13788#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:36,134 INFO L273 TraceCheckUtils]: 29: Hoare triple {13788#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {13789#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:36,135 INFO L273 TraceCheckUtils]: 30: Hoare triple {13789#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13789#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:36,135 INFO L273 TraceCheckUtils]: 31: Hoare triple {13789#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13789#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:36,136 INFO L273 TraceCheckUtils]: 32: Hoare triple {13789#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {13790#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:36,136 INFO L273 TraceCheckUtils]: 33: Hoare triple {13790#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13790#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:36,137 INFO L273 TraceCheckUtils]: 34: Hoare triple {13790#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13790#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:36,138 INFO L273 TraceCheckUtils]: 35: Hoare triple {13790#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {13791#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:36,138 INFO L273 TraceCheckUtils]: 36: Hoare triple {13791#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13791#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:36,139 INFO L273 TraceCheckUtils]: 37: Hoare triple {13791#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13791#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:36,139 INFO L273 TraceCheckUtils]: 38: Hoare triple {13791#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {13792#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:36,140 INFO L273 TraceCheckUtils]: 39: Hoare triple {13792#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13792#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:36,141 INFO L273 TraceCheckUtils]: 40: Hoare triple {13792#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13792#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:36,141 INFO L273 TraceCheckUtils]: 41: Hoare triple {13792#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {13793#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:36,142 INFO L273 TraceCheckUtils]: 42: Hoare triple {13793#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13793#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:36,142 INFO L273 TraceCheckUtils]: 43: Hoare triple {13793#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13793#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:36,143 INFO L273 TraceCheckUtils]: 44: Hoare triple {13793#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {13794#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:36,163 INFO L273 TraceCheckUtils]: 45: Hoare triple {13794#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13794#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:36,178 INFO L273 TraceCheckUtils]: 46: Hoare triple {13794#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13794#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:36,187 INFO L273 TraceCheckUtils]: 47: Hoare triple {13794#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {13795#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:36,193 INFO L273 TraceCheckUtils]: 48: Hoare triple {13795#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13795#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:36,194 INFO L273 TraceCheckUtils]: 49: Hoare triple {13795#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13795#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:36,194 INFO L273 TraceCheckUtils]: 50: Hoare triple {13795#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {13796#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:36,195 INFO L273 TraceCheckUtils]: 51: Hoare triple {13796#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13796#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:36,195 INFO L273 TraceCheckUtils]: 52: Hoare triple {13796#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13796#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:36,195 INFO L273 TraceCheckUtils]: 53: Hoare triple {13796#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {13797#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:36,196 INFO L273 TraceCheckUtils]: 54: Hoare triple {13797#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13797#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:36,196 INFO L273 TraceCheckUtils]: 55: Hoare triple {13797#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13797#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:36,197 INFO L273 TraceCheckUtils]: 56: Hoare triple {13797#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {13798#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:36,197 INFO L273 TraceCheckUtils]: 57: Hoare triple {13798#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13798#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:36,197 INFO L273 TraceCheckUtils]: 58: Hoare triple {13798#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13798#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:36,198 INFO L273 TraceCheckUtils]: 59: Hoare triple {13798#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {13799#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:36,198 INFO L273 TraceCheckUtils]: 60: Hoare triple {13799#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13799#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:36,199 INFO L273 TraceCheckUtils]: 61: Hoare triple {13799#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13799#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:36,199 INFO L273 TraceCheckUtils]: 62: Hoare triple {13799#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {13800#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:36,200 INFO L273 TraceCheckUtils]: 63: Hoare triple {13800#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13800#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:36,200 INFO L273 TraceCheckUtils]: 64: Hoare triple {13800#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13800#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:36,201 INFO L273 TraceCheckUtils]: 65: Hoare triple {13800#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {13801#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:36,202 INFO L273 TraceCheckUtils]: 66: Hoare triple {13801#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13801#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:36,202 INFO L273 TraceCheckUtils]: 67: Hoare triple {13801#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13801#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:36,203 INFO L273 TraceCheckUtils]: 68: Hoare triple {13801#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {13802#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:36,203 INFO L273 TraceCheckUtils]: 69: Hoare triple {13802#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13802#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:36,204 INFO L273 TraceCheckUtils]: 70: Hoare triple {13802#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13802#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:36,205 INFO L273 TraceCheckUtils]: 71: Hoare triple {13802#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {13803#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:36,206 INFO L273 TraceCheckUtils]: 72: Hoare triple {13803#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13803#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:36,206 INFO L273 TraceCheckUtils]: 73: Hoare triple {13803#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13803#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:36,207 INFO L273 TraceCheckUtils]: 74: Hoare triple {13803#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {13804#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:36,207 INFO L273 TraceCheckUtils]: 75: Hoare triple {13804#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13804#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:36,208 INFO L273 TraceCheckUtils]: 76: Hoare triple {13804#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13804#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:36,215 INFO L273 TraceCheckUtils]: 77: Hoare triple {13804#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {13805#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:36,215 INFO L273 TraceCheckUtils]: 78: Hoare triple {13805#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13805#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:36,216 INFO L273 TraceCheckUtils]: 79: Hoare triple {13805#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13805#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:36,216 INFO L273 TraceCheckUtils]: 80: Hoare triple {13805#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {13806#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:36,217 INFO L273 TraceCheckUtils]: 81: Hoare triple {13806#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13806#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:36,217 INFO L273 TraceCheckUtils]: 82: Hoare triple {13806#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13806#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:36,217 INFO L273 TraceCheckUtils]: 83: Hoare triple {13806#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {13807#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:36,218 INFO L273 TraceCheckUtils]: 84: Hoare triple {13807#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13807#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:36,218 INFO L273 TraceCheckUtils]: 85: Hoare triple {13807#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13807#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:36,218 INFO L273 TraceCheckUtils]: 86: Hoare triple {13807#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {13808#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:36,219 INFO L273 TraceCheckUtils]: 87: Hoare triple {13808#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13808#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:36,219 INFO L273 TraceCheckUtils]: 88: Hoare triple {13808#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {13808#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:36,220 INFO L273 TraceCheckUtils]: 89: Hoare triple {13808#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {13809#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:36,221 INFO L273 TraceCheckUtils]: 90: Hoare triple {13809#(<= main_~i~0 28)} assume !(~i~0 < 100000); {13780#false} is VALID [2018-11-23 12:05:36,221 INFO L273 TraceCheckUtils]: 91: Hoare triple {13780#false} havoc ~x~0;~x~0 := 0; {13780#false} is VALID [2018-11-23 12:05:36,221 INFO L273 TraceCheckUtils]: 92: Hoare triple {13780#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13780#false} is VALID [2018-11-23 12:05:36,221 INFO L256 TraceCheckUtils]: 93: Hoare triple {13780#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {13780#false} is VALID [2018-11-23 12:05:36,221 INFO L273 TraceCheckUtils]: 94: Hoare triple {13780#false} ~cond := #in~cond; {13780#false} is VALID [2018-11-23 12:05:36,222 INFO L273 TraceCheckUtils]: 95: Hoare triple {13780#false} assume 0 == ~cond; {13780#false} is VALID [2018-11-23 12:05:36,222 INFO L273 TraceCheckUtils]: 96: Hoare triple {13780#false} assume !false; {13780#false} is VALID [2018-11-23 12:05:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:36,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:36,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 12:05:36,249 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2018-11-23 12:05:36,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:36,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:05:36,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:36,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:05:36,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:05:36,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:05:36,386 INFO L87 Difference]: Start difference. First operand 102 states and 131 transitions. Second operand 32 states. [2018-11-23 12:05:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:37,322 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2018-11-23 12:05:37,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:05:37,322 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2018-11-23 12:05:37,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:05:37,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 150 transitions. [2018-11-23 12:05:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:05:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 150 transitions. [2018-11-23 12:05:37,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 150 transitions. [2018-11-23 12:05:37,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:37,501 INFO L225 Difference]: With dead ends: 118 [2018-11-23 12:05:37,501 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 12:05:37,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:05:37,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 12:05:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-11-23 12:05:37,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:37,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 105 states. [2018-11-23 12:05:37,530 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 105 states. [2018-11-23 12:05:37,530 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 105 states. [2018-11-23 12:05:37,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:37,532 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2018-11-23 12:05:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2018-11-23 12:05:37,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:37,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:37,532 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 107 states. [2018-11-23 12:05:37,533 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 107 states. [2018-11-23 12:05:37,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:37,534 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2018-11-23 12:05:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2018-11-23 12:05:37,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:37,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:37,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:37,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 12:05:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2018-11-23 12:05:37,537 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 97 [2018-11-23 12:05:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:37,538 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2018-11-23 12:05:37,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:05:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2018-11-23 12:05:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:05:37,538 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:37,539 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:37,539 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:37,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:37,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1631457379, now seen corresponding path program 29 times [2018-11-23 12:05:37,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:37,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:37,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:37,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:37,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:38,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {14615#true} call ULTIMATE.init(); {14615#true} is VALID [2018-11-23 12:05:38,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {14615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14615#true} is VALID [2018-11-23 12:05:38,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {14615#true} assume true; {14615#true} is VALID [2018-11-23 12:05:38,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14615#true} {14615#true} #55#return; {14615#true} is VALID [2018-11-23 12:05:38,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {14615#true} call #t~ret4 := main(); {14615#true} is VALID [2018-11-23 12:05:38,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {14615#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {14617#(= main_~i~0 0)} is VALID [2018-11-23 12:05:38,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {14617#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14617#(= main_~i~0 0)} is VALID [2018-11-23 12:05:38,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {14617#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14617#(= main_~i~0 0)} is VALID [2018-11-23 12:05:38,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {14617#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {14618#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,275 INFO L273 TraceCheckUtils]: 9: Hoare triple {14618#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14618#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {14618#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14618#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,285 INFO L273 TraceCheckUtils]: 11: Hoare triple {14618#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {14619#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,286 INFO L273 TraceCheckUtils]: 12: Hoare triple {14619#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14619#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,286 INFO L273 TraceCheckUtils]: 13: Hoare triple {14619#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14619#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {14619#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {14620#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,320 INFO L273 TraceCheckUtils]: 15: Hoare triple {14620#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14620#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,320 INFO L273 TraceCheckUtils]: 16: Hoare triple {14620#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14620#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,321 INFO L273 TraceCheckUtils]: 17: Hoare triple {14620#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {14621#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,321 INFO L273 TraceCheckUtils]: 18: Hoare triple {14621#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14621#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,321 INFO L273 TraceCheckUtils]: 19: Hoare triple {14621#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14621#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,322 INFO L273 TraceCheckUtils]: 20: Hoare triple {14621#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {14622#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,322 INFO L273 TraceCheckUtils]: 21: Hoare triple {14622#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14622#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,323 INFO L273 TraceCheckUtils]: 22: Hoare triple {14622#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14622#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,323 INFO L273 TraceCheckUtils]: 23: Hoare triple {14622#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {14623#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,323 INFO L273 TraceCheckUtils]: 24: Hoare triple {14623#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14623#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,324 INFO L273 TraceCheckUtils]: 25: Hoare triple {14623#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14623#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,324 INFO L273 TraceCheckUtils]: 26: Hoare triple {14623#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {14624#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,325 INFO L273 TraceCheckUtils]: 27: Hoare triple {14624#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14624#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,325 INFO L273 TraceCheckUtils]: 28: Hoare triple {14624#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14624#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,326 INFO L273 TraceCheckUtils]: 29: Hoare triple {14624#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {14625#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,326 INFO L273 TraceCheckUtils]: 30: Hoare triple {14625#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14625#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,327 INFO L273 TraceCheckUtils]: 31: Hoare triple {14625#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14625#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,328 INFO L273 TraceCheckUtils]: 32: Hoare triple {14625#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {14626#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,328 INFO L273 TraceCheckUtils]: 33: Hoare triple {14626#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14626#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,348 INFO L273 TraceCheckUtils]: 34: Hoare triple {14626#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14626#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,357 INFO L273 TraceCheckUtils]: 35: Hoare triple {14626#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {14627#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,361 INFO L273 TraceCheckUtils]: 36: Hoare triple {14627#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14627#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,363 INFO L273 TraceCheckUtils]: 37: Hoare triple {14627#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14627#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,363 INFO L273 TraceCheckUtils]: 38: Hoare triple {14627#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {14628#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,365 INFO L273 TraceCheckUtils]: 39: Hoare triple {14628#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14628#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,366 INFO L273 TraceCheckUtils]: 40: Hoare triple {14628#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14628#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,366 INFO L273 TraceCheckUtils]: 41: Hoare triple {14628#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {14629#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,366 INFO L273 TraceCheckUtils]: 42: Hoare triple {14629#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14629#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,367 INFO L273 TraceCheckUtils]: 43: Hoare triple {14629#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14629#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,367 INFO L273 TraceCheckUtils]: 44: Hoare triple {14629#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {14630#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:38,368 INFO L273 TraceCheckUtils]: 45: Hoare triple {14630#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14630#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:38,368 INFO L273 TraceCheckUtils]: 46: Hoare triple {14630#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14630#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:38,369 INFO L273 TraceCheckUtils]: 47: Hoare triple {14630#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {14631#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:38,370 INFO L273 TraceCheckUtils]: 48: Hoare triple {14631#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14631#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:38,370 INFO L273 TraceCheckUtils]: 49: Hoare triple {14631#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14631#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:38,371 INFO L273 TraceCheckUtils]: 50: Hoare triple {14631#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {14632#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:38,372 INFO L273 TraceCheckUtils]: 51: Hoare triple {14632#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14632#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:38,372 INFO L273 TraceCheckUtils]: 52: Hoare triple {14632#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14632#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:38,373 INFO L273 TraceCheckUtils]: 53: Hoare triple {14632#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {14633#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:38,373 INFO L273 TraceCheckUtils]: 54: Hoare triple {14633#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14633#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:38,374 INFO L273 TraceCheckUtils]: 55: Hoare triple {14633#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14633#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:38,375 INFO L273 TraceCheckUtils]: 56: Hoare triple {14633#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {14634#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:38,375 INFO L273 TraceCheckUtils]: 57: Hoare triple {14634#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14634#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:38,376 INFO L273 TraceCheckUtils]: 58: Hoare triple {14634#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14634#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:38,376 INFO L273 TraceCheckUtils]: 59: Hoare triple {14634#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {14635#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:38,377 INFO L273 TraceCheckUtils]: 60: Hoare triple {14635#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14635#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:38,377 INFO L273 TraceCheckUtils]: 61: Hoare triple {14635#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14635#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:38,378 INFO L273 TraceCheckUtils]: 62: Hoare triple {14635#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {14636#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:38,379 INFO L273 TraceCheckUtils]: 63: Hoare triple {14636#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14636#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:38,379 INFO L273 TraceCheckUtils]: 64: Hoare triple {14636#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14636#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:38,380 INFO L273 TraceCheckUtils]: 65: Hoare triple {14636#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {14637#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:38,381 INFO L273 TraceCheckUtils]: 66: Hoare triple {14637#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14637#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:38,381 INFO L273 TraceCheckUtils]: 67: Hoare triple {14637#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14637#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:38,382 INFO L273 TraceCheckUtils]: 68: Hoare triple {14637#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {14638#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:38,382 INFO L273 TraceCheckUtils]: 69: Hoare triple {14638#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14638#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:38,383 INFO L273 TraceCheckUtils]: 70: Hoare triple {14638#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14638#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:38,384 INFO L273 TraceCheckUtils]: 71: Hoare triple {14638#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {14639#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:38,384 INFO L273 TraceCheckUtils]: 72: Hoare triple {14639#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14639#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:38,385 INFO L273 TraceCheckUtils]: 73: Hoare triple {14639#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14639#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:38,385 INFO L273 TraceCheckUtils]: 74: Hoare triple {14639#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {14640#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:38,386 INFO L273 TraceCheckUtils]: 75: Hoare triple {14640#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14640#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:38,386 INFO L273 TraceCheckUtils]: 76: Hoare triple {14640#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14640#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:38,387 INFO L273 TraceCheckUtils]: 77: Hoare triple {14640#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {14641#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:38,388 INFO L273 TraceCheckUtils]: 78: Hoare triple {14641#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14641#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:38,388 INFO L273 TraceCheckUtils]: 79: Hoare triple {14641#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14641#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:38,389 INFO L273 TraceCheckUtils]: 80: Hoare triple {14641#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {14642#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:38,389 INFO L273 TraceCheckUtils]: 81: Hoare triple {14642#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14642#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:38,390 INFO L273 TraceCheckUtils]: 82: Hoare triple {14642#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14642#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:38,391 INFO L273 TraceCheckUtils]: 83: Hoare triple {14642#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {14643#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:38,391 INFO L273 TraceCheckUtils]: 84: Hoare triple {14643#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14643#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:38,410 INFO L273 TraceCheckUtils]: 85: Hoare triple {14643#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14643#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:38,426 INFO L273 TraceCheckUtils]: 86: Hoare triple {14643#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {14644#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:38,435 INFO L273 TraceCheckUtils]: 87: Hoare triple {14644#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14644#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:38,449 INFO L273 TraceCheckUtils]: 88: Hoare triple {14644#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14644#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:38,458 INFO L273 TraceCheckUtils]: 89: Hoare triple {14644#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {14645#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:38,471 INFO L273 TraceCheckUtils]: 90: Hoare triple {14645#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14645#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:38,480 INFO L273 TraceCheckUtils]: 91: Hoare triple {14645#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14645#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:38,493 INFO L273 TraceCheckUtils]: 92: Hoare triple {14645#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {14646#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:38,502 INFO L273 TraceCheckUtils]: 93: Hoare triple {14646#(<= main_~i~0 29)} assume !(~i~0 < 100000); {14616#false} is VALID [2018-11-23 12:05:38,502 INFO L273 TraceCheckUtils]: 94: Hoare triple {14616#false} havoc ~x~0;~x~0 := 0; {14616#false} is VALID [2018-11-23 12:05:38,502 INFO L273 TraceCheckUtils]: 95: Hoare triple {14616#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14616#false} is VALID [2018-11-23 12:05:38,503 INFO L256 TraceCheckUtils]: 96: Hoare triple {14616#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {14616#false} is VALID [2018-11-23 12:05:38,503 INFO L273 TraceCheckUtils]: 97: Hoare triple {14616#false} ~cond := #in~cond; {14616#false} is VALID [2018-11-23 12:05:38,503 INFO L273 TraceCheckUtils]: 98: Hoare triple {14616#false} assume 0 == ~cond; {14616#false} is VALID [2018-11-23 12:05:38,503 INFO L273 TraceCheckUtils]: 99: Hoare triple {14616#false} assume !false; {14616#false} is VALID [2018-11-23 12:05:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:38,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:38,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:38,531 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:38,680 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 12:05:38,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:38,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:38,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {14615#true} call ULTIMATE.init(); {14615#true} is VALID [2018-11-23 12:05:38,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {14615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14615#true} is VALID [2018-11-23 12:05:38,961 INFO L273 TraceCheckUtils]: 2: Hoare triple {14615#true} assume true; {14615#true} is VALID [2018-11-23 12:05:38,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14615#true} {14615#true} #55#return; {14615#true} is VALID [2018-11-23 12:05:38,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {14615#true} call #t~ret4 := main(); {14615#true} is VALID [2018-11-23 12:05:38,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {14615#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {14665#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:38,963 INFO L273 TraceCheckUtils]: 6: Hoare triple {14665#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14665#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:38,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {14665#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14665#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:38,964 INFO L273 TraceCheckUtils]: 8: Hoare triple {14665#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {14618#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,965 INFO L273 TraceCheckUtils]: 9: Hoare triple {14618#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14618#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,965 INFO L273 TraceCheckUtils]: 10: Hoare triple {14618#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14618#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,966 INFO L273 TraceCheckUtils]: 11: Hoare triple {14618#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {14619#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {14619#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14619#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,967 INFO L273 TraceCheckUtils]: 13: Hoare triple {14619#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14619#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,968 INFO L273 TraceCheckUtils]: 14: Hoare triple {14619#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {14620#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,968 INFO L273 TraceCheckUtils]: 15: Hoare triple {14620#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14620#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,969 INFO L273 TraceCheckUtils]: 16: Hoare triple {14620#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14620#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,969 INFO L273 TraceCheckUtils]: 17: Hoare triple {14620#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {14621#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,970 INFO L273 TraceCheckUtils]: 18: Hoare triple {14621#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14621#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,970 INFO L273 TraceCheckUtils]: 19: Hoare triple {14621#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14621#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,971 INFO L273 TraceCheckUtils]: 20: Hoare triple {14621#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {14622#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,972 INFO L273 TraceCheckUtils]: 21: Hoare triple {14622#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14622#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,972 INFO L273 TraceCheckUtils]: 22: Hoare triple {14622#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14622#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,973 INFO L273 TraceCheckUtils]: 23: Hoare triple {14622#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {14623#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,973 INFO L273 TraceCheckUtils]: 24: Hoare triple {14623#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14623#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,974 INFO L273 TraceCheckUtils]: 25: Hoare triple {14623#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14623#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {14623#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {14624#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,975 INFO L273 TraceCheckUtils]: 27: Hoare triple {14624#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14624#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {14624#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14624#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,976 INFO L273 TraceCheckUtils]: 29: Hoare triple {14624#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {14625#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,977 INFO L273 TraceCheckUtils]: 30: Hoare triple {14625#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14625#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,998 INFO L273 TraceCheckUtils]: 31: Hoare triple {14625#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14625#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:39,007 INFO L273 TraceCheckUtils]: 32: Hoare triple {14625#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {14626#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:39,008 INFO L273 TraceCheckUtils]: 33: Hoare triple {14626#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14626#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:39,008 INFO L273 TraceCheckUtils]: 34: Hoare triple {14626#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14626#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:39,009 INFO L273 TraceCheckUtils]: 35: Hoare triple {14626#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {14627#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:39,009 INFO L273 TraceCheckUtils]: 36: Hoare triple {14627#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14627#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:39,009 INFO L273 TraceCheckUtils]: 37: Hoare triple {14627#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14627#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:39,010 INFO L273 TraceCheckUtils]: 38: Hoare triple {14627#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {14628#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:39,010 INFO L273 TraceCheckUtils]: 39: Hoare triple {14628#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14628#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:39,010 INFO L273 TraceCheckUtils]: 40: Hoare triple {14628#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14628#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:39,011 INFO L273 TraceCheckUtils]: 41: Hoare triple {14628#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {14629#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:39,011 INFO L273 TraceCheckUtils]: 42: Hoare triple {14629#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14629#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:39,012 INFO L273 TraceCheckUtils]: 43: Hoare triple {14629#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14629#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:39,012 INFO L273 TraceCheckUtils]: 44: Hoare triple {14629#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {14630#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:39,013 INFO L273 TraceCheckUtils]: 45: Hoare triple {14630#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14630#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:39,013 INFO L273 TraceCheckUtils]: 46: Hoare triple {14630#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14630#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:39,014 INFO L273 TraceCheckUtils]: 47: Hoare triple {14630#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {14631#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:39,015 INFO L273 TraceCheckUtils]: 48: Hoare triple {14631#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14631#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:39,015 INFO L273 TraceCheckUtils]: 49: Hoare triple {14631#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14631#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:39,016 INFO L273 TraceCheckUtils]: 50: Hoare triple {14631#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {14632#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:39,016 INFO L273 TraceCheckUtils]: 51: Hoare triple {14632#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14632#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:39,017 INFO L273 TraceCheckUtils]: 52: Hoare triple {14632#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14632#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:39,018 INFO L273 TraceCheckUtils]: 53: Hoare triple {14632#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {14633#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:39,018 INFO L273 TraceCheckUtils]: 54: Hoare triple {14633#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14633#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:39,019 INFO L273 TraceCheckUtils]: 55: Hoare triple {14633#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14633#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:39,019 INFO L273 TraceCheckUtils]: 56: Hoare triple {14633#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {14634#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:39,020 INFO L273 TraceCheckUtils]: 57: Hoare triple {14634#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14634#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:39,020 INFO L273 TraceCheckUtils]: 58: Hoare triple {14634#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14634#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:39,021 INFO L273 TraceCheckUtils]: 59: Hoare triple {14634#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {14635#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:39,022 INFO L273 TraceCheckUtils]: 60: Hoare triple {14635#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14635#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:39,022 INFO L273 TraceCheckUtils]: 61: Hoare triple {14635#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14635#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:39,023 INFO L273 TraceCheckUtils]: 62: Hoare triple {14635#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {14636#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:39,023 INFO L273 TraceCheckUtils]: 63: Hoare triple {14636#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14636#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:39,024 INFO L273 TraceCheckUtils]: 64: Hoare triple {14636#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14636#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:39,025 INFO L273 TraceCheckUtils]: 65: Hoare triple {14636#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {14637#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:39,025 INFO L273 TraceCheckUtils]: 66: Hoare triple {14637#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14637#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:39,026 INFO L273 TraceCheckUtils]: 67: Hoare triple {14637#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14637#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:39,026 INFO L273 TraceCheckUtils]: 68: Hoare triple {14637#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {14638#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:39,027 INFO L273 TraceCheckUtils]: 69: Hoare triple {14638#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14638#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:39,027 INFO L273 TraceCheckUtils]: 70: Hoare triple {14638#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14638#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:39,028 INFO L273 TraceCheckUtils]: 71: Hoare triple {14638#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {14639#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:39,029 INFO L273 TraceCheckUtils]: 72: Hoare triple {14639#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14639#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:39,029 INFO L273 TraceCheckUtils]: 73: Hoare triple {14639#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14639#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:39,030 INFO L273 TraceCheckUtils]: 74: Hoare triple {14639#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {14640#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:39,030 INFO L273 TraceCheckUtils]: 75: Hoare triple {14640#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14640#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:39,031 INFO L273 TraceCheckUtils]: 76: Hoare triple {14640#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14640#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:39,032 INFO L273 TraceCheckUtils]: 77: Hoare triple {14640#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {14641#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:39,032 INFO L273 TraceCheckUtils]: 78: Hoare triple {14641#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14641#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:39,033 INFO L273 TraceCheckUtils]: 79: Hoare triple {14641#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14641#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:39,033 INFO L273 TraceCheckUtils]: 80: Hoare triple {14641#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {14642#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:39,034 INFO L273 TraceCheckUtils]: 81: Hoare triple {14642#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14642#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:39,034 INFO L273 TraceCheckUtils]: 82: Hoare triple {14642#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14642#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:39,035 INFO L273 TraceCheckUtils]: 83: Hoare triple {14642#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {14643#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:39,036 INFO L273 TraceCheckUtils]: 84: Hoare triple {14643#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14643#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:39,036 INFO L273 TraceCheckUtils]: 85: Hoare triple {14643#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14643#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:39,037 INFO L273 TraceCheckUtils]: 86: Hoare triple {14643#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {14644#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:39,037 INFO L273 TraceCheckUtils]: 87: Hoare triple {14644#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14644#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:39,038 INFO L273 TraceCheckUtils]: 88: Hoare triple {14644#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14644#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:39,039 INFO L273 TraceCheckUtils]: 89: Hoare triple {14644#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {14645#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:39,039 INFO L273 TraceCheckUtils]: 90: Hoare triple {14645#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14645#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:39,040 INFO L273 TraceCheckUtils]: 91: Hoare triple {14645#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {14645#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:39,040 INFO L273 TraceCheckUtils]: 92: Hoare triple {14645#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {14646#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:39,041 INFO L273 TraceCheckUtils]: 93: Hoare triple {14646#(<= main_~i~0 29)} assume !(~i~0 < 100000); {14616#false} is VALID [2018-11-23 12:05:39,041 INFO L273 TraceCheckUtils]: 94: Hoare triple {14616#false} havoc ~x~0;~x~0 := 0; {14616#false} is VALID [2018-11-23 12:05:39,041 INFO L273 TraceCheckUtils]: 95: Hoare triple {14616#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14616#false} is VALID [2018-11-23 12:05:39,042 INFO L256 TraceCheckUtils]: 96: Hoare triple {14616#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {14616#false} is VALID [2018-11-23 12:05:39,042 INFO L273 TraceCheckUtils]: 97: Hoare triple {14616#false} ~cond := #in~cond; {14616#false} is VALID [2018-11-23 12:05:39,042 INFO L273 TraceCheckUtils]: 98: Hoare triple {14616#false} assume 0 == ~cond; {14616#false} is VALID [2018-11-23 12:05:39,042 INFO L273 TraceCheckUtils]: 99: Hoare triple {14616#false} assume !false; {14616#false} is VALID [2018-11-23 12:05:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:39,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:39,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 12:05:39,069 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 100 [2018-11-23 12:05:39,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:39,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:05:39,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:39,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:05:39,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:05:39,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:05:39,171 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand 33 states. [2018-11-23 12:05:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:39,969 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2018-11-23 12:05:39,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 12:05:39,969 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 100 [2018-11-23 12:05:39,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:05:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 154 transitions. [2018-11-23 12:05:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:05:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 154 transitions. [2018-11-23 12:05:39,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 154 transitions. [2018-11-23 12:05:40,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:40,116 INFO L225 Difference]: With dead ends: 121 [2018-11-23 12:05:40,116 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 12:05:40,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:05:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 12:05:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-11-23 12:05:40,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:40,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 108 states. [2018-11-23 12:05:40,142 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 108 states. [2018-11-23 12:05:40,142 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 108 states. [2018-11-23 12:05:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:40,143 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-11-23 12:05:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2018-11-23 12:05:40,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:40,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:40,144 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 110 states. [2018-11-23 12:05:40,144 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 110 states. [2018-11-23 12:05:40,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:40,145 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-11-23 12:05:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2018-11-23 12:05:40,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:40,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:40,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:40,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 12:05:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2018-11-23 12:05:40,148 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 139 transitions. Word has length 100 [2018-11-23 12:05:40,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:40,148 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 139 transitions. [2018-11-23 12:05:40,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:05:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 139 transitions. [2018-11-23 12:05:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 12:05:40,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:40,149 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:40,149 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:40,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:40,150 INFO L82 PathProgramCache]: Analyzing trace with hash -57777927, now seen corresponding path program 30 times [2018-11-23 12:05:40,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:40,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:40,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:40,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:40,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:40,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {15475#true} call ULTIMATE.init(); {15475#true} is VALID [2018-11-23 12:05:40,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {15475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15475#true} is VALID [2018-11-23 12:05:40,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-23 12:05:40,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15475#true} {15475#true} #55#return; {15475#true} is VALID [2018-11-23 12:05:40,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {15475#true} call #t~ret4 := main(); {15475#true} is VALID [2018-11-23 12:05:40,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {15475#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {15477#(= main_~i~0 0)} is VALID [2018-11-23 12:05:40,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {15477#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15477#(= main_~i~0 0)} is VALID [2018-11-23 12:05:40,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {15477#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15477#(= main_~i~0 0)} is VALID [2018-11-23 12:05:40,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {15477#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {15478#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {15478#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15478#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {15478#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15478#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {15478#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {15479#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {15479#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15479#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,792 INFO L273 TraceCheckUtils]: 13: Hoare triple {15479#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15479#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {15479#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {15480#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,793 INFO L273 TraceCheckUtils]: 15: Hoare triple {15480#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15480#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,794 INFO L273 TraceCheckUtils]: 16: Hoare triple {15480#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15480#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,795 INFO L273 TraceCheckUtils]: 17: Hoare triple {15480#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {15481#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {15481#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15481#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,796 INFO L273 TraceCheckUtils]: 19: Hoare triple {15481#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15481#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {15481#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {15482#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,797 INFO L273 TraceCheckUtils]: 21: Hoare triple {15482#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15482#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {15482#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15482#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,798 INFO L273 TraceCheckUtils]: 23: Hoare triple {15482#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {15483#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:40,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {15483#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15483#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:40,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {15483#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15483#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:40,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {15483#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {15484#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:40,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {15484#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15484#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:40,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {15484#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15484#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:40,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {15484#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {15485#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:40,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {15485#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15485#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:40,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {15485#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15485#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:40,803 INFO L273 TraceCheckUtils]: 32: Hoare triple {15485#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {15486#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:40,804 INFO L273 TraceCheckUtils]: 33: Hoare triple {15486#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15486#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:40,804 INFO L273 TraceCheckUtils]: 34: Hoare triple {15486#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15486#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:40,805 INFO L273 TraceCheckUtils]: 35: Hoare triple {15486#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {15487#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:40,806 INFO L273 TraceCheckUtils]: 36: Hoare triple {15487#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15487#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:40,806 INFO L273 TraceCheckUtils]: 37: Hoare triple {15487#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15487#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:40,807 INFO L273 TraceCheckUtils]: 38: Hoare triple {15487#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {15488#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:40,807 INFO L273 TraceCheckUtils]: 39: Hoare triple {15488#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15488#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:40,808 INFO L273 TraceCheckUtils]: 40: Hoare triple {15488#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15488#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:40,809 INFO L273 TraceCheckUtils]: 41: Hoare triple {15488#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {15489#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:40,809 INFO L273 TraceCheckUtils]: 42: Hoare triple {15489#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15489#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:40,810 INFO L273 TraceCheckUtils]: 43: Hoare triple {15489#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15489#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:40,810 INFO L273 TraceCheckUtils]: 44: Hoare triple {15489#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {15490#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:40,811 INFO L273 TraceCheckUtils]: 45: Hoare triple {15490#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15490#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:40,811 INFO L273 TraceCheckUtils]: 46: Hoare triple {15490#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15490#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:40,812 INFO L273 TraceCheckUtils]: 47: Hoare triple {15490#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {15491#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:40,813 INFO L273 TraceCheckUtils]: 48: Hoare triple {15491#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15491#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:40,813 INFO L273 TraceCheckUtils]: 49: Hoare triple {15491#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15491#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:40,814 INFO L273 TraceCheckUtils]: 50: Hoare triple {15491#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {15492#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:40,814 INFO L273 TraceCheckUtils]: 51: Hoare triple {15492#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15492#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:40,815 INFO L273 TraceCheckUtils]: 52: Hoare triple {15492#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15492#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:40,816 INFO L273 TraceCheckUtils]: 53: Hoare triple {15492#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {15493#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:40,816 INFO L273 TraceCheckUtils]: 54: Hoare triple {15493#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15493#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:40,817 INFO L273 TraceCheckUtils]: 55: Hoare triple {15493#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15493#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:40,817 INFO L273 TraceCheckUtils]: 56: Hoare triple {15493#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {15494#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:40,818 INFO L273 TraceCheckUtils]: 57: Hoare triple {15494#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15494#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:40,818 INFO L273 TraceCheckUtils]: 58: Hoare triple {15494#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15494#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:40,819 INFO L273 TraceCheckUtils]: 59: Hoare triple {15494#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {15495#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:40,820 INFO L273 TraceCheckUtils]: 60: Hoare triple {15495#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15495#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:40,820 INFO L273 TraceCheckUtils]: 61: Hoare triple {15495#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15495#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:40,821 INFO L273 TraceCheckUtils]: 62: Hoare triple {15495#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {15496#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:40,821 INFO L273 TraceCheckUtils]: 63: Hoare triple {15496#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15496#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:40,822 INFO L273 TraceCheckUtils]: 64: Hoare triple {15496#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15496#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:40,823 INFO L273 TraceCheckUtils]: 65: Hoare triple {15496#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {15497#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:40,823 INFO L273 TraceCheckUtils]: 66: Hoare triple {15497#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15497#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:40,824 INFO L273 TraceCheckUtils]: 67: Hoare triple {15497#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15497#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:40,824 INFO L273 TraceCheckUtils]: 68: Hoare triple {15497#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {15498#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:40,825 INFO L273 TraceCheckUtils]: 69: Hoare triple {15498#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15498#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:40,825 INFO L273 TraceCheckUtils]: 70: Hoare triple {15498#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15498#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:40,826 INFO L273 TraceCheckUtils]: 71: Hoare triple {15498#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {15499#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:40,827 INFO L273 TraceCheckUtils]: 72: Hoare triple {15499#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15499#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:40,827 INFO L273 TraceCheckUtils]: 73: Hoare triple {15499#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15499#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:40,828 INFO L273 TraceCheckUtils]: 74: Hoare triple {15499#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {15500#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:40,829 INFO L273 TraceCheckUtils]: 75: Hoare triple {15500#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15500#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:40,829 INFO L273 TraceCheckUtils]: 76: Hoare triple {15500#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15500#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:40,830 INFO L273 TraceCheckUtils]: 77: Hoare triple {15500#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {15501#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:40,830 INFO L273 TraceCheckUtils]: 78: Hoare triple {15501#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15501#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:40,831 INFO L273 TraceCheckUtils]: 79: Hoare triple {15501#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15501#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:40,831 INFO L273 TraceCheckUtils]: 80: Hoare triple {15501#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {15502#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:40,832 INFO L273 TraceCheckUtils]: 81: Hoare triple {15502#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15502#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:40,833 INFO L273 TraceCheckUtils]: 82: Hoare triple {15502#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15502#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:40,833 INFO L273 TraceCheckUtils]: 83: Hoare triple {15502#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {15503#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:40,834 INFO L273 TraceCheckUtils]: 84: Hoare triple {15503#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15503#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:40,834 INFO L273 TraceCheckUtils]: 85: Hoare triple {15503#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15503#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:40,835 INFO L273 TraceCheckUtils]: 86: Hoare triple {15503#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {15504#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:40,836 INFO L273 TraceCheckUtils]: 87: Hoare triple {15504#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15504#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:40,836 INFO L273 TraceCheckUtils]: 88: Hoare triple {15504#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15504#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:40,837 INFO L273 TraceCheckUtils]: 89: Hoare triple {15504#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {15505#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:40,837 INFO L273 TraceCheckUtils]: 90: Hoare triple {15505#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15505#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:40,838 INFO L273 TraceCheckUtils]: 91: Hoare triple {15505#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15505#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:40,838 INFO L273 TraceCheckUtils]: 92: Hoare triple {15505#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {15506#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:40,839 INFO L273 TraceCheckUtils]: 93: Hoare triple {15506#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15506#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:40,840 INFO L273 TraceCheckUtils]: 94: Hoare triple {15506#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15506#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:40,840 INFO L273 TraceCheckUtils]: 95: Hoare triple {15506#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {15507#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:40,841 INFO L273 TraceCheckUtils]: 96: Hoare triple {15507#(<= main_~i~0 30)} assume !(~i~0 < 100000); {15476#false} is VALID [2018-11-23 12:05:40,841 INFO L273 TraceCheckUtils]: 97: Hoare triple {15476#false} havoc ~x~0;~x~0 := 0; {15476#false} is VALID [2018-11-23 12:05:40,841 INFO L273 TraceCheckUtils]: 98: Hoare triple {15476#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15476#false} is VALID [2018-11-23 12:05:40,842 INFO L256 TraceCheckUtils]: 99: Hoare triple {15476#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {15476#false} is VALID [2018-11-23 12:05:40,842 INFO L273 TraceCheckUtils]: 100: Hoare triple {15476#false} ~cond := #in~cond; {15476#false} is VALID [2018-11-23 12:05:40,842 INFO L273 TraceCheckUtils]: 101: Hoare triple {15476#false} assume 0 == ~cond; {15476#false} is VALID [2018-11-23 12:05:40,842 INFO L273 TraceCheckUtils]: 102: Hoare triple {15476#false} assume !false; {15476#false} is VALID [2018-11-23 12:05:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:40,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:40,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:40,859 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:40,933 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-23 12:05:40,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:40,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:42,442 INFO L256 TraceCheckUtils]: 0: Hoare triple {15475#true} call ULTIMATE.init(); {15475#true} is VALID [2018-11-23 12:05:42,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {15475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15475#true} is VALID [2018-11-23 12:05:42,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-23 12:05:42,442 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15475#true} {15475#true} #55#return; {15475#true} is VALID [2018-11-23 12:05:42,442 INFO L256 TraceCheckUtils]: 4: Hoare triple {15475#true} call #t~ret4 := main(); {15475#true} is VALID [2018-11-23 12:05:42,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {15475#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {15526#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:42,444 INFO L273 TraceCheckUtils]: 6: Hoare triple {15526#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15526#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:42,447 INFO L273 TraceCheckUtils]: 7: Hoare triple {15526#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15526#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:42,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {15526#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {15478#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:42,450 INFO L273 TraceCheckUtils]: 9: Hoare triple {15478#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15478#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:42,452 INFO L273 TraceCheckUtils]: 10: Hoare triple {15478#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15478#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:42,452 INFO L273 TraceCheckUtils]: 11: Hoare triple {15478#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {15479#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:42,454 INFO L273 TraceCheckUtils]: 12: Hoare triple {15479#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15479#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:42,454 INFO L273 TraceCheckUtils]: 13: Hoare triple {15479#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15479#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:42,456 INFO L273 TraceCheckUtils]: 14: Hoare triple {15479#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {15480#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:42,456 INFO L273 TraceCheckUtils]: 15: Hoare triple {15480#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15480#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:42,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {15480#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15480#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:42,459 INFO L273 TraceCheckUtils]: 17: Hoare triple {15480#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {15481#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:42,461 INFO L273 TraceCheckUtils]: 18: Hoare triple {15481#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15481#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:42,461 INFO L273 TraceCheckUtils]: 19: Hoare triple {15481#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15481#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:42,463 INFO L273 TraceCheckUtils]: 20: Hoare triple {15481#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {15482#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:42,463 INFO L273 TraceCheckUtils]: 21: Hoare triple {15482#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15482#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:42,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {15482#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15482#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:42,465 INFO L273 TraceCheckUtils]: 23: Hoare triple {15482#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {15483#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:42,468 INFO L273 TraceCheckUtils]: 24: Hoare triple {15483#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15483#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:42,468 INFO L273 TraceCheckUtils]: 25: Hoare triple {15483#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15483#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:42,468 INFO L273 TraceCheckUtils]: 26: Hoare triple {15483#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {15484#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:42,469 INFO L273 TraceCheckUtils]: 27: Hoare triple {15484#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15484#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:42,470 INFO L273 TraceCheckUtils]: 28: Hoare triple {15484#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15484#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:42,470 INFO L273 TraceCheckUtils]: 29: Hoare triple {15484#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {15485#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:42,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {15485#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15485#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:42,471 INFO L273 TraceCheckUtils]: 31: Hoare triple {15485#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15485#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:42,471 INFO L273 TraceCheckUtils]: 32: Hoare triple {15485#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {15486#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:42,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {15486#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15486#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:42,472 INFO L273 TraceCheckUtils]: 34: Hoare triple {15486#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15486#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:42,473 INFO L273 TraceCheckUtils]: 35: Hoare triple {15486#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {15487#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:42,474 INFO L273 TraceCheckUtils]: 36: Hoare triple {15487#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15487#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:42,474 INFO L273 TraceCheckUtils]: 37: Hoare triple {15487#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15487#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:42,475 INFO L273 TraceCheckUtils]: 38: Hoare triple {15487#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {15488#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:42,475 INFO L273 TraceCheckUtils]: 39: Hoare triple {15488#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15488#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:42,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {15488#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15488#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:42,477 INFO L273 TraceCheckUtils]: 41: Hoare triple {15488#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {15489#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:42,477 INFO L273 TraceCheckUtils]: 42: Hoare triple {15489#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15489#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:42,478 INFO L273 TraceCheckUtils]: 43: Hoare triple {15489#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15489#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:42,478 INFO L273 TraceCheckUtils]: 44: Hoare triple {15489#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {15490#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:42,479 INFO L273 TraceCheckUtils]: 45: Hoare triple {15490#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15490#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:42,480 INFO L273 TraceCheckUtils]: 46: Hoare triple {15490#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15490#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:42,480 INFO L273 TraceCheckUtils]: 47: Hoare triple {15490#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {15491#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:42,481 INFO L273 TraceCheckUtils]: 48: Hoare triple {15491#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15491#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:42,481 INFO L273 TraceCheckUtils]: 49: Hoare triple {15491#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15491#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:42,482 INFO L273 TraceCheckUtils]: 50: Hoare triple {15491#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {15492#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:42,482 INFO L273 TraceCheckUtils]: 51: Hoare triple {15492#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15492#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:42,483 INFO L273 TraceCheckUtils]: 52: Hoare triple {15492#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15492#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:42,484 INFO L273 TraceCheckUtils]: 53: Hoare triple {15492#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {15493#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:42,484 INFO L273 TraceCheckUtils]: 54: Hoare triple {15493#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15493#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:42,485 INFO L273 TraceCheckUtils]: 55: Hoare triple {15493#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15493#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:42,485 INFO L273 TraceCheckUtils]: 56: Hoare triple {15493#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {15494#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:42,486 INFO L273 TraceCheckUtils]: 57: Hoare triple {15494#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15494#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:42,487 INFO L273 TraceCheckUtils]: 58: Hoare triple {15494#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15494#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:42,487 INFO L273 TraceCheckUtils]: 59: Hoare triple {15494#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {15495#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:42,488 INFO L273 TraceCheckUtils]: 60: Hoare triple {15495#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15495#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:42,488 INFO L273 TraceCheckUtils]: 61: Hoare triple {15495#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15495#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:42,489 INFO L273 TraceCheckUtils]: 62: Hoare triple {15495#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {15496#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:42,490 INFO L273 TraceCheckUtils]: 63: Hoare triple {15496#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15496#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:42,490 INFO L273 TraceCheckUtils]: 64: Hoare triple {15496#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15496#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:42,491 INFO L273 TraceCheckUtils]: 65: Hoare triple {15496#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {15497#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:42,491 INFO L273 TraceCheckUtils]: 66: Hoare triple {15497#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15497#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:42,492 INFO L273 TraceCheckUtils]: 67: Hoare triple {15497#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15497#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:42,493 INFO L273 TraceCheckUtils]: 68: Hoare triple {15497#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {15498#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:42,493 INFO L273 TraceCheckUtils]: 69: Hoare triple {15498#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15498#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:42,494 INFO L273 TraceCheckUtils]: 70: Hoare triple {15498#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15498#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:42,494 INFO L273 TraceCheckUtils]: 71: Hoare triple {15498#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {15499#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:42,495 INFO L273 TraceCheckUtils]: 72: Hoare triple {15499#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15499#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:42,495 INFO L273 TraceCheckUtils]: 73: Hoare triple {15499#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15499#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:42,496 INFO L273 TraceCheckUtils]: 74: Hoare triple {15499#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {15500#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:42,497 INFO L273 TraceCheckUtils]: 75: Hoare triple {15500#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15500#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:42,497 INFO L273 TraceCheckUtils]: 76: Hoare triple {15500#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15500#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:42,498 INFO L273 TraceCheckUtils]: 77: Hoare triple {15500#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {15501#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:42,498 INFO L273 TraceCheckUtils]: 78: Hoare triple {15501#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15501#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:42,499 INFO L273 TraceCheckUtils]: 79: Hoare triple {15501#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15501#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:42,500 INFO L273 TraceCheckUtils]: 80: Hoare triple {15501#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {15502#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:42,500 INFO L273 TraceCheckUtils]: 81: Hoare triple {15502#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15502#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:42,501 INFO L273 TraceCheckUtils]: 82: Hoare triple {15502#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15502#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:42,501 INFO L273 TraceCheckUtils]: 83: Hoare triple {15502#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {15503#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:42,502 INFO L273 TraceCheckUtils]: 84: Hoare triple {15503#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15503#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:42,502 INFO L273 TraceCheckUtils]: 85: Hoare triple {15503#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15503#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:42,503 INFO L273 TraceCheckUtils]: 86: Hoare triple {15503#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {15504#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:42,504 INFO L273 TraceCheckUtils]: 87: Hoare triple {15504#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15504#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:42,504 INFO L273 TraceCheckUtils]: 88: Hoare triple {15504#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15504#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:42,505 INFO L273 TraceCheckUtils]: 89: Hoare triple {15504#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {15505#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:42,505 INFO L273 TraceCheckUtils]: 90: Hoare triple {15505#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15505#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:42,506 INFO L273 TraceCheckUtils]: 91: Hoare triple {15505#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15505#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:42,507 INFO L273 TraceCheckUtils]: 92: Hoare triple {15505#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {15506#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:42,507 INFO L273 TraceCheckUtils]: 93: Hoare triple {15506#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15506#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:42,508 INFO L273 TraceCheckUtils]: 94: Hoare triple {15506#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {15506#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:42,508 INFO L273 TraceCheckUtils]: 95: Hoare triple {15506#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {15507#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:42,509 INFO L273 TraceCheckUtils]: 96: Hoare triple {15507#(<= main_~i~0 30)} assume !(~i~0 < 100000); {15476#false} is VALID [2018-11-23 12:05:42,509 INFO L273 TraceCheckUtils]: 97: Hoare triple {15476#false} havoc ~x~0;~x~0 := 0; {15476#false} is VALID [2018-11-23 12:05:42,509 INFO L273 TraceCheckUtils]: 98: Hoare triple {15476#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15476#false} is VALID [2018-11-23 12:05:42,510 INFO L256 TraceCheckUtils]: 99: Hoare triple {15476#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {15476#false} is VALID [2018-11-23 12:05:42,510 INFO L273 TraceCheckUtils]: 100: Hoare triple {15476#false} ~cond := #in~cond; {15476#false} is VALID [2018-11-23 12:05:42,510 INFO L273 TraceCheckUtils]: 101: Hoare triple {15476#false} assume 0 == ~cond; {15476#false} is VALID [2018-11-23 12:05:42,510 INFO L273 TraceCheckUtils]: 102: Hoare triple {15476#false} assume !false; {15476#false} is VALID [2018-11-23 12:05:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:42,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:42,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 12:05:42,539 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 103 [2018-11-23 12:05:42,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:42,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:05:42,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:42,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:05:42,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:05:42,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:05:42,645 INFO L87 Difference]: Start difference. First operand 108 states and 139 transitions. Second operand 34 states. [2018-11-23 12:05:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:43,259 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2018-11-23 12:05:43,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:05:43,259 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 103 [2018-11-23 12:05:43,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:05:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 158 transitions. [2018-11-23 12:05:43,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:05:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 158 transitions. [2018-11-23 12:05:43,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 158 transitions. [2018-11-23 12:05:43,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:43,456 INFO L225 Difference]: With dead ends: 124 [2018-11-23 12:05:43,456 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 12:05:43,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:05:43,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 12:05:43,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-23 12:05:43,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:43,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 111 states. [2018-11-23 12:05:43,524 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 111 states. [2018-11-23 12:05:43,524 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 111 states. [2018-11-23 12:05:43,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:43,528 INFO L93 Difference]: Finished difference Result 113 states and 146 transitions. [2018-11-23 12:05:43,528 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2018-11-23 12:05:43,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:43,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:43,529 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 113 states. [2018-11-23 12:05:43,529 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 113 states. [2018-11-23 12:05:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:43,530 INFO L93 Difference]: Finished difference Result 113 states and 146 transitions. [2018-11-23 12:05:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2018-11-23 12:05:43,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:43,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:43,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:43,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 12:05:43,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 143 transitions. [2018-11-23 12:05:43,532 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 143 transitions. Word has length 103 [2018-11-23 12:05:43,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:43,532 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 143 transitions. [2018-11-23 12:05:43,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:05:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 143 transitions. [2018-11-23 12:05:43,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 12:05:43,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:43,533 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:43,534 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:43,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:43,534 INFO L82 PathProgramCache]: Analyzing trace with hash 65028259, now seen corresponding path program 31 times [2018-11-23 12:05:43,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:43,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:43,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:43,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:43,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:44,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {16359#true} call ULTIMATE.init(); {16359#true} is VALID [2018-11-23 12:05:44,214 INFO L273 TraceCheckUtils]: 1: Hoare triple {16359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16359#true} is VALID [2018-11-23 12:05:44,214 INFO L273 TraceCheckUtils]: 2: Hoare triple {16359#true} assume true; {16359#true} is VALID [2018-11-23 12:05:44,214 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16359#true} {16359#true} #55#return; {16359#true} is VALID [2018-11-23 12:05:44,214 INFO L256 TraceCheckUtils]: 4: Hoare triple {16359#true} call #t~ret4 := main(); {16359#true} is VALID [2018-11-23 12:05:44,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {16359#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {16361#(= main_~i~0 0)} is VALID [2018-11-23 12:05:44,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {16361#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16361#(= main_~i~0 0)} is VALID [2018-11-23 12:05:44,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {16361#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16361#(= main_~i~0 0)} is VALID [2018-11-23 12:05:44,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {16361#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {16362#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:44,217 INFO L273 TraceCheckUtils]: 9: Hoare triple {16362#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16362#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:44,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {16362#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16362#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:44,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {16362#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {16363#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:44,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {16363#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16363#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:44,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {16363#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16363#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:44,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {16363#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {16364#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:44,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {16364#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16364#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:44,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {16364#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16364#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:44,222 INFO L273 TraceCheckUtils]: 17: Hoare triple {16364#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {16365#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:44,222 INFO L273 TraceCheckUtils]: 18: Hoare triple {16365#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16365#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:44,223 INFO L273 TraceCheckUtils]: 19: Hoare triple {16365#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16365#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:44,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {16365#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {16366#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:44,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {16366#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16366#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:44,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {16366#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16366#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:44,227 INFO L273 TraceCheckUtils]: 23: Hoare triple {16366#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {16367#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:44,227 INFO L273 TraceCheckUtils]: 24: Hoare triple {16367#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16367#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:44,228 INFO L273 TraceCheckUtils]: 25: Hoare triple {16367#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16367#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:44,228 INFO L273 TraceCheckUtils]: 26: Hoare triple {16367#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {16368#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:44,229 INFO L273 TraceCheckUtils]: 27: Hoare triple {16368#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16368#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:44,229 INFO L273 TraceCheckUtils]: 28: Hoare triple {16368#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16368#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:44,230 INFO L273 TraceCheckUtils]: 29: Hoare triple {16368#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {16369#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:44,231 INFO L273 TraceCheckUtils]: 30: Hoare triple {16369#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16369#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:44,231 INFO L273 TraceCheckUtils]: 31: Hoare triple {16369#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16369#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:44,232 INFO L273 TraceCheckUtils]: 32: Hoare triple {16369#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {16370#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:44,232 INFO L273 TraceCheckUtils]: 33: Hoare triple {16370#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16370#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:44,233 INFO L273 TraceCheckUtils]: 34: Hoare triple {16370#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16370#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:44,234 INFO L273 TraceCheckUtils]: 35: Hoare triple {16370#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {16371#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:44,234 INFO L273 TraceCheckUtils]: 36: Hoare triple {16371#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16371#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:44,235 INFO L273 TraceCheckUtils]: 37: Hoare triple {16371#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16371#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:44,235 INFO L273 TraceCheckUtils]: 38: Hoare triple {16371#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {16372#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:44,236 INFO L273 TraceCheckUtils]: 39: Hoare triple {16372#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16372#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:44,236 INFO L273 TraceCheckUtils]: 40: Hoare triple {16372#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16372#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:44,237 INFO L273 TraceCheckUtils]: 41: Hoare triple {16372#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {16373#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:44,238 INFO L273 TraceCheckUtils]: 42: Hoare triple {16373#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16373#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:44,238 INFO L273 TraceCheckUtils]: 43: Hoare triple {16373#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16373#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:44,239 INFO L273 TraceCheckUtils]: 44: Hoare triple {16373#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {16374#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:44,239 INFO L273 TraceCheckUtils]: 45: Hoare triple {16374#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16374#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:44,240 INFO L273 TraceCheckUtils]: 46: Hoare triple {16374#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16374#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:44,241 INFO L273 TraceCheckUtils]: 47: Hoare triple {16374#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {16375#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:44,241 INFO L273 TraceCheckUtils]: 48: Hoare triple {16375#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16375#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:44,242 INFO L273 TraceCheckUtils]: 49: Hoare triple {16375#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16375#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:44,242 INFO L273 TraceCheckUtils]: 50: Hoare triple {16375#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {16376#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:44,243 INFO L273 TraceCheckUtils]: 51: Hoare triple {16376#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16376#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:44,243 INFO L273 TraceCheckUtils]: 52: Hoare triple {16376#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16376#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:44,244 INFO L273 TraceCheckUtils]: 53: Hoare triple {16376#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {16377#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:44,245 INFO L273 TraceCheckUtils]: 54: Hoare triple {16377#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16377#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:44,245 INFO L273 TraceCheckUtils]: 55: Hoare triple {16377#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16377#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:44,246 INFO L273 TraceCheckUtils]: 56: Hoare triple {16377#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {16378#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:44,246 INFO L273 TraceCheckUtils]: 57: Hoare triple {16378#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16378#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:44,247 INFO L273 TraceCheckUtils]: 58: Hoare triple {16378#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16378#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:44,248 INFO L273 TraceCheckUtils]: 59: Hoare triple {16378#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {16379#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:44,248 INFO L273 TraceCheckUtils]: 60: Hoare triple {16379#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16379#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:44,249 INFO L273 TraceCheckUtils]: 61: Hoare triple {16379#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16379#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:44,249 INFO L273 TraceCheckUtils]: 62: Hoare triple {16379#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {16380#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:44,250 INFO L273 TraceCheckUtils]: 63: Hoare triple {16380#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16380#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:44,250 INFO L273 TraceCheckUtils]: 64: Hoare triple {16380#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16380#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:44,251 INFO L273 TraceCheckUtils]: 65: Hoare triple {16380#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {16381#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:44,252 INFO L273 TraceCheckUtils]: 66: Hoare triple {16381#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16381#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:44,252 INFO L273 TraceCheckUtils]: 67: Hoare triple {16381#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16381#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:44,253 INFO L273 TraceCheckUtils]: 68: Hoare triple {16381#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {16382#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:44,253 INFO L273 TraceCheckUtils]: 69: Hoare triple {16382#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16382#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:44,254 INFO L273 TraceCheckUtils]: 70: Hoare triple {16382#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16382#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:44,255 INFO L273 TraceCheckUtils]: 71: Hoare triple {16382#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {16383#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:44,255 INFO L273 TraceCheckUtils]: 72: Hoare triple {16383#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16383#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:44,256 INFO L273 TraceCheckUtils]: 73: Hoare triple {16383#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16383#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:44,256 INFO L273 TraceCheckUtils]: 74: Hoare triple {16383#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {16384#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:44,257 INFO L273 TraceCheckUtils]: 75: Hoare triple {16384#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16384#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:44,257 INFO L273 TraceCheckUtils]: 76: Hoare triple {16384#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16384#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:44,258 INFO L273 TraceCheckUtils]: 77: Hoare triple {16384#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {16385#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:44,259 INFO L273 TraceCheckUtils]: 78: Hoare triple {16385#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16385#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:44,259 INFO L273 TraceCheckUtils]: 79: Hoare triple {16385#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16385#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:44,260 INFO L273 TraceCheckUtils]: 80: Hoare triple {16385#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {16386#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:44,260 INFO L273 TraceCheckUtils]: 81: Hoare triple {16386#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16386#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:44,261 INFO L273 TraceCheckUtils]: 82: Hoare triple {16386#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16386#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:44,262 INFO L273 TraceCheckUtils]: 83: Hoare triple {16386#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {16387#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:44,262 INFO L273 TraceCheckUtils]: 84: Hoare triple {16387#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16387#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:44,263 INFO L273 TraceCheckUtils]: 85: Hoare triple {16387#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16387#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:44,263 INFO L273 TraceCheckUtils]: 86: Hoare triple {16387#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {16388#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:44,264 INFO L273 TraceCheckUtils]: 87: Hoare triple {16388#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16388#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:44,264 INFO L273 TraceCheckUtils]: 88: Hoare triple {16388#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16388#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:44,265 INFO L273 TraceCheckUtils]: 89: Hoare triple {16388#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {16389#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:44,266 INFO L273 TraceCheckUtils]: 90: Hoare triple {16389#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16389#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:44,266 INFO L273 TraceCheckUtils]: 91: Hoare triple {16389#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16389#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:44,267 INFO L273 TraceCheckUtils]: 92: Hoare triple {16389#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {16390#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:44,267 INFO L273 TraceCheckUtils]: 93: Hoare triple {16390#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16390#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:44,268 INFO L273 TraceCheckUtils]: 94: Hoare triple {16390#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16390#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:44,269 INFO L273 TraceCheckUtils]: 95: Hoare triple {16390#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {16391#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:44,269 INFO L273 TraceCheckUtils]: 96: Hoare triple {16391#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16391#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:44,270 INFO L273 TraceCheckUtils]: 97: Hoare triple {16391#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16391#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:44,270 INFO L273 TraceCheckUtils]: 98: Hoare triple {16391#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {16392#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:44,271 INFO L273 TraceCheckUtils]: 99: Hoare triple {16392#(<= main_~i~0 31)} assume !(~i~0 < 100000); {16360#false} is VALID [2018-11-23 12:05:44,271 INFO L273 TraceCheckUtils]: 100: Hoare triple {16360#false} havoc ~x~0;~x~0 := 0; {16360#false} is VALID [2018-11-23 12:05:44,271 INFO L273 TraceCheckUtils]: 101: Hoare triple {16360#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16360#false} is VALID [2018-11-23 12:05:44,272 INFO L256 TraceCheckUtils]: 102: Hoare triple {16360#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {16360#false} is VALID [2018-11-23 12:05:44,272 INFO L273 TraceCheckUtils]: 103: Hoare triple {16360#false} ~cond := #in~cond; {16360#false} is VALID [2018-11-23 12:05:44,272 INFO L273 TraceCheckUtils]: 104: Hoare triple {16360#false} assume 0 == ~cond; {16360#false} is VALID [2018-11-23 12:05:44,272 INFO L273 TraceCheckUtils]: 105: Hoare triple {16360#false} assume !false; {16360#false} is VALID [2018-11-23 12:05:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:44,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:44,281 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:44,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:44,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:44,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {16359#true} call ULTIMATE.init(); {16359#true} is VALID [2018-11-23 12:05:44,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {16359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16359#true} is VALID [2018-11-23 12:05:44,602 INFO L273 TraceCheckUtils]: 2: Hoare triple {16359#true} assume true; {16359#true} is VALID [2018-11-23 12:05:44,602 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16359#true} {16359#true} #55#return; {16359#true} is VALID [2018-11-23 12:05:44,602 INFO L256 TraceCheckUtils]: 4: Hoare triple {16359#true} call #t~ret4 := main(); {16359#true} is VALID [2018-11-23 12:05:44,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {16359#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {16411#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:44,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {16411#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16411#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:44,604 INFO L273 TraceCheckUtils]: 7: Hoare triple {16411#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16411#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:44,604 INFO L273 TraceCheckUtils]: 8: Hoare triple {16411#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {16362#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:44,605 INFO L273 TraceCheckUtils]: 9: Hoare triple {16362#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16362#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:44,605 INFO L273 TraceCheckUtils]: 10: Hoare triple {16362#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16362#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:44,605 INFO L273 TraceCheckUtils]: 11: Hoare triple {16362#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {16363#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:44,606 INFO L273 TraceCheckUtils]: 12: Hoare triple {16363#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16363#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:44,606 INFO L273 TraceCheckUtils]: 13: Hoare triple {16363#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16363#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:44,607 INFO L273 TraceCheckUtils]: 14: Hoare triple {16363#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {16364#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:44,608 INFO L273 TraceCheckUtils]: 15: Hoare triple {16364#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16364#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:44,608 INFO L273 TraceCheckUtils]: 16: Hoare triple {16364#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16364#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:44,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {16364#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {16365#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:44,609 INFO L273 TraceCheckUtils]: 18: Hoare triple {16365#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16365#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:44,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {16365#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16365#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:44,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {16365#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {16366#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:44,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {16366#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16366#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:44,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {16366#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16366#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:44,612 INFO L273 TraceCheckUtils]: 23: Hoare triple {16366#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {16367#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:44,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {16367#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16367#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:44,614 INFO L273 TraceCheckUtils]: 25: Hoare triple {16367#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16367#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:44,615 INFO L273 TraceCheckUtils]: 26: Hoare triple {16367#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {16368#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:44,616 INFO L273 TraceCheckUtils]: 27: Hoare triple {16368#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16368#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:44,616 INFO L273 TraceCheckUtils]: 28: Hoare triple {16368#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16368#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:44,617 INFO L273 TraceCheckUtils]: 29: Hoare triple {16368#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {16369#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:44,617 INFO L273 TraceCheckUtils]: 30: Hoare triple {16369#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16369#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:44,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {16369#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16369#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:44,619 INFO L273 TraceCheckUtils]: 32: Hoare triple {16369#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {16370#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:44,619 INFO L273 TraceCheckUtils]: 33: Hoare triple {16370#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16370#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:44,620 INFO L273 TraceCheckUtils]: 34: Hoare triple {16370#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16370#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:44,620 INFO L273 TraceCheckUtils]: 35: Hoare triple {16370#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {16371#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:44,621 INFO L273 TraceCheckUtils]: 36: Hoare triple {16371#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16371#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:44,621 INFO L273 TraceCheckUtils]: 37: Hoare triple {16371#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16371#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:44,622 INFO L273 TraceCheckUtils]: 38: Hoare triple {16371#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {16372#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:44,623 INFO L273 TraceCheckUtils]: 39: Hoare triple {16372#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16372#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:44,623 INFO L273 TraceCheckUtils]: 40: Hoare triple {16372#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16372#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:44,624 INFO L273 TraceCheckUtils]: 41: Hoare triple {16372#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {16373#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:44,624 INFO L273 TraceCheckUtils]: 42: Hoare triple {16373#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16373#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:44,625 INFO L273 TraceCheckUtils]: 43: Hoare triple {16373#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16373#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:44,626 INFO L273 TraceCheckUtils]: 44: Hoare triple {16373#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {16374#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:44,626 INFO L273 TraceCheckUtils]: 45: Hoare triple {16374#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16374#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:44,627 INFO L273 TraceCheckUtils]: 46: Hoare triple {16374#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16374#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:44,627 INFO L273 TraceCheckUtils]: 47: Hoare triple {16374#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {16375#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:44,628 INFO L273 TraceCheckUtils]: 48: Hoare triple {16375#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16375#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:44,628 INFO L273 TraceCheckUtils]: 49: Hoare triple {16375#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16375#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:44,629 INFO L273 TraceCheckUtils]: 50: Hoare triple {16375#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {16376#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:44,630 INFO L273 TraceCheckUtils]: 51: Hoare triple {16376#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16376#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:44,630 INFO L273 TraceCheckUtils]: 52: Hoare triple {16376#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16376#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:44,631 INFO L273 TraceCheckUtils]: 53: Hoare triple {16376#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {16377#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:44,631 INFO L273 TraceCheckUtils]: 54: Hoare triple {16377#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16377#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:44,632 INFO L273 TraceCheckUtils]: 55: Hoare triple {16377#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16377#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:44,633 INFO L273 TraceCheckUtils]: 56: Hoare triple {16377#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {16378#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:44,633 INFO L273 TraceCheckUtils]: 57: Hoare triple {16378#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16378#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:44,634 INFO L273 TraceCheckUtils]: 58: Hoare triple {16378#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16378#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:44,634 INFO L273 TraceCheckUtils]: 59: Hoare triple {16378#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {16379#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:44,635 INFO L273 TraceCheckUtils]: 60: Hoare triple {16379#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16379#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:44,635 INFO L273 TraceCheckUtils]: 61: Hoare triple {16379#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16379#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:44,636 INFO L273 TraceCheckUtils]: 62: Hoare triple {16379#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {16380#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:44,637 INFO L273 TraceCheckUtils]: 63: Hoare triple {16380#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16380#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:44,637 INFO L273 TraceCheckUtils]: 64: Hoare triple {16380#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16380#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:44,638 INFO L273 TraceCheckUtils]: 65: Hoare triple {16380#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {16381#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:44,638 INFO L273 TraceCheckUtils]: 66: Hoare triple {16381#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16381#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:44,639 INFO L273 TraceCheckUtils]: 67: Hoare triple {16381#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16381#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:44,659 INFO L273 TraceCheckUtils]: 68: Hoare triple {16381#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {16382#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:44,672 INFO L273 TraceCheckUtils]: 69: Hoare triple {16382#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16382#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:44,672 INFO L273 TraceCheckUtils]: 70: Hoare triple {16382#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16382#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:44,673 INFO L273 TraceCheckUtils]: 71: Hoare triple {16382#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {16383#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:44,673 INFO L273 TraceCheckUtils]: 72: Hoare triple {16383#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16383#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:44,673 INFO L273 TraceCheckUtils]: 73: Hoare triple {16383#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16383#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:44,674 INFO L273 TraceCheckUtils]: 74: Hoare triple {16383#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {16384#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:44,674 INFO L273 TraceCheckUtils]: 75: Hoare triple {16384#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16384#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:44,675 INFO L273 TraceCheckUtils]: 76: Hoare triple {16384#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16384#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:44,675 INFO L273 TraceCheckUtils]: 77: Hoare triple {16384#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {16385#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:44,675 INFO L273 TraceCheckUtils]: 78: Hoare triple {16385#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16385#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:44,676 INFO L273 TraceCheckUtils]: 79: Hoare triple {16385#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16385#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:44,676 INFO L273 TraceCheckUtils]: 80: Hoare triple {16385#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {16386#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:44,677 INFO L273 TraceCheckUtils]: 81: Hoare triple {16386#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16386#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:44,677 INFO L273 TraceCheckUtils]: 82: Hoare triple {16386#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16386#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:44,678 INFO L273 TraceCheckUtils]: 83: Hoare triple {16386#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {16387#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:44,678 INFO L273 TraceCheckUtils]: 84: Hoare triple {16387#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16387#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:44,679 INFO L273 TraceCheckUtils]: 85: Hoare triple {16387#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16387#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:44,680 INFO L273 TraceCheckUtils]: 86: Hoare triple {16387#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {16388#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:44,680 INFO L273 TraceCheckUtils]: 87: Hoare triple {16388#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16388#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:44,681 INFO L273 TraceCheckUtils]: 88: Hoare triple {16388#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16388#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:44,681 INFO L273 TraceCheckUtils]: 89: Hoare triple {16388#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {16389#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:44,682 INFO L273 TraceCheckUtils]: 90: Hoare triple {16389#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16389#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:44,682 INFO L273 TraceCheckUtils]: 91: Hoare triple {16389#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16389#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:44,683 INFO L273 TraceCheckUtils]: 92: Hoare triple {16389#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {16390#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:44,684 INFO L273 TraceCheckUtils]: 93: Hoare triple {16390#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16390#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:44,684 INFO L273 TraceCheckUtils]: 94: Hoare triple {16390#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16390#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:44,685 INFO L273 TraceCheckUtils]: 95: Hoare triple {16390#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {16391#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:44,685 INFO L273 TraceCheckUtils]: 96: Hoare triple {16391#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16391#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:44,686 INFO L273 TraceCheckUtils]: 97: Hoare triple {16391#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {16391#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:44,687 INFO L273 TraceCheckUtils]: 98: Hoare triple {16391#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {16392#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:44,687 INFO L273 TraceCheckUtils]: 99: Hoare triple {16392#(<= main_~i~0 31)} assume !(~i~0 < 100000); {16360#false} is VALID [2018-11-23 12:05:44,688 INFO L273 TraceCheckUtils]: 100: Hoare triple {16360#false} havoc ~x~0;~x~0 := 0; {16360#false} is VALID [2018-11-23 12:05:44,688 INFO L273 TraceCheckUtils]: 101: Hoare triple {16360#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16360#false} is VALID [2018-11-23 12:05:44,688 INFO L256 TraceCheckUtils]: 102: Hoare triple {16360#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {16360#false} is VALID [2018-11-23 12:05:44,688 INFO L273 TraceCheckUtils]: 103: Hoare triple {16360#false} ~cond := #in~cond; {16360#false} is VALID [2018-11-23 12:05:44,688 INFO L273 TraceCheckUtils]: 104: Hoare triple {16360#false} assume 0 == ~cond; {16360#false} is VALID [2018-11-23 12:05:44,689 INFO L273 TraceCheckUtils]: 105: Hoare triple {16360#false} assume !false; {16360#false} is VALID [2018-11-23 12:05:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:44,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:44,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:05:44,717 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2018-11-23 12:05:44,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:44,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:05:44,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:44,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:05:44,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:05:44,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:05:44,824 INFO L87 Difference]: Start difference. First operand 111 states and 143 transitions. Second operand 35 states. [2018-11-23 12:05:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:45,353 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2018-11-23 12:05:45,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:05:45,353 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2018-11-23 12:05:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:05:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 162 transitions. [2018-11-23 12:05:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:05:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 162 transitions. [2018-11-23 12:05:45,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 162 transitions. [2018-11-23 12:05:45,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:45,557 INFO L225 Difference]: With dead ends: 127 [2018-11-23 12:05:45,557 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 12:05:45,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:05:45,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 12:05:45,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-11-23 12:05:45,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:45,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 114 states. [2018-11-23 12:05:45,588 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 114 states. [2018-11-23 12:05:45,588 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 114 states. [2018-11-23 12:05:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:45,590 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2018-11-23 12:05:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2018-11-23 12:05:45,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:45,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:45,591 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 116 states. [2018-11-23 12:05:45,591 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 116 states. [2018-11-23 12:05:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:45,592 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2018-11-23 12:05:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2018-11-23 12:05:45,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:45,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:45,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:45,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:45,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 12:05:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 147 transitions. [2018-11-23 12:05:45,595 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 147 transitions. Word has length 106 [2018-11-23 12:05:45,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:45,595 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 147 transitions. [2018-11-23 12:05:45,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:05:45,595 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 147 transitions. [2018-11-23 12:05:45,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 12:05:45,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:45,596 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:45,596 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:45,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:45,597 INFO L82 PathProgramCache]: Analyzing trace with hash -728020807, now seen corresponding path program 32 times [2018-11-23 12:05:45,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:45,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:45,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:45,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:45,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:46,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {17267#true} call ULTIMATE.init(); {17267#true} is VALID [2018-11-23 12:05:46,305 INFO L273 TraceCheckUtils]: 1: Hoare triple {17267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17267#true} is VALID [2018-11-23 12:05:46,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {17267#true} assume true; {17267#true} is VALID [2018-11-23 12:05:46,306 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17267#true} {17267#true} #55#return; {17267#true} is VALID [2018-11-23 12:05:46,306 INFO L256 TraceCheckUtils]: 4: Hoare triple {17267#true} call #t~ret4 := main(); {17267#true} is VALID [2018-11-23 12:05:46,306 INFO L273 TraceCheckUtils]: 5: Hoare triple {17267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {17269#(= main_~i~0 0)} is VALID [2018-11-23 12:05:46,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {17269#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17269#(= main_~i~0 0)} is VALID [2018-11-23 12:05:46,307 INFO L273 TraceCheckUtils]: 7: Hoare triple {17269#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17269#(= main_~i~0 0)} is VALID [2018-11-23 12:05:46,308 INFO L273 TraceCheckUtils]: 8: Hoare triple {17269#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {17270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:46,308 INFO L273 TraceCheckUtils]: 9: Hoare triple {17270#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:46,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {17270#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:46,309 INFO L273 TraceCheckUtils]: 11: Hoare triple {17270#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {17271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:46,309 INFO L273 TraceCheckUtils]: 12: Hoare triple {17271#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:46,310 INFO L273 TraceCheckUtils]: 13: Hoare triple {17271#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:46,310 INFO L273 TraceCheckUtils]: 14: Hoare triple {17271#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {17272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:46,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {17272#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:46,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {17272#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:46,311 INFO L273 TraceCheckUtils]: 17: Hoare triple {17272#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {17273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:46,312 INFO L273 TraceCheckUtils]: 18: Hoare triple {17273#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:46,312 INFO L273 TraceCheckUtils]: 19: Hoare triple {17273#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:46,313 INFO L273 TraceCheckUtils]: 20: Hoare triple {17273#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {17274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:46,314 INFO L273 TraceCheckUtils]: 21: Hoare triple {17274#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:46,314 INFO L273 TraceCheckUtils]: 22: Hoare triple {17274#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:46,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {17274#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {17275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:46,315 INFO L273 TraceCheckUtils]: 24: Hoare triple {17275#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:46,316 INFO L273 TraceCheckUtils]: 25: Hoare triple {17275#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:46,317 INFO L273 TraceCheckUtils]: 26: Hoare triple {17275#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {17276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:46,317 INFO L273 TraceCheckUtils]: 27: Hoare triple {17276#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:46,318 INFO L273 TraceCheckUtils]: 28: Hoare triple {17276#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:46,318 INFO L273 TraceCheckUtils]: 29: Hoare triple {17276#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {17277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:46,319 INFO L273 TraceCheckUtils]: 30: Hoare triple {17277#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:46,319 INFO L273 TraceCheckUtils]: 31: Hoare triple {17277#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:46,320 INFO L273 TraceCheckUtils]: 32: Hoare triple {17277#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {17278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:46,321 INFO L273 TraceCheckUtils]: 33: Hoare triple {17278#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:46,321 INFO L273 TraceCheckUtils]: 34: Hoare triple {17278#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:46,322 INFO L273 TraceCheckUtils]: 35: Hoare triple {17278#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {17279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:46,322 INFO L273 TraceCheckUtils]: 36: Hoare triple {17279#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:46,323 INFO L273 TraceCheckUtils]: 37: Hoare triple {17279#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:46,324 INFO L273 TraceCheckUtils]: 38: Hoare triple {17279#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {17280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:46,324 INFO L273 TraceCheckUtils]: 39: Hoare triple {17280#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:46,325 INFO L273 TraceCheckUtils]: 40: Hoare triple {17280#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:46,325 INFO L273 TraceCheckUtils]: 41: Hoare triple {17280#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {17281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:46,326 INFO L273 TraceCheckUtils]: 42: Hoare triple {17281#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:46,326 INFO L273 TraceCheckUtils]: 43: Hoare triple {17281#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:46,327 INFO L273 TraceCheckUtils]: 44: Hoare triple {17281#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {17282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:46,328 INFO L273 TraceCheckUtils]: 45: Hoare triple {17282#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:46,328 INFO L273 TraceCheckUtils]: 46: Hoare triple {17282#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:46,329 INFO L273 TraceCheckUtils]: 47: Hoare triple {17282#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {17283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:46,329 INFO L273 TraceCheckUtils]: 48: Hoare triple {17283#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:46,330 INFO L273 TraceCheckUtils]: 49: Hoare triple {17283#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:46,331 INFO L273 TraceCheckUtils]: 50: Hoare triple {17283#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {17284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:46,331 INFO L273 TraceCheckUtils]: 51: Hoare triple {17284#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:46,332 INFO L273 TraceCheckUtils]: 52: Hoare triple {17284#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:46,332 INFO L273 TraceCheckUtils]: 53: Hoare triple {17284#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {17285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:46,333 INFO L273 TraceCheckUtils]: 54: Hoare triple {17285#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:46,333 INFO L273 TraceCheckUtils]: 55: Hoare triple {17285#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:46,334 INFO L273 TraceCheckUtils]: 56: Hoare triple {17285#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {17286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:46,335 INFO L273 TraceCheckUtils]: 57: Hoare triple {17286#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:46,335 INFO L273 TraceCheckUtils]: 58: Hoare triple {17286#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:46,336 INFO L273 TraceCheckUtils]: 59: Hoare triple {17286#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {17287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:46,336 INFO L273 TraceCheckUtils]: 60: Hoare triple {17287#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:46,337 INFO L273 TraceCheckUtils]: 61: Hoare triple {17287#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:46,338 INFO L273 TraceCheckUtils]: 62: Hoare triple {17287#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {17288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:46,338 INFO L273 TraceCheckUtils]: 63: Hoare triple {17288#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:46,339 INFO L273 TraceCheckUtils]: 64: Hoare triple {17288#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:46,339 INFO L273 TraceCheckUtils]: 65: Hoare triple {17288#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {17289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:46,340 INFO L273 TraceCheckUtils]: 66: Hoare triple {17289#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:46,340 INFO L273 TraceCheckUtils]: 67: Hoare triple {17289#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:46,341 INFO L273 TraceCheckUtils]: 68: Hoare triple {17289#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {17290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:46,342 INFO L273 TraceCheckUtils]: 69: Hoare triple {17290#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:46,342 INFO L273 TraceCheckUtils]: 70: Hoare triple {17290#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:46,343 INFO L273 TraceCheckUtils]: 71: Hoare triple {17290#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {17291#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:46,343 INFO L273 TraceCheckUtils]: 72: Hoare triple {17291#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17291#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:46,344 INFO L273 TraceCheckUtils]: 73: Hoare triple {17291#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17291#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:46,344 INFO L273 TraceCheckUtils]: 74: Hoare triple {17291#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {17292#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:46,345 INFO L273 TraceCheckUtils]: 75: Hoare triple {17292#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17292#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:46,346 INFO L273 TraceCheckUtils]: 76: Hoare triple {17292#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17292#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:46,346 INFO L273 TraceCheckUtils]: 77: Hoare triple {17292#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {17293#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:46,347 INFO L273 TraceCheckUtils]: 78: Hoare triple {17293#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17293#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:46,347 INFO L273 TraceCheckUtils]: 79: Hoare triple {17293#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17293#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:46,348 INFO L273 TraceCheckUtils]: 80: Hoare triple {17293#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {17294#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:46,349 INFO L273 TraceCheckUtils]: 81: Hoare triple {17294#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17294#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:46,349 INFO L273 TraceCheckUtils]: 82: Hoare triple {17294#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17294#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:46,350 INFO L273 TraceCheckUtils]: 83: Hoare triple {17294#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {17295#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:46,350 INFO L273 TraceCheckUtils]: 84: Hoare triple {17295#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17295#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:46,351 INFO L273 TraceCheckUtils]: 85: Hoare triple {17295#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17295#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:46,351 INFO L273 TraceCheckUtils]: 86: Hoare triple {17295#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {17296#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:46,352 INFO L273 TraceCheckUtils]: 87: Hoare triple {17296#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17296#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:46,352 INFO L273 TraceCheckUtils]: 88: Hoare triple {17296#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17296#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:46,353 INFO L273 TraceCheckUtils]: 89: Hoare triple {17296#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {17297#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:46,354 INFO L273 TraceCheckUtils]: 90: Hoare triple {17297#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17297#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:46,354 INFO L273 TraceCheckUtils]: 91: Hoare triple {17297#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17297#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:46,355 INFO L273 TraceCheckUtils]: 92: Hoare triple {17297#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {17298#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:46,355 INFO L273 TraceCheckUtils]: 93: Hoare triple {17298#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17298#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:46,356 INFO L273 TraceCheckUtils]: 94: Hoare triple {17298#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17298#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:46,357 INFO L273 TraceCheckUtils]: 95: Hoare triple {17298#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {17299#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:46,357 INFO L273 TraceCheckUtils]: 96: Hoare triple {17299#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17299#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:46,358 INFO L273 TraceCheckUtils]: 97: Hoare triple {17299#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17299#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:46,358 INFO L273 TraceCheckUtils]: 98: Hoare triple {17299#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {17300#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:46,359 INFO L273 TraceCheckUtils]: 99: Hoare triple {17300#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17300#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:46,359 INFO L273 TraceCheckUtils]: 100: Hoare triple {17300#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17300#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:46,360 INFO L273 TraceCheckUtils]: 101: Hoare triple {17300#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {17301#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:46,361 INFO L273 TraceCheckUtils]: 102: Hoare triple {17301#(<= main_~i~0 32)} assume !(~i~0 < 100000); {17268#false} is VALID [2018-11-23 12:05:46,361 INFO L273 TraceCheckUtils]: 103: Hoare triple {17268#false} havoc ~x~0;~x~0 := 0; {17268#false} is VALID [2018-11-23 12:05:46,361 INFO L273 TraceCheckUtils]: 104: Hoare triple {17268#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {17268#false} is VALID [2018-11-23 12:05:46,361 INFO L256 TraceCheckUtils]: 105: Hoare triple {17268#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {17268#false} is VALID [2018-11-23 12:05:46,362 INFO L273 TraceCheckUtils]: 106: Hoare triple {17268#false} ~cond := #in~cond; {17268#false} is VALID [2018-11-23 12:05:46,362 INFO L273 TraceCheckUtils]: 107: Hoare triple {17268#false} assume 0 == ~cond; {17268#false} is VALID [2018-11-23 12:05:46,362 INFO L273 TraceCheckUtils]: 108: Hoare triple {17268#false} assume !false; {17268#false} is VALID [2018-11-23 12:05:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:46,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:46,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:46,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:46,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:46,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:46,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:46,705 INFO L256 TraceCheckUtils]: 0: Hoare triple {17267#true} call ULTIMATE.init(); {17267#true} is VALID [2018-11-23 12:05:46,705 INFO L273 TraceCheckUtils]: 1: Hoare triple {17267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17267#true} is VALID [2018-11-23 12:05:46,706 INFO L273 TraceCheckUtils]: 2: Hoare triple {17267#true} assume true; {17267#true} is VALID [2018-11-23 12:05:46,706 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17267#true} {17267#true} #55#return; {17267#true} is VALID [2018-11-23 12:05:46,706 INFO L256 TraceCheckUtils]: 4: Hoare triple {17267#true} call #t~ret4 := main(); {17267#true} is VALID [2018-11-23 12:05:46,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {17267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {17320#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:46,707 INFO L273 TraceCheckUtils]: 6: Hoare triple {17320#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17320#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:46,707 INFO L273 TraceCheckUtils]: 7: Hoare triple {17320#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17320#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:46,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {17320#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {17270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:46,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {17270#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:46,708 INFO L273 TraceCheckUtils]: 10: Hoare triple {17270#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17270#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:46,709 INFO L273 TraceCheckUtils]: 11: Hoare triple {17270#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {17271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:46,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {17271#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:46,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {17271#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17271#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:46,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {17271#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {17272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:46,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {17272#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:46,711 INFO L273 TraceCheckUtils]: 16: Hoare triple {17272#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17272#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:46,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {17272#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {17273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:46,712 INFO L273 TraceCheckUtils]: 18: Hoare triple {17273#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:46,712 INFO L273 TraceCheckUtils]: 19: Hoare triple {17273#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17273#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:46,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {17273#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {17274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:46,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {17274#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:46,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {17274#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17274#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:46,715 INFO L273 TraceCheckUtils]: 23: Hoare triple {17274#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {17275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:46,715 INFO L273 TraceCheckUtils]: 24: Hoare triple {17275#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:46,716 INFO L273 TraceCheckUtils]: 25: Hoare triple {17275#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17275#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:46,716 INFO L273 TraceCheckUtils]: 26: Hoare triple {17275#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {17276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:46,717 INFO L273 TraceCheckUtils]: 27: Hoare triple {17276#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:46,717 INFO L273 TraceCheckUtils]: 28: Hoare triple {17276#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17276#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:46,718 INFO L273 TraceCheckUtils]: 29: Hoare triple {17276#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {17277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:46,719 INFO L273 TraceCheckUtils]: 30: Hoare triple {17277#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:46,719 INFO L273 TraceCheckUtils]: 31: Hoare triple {17277#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17277#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:46,720 INFO L273 TraceCheckUtils]: 32: Hoare triple {17277#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {17278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:46,721 INFO L273 TraceCheckUtils]: 33: Hoare triple {17278#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:46,721 INFO L273 TraceCheckUtils]: 34: Hoare triple {17278#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17278#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:46,722 INFO L273 TraceCheckUtils]: 35: Hoare triple {17278#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {17279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:46,722 INFO L273 TraceCheckUtils]: 36: Hoare triple {17279#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:46,723 INFO L273 TraceCheckUtils]: 37: Hoare triple {17279#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17279#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:46,724 INFO L273 TraceCheckUtils]: 38: Hoare triple {17279#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {17280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:46,724 INFO L273 TraceCheckUtils]: 39: Hoare triple {17280#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:46,725 INFO L273 TraceCheckUtils]: 40: Hoare triple {17280#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17280#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:46,725 INFO L273 TraceCheckUtils]: 41: Hoare triple {17280#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {17281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:46,726 INFO L273 TraceCheckUtils]: 42: Hoare triple {17281#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:46,726 INFO L273 TraceCheckUtils]: 43: Hoare triple {17281#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17281#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:46,727 INFO L273 TraceCheckUtils]: 44: Hoare triple {17281#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {17282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:46,728 INFO L273 TraceCheckUtils]: 45: Hoare triple {17282#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:46,728 INFO L273 TraceCheckUtils]: 46: Hoare triple {17282#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17282#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:46,729 INFO L273 TraceCheckUtils]: 47: Hoare triple {17282#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {17283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:46,729 INFO L273 TraceCheckUtils]: 48: Hoare triple {17283#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:46,730 INFO L273 TraceCheckUtils]: 49: Hoare triple {17283#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17283#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:46,731 INFO L273 TraceCheckUtils]: 50: Hoare triple {17283#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {17284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:46,731 INFO L273 TraceCheckUtils]: 51: Hoare triple {17284#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:46,732 INFO L273 TraceCheckUtils]: 52: Hoare triple {17284#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17284#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:46,732 INFO L273 TraceCheckUtils]: 53: Hoare triple {17284#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {17285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:46,733 INFO L273 TraceCheckUtils]: 54: Hoare triple {17285#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:46,733 INFO L273 TraceCheckUtils]: 55: Hoare triple {17285#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17285#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:46,734 INFO L273 TraceCheckUtils]: 56: Hoare triple {17285#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {17286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:46,735 INFO L273 TraceCheckUtils]: 57: Hoare triple {17286#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:46,735 INFO L273 TraceCheckUtils]: 58: Hoare triple {17286#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17286#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:46,736 INFO L273 TraceCheckUtils]: 59: Hoare triple {17286#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {17287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:46,736 INFO L273 TraceCheckUtils]: 60: Hoare triple {17287#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:46,737 INFO L273 TraceCheckUtils]: 61: Hoare triple {17287#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17287#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:46,738 INFO L273 TraceCheckUtils]: 62: Hoare triple {17287#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {17288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:46,738 INFO L273 TraceCheckUtils]: 63: Hoare triple {17288#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:46,739 INFO L273 TraceCheckUtils]: 64: Hoare triple {17288#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17288#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:46,743 INFO L273 TraceCheckUtils]: 65: Hoare triple {17288#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {17289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:46,743 INFO L273 TraceCheckUtils]: 66: Hoare triple {17289#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:46,743 INFO L273 TraceCheckUtils]: 67: Hoare triple {17289#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17289#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:46,744 INFO L273 TraceCheckUtils]: 68: Hoare triple {17289#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {17290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:46,746 INFO L273 TraceCheckUtils]: 69: Hoare triple {17290#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:46,747 INFO L273 TraceCheckUtils]: 70: Hoare triple {17290#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17290#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:46,747 INFO L273 TraceCheckUtils]: 71: Hoare triple {17290#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {17291#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:46,748 INFO L273 TraceCheckUtils]: 72: Hoare triple {17291#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17291#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:46,748 INFO L273 TraceCheckUtils]: 73: Hoare triple {17291#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17291#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:46,748 INFO L273 TraceCheckUtils]: 74: Hoare triple {17291#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {17292#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:46,749 INFO L273 TraceCheckUtils]: 75: Hoare triple {17292#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17292#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:46,749 INFO L273 TraceCheckUtils]: 76: Hoare triple {17292#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17292#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:46,750 INFO L273 TraceCheckUtils]: 77: Hoare triple {17292#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {17293#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:46,750 INFO L273 TraceCheckUtils]: 78: Hoare triple {17293#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17293#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:46,750 INFO L273 TraceCheckUtils]: 79: Hoare triple {17293#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17293#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:46,751 INFO L273 TraceCheckUtils]: 80: Hoare triple {17293#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {17294#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:46,751 INFO L273 TraceCheckUtils]: 81: Hoare triple {17294#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17294#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:46,751 INFO L273 TraceCheckUtils]: 82: Hoare triple {17294#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17294#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:46,752 INFO L273 TraceCheckUtils]: 83: Hoare triple {17294#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {17295#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:46,753 INFO L273 TraceCheckUtils]: 84: Hoare triple {17295#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17295#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:46,753 INFO L273 TraceCheckUtils]: 85: Hoare triple {17295#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17295#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:46,754 INFO L273 TraceCheckUtils]: 86: Hoare triple {17295#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {17296#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:46,754 INFO L273 TraceCheckUtils]: 87: Hoare triple {17296#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17296#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:46,755 INFO L273 TraceCheckUtils]: 88: Hoare triple {17296#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17296#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:46,756 INFO L273 TraceCheckUtils]: 89: Hoare triple {17296#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {17297#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:46,756 INFO L273 TraceCheckUtils]: 90: Hoare triple {17297#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17297#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:46,757 INFO L273 TraceCheckUtils]: 91: Hoare triple {17297#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17297#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:46,757 INFO L273 TraceCheckUtils]: 92: Hoare triple {17297#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {17298#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:46,758 INFO L273 TraceCheckUtils]: 93: Hoare triple {17298#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17298#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:46,758 INFO L273 TraceCheckUtils]: 94: Hoare triple {17298#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17298#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:46,759 INFO L273 TraceCheckUtils]: 95: Hoare triple {17298#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {17299#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:46,760 INFO L273 TraceCheckUtils]: 96: Hoare triple {17299#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17299#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:46,760 INFO L273 TraceCheckUtils]: 97: Hoare triple {17299#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17299#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:46,761 INFO L273 TraceCheckUtils]: 98: Hoare triple {17299#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {17300#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:46,761 INFO L273 TraceCheckUtils]: 99: Hoare triple {17300#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17300#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:46,762 INFO L273 TraceCheckUtils]: 100: Hoare triple {17300#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {17300#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:46,763 INFO L273 TraceCheckUtils]: 101: Hoare triple {17300#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {17301#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:46,763 INFO L273 TraceCheckUtils]: 102: Hoare triple {17301#(<= main_~i~0 32)} assume !(~i~0 < 100000); {17268#false} is VALID [2018-11-23 12:05:46,764 INFO L273 TraceCheckUtils]: 103: Hoare triple {17268#false} havoc ~x~0;~x~0 := 0; {17268#false} is VALID [2018-11-23 12:05:46,764 INFO L273 TraceCheckUtils]: 104: Hoare triple {17268#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {17268#false} is VALID [2018-11-23 12:05:46,764 INFO L256 TraceCheckUtils]: 105: Hoare triple {17268#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {17268#false} is VALID [2018-11-23 12:05:46,764 INFO L273 TraceCheckUtils]: 106: Hoare triple {17268#false} ~cond := #in~cond; {17268#false} is VALID [2018-11-23 12:05:46,764 INFO L273 TraceCheckUtils]: 107: Hoare triple {17268#false} assume 0 == ~cond; {17268#false} is VALID [2018-11-23 12:05:46,764 INFO L273 TraceCheckUtils]: 108: Hoare triple {17268#false} assume !false; {17268#false} is VALID [2018-11-23 12:05:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:46,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:46,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:05:46,794 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2018-11-23 12:05:46,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:46,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:05:46,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:46,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:05:46,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:05:46,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:05:46,909 INFO L87 Difference]: Start difference. First operand 114 states and 147 transitions. Second operand 36 states. [2018-11-23 12:05:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:47,636 INFO L93 Difference]: Finished difference Result 130 states and 166 transitions. [2018-11-23 12:05:47,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:05:47,637 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2018-11-23 12:05:47,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:05:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 166 transitions. [2018-11-23 12:05:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:05:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 166 transitions. [2018-11-23 12:05:47,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 166 transitions. [2018-11-23 12:05:47,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:47,797 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:05:47,797 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 12:05:47,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:05:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 12:05:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-23 12:05:47,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:47,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 117 states. [2018-11-23 12:05:47,831 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 117 states. [2018-11-23 12:05:47,831 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 117 states. [2018-11-23 12:05:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:47,833 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2018-11-23 12:05:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2018-11-23 12:05:47,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:47,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:47,833 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 119 states. [2018-11-23 12:05:47,834 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 119 states. [2018-11-23 12:05:47,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:47,836 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2018-11-23 12:05:47,836 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2018-11-23 12:05:47,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:47,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:47,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:47,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 12:05:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 151 transitions. [2018-11-23 12:05:47,839 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 151 transitions. Word has length 109 [2018-11-23 12:05:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:47,839 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 151 transitions. [2018-11-23 12:05:47,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:05:47,839 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2018-11-23 12:05:47,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-23 12:05:47,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:47,840 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:47,840 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:47,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:47,841 INFO L82 PathProgramCache]: Analyzing trace with hash 162349283, now seen corresponding path program 33 times [2018-11-23 12:05:47,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:47,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:47,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:47,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:47,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:48,922 INFO L256 TraceCheckUtils]: 0: Hoare triple {18199#true} call ULTIMATE.init(); {18199#true} is VALID [2018-11-23 12:05:48,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {18199#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18199#true} is VALID [2018-11-23 12:05:48,923 INFO L273 TraceCheckUtils]: 2: Hoare triple {18199#true} assume true; {18199#true} is VALID [2018-11-23 12:05:48,923 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18199#true} {18199#true} #55#return; {18199#true} is VALID [2018-11-23 12:05:48,924 INFO L256 TraceCheckUtils]: 4: Hoare triple {18199#true} call #t~ret4 := main(); {18199#true} is VALID [2018-11-23 12:05:48,924 INFO L273 TraceCheckUtils]: 5: Hoare triple {18199#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {18201#(= main_~i~0 0)} is VALID [2018-11-23 12:05:48,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {18201#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18201#(= main_~i~0 0)} is VALID [2018-11-23 12:05:48,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {18201#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18201#(= main_~i~0 0)} is VALID [2018-11-23 12:05:48,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {18201#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {18202#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:48,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {18202#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18202#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:48,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {18202#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18202#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:48,927 INFO L273 TraceCheckUtils]: 11: Hoare triple {18202#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {18203#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:48,927 INFO L273 TraceCheckUtils]: 12: Hoare triple {18203#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18203#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:48,928 INFO L273 TraceCheckUtils]: 13: Hoare triple {18203#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18203#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:48,928 INFO L273 TraceCheckUtils]: 14: Hoare triple {18203#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {18204#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:48,929 INFO L273 TraceCheckUtils]: 15: Hoare triple {18204#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18204#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:48,929 INFO L273 TraceCheckUtils]: 16: Hoare triple {18204#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18204#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:48,930 INFO L273 TraceCheckUtils]: 17: Hoare triple {18204#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {18205#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:48,931 INFO L273 TraceCheckUtils]: 18: Hoare triple {18205#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18205#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:48,931 INFO L273 TraceCheckUtils]: 19: Hoare triple {18205#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18205#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:48,932 INFO L273 TraceCheckUtils]: 20: Hoare triple {18205#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {18206#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:48,932 INFO L273 TraceCheckUtils]: 21: Hoare triple {18206#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18206#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:48,933 INFO L273 TraceCheckUtils]: 22: Hoare triple {18206#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18206#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:48,933 INFO L273 TraceCheckUtils]: 23: Hoare triple {18206#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {18207#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:48,934 INFO L273 TraceCheckUtils]: 24: Hoare triple {18207#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18207#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:48,935 INFO L273 TraceCheckUtils]: 25: Hoare triple {18207#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18207#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:48,935 INFO L273 TraceCheckUtils]: 26: Hoare triple {18207#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {18208#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:48,936 INFO L273 TraceCheckUtils]: 27: Hoare triple {18208#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18208#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:48,936 INFO L273 TraceCheckUtils]: 28: Hoare triple {18208#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18208#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:48,937 INFO L273 TraceCheckUtils]: 29: Hoare triple {18208#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {18209#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:48,938 INFO L273 TraceCheckUtils]: 30: Hoare triple {18209#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18209#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:48,938 INFO L273 TraceCheckUtils]: 31: Hoare triple {18209#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18209#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:48,939 INFO L273 TraceCheckUtils]: 32: Hoare triple {18209#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {18210#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:48,939 INFO L273 TraceCheckUtils]: 33: Hoare triple {18210#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18210#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:48,940 INFO L273 TraceCheckUtils]: 34: Hoare triple {18210#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18210#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:48,940 INFO L273 TraceCheckUtils]: 35: Hoare triple {18210#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {18211#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:48,941 INFO L273 TraceCheckUtils]: 36: Hoare triple {18211#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18211#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:48,941 INFO L273 TraceCheckUtils]: 37: Hoare triple {18211#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18211#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:48,942 INFO L273 TraceCheckUtils]: 38: Hoare triple {18211#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {18212#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:48,943 INFO L273 TraceCheckUtils]: 39: Hoare triple {18212#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18212#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:48,946 INFO L273 TraceCheckUtils]: 40: Hoare triple {18212#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18212#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:48,946 INFO L273 TraceCheckUtils]: 41: Hoare triple {18212#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {18213#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:48,947 INFO L273 TraceCheckUtils]: 42: Hoare triple {18213#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18213#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:48,947 INFO L273 TraceCheckUtils]: 43: Hoare triple {18213#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18213#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:48,948 INFO L273 TraceCheckUtils]: 44: Hoare triple {18213#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {18214#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:48,948 INFO L273 TraceCheckUtils]: 45: Hoare triple {18214#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18214#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:48,948 INFO L273 TraceCheckUtils]: 46: Hoare triple {18214#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18214#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:48,949 INFO L273 TraceCheckUtils]: 47: Hoare triple {18214#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {18215#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:48,949 INFO L273 TraceCheckUtils]: 48: Hoare triple {18215#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18215#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:48,949 INFO L273 TraceCheckUtils]: 49: Hoare triple {18215#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18215#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:48,950 INFO L273 TraceCheckUtils]: 50: Hoare triple {18215#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {18216#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:48,950 INFO L273 TraceCheckUtils]: 51: Hoare triple {18216#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18216#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:48,950 INFO L273 TraceCheckUtils]: 52: Hoare triple {18216#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18216#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:48,951 INFO L273 TraceCheckUtils]: 53: Hoare triple {18216#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {18217#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:48,952 INFO L273 TraceCheckUtils]: 54: Hoare triple {18217#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18217#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:48,952 INFO L273 TraceCheckUtils]: 55: Hoare triple {18217#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18217#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:48,953 INFO L273 TraceCheckUtils]: 56: Hoare triple {18217#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {18218#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:48,953 INFO L273 TraceCheckUtils]: 57: Hoare triple {18218#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18218#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:48,954 INFO L273 TraceCheckUtils]: 58: Hoare triple {18218#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18218#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:48,955 INFO L273 TraceCheckUtils]: 59: Hoare triple {18218#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {18219#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:48,955 INFO L273 TraceCheckUtils]: 60: Hoare triple {18219#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18219#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:48,956 INFO L273 TraceCheckUtils]: 61: Hoare triple {18219#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18219#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:48,956 INFO L273 TraceCheckUtils]: 62: Hoare triple {18219#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {18220#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:48,957 INFO L273 TraceCheckUtils]: 63: Hoare triple {18220#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18220#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:48,957 INFO L273 TraceCheckUtils]: 64: Hoare triple {18220#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18220#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:48,958 INFO L273 TraceCheckUtils]: 65: Hoare triple {18220#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {18221#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:48,959 INFO L273 TraceCheckUtils]: 66: Hoare triple {18221#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18221#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:48,959 INFO L273 TraceCheckUtils]: 67: Hoare triple {18221#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18221#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:48,960 INFO L273 TraceCheckUtils]: 68: Hoare triple {18221#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {18222#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:48,960 INFO L273 TraceCheckUtils]: 69: Hoare triple {18222#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18222#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:48,961 INFO L273 TraceCheckUtils]: 70: Hoare triple {18222#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18222#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:48,962 INFO L273 TraceCheckUtils]: 71: Hoare triple {18222#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {18223#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:48,962 INFO L273 TraceCheckUtils]: 72: Hoare triple {18223#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18223#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:48,963 INFO L273 TraceCheckUtils]: 73: Hoare triple {18223#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18223#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:48,963 INFO L273 TraceCheckUtils]: 74: Hoare triple {18223#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {18224#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:48,964 INFO L273 TraceCheckUtils]: 75: Hoare triple {18224#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18224#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:48,964 INFO L273 TraceCheckUtils]: 76: Hoare triple {18224#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18224#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:48,965 INFO L273 TraceCheckUtils]: 77: Hoare triple {18224#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {18225#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:48,966 INFO L273 TraceCheckUtils]: 78: Hoare triple {18225#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18225#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:48,966 INFO L273 TraceCheckUtils]: 79: Hoare triple {18225#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18225#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:48,967 INFO L273 TraceCheckUtils]: 80: Hoare triple {18225#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {18226#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:48,967 INFO L273 TraceCheckUtils]: 81: Hoare triple {18226#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18226#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:48,968 INFO L273 TraceCheckUtils]: 82: Hoare triple {18226#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18226#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:48,969 INFO L273 TraceCheckUtils]: 83: Hoare triple {18226#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {18227#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:48,969 INFO L273 TraceCheckUtils]: 84: Hoare triple {18227#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18227#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:48,970 INFO L273 TraceCheckUtils]: 85: Hoare triple {18227#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18227#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:48,970 INFO L273 TraceCheckUtils]: 86: Hoare triple {18227#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {18228#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:48,971 INFO L273 TraceCheckUtils]: 87: Hoare triple {18228#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18228#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:48,971 INFO L273 TraceCheckUtils]: 88: Hoare triple {18228#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18228#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:48,972 INFO L273 TraceCheckUtils]: 89: Hoare triple {18228#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {18229#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:48,973 INFO L273 TraceCheckUtils]: 90: Hoare triple {18229#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18229#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:48,973 INFO L273 TraceCheckUtils]: 91: Hoare triple {18229#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18229#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:48,974 INFO L273 TraceCheckUtils]: 92: Hoare triple {18229#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {18230#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:48,974 INFO L273 TraceCheckUtils]: 93: Hoare triple {18230#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18230#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:48,975 INFO L273 TraceCheckUtils]: 94: Hoare triple {18230#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18230#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:48,976 INFO L273 TraceCheckUtils]: 95: Hoare triple {18230#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {18231#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:48,976 INFO L273 TraceCheckUtils]: 96: Hoare triple {18231#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18231#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:48,977 INFO L273 TraceCheckUtils]: 97: Hoare triple {18231#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18231#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:48,977 INFO L273 TraceCheckUtils]: 98: Hoare triple {18231#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {18232#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:48,978 INFO L273 TraceCheckUtils]: 99: Hoare triple {18232#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18232#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:48,978 INFO L273 TraceCheckUtils]: 100: Hoare triple {18232#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18232#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:48,979 INFO L273 TraceCheckUtils]: 101: Hoare triple {18232#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {18233#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:48,980 INFO L273 TraceCheckUtils]: 102: Hoare triple {18233#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18233#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:48,980 INFO L273 TraceCheckUtils]: 103: Hoare triple {18233#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18233#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:48,981 INFO L273 TraceCheckUtils]: 104: Hoare triple {18233#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {18234#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:48,982 INFO L273 TraceCheckUtils]: 105: Hoare triple {18234#(<= main_~i~0 33)} assume !(~i~0 < 100000); {18200#false} is VALID [2018-11-23 12:05:48,982 INFO L273 TraceCheckUtils]: 106: Hoare triple {18200#false} havoc ~x~0;~x~0 := 0; {18200#false} is VALID [2018-11-23 12:05:48,982 INFO L273 TraceCheckUtils]: 107: Hoare triple {18200#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {18200#false} is VALID [2018-11-23 12:05:48,982 INFO L256 TraceCheckUtils]: 108: Hoare triple {18200#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {18200#false} is VALID [2018-11-23 12:05:48,982 INFO L273 TraceCheckUtils]: 109: Hoare triple {18200#false} ~cond := #in~cond; {18200#false} is VALID [2018-11-23 12:05:48,983 INFO L273 TraceCheckUtils]: 110: Hoare triple {18200#false} assume 0 == ~cond; {18200#false} is VALID [2018-11-23 12:05:48,983 INFO L273 TraceCheckUtils]: 111: Hoare triple {18200#false} assume !false; {18200#false} is VALID [2018-11-23 12:05:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:48,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:48,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:49,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:49,083 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-23 12:05:49,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:49,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:49,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {18199#true} call ULTIMATE.init(); {18199#true} is VALID [2018-11-23 12:05:49,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {18199#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18199#true} is VALID [2018-11-23 12:05:49,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {18199#true} assume true; {18199#true} is VALID [2018-11-23 12:05:49,367 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18199#true} {18199#true} #55#return; {18199#true} is VALID [2018-11-23 12:05:49,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {18199#true} call #t~ret4 := main(); {18199#true} is VALID [2018-11-23 12:05:49,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {18199#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {18253#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:49,368 INFO L273 TraceCheckUtils]: 6: Hoare triple {18253#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18253#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:49,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {18253#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18253#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:49,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {18253#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {18202#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:49,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {18202#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18202#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:49,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {18202#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18202#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:49,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {18202#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {18203#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:49,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {18203#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18203#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:49,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {18203#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18203#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:49,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {18203#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {18204#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:49,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {18204#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18204#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:49,374 INFO L273 TraceCheckUtils]: 16: Hoare triple {18204#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18204#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:49,375 INFO L273 TraceCheckUtils]: 17: Hoare triple {18204#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {18205#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:49,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {18205#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18205#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:49,376 INFO L273 TraceCheckUtils]: 19: Hoare triple {18205#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18205#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:49,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {18205#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {18206#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:49,377 INFO L273 TraceCheckUtils]: 21: Hoare triple {18206#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18206#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:49,378 INFO L273 TraceCheckUtils]: 22: Hoare triple {18206#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18206#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:49,378 INFO L273 TraceCheckUtils]: 23: Hoare triple {18206#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {18207#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:49,379 INFO L273 TraceCheckUtils]: 24: Hoare triple {18207#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18207#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:49,379 INFO L273 TraceCheckUtils]: 25: Hoare triple {18207#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18207#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:49,380 INFO L273 TraceCheckUtils]: 26: Hoare triple {18207#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {18208#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:49,381 INFO L273 TraceCheckUtils]: 27: Hoare triple {18208#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18208#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:49,381 INFO L273 TraceCheckUtils]: 28: Hoare triple {18208#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18208#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:49,382 INFO L273 TraceCheckUtils]: 29: Hoare triple {18208#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {18209#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:49,382 INFO L273 TraceCheckUtils]: 30: Hoare triple {18209#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18209#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:49,383 INFO L273 TraceCheckUtils]: 31: Hoare triple {18209#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18209#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:49,384 INFO L273 TraceCheckUtils]: 32: Hoare triple {18209#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {18210#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:49,384 INFO L273 TraceCheckUtils]: 33: Hoare triple {18210#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18210#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:49,385 INFO L273 TraceCheckUtils]: 34: Hoare triple {18210#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18210#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:49,385 INFO L273 TraceCheckUtils]: 35: Hoare triple {18210#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {18211#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:49,386 INFO L273 TraceCheckUtils]: 36: Hoare triple {18211#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18211#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:49,386 INFO L273 TraceCheckUtils]: 37: Hoare triple {18211#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18211#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:49,387 INFO L273 TraceCheckUtils]: 38: Hoare triple {18211#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {18212#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:49,388 INFO L273 TraceCheckUtils]: 39: Hoare triple {18212#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18212#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:49,388 INFO L273 TraceCheckUtils]: 40: Hoare triple {18212#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18212#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:49,389 INFO L273 TraceCheckUtils]: 41: Hoare triple {18212#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {18213#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:49,389 INFO L273 TraceCheckUtils]: 42: Hoare triple {18213#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18213#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:49,390 INFO L273 TraceCheckUtils]: 43: Hoare triple {18213#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18213#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:49,391 INFO L273 TraceCheckUtils]: 44: Hoare triple {18213#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {18214#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:49,391 INFO L273 TraceCheckUtils]: 45: Hoare triple {18214#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18214#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:49,392 INFO L273 TraceCheckUtils]: 46: Hoare triple {18214#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18214#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:49,392 INFO L273 TraceCheckUtils]: 47: Hoare triple {18214#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {18215#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:49,393 INFO L273 TraceCheckUtils]: 48: Hoare triple {18215#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18215#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:49,393 INFO L273 TraceCheckUtils]: 49: Hoare triple {18215#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18215#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:49,394 INFO L273 TraceCheckUtils]: 50: Hoare triple {18215#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {18216#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:49,395 INFO L273 TraceCheckUtils]: 51: Hoare triple {18216#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18216#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:49,395 INFO L273 TraceCheckUtils]: 52: Hoare triple {18216#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18216#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:49,396 INFO L273 TraceCheckUtils]: 53: Hoare triple {18216#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {18217#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:49,396 INFO L273 TraceCheckUtils]: 54: Hoare triple {18217#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18217#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:49,397 INFO L273 TraceCheckUtils]: 55: Hoare triple {18217#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18217#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:49,398 INFO L273 TraceCheckUtils]: 56: Hoare triple {18217#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {18218#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:49,398 INFO L273 TraceCheckUtils]: 57: Hoare triple {18218#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18218#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:49,399 INFO L273 TraceCheckUtils]: 58: Hoare triple {18218#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18218#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:49,399 INFO L273 TraceCheckUtils]: 59: Hoare triple {18218#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {18219#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:49,400 INFO L273 TraceCheckUtils]: 60: Hoare triple {18219#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18219#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:49,400 INFO L273 TraceCheckUtils]: 61: Hoare triple {18219#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18219#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:49,401 INFO L273 TraceCheckUtils]: 62: Hoare triple {18219#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {18220#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:49,402 INFO L273 TraceCheckUtils]: 63: Hoare triple {18220#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18220#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:49,402 INFO L273 TraceCheckUtils]: 64: Hoare triple {18220#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18220#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:49,403 INFO L273 TraceCheckUtils]: 65: Hoare triple {18220#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {18221#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:49,403 INFO L273 TraceCheckUtils]: 66: Hoare triple {18221#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18221#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:49,404 INFO L273 TraceCheckUtils]: 67: Hoare triple {18221#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18221#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:49,405 INFO L273 TraceCheckUtils]: 68: Hoare triple {18221#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {18222#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:49,405 INFO L273 TraceCheckUtils]: 69: Hoare triple {18222#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18222#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:49,406 INFO L273 TraceCheckUtils]: 70: Hoare triple {18222#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18222#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:49,406 INFO L273 TraceCheckUtils]: 71: Hoare triple {18222#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {18223#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:49,407 INFO L273 TraceCheckUtils]: 72: Hoare triple {18223#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18223#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:49,407 INFO L273 TraceCheckUtils]: 73: Hoare triple {18223#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18223#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:49,408 INFO L273 TraceCheckUtils]: 74: Hoare triple {18223#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {18224#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:49,409 INFO L273 TraceCheckUtils]: 75: Hoare triple {18224#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18224#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:49,409 INFO L273 TraceCheckUtils]: 76: Hoare triple {18224#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18224#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:49,410 INFO L273 TraceCheckUtils]: 77: Hoare triple {18224#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {18225#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:49,410 INFO L273 TraceCheckUtils]: 78: Hoare triple {18225#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18225#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:49,411 INFO L273 TraceCheckUtils]: 79: Hoare triple {18225#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18225#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:49,412 INFO L273 TraceCheckUtils]: 80: Hoare triple {18225#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {18226#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:49,412 INFO L273 TraceCheckUtils]: 81: Hoare triple {18226#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18226#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:49,413 INFO L273 TraceCheckUtils]: 82: Hoare triple {18226#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18226#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:49,413 INFO L273 TraceCheckUtils]: 83: Hoare triple {18226#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {18227#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:49,414 INFO L273 TraceCheckUtils]: 84: Hoare triple {18227#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18227#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:49,414 INFO L273 TraceCheckUtils]: 85: Hoare triple {18227#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18227#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:49,415 INFO L273 TraceCheckUtils]: 86: Hoare triple {18227#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {18228#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:49,416 INFO L273 TraceCheckUtils]: 87: Hoare triple {18228#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18228#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:49,416 INFO L273 TraceCheckUtils]: 88: Hoare triple {18228#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18228#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:49,417 INFO L273 TraceCheckUtils]: 89: Hoare triple {18228#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {18229#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:49,418 INFO L273 TraceCheckUtils]: 90: Hoare triple {18229#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18229#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:49,418 INFO L273 TraceCheckUtils]: 91: Hoare triple {18229#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18229#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:49,419 INFO L273 TraceCheckUtils]: 92: Hoare triple {18229#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {18230#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:49,419 INFO L273 TraceCheckUtils]: 93: Hoare triple {18230#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18230#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:49,420 INFO L273 TraceCheckUtils]: 94: Hoare triple {18230#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18230#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:49,420 INFO L273 TraceCheckUtils]: 95: Hoare triple {18230#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {18231#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:49,421 INFO L273 TraceCheckUtils]: 96: Hoare triple {18231#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18231#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:49,422 INFO L273 TraceCheckUtils]: 97: Hoare triple {18231#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18231#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:49,422 INFO L273 TraceCheckUtils]: 98: Hoare triple {18231#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {18232#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:49,423 INFO L273 TraceCheckUtils]: 99: Hoare triple {18232#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18232#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:49,423 INFO L273 TraceCheckUtils]: 100: Hoare triple {18232#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18232#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:49,424 INFO L273 TraceCheckUtils]: 101: Hoare triple {18232#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {18233#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:49,425 INFO L273 TraceCheckUtils]: 102: Hoare triple {18233#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18233#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:49,425 INFO L273 TraceCheckUtils]: 103: Hoare triple {18233#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {18233#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:49,426 INFO L273 TraceCheckUtils]: 104: Hoare triple {18233#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {18234#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:49,427 INFO L273 TraceCheckUtils]: 105: Hoare triple {18234#(<= main_~i~0 33)} assume !(~i~0 < 100000); {18200#false} is VALID [2018-11-23 12:05:49,427 INFO L273 TraceCheckUtils]: 106: Hoare triple {18200#false} havoc ~x~0;~x~0 := 0; {18200#false} is VALID [2018-11-23 12:05:49,427 INFO L273 TraceCheckUtils]: 107: Hoare triple {18200#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {18200#false} is VALID [2018-11-23 12:05:49,428 INFO L256 TraceCheckUtils]: 108: Hoare triple {18200#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {18200#false} is VALID [2018-11-23 12:05:49,428 INFO L273 TraceCheckUtils]: 109: Hoare triple {18200#false} ~cond := #in~cond; {18200#false} is VALID [2018-11-23 12:05:49,428 INFO L273 TraceCheckUtils]: 110: Hoare triple {18200#false} assume 0 == ~cond; {18200#false} is VALID [2018-11-23 12:05:49,428 INFO L273 TraceCheckUtils]: 111: Hoare triple {18200#false} assume !false; {18200#false} is VALID [2018-11-23 12:05:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:49,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:49,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 12:05:49,482 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 112 [2018-11-23 12:05:49,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:49,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:05:49,600 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 12:05:49,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:05:49,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:05:49,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:05:49,602 INFO L87 Difference]: Start difference. First operand 117 states and 151 transitions. Second operand 37 states. [2018-11-23 12:05:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:50,358 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2018-11-23 12:05:50,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:05:50,359 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 112 [2018-11-23 12:05:50,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:05:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 170 transitions. [2018-11-23 12:05:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:05:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 170 transitions. [2018-11-23 12:05:50,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 170 transitions. [2018-11-23 12:05:50,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:50,533 INFO L225 Difference]: With dead ends: 133 [2018-11-23 12:05:50,533 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 12:05:50,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:05:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 12:05:50,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-11-23 12:05:50,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:50,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 120 states. [2018-11-23 12:05:50,571 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 120 states. [2018-11-23 12:05:50,571 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 120 states. [2018-11-23 12:05:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:50,574 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2018-11-23 12:05:50,574 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2018-11-23 12:05:50,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:50,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:50,575 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 122 states. [2018-11-23 12:05:50,575 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 122 states. [2018-11-23 12:05:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:50,577 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2018-11-23 12:05:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2018-11-23 12:05:50,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:50,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:50,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:50,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 12:05:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 155 transitions. [2018-11-23 12:05:50,581 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 155 transitions. Word has length 112 [2018-11-23 12:05:50,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:50,581 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 155 transitions. [2018-11-23 12:05:50,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:05:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 155 transitions. [2018-11-23 12:05:50,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 12:05:50,582 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:50,582 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:50,582 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:50,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:50,583 INFO L82 PathProgramCache]: Analyzing trace with hash -540319623, now seen corresponding path program 34 times [2018-11-23 12:05:50,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:50,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:50,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:50,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:50,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:52,936 INFO L256 TraceCheckUtils]: 0: Hoare triple {19155#true} call ULTIMATE.init(); {19155#true} is VALID [2018-11-23 12:05:52,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {19155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19155#true} is VALID [2018-11-23 12:05:52,937 INFO L273 TraceCheckUtils]: 2: Hoare triple {19155#true} assume true; {19155#true} is VALID [2018-11-23 12:05:52,937 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19155#true} {19155#true} #55#return; {19155#true} is VALID [2018-11-23 12:05:52,937 INFO L256 TraceCheckUtils]: 4: Hoare triple {19155#true} call #t~ret4 := main(); {19155#true} is VALID [2018-11-23 12:05:52,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {19155#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {19157#(= main_~i~0 0)} is VALID [2018-11-23 12:05:52,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {19157#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19157#(= main_~i~0 0)} is VALID [2018-11-23 12:05:52,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {19157#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19157#(= main_~i~0 0)} is VALID [2018-11-23 12:05:52,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {19157#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {19158#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:52,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {19158#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19158#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:52,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {19158#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19158#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:52,940 INFO L273 TraceCheckUtils]: 11: Hoare triple {19158#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {19159#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:52,940 INFO L273 TraceCheckUtils]: 12: Hoare triple {19159#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19159#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:52,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {19159#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19159#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:52,941 INFO L273 TraceCheckUtils]: 14: Hoare triple {19159#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {19160#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:52,942 INFO L273 TraceCheckUtils]: 15: Hoare triple {19160#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19160#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:52,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {19160#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19160#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:52,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {19160#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {19161#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:52,944 INFO L273 TraceCheckUtils]: 18: Hoare triple {19161#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19161#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:52,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {19161#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19161#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:52,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {19161#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {19162#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:52,946 INFO L273 TraceCheckUtils]: 21: Hoare triple {19162#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19162#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:52,946 INFO L273 TraceCheckUtils]: 22: Hoare triple {19162#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19162#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:52,947 INFO L273 TraceCheckUtils]: 23: Hoare triple {19162#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {19163#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:52,947 INFO L273 TraceCheckUtils]: 24: Hoare triple {19163#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19163#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:52,948 INFO L273 TraceCheckUtils]: 25: Hoare triple {19163#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19163#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:52,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {19163#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {19164#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:52,949 INFO L273 TraceCheckUtils]: 27: Hoare triple {19164#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19164#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:52,950 INFO L273 TraceCheckUtils]: 28: Hoare triple {19164#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19164#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:52,950 INFO L273 TraceCheckUtils]: 29: Hoare triple {19164#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {19165#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:52,951 INFO L273 TraceCheckUtils]: 30: Hoare triple {19165#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19165#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:52,951 INFO L273 TraceCheckUtils]: 31: Hoare triple {19165#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19165#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:52,952 INFO L273 TraceCheckUtils]: 32: Hoare triple {19165#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {19166#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:52,953 INFO L273 TraceCheckUtils]: 33: Hoare triple {19166#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19166#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:52,953 INFO L273 TraceCheckUtils]: 34: Hoare triple {19166#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19166#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:52,954 INFO L273 TraceCheckUtils]: 35: Hoare triple {19166#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {19167#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:52,954 INFO L273 TraceCheckUtils]: 36: Hoare triple {19167#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19167#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:52,955 INFO L273 TraceCheckUtils]: 37: Hoare triple {19167#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19167#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:52,955 INFO L273 TraceCheckUtils]: 38: Hoare triple {19167#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {19168#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:52,956 INFO L273 TraceCheckUtils]: 39: Hoare triple {19168#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19168#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:52,957 INFO L273 TraceCheckUtils]: 40: Hoare triple {19168#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19168#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:52,957 INFO L273 TraceCheckUtils]: 41: Hoare triple {19168#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {19169#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:52,958 INFO L273 TraceCheckUtils]: 42: Hoare triple {19169#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19169#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:52,958 INFO L273 TraceCheckUtils]: 43: Hoare triple {19169#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19169#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:52,959 INFO L273 TraceCheckUtils]: 44: Hoare triple {19169#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {19170#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:52,960 INFO L273 TraceCheckUtils]: 45: Hoare triple {19170#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19170#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:52,960 INFO L273 TraceCheckUtils]: 46: Hoare triple {19170#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19170#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:52,961 INFO L273 TraceCheckUtils]: 47: Hoare triple {19170#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {19171#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:52,961 INFO L273 TraceCheckUtils]: 48: Hoare triple {19171#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19171#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:52,962 INFO L273 TraceCheckUtils]: 49: Hoare triple {19171#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19171#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:52,962 INFO L273 TraceCheckUtils]: 50: Hoare triple {19171#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {19172#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:52,963 INFO L273 TraceCheckUtils]: 51: Hoare triple {19172#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19172#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:52,963 INFO L273 TraceCheckUtils]: 52: Hoare triple {19172#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19172#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:52,964 INFO L273 TraceCheckUtils]: 53: Hoare triple {19172#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {19173#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:52,965 INFO L273 TraceCheckUtils]: 54: Hoare triple {19173#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19173#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:52,965 INFO L273 TraceCheckUtils]: 55: Hoare triple {19173#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19173#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:52,966 INFO L273 TraceCheckUtils]: 56: Hoare triple {19173#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {19174#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:52,966 INFO L273 TraceCheckUtils]: 57: Hoare triple {19174#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19174#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:52,967 INFO L273 TraceCheckUtils]: 58: Hoare triple {19174#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19174#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:52,968 INFO L273 TraceCheckUtils]: 59: Hoare triple {19174#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {19175#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:52,968 INFO L273 TraceCheckUtils]: 60: Hoare triple {19175#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19175#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:52,969 INFO L273 TraceCheckUtils]: 61: Hoare triple {19175#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19175#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:52,969 INFO L273 TraceCheckUtils]: 62: Hoare triple {19175#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {19176#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:52,970 INFO L273 TraceCheckUtils]: 63: Hoare triple {19176#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19176#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:52,971 INFO L273 TraceCheckUtils]: 64: Hoare triple {19176#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19176#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:52,971 INFO L273 TraceCheckUtils]: 65: Hoare triple {19176#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {19177#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:52,972 INFO L273 TraceCheckUtils]: 66: Hoare triple {19177#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19177#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:52,972 INFO L273 TraceCheckUtils]: 67: Hoare triple {19177#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19177#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:52,973 INFO L273 TraceCheckUtils]: 68: Hoare triple {19177#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {19178#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:52,974 INFO L273 TraceCheckUtils]: 69: Hoare triple {19178#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19178#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:52,974 INFO L273 TraceCheckUtils]: 70: Hoare triple {19178#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19178#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:52,975 INFO L273 TraceCheckUtils]: 71: Hoare triple {19178#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {19179#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:52,975 INFO L273 TraceCheckUtils]: 72: Hoare triple {19179#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19179#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:52,976 INFO L273 TraceCheckUtils]: 73: Hoare triple {19179#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19179#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:52,976 INFO L273 TraceCheckUtils]: 74: Hoare triple {19179#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {19180#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:52,977 INFO L273 TraceCheckUtils]: 75: Hoare triple {19180#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19180#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:52,978 INFO L273 TraceCheckUtils]: 76: Hoare triple {19180#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19180#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:52,978 INFO L273 TraceCheckUtils]: 77: Hoare triple {19180#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {19181#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:52,979 INFO L273 TraceCheckUtils]: 78: Hoare triple {19181#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19181#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:52,979 INFO L273 TraceCheckUtils]: 79: Hoare triple {19181#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19181#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:52,980 INFO L273 TraceCheckUtils]: 80: Hoare triple {19181#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {19182#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:52,981 INFO L273 TraceCheckUtils]: 81: Hoare triple {19182#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19182#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:52,981 INFO L273 TraceCheckUtils]: 82: Hoare triple {19182#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19182#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:52,982 INFO L273 TraceCheckUtils]: 83: Hoare triple {19182#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {19183#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:52,982 INFO L273 TraceCheckUtils]: 84: Hoare triple {19183#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19183#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:52,983 INFO L273 TraceCheckUtils]: 85: Hoare triple {19183#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19183#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:52,984 INFO L273 TraceCheckUtils]: 86: Hoare triple {19183#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {19184#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:52,984 INFO L273 TraceCheckUtils]: 87: Hoare triple {19184#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19184#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:52,985 INFO L273 TraceCheckUtils]: 88: Hoare triple {19184#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19184#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:52,985 INFO L273 TraceCheckUtils]: 89: Hoare triple {19184#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {19185#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:52,986 INFO L273 TraceCheckUtils]: 90: Hoare triple {19185#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19185#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:52,986 INFO L273 TraceCheckUtils]: 91: Hoare triple {19185#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19185#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:52,987 INFO L273 TraceCheckUtils]: 92: Hoare triple {19185#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {19186#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:52,987 INFO L273 TraceCheckUtils]: 93: Hoare triple {19186#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19186#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:52,988 INFO L273 TraceCheckUtils]: 94: Hoare triple {19186#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19186#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:52,989 INFO L273 TraceCheckUtils]: 95: Hoare triple {19186#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {19187#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:52,989 INFO L273 TraceCheckUtils]: 96: Hoare triple {19187#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19187#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:52,990 INFO L273 TraceCheckUtils]: 97: Hoare triple {19187#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19187#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:52,990 INFO L273 TraceCheckUtils]: 98: Hoare triple {19187#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {19188#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:52,991 INFO L273 TraceCheckUtils]: 99: Hoare triple {19188#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19188#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:52,991 INFO L273 TraceCheckUtils]: 100: Hoare triple {19188#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19188#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:52,992 INFO L273 TraceCheckUtils]: 101: Hoare triple {19188#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {19189#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:52,993 INFO L273 TraceCheckUtils]: 102: Hoare triple {19189#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19189#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:52,993 INFO L273 TraceCheckUtils]: 103: Hoare triple {19189#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19189#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:52,994 INFO L273 TraceCheckUtils]: 104: Hoare triple {19189#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {19190#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:52,994 INFO L273 TraceCheckUtils]: 105: Hoare triple {19190#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19190#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:52,995 INFO L273 TraceCheckUtils]: 106: Hoare triple {19190#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19190#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:52,996 INFO L273 TraceCheckUtils]: 107: Hoare triple {19190#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {19191#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:52,996 INFO L273 TraceCheckUtils]: 108: Hoare triple {19191#(<= main_~i~0 34)} assume !(~i~0 < 100000); {19156#false} is VALID [2018-11-23 12:05:52,997 INFO L273 TraceCheckUtils]: 109: Hoare triple {19156#false} havoc ~x~0;~x~0 := 0; {19156#false} is VALID [2018-11-23 12:05:52,997 INFO L273 TraceCheckUtils]: 110: Hoare triple {19156#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {19156#false} is VALID [2018-11-23 12:05:52,997 INFO L256 TraceCheckUtils]: 111: Hoare triple {19156#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {19156#false} is VALID [2018-11-23 12:05:52,997 INFO L273 TraceCheckUtils]: 112: Hoare triple {19156#false} ~cond := #in~cond; {19156#false} is VALID [2018-11-23 12:05:52,997 INFO L273 TraceCheckUtils]: 113: Hoare triple {19156#false} assume 0 == ~cond; {19156#false} is VALID [2018-11-23 12:05:52,998 INFO L273 TraceCheckUtils]: 114: Hoare triple {19156#false} assume !false; {19156#false} is VALID [2018-11-23 12:05:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:53,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:53,008 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:53,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:53,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:53,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:53,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:53,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {19155#true} call ULTIMATE.init(); {19155#true} is VALID [2018-11-23 12:05:53,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {19155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19155#true} is VALID [2018-11-23 12:05:53,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {19155#true} assume true; {19155#true} is VALID [2018-11-23 12:05:53,420 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19155#true} {19155#true} #55#return; {19155#true} is VALID [2018-11-23 12:05:53,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {19155#true} call #t~ret4 := main(); {19155#true} is VALID [2018-11-23 12:05:53,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {19155#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {19210#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:53,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {19210#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19210#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:53,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {19210#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19210#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:53,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {19210#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {19158#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:53,423 INFO L273 TraceCheckUtils]: 9: Hoare triple {19158#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19158#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:53,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {19158#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19158#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:53,424 INFO L273 TraceCheckUtils]: 11: Hoare triple {19158#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {19159#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:53,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {19159#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19159#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:53,425 INFO L273 TraceCheckUtils]: 13: Hoare triple {19159#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19159#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:53,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {19159#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {19160#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:53,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {19160#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19160#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:53,426 INFO L273 TraceCheckUtils]: 16: Hoare triple {19160#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19160#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:53,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {19160#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {19161#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:53,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {19161#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19161#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:53,427 INFO L273 TraceCheckUtils]: 19: Hoare triple {19161#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19161#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:53,428 INFO L273 TraceCheckUtils]: 20: Hoare triple {19161#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {19162#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:53,429 INFO L273 TraceCheckUtils]: 21: Hoare triple {19162#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19162#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:53,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {19162#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19162#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:53,430 INFO L273 TraceCheckUtils]: 23: Hoare triple {19162#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {19163#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:53,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {19163#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19163#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:53,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {19163#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19163#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:53,432 INFO L273 TraceCheckUtils]: 26: Hoare triple {19163#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {19164#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:53,432 INFO L273 TraceCheckUtils]: 27: Hoare triple {19164#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19164#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:53,433 INFO L273 TraceCheckUtils]: 28: Hoare triple {19164#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19164#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:53,433 INFO L273 TraceCheckUtils]: 29: Hoare triple {19164#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {19165#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:53,434 INFO L273 TraceCheckUtils]: 30: Hoare triple {19165#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19165#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:53,434 INFO L273 TraceCheckUtils]: 31: Hoare triple {19165#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19165#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:53,435 INFO L273 TraceCheckUtils]: 32: Hoare triple {19165#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {19166#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:53,436 INFO L273 TraceCheckUtils]: 33: Hoare triple {19166#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19166#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:53,436 INFO L273 TraceCheckUtils]: 34: Hoare triple {19166#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19166#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:53,437 INFO L273 TraceCheckUtils]: 35: Hoare triple {19166#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {19167#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:53,437 INFO L273 TraceCheckUtils]: 36: Hoare triple {19167#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19167#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:53,438 INFO L273 TraceCheckUtils]: 37: Hoare triple {19167#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19167#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:53,439 INFO L273 TraceCheckUtils]: 38: Hoare triple {19167#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {19168#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:53,439 INFO L273 TraceCheckUtils]: 39: Hoare triple {19168#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19168#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:53,440 INFO L273 TraceCheckUtils]: 40: Hoare triple {19168#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19168#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:53,440 INFO L273 TraceCheckUtils]: 41: Hoare triple {19168#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {19169#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:53,441 INFO L273 TraceCheckUtils]: 42: Hoare triple {19169#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19169#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:53,441 INFO L273 TraceCheckUtils]: 43: Hoare triple {19169#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19169#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:53,442 INFO L273 TraceCheckUtils]: 44: Hoare triple {19169#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {19170#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:53,443 INFO L273 TraceCheckUtils]: 45: Hoare triple {19170#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19170#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:53,443 INFO L273 TraceCheckUtils]: 46: Hoare triple {19170#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19170#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:53,444 INFO L273 TraceCheckUtils]: 47: Hoare triple {19170#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {19171#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:53,444 INFO L273 TraceCheckUtils]: 48: Hoare triple {19171#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19171#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:53,445 INFO L273 TraceCheckUtils]: 49: Hoare triple {19171#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19171#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:53,446 INFO L273 TraceCheckUtils]: 50: Hoare triple {19171#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {19172#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:53,446 INFO L273 TraceCheckUtils]: 51: Hoare triple {19172#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19172#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:53,447 INFO L273 TraceCheckUtils]: 52: Hoare triple {19172#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19172#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:53,447 INFO L273 TraceCheckUtils]: 53: Hoare triple {19172#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {19173#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:53,448 INFO L273 TraceCheckUtils]: 54: Hoare triple {19173#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19173#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:53,448 INFO L273 TraceCheckUtils]: 55: Hoare triple {19173#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19173#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:53,449 INFO L273 TraceCheckUtils]: 56: Hoare triple {19173#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {19174#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:53,450 INFO L273 TraceCheckUtils]: 57: Hoare triple {19174#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19174#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:53,450 INFO L273 TraceCheckUtils]: 58: Hoare triple {19174#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19174#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:53,451 INFO L273 TraceCheckUtils]: 59: Hoare triple {19174#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {19175#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:53,451 INFO L273 TraceCheckUtils]: 60: Hoare triple {19175#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19175#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:53,452 INFO L273 TraceCheckUtils]: 61: Hoare triple {19175#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19175#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:53,453 INFO L273 TraceCheckUtils]: 62: Hoare triple {19175#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {19176#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:53,453 INFO L273 TraceCheckUtils]: 63: Hoare triple {19176#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19176#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:53,454 INFO L273 TraceCheckUtils]: 64: Hoare triple {19176#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19176#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:53,454 INFO L273 TraceCheckUtils]: 65: Hoare triple {19176#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {19177#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:53,455 INFO L273 TraceCheckUtils]: 66: Hoare triple {19177#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19177#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:53,455 INFO L273 TraceCheckUtils]: 67: Hoare triple {19177#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19177#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:53,456 INFO L273 TraceCheckUtils]: 68: Hoare triple {19177#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {19178#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:53,457 INFO L273 TraceCheckUtils]: 69: Hoare triple {19178#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19178#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:53,457 INFO L273 TraceCheckUtils]: 70: Hoare triple {19178#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19178#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:53,458 INFO L273 TraceCheckUtils]: 71: Hoare triple {19178#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {19179#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:53,458 INFO L273 TraceCheckUtils]: 72: Hoare triple {19179#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19179#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:53,459 INFO L273 TraceCheckUtils]: 73: Hoare triple {19179#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19179#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:53,460 INFO L273 TraceCheckUtils]: 74: Hoare triple {19179#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {19180#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:53,460 INFO L273 TraceCheckUtils]: 75: Hoare triple {19180#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19180#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:53,461 INFO L273 TraceCheckUtils]: 76: Hoare triple {19180#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19180#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:53,461 INFO L273 TraceCheckUtils]: 77: Hoare triple {19180#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {19181#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:53,462 INFO L273 TraceCheckUtils]: 78: Hoare triple {19181#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19181#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:53,462 INFO L273 TraceCheckUtils]: 79: Hoare triple {19181#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19181#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:53,463 INFO L273 TraceCheckUtils]: 80: Hoare triple {19181#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {19182#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:53,464 INFO L273 TraceCheckUtils]: 81: Hoare triple {19182#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19182#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:53,464 INFO L273 TraceCheckUtils]: 82: Hoare triple {19182#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19182#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:53,465 INFO L273 TraceCheckUtils]: 83: Hoare triple {19182#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {19183#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:53,465 INFO L273 TraceCheckUtils]: 84: Hoare triple {19183#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19183#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:53,466 INFO L273 TraceCheckUtils]: 85: Hoare triple {19183#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19183#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:53,467 INFO L273 TraceCheckUtils]: 86: Hoare triple {19183#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {19184#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:53,467 INFO L273 TraceCheckUtils]: 87: Hoare triple {19184#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19184#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:53,468 INFO L273 TraceCheckUtils]: 88: Hoare triple {19184#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19184#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:53,468 INFO L273 TraceCheckUtils]: 89: Hoare triple {19184#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {19185#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:53,469 INFO L273 TraceCheckUtils]: 90: Hoare triple {19185#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19185#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:53,469 INFO L273 TraceCheckUtils]: 91: Hoare triple {19185#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19185#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:53,470 INFO L273 TraceCheckUtils]: 92: Hoare triple {19185#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {19186#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:53,471 INFO L273 TraceCheckUtils]: 93: Hoare triple {19186#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19186#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:53,471 INFO L273 TraceCheckUtils]: 94: Hoare triple {19186#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19186#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:53,472 INFO L273 TraceCheckUtils]: 95: Hoare triple {19186#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {19187#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:53,472 INFO L273 TraceCheckUtils]: 96: Hoare triple {19187#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19187#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:53,473 INFO L273 TraceCheckUtils]: 97: Hoare triple {19187#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19187#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:53,474 INFO L273 TraceCheckUtils]: 98: Hoare triple {19187#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {19188#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:53,474 INFO L273 TraceCheckUtils]: 99: Hoare triple {19188#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19188#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:53,475 INFO L273 TraceCheckUtils]: 100: Hoare triple {19188#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19188#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:53,475 INFO L273 TraceCheckUtils]: 101: Hoare triple {19188#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {19189#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:53,476 INFO L273 TraceCheckUtils]: 102: Hoare triple {19189#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19189#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:53,476 INFO L273 TraceCheckUtils]: 103: Hoare triple {19189#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19189#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:53,477 INFO L273 TraceCheckUtils]: 104: Hoare triple {19189#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {19190#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:53,478 INFO L273 TraceCheckUtils]: 105: Hoare triple {19190#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19190#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:53,478 INFO L273 TraceCheckUtils]: 106: Hoare triple {19190#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {19190#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:53,479 INFO L273 TraceCheckUtils]: 107: Hoare triple {19190#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {19191#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:53,479 INFO L273 TraceCheckUtils]: 108: Hoare triple {19191#(<= main_~i~0 34)} assume !(~i~0 < 100000); {19156#false} is VALID [2018-11-23 12:05:53,480 INFO L273 TraceCheckUtils]: 109: Hoare triple {19156#false} havoc ~x~0;~x~0 := 0; {19156#false} is VALID [2018-11-23 12:05:53,480 INFO L273 TraceCheckUtils]: 110: Hoare triple {19156#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {19156#false} is VALID [2018-11-23 12:05:53,480 INFO L256 TraceCheckUtils]: 111: Hoare triple {19156#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {19156#false} is VALID [2018-11-23 12:05:53,480 INFO L273 TraceCheckUtils]: 112: Hoare triple {19156#false} ~cond := #in~cond; {19156#false} is VALID [2018-11-23 12:05:53,480 INFO L273 TraceCheckUtils]: 113: Hoare triple {19156#false} assume 0 == ~cond; {19156#false} is VALID [2018-11-23 12:05:53,481 INFO L273 TraceCheckUtils]: 114: Hoare triple {19156#false} assume !false; {19156#false} is VALID [2018-11-23 12:05:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:53,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:53,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 12:05:53,512 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 115 [2018-11-23 12:05:53,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:53,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:05:53,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:53,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:05:53,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:05:53,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:05:53,630 INFO L87 Difference]: Start difference. First operand 120 states and 155 transitions. Second operand 38 states. [2018-11-23 12:05:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:54,373 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2018-11-23 12:05:54,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 12:05:54,373 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 115 [2018-11-23 12:05:54,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:05:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 174 transitions. [2018-11-23 12:05:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:05:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 174 transitions. [2018-11-23 12:05:54,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 174 transitions. [2018-11-23 12:05:54,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:54,871 INFO L225 Difference]: With dead ends: 136 [2018-11-23 12:05:54,871 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:05:54,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:05:54,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:05:54,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-23 12:05:54,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:54,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 123 states. [2018-11-23 12:05:54,901 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 123 states. [2018-11-23 12:05:54,901 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 123 states. [2018-11-23 12:05:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:54,904 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2018-11-23 12:05:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2018-11-23 12:05:54,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:54,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:54,905 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 125 states. [2018-11-23 12:05:54,905 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 125 states. [2018-11-23 12:05:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:54,907 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2018-11-23 12:05:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2018-11-23 12:05:54,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:54,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:54,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:54,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 12:05:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 159 transitions. [2018-11-23 12:05:54,909 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 159 transitions. Word has length 115 [2018-11-23 12:05:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:54,909 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 159 transitions. [2018-11-23 12:05:54,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:05:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 159 transitions. [2018-11-23 12:05:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:05:54,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:54,910 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:54,910 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:54,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:54,910 INFO L82 PathProgramCache]: Analyzing trace with hash -79097565, now seen corresponding path program 35 times [2018-11-23 12:05:54,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:54,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:54,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:54,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:54,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:55,640 INFO L256 TraceCheckUtils]: 0: Hoare triple {20135#true} call ULTIMATE.init(); {20135#true} is VALID [2018-11-23 12:05:55,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {20135#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20135#true} is VALID [2018-11-23 12:05:55,640 INFO L273 TraceCheckUtils]: 2: Hoare triple {20135#true} assume true; {20135#true} is VALID [2018-11-23 12:05:55,640 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20135#true} {20135#true} #55#return; {20135#true} is VALID [2018-11-23 12:05:55,640 INFO L256 TraceCheckUtils]: 4: Hoare triple {20135#true} call #t~ret4 := main(); {20135#true} is VALID [2018-11-23 12:05:55,641 INFO L273 TraceCheckUtils]: 5: Hoare triple {20135#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {20137#(= main_~i~0 0)} is VALID [2018-11-23 12:05:55,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {20137#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20137#(= main_~i~0 0)} is VALID [2018-11-23 12:05:55,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {20137#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20137#(= main_~i~0 0)} is VALID [2018-11-23 12:05:55,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {20137#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {20138#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:55,643 INFO L273 TraceCheckUtils]: 9: Hoare triple {20138#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20138#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:55,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {20138#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20138#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:55,644 INFO L273 TraceCheckUtils]: 11: Hoare triple {20138#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {20139#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:55,645 INFO L273 TraceCheckUtils]: 12: Hoare triple {20139#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20139#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:55,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {20139#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20139#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:55,646 INFO L273 TraceCheckUtils]: 14: Hoare triple {20139#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {20140#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:55,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {20140#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20140#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:55,647 INFO L273 TraceCheckUtils]: 16: Hoare triple {20140#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20140#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:55,648 INFO L273 TraceCheckUtils]: 17: Hoare triple {20140#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {20141#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:55,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {20141#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20141#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:55,649 INFO L273 TraceCheckUtils]: 19: Hoare triple {20141#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20141#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:55,649 INFO L273 TraceCheckUtils]: 20: Hoare triple {20141#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {20142#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:55,650 INFO L273 TraceCheckUtils]: 21: Hoare triple {20142#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20142#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:55,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {20142#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20142#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:55,651 INFO L273 TraceCheckUtils]: 23: Hoare triple {20142#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {20143#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:55,652 INFO L273 TraceCheckUtils]: 24: Hoare triple {20143#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20143#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:55,652 INFO L273 TraceCheckUtils]: 25: Hoare triple {20143#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20143#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:55,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {20143#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {20144#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:55,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {20144#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20144#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:55,654 INFO L273 TraceCheckUtils]: 28: Hoare triple {20144#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20144#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:55,655 INFO L273 TraceCheckUtils]: 29: Hoare triple {20144#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {20145#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:55,655 INFO L273 TraceCheckUtils]: 30: Hoare triple {20145#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20145#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:55,656 INFO L273 TraceCheckUtils]: 31: Hoare triple {20145#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20145#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:55,656 INFO L273 TraceCheckUtils]: 32: Hoare triple {20145#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {20146#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:55,657 INFO L273 TraceCheckUtils]: 33: Hoare triple {20146#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20146#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:55,657 INFO L273 TraceCheckUtils]: 34: Hoare triple {20146#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20146#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:55,658 INFO L273 TraceCheckUtils]: 35: Hoare triple {20146#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {20147#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:55,659 INFO L273 TraceCheckUtils]: 36: Hoare triple {20147#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20147#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:55,659 INFO L273 TraceCheckUtils]: 37: Hoare triple {20147#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20147#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:55,660 INFO L273 TraceCheckUtils]: 38: Hoare triple {20147#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {20148#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:55,660 INFO L273 TraceCheckUtils]: 39: Hoare triple {20148#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20148#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:55,661 INFO L273 TraceCheckUtils]: 40: Hoare triple {20148#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20148#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:55,662 INFO L273 TraceCheckUtils]: 41: Hoare triple {20148#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {20149#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:55,662 INFO L273 TraceCheckUtils]: 42: Hoare triple {20149#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20149#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:55,663 INFO L273 TraceCheckUtils]: 43: Hoare triple {20149#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20149#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:55,663 INFO L273 TraceCheckUtils]: 44: Hoare triple {20149#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {20150#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:55,664 INFO L273 TraceCheckUtils]: 45: Hoare triple {20150#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20150#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:55,664 INFO L273 TraceCheckUtils]: 46: Hoare triple {20150#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20150#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:55,665 INFO L273 TraceCheckUtils]: 47: Hoare triple {20150#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {20151#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:55,666 INFO L273 TraceCheckUtils]: 48: Hoare triple {20151#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20151#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:55,666 INFO L273 TraceCheckUtils]: 49: Hoare triple {20151#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20151#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:55,667 INFO L273 TraceCheckUtils]: 50: Hoare triple {20151#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {20152#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:55,667 INFO L273 TraceCheckUtils]: 51: Hoare triple {20152#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20152#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:55,668 INFO L273 TraceCheckUtils]: 52: Hoare triple {20152#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20152#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:55,669 INFO L273 TraceCheckUtils]: 53: Hoare triple {20152#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {20153#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:55,669 INFO L273 TraceCheckUtils]: 54: Hoare triple {20153#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20153#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:55,670 INFO L273 TraceCheckUtils]: 55: Hoare triple {20153#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20153#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:55,670 INFO L273 TraceCheckUtils]: 56: Hoare triple {20153#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {20154#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:55,671 INFO L273 TraceCheckUtils]: 57: Hoare triple {20154#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20154#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:55,671 INFO L273 TraceCheckUtils]: 58: Hoare triple {20154#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20154#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:55,672 INFO L273 TraceCheckUtils]: 59: Hoare triple {20154#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {20155#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:55,673 INFO L273 TraceCheckUtils]: 60: Hoare triple {20155#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20155#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:55,673 INFO L273 TraceCheckUtils]: 61: Hoare triple {20155#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20155#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:55,674 INFO L273 TraceCheckUtils]: 62: Hoare triple {20155#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {20156#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:55,674 INFO L273 TraceCheckUtils]: 63: Hoare triple {20156#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20156#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:55,675 INFO L273 TraceCheckUtils]: 64: Hoare triple {20156#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20156#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:55,676 INFO L273 TraceCheckUtils]: 65: Hoare triple {20156#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {20157#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:55,676 INFO L273 TraceCheckUtils]: 66: Hoare triple {20157#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20157#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:55,677 INFO L273 TraceCheckUtils]: 67: Hoare triple {20157#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20157#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:55,677 INFO L273 TraceCheckUtils]: 68: Hoare triple {20157#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {20158#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:55,678 INFO L273 TraceCheckUtils]: 69: Hoare triple {20158#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20158#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:55,678 INFO L273 TraceCheckUtils]: 70: Hoare triple {20158#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20158#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:55,679 INFO L273 TraceCheckUtils]: 71: Hoare triple {20158#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {20159#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:55,680 INFO L273 TraceCheckUtils]: 72: Hoare triple {20159#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20159#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:55,680 INFO L273 TraceCheckUtils]: 73: Hoare triple {20159#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20159#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:55,681 INFO L273 TraceCheckUtils]: 74: Hoare triple {20159#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {20160#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:55,681 INFO L273 TraceCheckUtils]: 75: Hoare triple {20160#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20160#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:55,682 INFO L273 TraceCheckUtils]: 76: Hoare triple {20160#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20160#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:55,683 INFO L273 TraceCheckUtils]: 77: Hoare triple {20160#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {20161#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:55,683 INFO L273 TraceCheckUtils]: 78: Hoare triple {20161#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20161#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:55,684 INFO L273 TraceCheckUtils]: 79: Hoare triple {20161#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20161#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:55,684 INFO L273 TraceCheckUtils]: 80: Hoare triple {20161#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {20162#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:55,685 INFO L273 TraceCheckUtils]: 81: Hoare triple {20162#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20162#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:55,685 INFO L273 TraceCheckUtils]: 82: Hoare triple {20162#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20162#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:55,686 INFO L273 TraceCheckUtils]: 83: Hoare triple {20162#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {20163#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:55,687 INFO L273 TraceCheckUtils]: 84: Hoare triple {20163#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20163#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:55,687 INFO L273 TraceCheckUtils]: 85: Hoare triple {20163#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20163#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:55,688 INFO L273 TraceCheckUtils]: 86: Hoare triple {20163#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {20164#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:55,688 INFO L273 TraceCheckUtils]: 87: Hoare triple {20164#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20164#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:55,689 INFO L273 TraceCheckUtils]: 88: Hoare triple {20164#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20164#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:55,690 INFO L273 TraceCheckUtils]: 89: Hoare triple {20164#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {20165#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:55,690 INFO L273 TraceCheckUtils]: 90: Hoare triple {20165#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20165#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:55,691 INFO L273 TraceCheckUtils]: 91: Hoare triple {20165#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20165#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:55,691 INFO L273 TraceCheckUtils]: 92: Hoare triple {20165#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {20166#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:55,692 INFO L273 TraceCheckUtils]: 93: Hoare triple {20166#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20166#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:55,692 INFO L273 TraceCheckUtils]: 94: Hoare triple {20166#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20166#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:55,693 INFO L273 TraceCheckUtils]: 95: Hoare triple {20166#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {20167#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:55,694 INFO L273 TraceCheckUtils]: 96: Hoare triple {20167#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20167#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:55,694 INFO L273 TraceCheckUtils]: 97: Hoare triple {20167#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20167#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:55,695 INFO L273 TraceCheckUtils]: 98: Hoare triple {20167#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {20168#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:55,695 INFO L273 TraceCheckUtils]: 99: Hoare triple {20168#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20168#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:55,696 INFO L273 TraceCheckUtils]: 100: Hoare triple {20168#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20168#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:55,697 INFO L273 TraceCheckUtils]: 101: Hoare triple {20168#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {20169#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:55,697 INFO L273 TraceCheckUtils]: 102: Hoare triple {20169#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20169#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:55,698 INFO L273 TraceCheckUtils]: 103: Hoare triple {20169#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20169#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:55,698 INFO L273 TraceCheckUtils]: 104: Hoare triple {20169#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {20170#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:55,699 INFO L273 TraceCheckUtils]: 105: Hoare triple {20170#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20170#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:55,699 INFO L273 TraceCheckUtils]: 106: Hoare triple {20170#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20170#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:55,700 INFO L273 TraceCheckUtils]: 107: Hoare triple {20170#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {20171#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:55,701 INFO L273 TraceCheckUtils]: 108: Hoare triple {20171#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20171#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:55,701 INFO L273 TraceCheckUtils]: 109: Hoare triple {20171#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20171#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:55,702 INFO L273 TraceCheckUtils]: 110: Hoare triple {20171#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {20172#(<= main_~i~0 35)} is VALID [2018-11-23 12:05:55,702 INFO L273 TraceCheckUtils]: 111: Hoare triple {20172#(<= main_~i~0 35)} assume !(~i~0 < 100000); {20136#false} is VALID [2018-11-23 12:05:55,703 INFO L273 TraceCheckUtils]: 112: Hoare triple {20136#false} havoc ~x~0;~x~0 := 0; {20136#false} is VALID [2018-11-23 12:05:55,703 INFO L273 TraceCheckUtils]: 113: Hoare triple {20136#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {20136#false} is VALID [2018-11-23 12:05:55,703 INFO L256 TraceCheckUtils]: 114: Hoare triple {20136#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {20136#false} is VALID [2018-11-23 12:05:55,703 INFO L273 TraceCheckUtils]: 115: Hoare triple {20136#false} ~cond := #in~cond; {20136#false} is VALID [2018-11-23 12:05:55,703 INFO L273 TraceCheckUtils]: 116: Hoare triple {20136#false} assume 0 == ~cond; {20136#false} is VALID [2018-11-23 12:05:55,704 INFO L273 TraceCheckUtils]: 117: Hoare triple {20136#false} assume !false; {20136#false} is VALID [2018-11-23 12:05:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:55,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:55,715 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:55,724 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:55,805 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 12:05:55,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:55,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:56,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {20135#true} call ULTIMATE.init(); {20135#true} is VALID [2018-11-23 12:05:56,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {20135#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20135#true} is VALID [2018-11-23 12:05:56,460 INFO L273 TraceCheckUtils]: 2: Hoare triple {20135#true} assume true; {20135#true} is VALID [2018-11-23 12:05:56,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20135#true} {20135#true} #55#return; {20135#true} is VALID [2018-11-23 12:05:56,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {20135#true} call #t~ret4 := main(); {20135#true} is VALID [2018-11-23 12:05:56,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {20135#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {20191#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:56,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {20191#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20191#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:56,462 INFO L273 TraceCheckUtils]: 7: Hoare triple {20191#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20191#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:56,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {20191#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {20138#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:56,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {20138#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20138#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:56,463 INFO L273 TraceCheckUtils]: 10: Hoare triple {20138#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20138#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:56,463 INFO L273 TraceCheckUtils]: 11: Hoare triple {20138#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {20139#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:56,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {20139#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20139#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:56,464 INFO L273 TraceCheckUtils]: 13: Hoare triple {20139#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20139#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:56,464 INFO L273 TraceCheckUtils]: 14: Hoare triple {20139#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {20140#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:56,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {20140#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20140#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:56,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {20140#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20140#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:56,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {20140#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {20141#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:56,466 INFO L273 TraceCheckUtils]: 18: Hoare triple {20141#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20141#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:56,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {20141#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20141#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:56,468 INFO L273 TraceCheckUtils]: 20: Hoare triple {20141#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {20142#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:56,468 INFO L273 TraceCheckUtils]: 21: Hoare triple {20142#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20142#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:56,468 INFO L273 TraceCheckUtils]: 22: Hoare triple {20142#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20142#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:56,469 INFO L273 TraceCheckUtils]: 23: Hoare triple {20142#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {20143#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:56,470 INFO L273 TraceCheckUtils]: 24: Hoare triple {20143#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20143#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:56,470 INFO L273 TraceCheckUtils]: 25: Hoare triple {20143#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20143#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:56,471 INFO L273 TraceCheckUtils]: 26: Hoare triple {20143#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {20144#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:56,471 INFO L273 TraceCheckUtils]: 27: Hoare triple {20144#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20144#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:56,472 INFO L273 TraceCheckUtils]: 28: Hoare triple {20144#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20144#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:56,472 INFO L273 TraceCheckUtils]: 29: Hoare triple {20144#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {20145#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:56,473 INFO L273 TraceCheckUtils]: 30: Hoare triple {20145#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20145#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:56,473 INFO L273 TraceCheckUtils]: 31: Hoare triple {20145#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20145#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:56,474 INFO L273 TraceCheckUtils]: 32: Hoare triple {20145#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {20146#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:56,474 INFO L273 TraceCheckUtils]: 33: Hoare triple {20146#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20146#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:56,475 INFO L273 TraceCheckUtils]: 34: Hoare triple {20146#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20146#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:56,476 INFO L273 TraceCheckUtils]: 35: Hoare triple {20146#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {20147#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:56,476 INFO L273 TraceCheckUtils]: 36: Hoare triple {20147#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20147#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:56,477 INFO L273 TraceCheckUtils]: 37: Hoare triple {20147#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20147#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:56,477 INFO L273 TraceCheckUtils]: 38: Hoare triple {20147#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {20148#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:56,478 INFO L273 TraceCheckUtils]: 39: Hoare triple {20148#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20148#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:56,478 INFO L273 TraceCheckUtils]: 40: Hoare triple {20148#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20148#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:56,479 INFO L273 TraceCheckUtils]: 41: Hoare triple {20148#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {20149#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:56,479 INFO L273 TraceCheckUtils]: 42: Hoare triple {20149#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20149#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:56,480 INFO L273 TraceCheckUtils]: 43: Hoare triple {20149#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20149#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:56,480 INFO L273 TraceCheckUtils]: 44: Hoare triple {20149#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {20150#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:56,481 INFO L273 TraceCheckUtils]: 45: Hoare triple {20150#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20150#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:56,481 INFO L273 TraceCheckUtils]: 46: Hoare triple {20150#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20150#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:56,482 INFO L273 TraceCheckUtils]: 47: Hoare triple {20150#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {20151#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:56,483 INFO L273 TraceCheckUtils]: 48: Hoare triple {20151#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20151#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:56,483 INFO L273 TraceCheckUtils]: 49: Hoare triple {20151#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20151#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:56,484 INFO L273 TraceCheckUtils]: 50: Hoare triple {20151#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {20152#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:56,484 INFO L273 TraceCheckUtils]: 51: Hoare triple {20152#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20152#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:56,485 INFO L273 TraceCheckUtils]: 52: Hoare triple {20152#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20152#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:56,485 INFO L273 TraceCheckUtils]: 53: Hoare triple {20152#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {20153#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:56,486 INFO L273 TraceCheckUtils]: 54: Hoare triple {20153#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20153#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:56,486 INFO L273 TraceCheckUtils]: 55: Hoare triple {20153#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20153#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:56,487 INFO L273 TraceCheckUtils]: 56: Hoare triple {20153#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {20154#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:56,487 INFO L273 TraceCheckUtils]: 57: Hoare triple {20154#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20154#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:56,488 INFO L273 TraceCheckUtils]: 58: Hoare triple {20154#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20154#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:56,489 INFO L273 TraceCheckUtils]: 59: Hoare triple {20154#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {20155#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:56,489 INFO L273 TraceCheckUtils]: 60: Hoare triple {20155#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20155#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:56,489 INFO L273 TraceCheckUtils]: 61: Hoare triple {20155#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20155#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:56,490 INFO L273 TraceCheckUtils]: 62: Hoare triple {20155#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {20156#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:56,491 INFO L273 TraceCheckUtils]: 63: Hoare triple {20156#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20156#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:56,491 INFO L273 TraceCheckUtils]: 64: Hoare triple {20156#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20156#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:56,492 INFO L273 TraceCheckUtils]: 65: Hoare triple {20156#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {20157#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:56,492 INFO L273 TraceCheckUtils]: 66: Hoare triple {20157#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20157#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:56,493 INFO L273 TraceCheckUtils]: 67: Hoare triple {20157#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20157#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:56,493 INFO L273 TraceCheckUtils]: 68: Hoare triple {20157#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {20158#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:56,494 INFO L273 TraceCheckUtils]: 69: Hoare triple {20158#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20158#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:56,494 INFO L273 TraceCheckUtils]: 70: Hoare triple {20158#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20158#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:56,495 INFO L273 TraceCheckUtils]: 71: Hoare triple {20158#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {20159#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:56,495 INFO L273 TraceCheckUtils]: 72: Hoare triple {20159#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20159#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:56,496 INFO L273 TraceCheckUtils]: 73: Hoare triple {20159#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20159#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:56,497 INFO L273 TraceCheckUtils]: 74: Hoare triple {20159#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {20160#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:56,497 INFO L273 TraceCheckUtils]: 75: Hoare triple {20160#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20160#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:56,498 INFO L273 TraceCheckUtils]: 76: Hoare triple {20160#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20160#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:56,498 INFO L273 TraceCheckUtils]: 77: Hoare triple {20160#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {20161#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:56,499 INFO L273 TraceCheckUtils]: 78: Hoare triple {20161#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20161#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:56,499 INFO L273 TraceCheckUtils]: 79: Hoare triple {20161#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20161#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:56,500 INFO L273 TraceCheckUtils]: 80: Hoare triple {20161#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {20162#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:56,500 INFO L273 TraceCheckUtils]: 81: Hoare triple {20162#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20162#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:56,501 INFO L273 TraceCheckUtils]: 82: Hoare triple {20162#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20162#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:56,501 INFO L273 TraceCheckUtils]: 83: Hoare triple {20162#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {20163#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:56,502 INFO L273 TraceCheckUtils]: 84: Hoare triple {20163#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20163#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:56,502 INFO L273 TraceCheckUtils]: 85: Hoare triple {20163#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20163#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:56,503 INFO L273 TraceCheckUtils]: 86: Hoare triple {20163#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {20164#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:56,504 INFO L273 TraceCheckUtils]: 87: Hoare triple {20164#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20164#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:56,504 INFO L273 TraceCheckUtils]: 88: Hoare triple {20164#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20164#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:56,505 INFO L273 TraceCheckUtils]: 89: Hoare triple {20164#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {20165#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:56,505 INFO L273 TraceCheckUtils]: 90: Hoare triple {20165#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20165#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:56,506 INFO L273 TraceCheckUtils]: 91: Hoare triple {20165#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20165#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:56,506 INFO L273 TraceCheckUtils]: 92: Hoare triple {20165#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {20166#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:56,507 INFO L273 TraceCheckUtils]: 93: Hoare triple {20166#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20166#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:56,507 INFO L273 TraceCheckUtils]: 94: Hoare triple {20166#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20166#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:56,508 INFO L273 TraceCheckUtils]: 95: Hoare triple {20166#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {20167#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:56,509 INFO L273 TraceCheckUtils]: 96: Hoare triple {20167#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20167#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:56,509 INFO L273 TraceCheckUtils]: 97: Hoare triple {20167#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20167#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:56,510 INFO L273 TraceCheckUtils]: 98: Hoare triple {20167#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {20168#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:56,510 INFO L273 TraceCheckUtils]: 99: Hoare triple {20168#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20168#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:56,511 INFO L273 TraceCheckUtils]: 100: Hoare triple {20168#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20168#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:56,511 INFO L273 TraceCheckUtils]: 101: Hoare triple {20168#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {20169#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:56,512 INFO L273 TraceCheckUtils]: 102: Hoare triple {20169#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20169#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:56,512 INFO L273 TraceCheckUtils]: 103: Hoare triple {20169#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20169#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:56,513 INFO L273 TraceCheckUtils]: 104: Hoare triple {20169#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {20170#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:56,513 INFO L273 TraceCheckUtils]: 105: Hoare triple {20170#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20170#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:56,514 INFO L273 TraceCheckUtils]: 106: Hoare triple {20170#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20170#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:56,515 INFO L273 TraceCheckUtils]: 107: Hoare triple {20170#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {20171#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:56,515 INFO L273 TraceCheckUtils]: 108: Hoare triple {20171#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20171#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:56,516 INFO L273 TraceCheckUtils]: 109: Hoare triple {20171#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {20171#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:56,516 INFO L273 TraceCheckUtils]: 110: Hoare triple {20171#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {20172#(<= main_~i~0 35)} is VALID [2018-11-23 12:05:56,517 INFO L273 TraceCheckUtils]: 111: Hoare triple {20172#(<= main_~i~0 35)} assume !(~i~0 < 100000); {20136#false} is VALID [2018-11-23 12:05:56,517 INFO L273 TraceCheckUtils]: 112: Hoare triple {20136#false} havoc ~x~0;~x~0 := 0; {20136#false} is VALID [2018-11-23 12:05:56,517 INFO L273 TraceCheckUtils]: 113: Hoare triple {20136#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {20136#false} is VALID [2018-11-23 12:05:56,517 INFO L256 TraceCheckUtils]: 114: Hoare triple {20136#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {20136#false} is VALID [2018-11-23 12:05:56,518 INFO L273 TraceCheckUtils]: 115: Hoare triple {20136#false} ~cond := #in~cond; {20136#false} is VALID [2018-11-23 12:05:56,518 INFO L273 TraceCheckUtils]: 116: Hoare triple {20136#false} assume 0 == ~cond; {20136#false} is VALID [2018-11-23 12:05:56,518 INFO L273 TraceCheckUtils]: 117: Hoare triple {20136#false} assume !false; {20136#false} is VALID [2018-11-23 12:05:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:56,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:56,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-23 12:05:56,547 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 118 [2018-11-23 12:05:56,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:56,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 12:05:56,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:56,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 12:05:56,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 12:05:56,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:05:56,713 INFO L87 Difference]: Start difference. First operand 123 states and 159 transitions. Second operand 39 states. [2018-11-23 12:05:57,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:57,234 INFO L93 Difference]: Finished difference Result 139 states and 178 transitions. [2018-11-23 12:05:57,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:05:57,234 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 118 [2018-11-23 12:05:57,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:05:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 178 transitions. [2018-11-23 12:05:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:05:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 178 transitions. [2018-11-23 12:05:57,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 178 transitions. [2018-11-23 12:05:57,413 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 12:05:57,416 INFO L225 Difference]: With dead ends: 139 [2018-11-23 12:05:57,416 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:05:57,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:05:57,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:05:57,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-23 12:05:57,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:57,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 126 states. [2018-11-23 12:05:57,833 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 126 states. [2018-11-23 12:05:57,834 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 126 states. [2018-11-23 12:05:57,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:57,835 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2018-11-23 12:05:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 166 transitions. [2018-11-23 12:05:57,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:57,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:57,836 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 128 states. [2018-11-23 12:05:57,836 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 128 states. [2018-11-23 12:05:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:57,838 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2018-11-23 12:05:57,839 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 166 transitions. [2018-11-23 12:05:57,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:57,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:57,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:57,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 12:05:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2018-11-23 12:05:57,842 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 118 [2018-11-23 12:05:57,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:57,842 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2018-11-23 12:05:57,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 12:05:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2018-11-23 12:05:57,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 12:05:57,843 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:57,843 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:57,843 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:57,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash 586852409, now seen corresponding path program 36 times [2018-11-23 12:05:57,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:57,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:57,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:57,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:59,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {21139#true} call ULTIMATE.init(); {21139#true} is VALID [2018-11-23 12:05:59,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {21139#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21139#true} is VALID [2018-11-23 12:05:59,156 INFO L273 TraceCheckUtils]: 2: Hoare triple {21139#true} assume true; {21139#true} is VALID [2018-11-23 12:05:59,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21139#true} {21139#true} #55#return; {21139#true} is VALID [2018-11-23 12:05:59,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {21139#true} call #t~ret4 := main(); {21139#true} is VALID [2018-11-23 12:05:59,157 INFO L273 TraceCheckUtils]: 5: Hoare triple {21139#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {21141#(= main_~i~0 0)} is VALID [2018-11-23 12:05:59,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {21141#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21141#(= main_~i~0 0)} is VALID [2018-11-23 12:05:59,158 INFO L273 TraceCheckUtils]: 7: Hoare triple {21141#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21141#(= main_~i~0 0)} is VALID [2018-11-23 12:05:59,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {21141#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {21142#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:59,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {21142#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21142#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:59,159 INFO L273 TraceCheckUtils]: 10: Hoare triple {21142#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21142#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:59,159 INFO L273 TraceCheckUtils]: 11: Hoare triple {21142#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {21143#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:59,160 INFO L273 TraceCheckUtils]: 12: Hoare triple {21143#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21143#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:59,160 INFO L273 TraceCheckUtils]: 13: Hoare triple {21143#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21143#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:59,161 INFO L273 TraceCheckUtils]: 14: Hoare triple {21143#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {21144#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:59,161 INFO L273 TraceCheckUtils]: 15: Hoare triple {21144#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21144#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:59,162 INFO L273 TraceCheckUtils]: 16: Hoare triple {21144#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21144#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:59,162 INFO L273 TraceCheckUtils]: 17: Hoare triple {21144#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {21145#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:59,163 INFO L273 TraceCheckUtils]: 18: Hoare triple {21145#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21145#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:59,164 INFO L273 TraceCheckUtils]: 19: Hoare triple {21145#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21145#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:59,164 INFO L273 TraceCheckUtils]: 20: Hoare triple {21145#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {21146#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:59,165 INFO L273 TraceCheckUtils]: 21: Hoare triple {21146#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21146#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:59,165 INFO L273 TraceCheckUtils]: 22: Hoare triple {21146#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21146#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:59,166 INFO L273 TraceCheckUtils]: 23: Hoare triple {21146#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {21147#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:59,167 INFO L273 TraceCheckUtils]: 24: Hoare triple {21147#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21147#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:59,167 INFO L273 TraceCheckUtils]: 25: Hoare triple {21147#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21147#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:59,168 INFO L273 TraceCheckUtils]: 26: Hoare triple {21147#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {21148#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:59,168 INFO L273 TraceCheckUtils]: 27: Hoare triple {21148#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21148#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:59,169 INFO L273 TraceCheckUtils]: 28: Hoare triple {21148#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21148#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:59,170 INFO L273 TraceCheckUtils]: 29: Hoare triple {21148#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {21149#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:59,170 INFO L273 TraceCheckUtils]: 30: Hoare triple {21149#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21149#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:59,171 INFO L273 TraceCheckUtils]: 31: Hoare triple {21149#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21149#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:59,171 INFO L273 TraceCheckUtils]: 32: Hoare triple {21149#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {21150#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:59,172 INFO L273 TraceCheckUtils]: 33: Hoare triple {21150#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21150#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:59,172 INFO L273 TraceCheckUtils]: 34: Hoare triple {21150#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21150#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:59,173 INFO L273 TraceCheckUtils]: 35: Hoare triple {21150#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {21151#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:59,174 INFO L273 TraceCheckUtils]: 36: Hoare triple {21151#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21151#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:59,174 INFO L273 TraceCheckUtils]: 37: Hoare triple {21151#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21151#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:59,175 INFO L273 TraceCheckUtils]: 38: Hoare triple {21151#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {21152#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:59,175 INFO L273 TraceCheckUtils]: 39: Hoare triple {21152#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21152#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:59,176 INFO L273 TraceCheckUtils]: 40: Hoare triple {21152#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21152#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:59,177 INFO L273 TraceCheckUtils]: 41: Hoare triple {21152#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {21153#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:59,177 INFO L273 TraceCheckUtils]: 42: Hoare triple {21153#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21153#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:59,178 INFO L273 TraceCheckUtils]: 43: Hoare triple {21153#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21153#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:59,178 INFO L273 TraceCheckUtils]: 44: Hoare triple {21153#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {21154#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:59,179 INFO L273 TraceCheckUtils]: 45: Hoare triple {21154#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21154#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:59,179 INFO L273 TraceCheckUtils]: 46: Hoare triple {21154#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21154#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:59,180 INFO L273 TraceCheckUtils]: 47: Hoare triple {21154#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {21155#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:59,181 INFO L273 TraceCheckUtils]: 48: Hoare triple {21155#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21155#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:59,181 INFO L273 TraceCheckUtils]: 49: Hoare triple {21155#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21155#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:59,182 INFO L273 TraceCheckUtils]: 50: Hoare triple {21155#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {21156#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:59,183 INFO L273 TraceCheckUtils]: 51: Hoare triple {21156#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21156#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:59,183 INFO L273 TraceCheckUtils]: 52: Hoare triple {21156#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21156#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:59,184 INFO L273 TraceCheckUtils]: 53: Hoare triple {21156#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {21157#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:59,184 INFO L273 TraceCheckUtils]: 54: Hoare triple {21157#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21157#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:59,185 INFO L273 TraceCheckUtils]: 55: Hoare triple {21157#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21157#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:59,186 INFO L273 TraceCheckUtils]: 56: Hoare triple {21157#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {21158#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:59,186 INFO L273 TraceCheckUtils]: 57: Hoare triple {21158#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21158#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:59,187 INFO L273 TraceCheckUtils]: 58: Hoare triple {21158#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21158#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:59,187 INFO L273 TraceCheckUtils]: 59: Hoare triple {21158#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {21159#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:59,188 INFO L273 TraceCheckUtils]: 60: Hoare triple {21159#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21159#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:59,188 INFO L273 TraceCheckUtils]: 61: Hoare triple {21159#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21159#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:59,189 INFO L273 TraceCheckUtils]: 62: Hoare triple {21159#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {21160#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:59,190 INFO L273 TraceCheckUtils]: 63: Hoare triple {21160#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21160#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:59,190 INFO L273 TraceCheckUtils]: 64: Hoare triple {21160#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21160#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:59,191 INFO L273 TraceCheckUtils]: 65: Hoare triple {21160#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {21161#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:59,192 INFO L273 TraceCheckUtils]: 66: Hoare triple {21161#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21161#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:59,192 INFO L273 TraceCheckUtils]: 67: Hoare triple {21161#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21161#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:59,193 INFO L273 TraceCheckUtils]: 68: Hoare triple {21161#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {21162#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:59,193 INFO L273 TraceCheckUtils]: 69: Hoare triple {21162#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21162#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:59,194 INFO L273 TraceCheckUtils]: 70: Hoare triple {21162#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21162#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:59,195 INFO L273 TraceCheckUtils]: 71: Hoare triple {21162#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {21163#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:59,195 INFO L273 TraceCheckUtils]: 72: Hoare triple {21163#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21163#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:59,196 INFO L273 TraceCheckUtils]: 73: Hoare triple {21163#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21163#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:59,196 INFO L273 TraceCheckUtils]: 74: Hoare triple {21163#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {21164#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:59,197 INFO L273 TraceCheckUtils]: 75: Hoare triple {21164#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21164#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:59,197 INFO L273 TraceCheckUtils]: 76: Hoare triple {21164#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21164#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:59,198 INFO L273 TraceCheckUtils]: 77: Hoare triple {21164#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {21165#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:59,199 INFO L273 TraceCheckUtils]: 78: Hoare triple {21165#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21165#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:59,199 INFO L273 TraceCheckUtils]: 79: Hoare triple {21165#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21165#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:59,200 INFO L273 TraceCheckUtils]: 80: Hoare triple {21165#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {21166#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:59,200 INFO L273 TraceCheckUtils]: 81: Hoare triple {21166#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21166#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:59,201 INFO L273 TraceCheckUtils]: 82: Hoare triple {21166#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21166#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:59,202 INFO L273 TraceCheckUtils]: 83: Hoare triple {21166#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {21167#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:59,202 INFO L273 TraceCheckUtils]: 84: Hoare triple {21167#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21167#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:59,203 INFO L273 TraceCheckUtils]: 85: Hoare triple {21167#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21167#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:59,203 INFO L273 TraceCheckUtils]: 86: Hoare triple {21167#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {21168#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:59,204 INFO L273 TraceCheckUtils]: 87: Hoare triple {21168#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21168#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:59,204 INFO L273 TraceCheckUtils]: 88: Hoare triple {21168#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21168#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:59,205 INFO L273 TraceCheckUtils]: 89: Hoare triple {21168#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {21169#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:59,206 INFO L273 TraceCheckUtils]: 90: Hoare triple {21169#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21169#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:59,206 INFO L273 TraceCheckUtils]: 91: Hoare triple {21169#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21169#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:59,207 INFO L273 TraceCheckUtils]: 92: Hoare triple {21169#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {21170#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:59,207 INFO L273 TraceCheckUtils]: 93: Hoare triple {21170#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21170#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:59,208 INFO L273 TraceCheckUtils]: 94: Hoare triple {21170#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21170#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:59,209 INFO L273 TraceCheckUtils]: 95: Hoare triple {21170#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {21171#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:59,209 INFO L273 TraceCheckUtils]: 96: Hoare triple {21171#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21171#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:59,210 INFO L273 TraceCheckUtils]: 97: Hoare triple {21171#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21171#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:59,210 INFO L273 TraceCheckUtils]: 98: Hoare triple {21171#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {21172#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:59,211 INFO L273 TraceCheckUtils]: 99: Hoare triple {21172#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21172#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:59,211 INFO L273 TraceCheckUtils]: 100: Hoare triple {21172#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21172#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:59,212 INFO L273 TraceCheckUtils]: 101: Hoare triple {21172#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {21173#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:59,213 INFO L273 TraceCheckUtils]: 102: Hoare triple {21173#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21173#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:59,213 INFO L273 TraceCheckUtils]: 103: Hoare triple {21173#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21173#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:59,214 INFO L273 TraceCheckUtils]: 104: Hoare triple {21173#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {21174#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:59,215 INFO L273 TraceCheckUtils]: 105: Hoare triple {21174#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21174#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:59,215 INFO L273 TraceCheckUtils]: 106: Hoare triple {21174#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21174#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:59,216 INFO L273 TraceCheckUtils]: 107: Hoare triple {21174#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {21175#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:59,216 INFO L273 TraceCheckUtils]: 108: Hoare triple {21175#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21175#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:59,217 INFO L273 TraceCheckUtils]: 109: Hoare triple {21175#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21175#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:59,217 INFO L273 TraceCheckUtils]: 110: Hoare triple {21175#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {21176#(<= main_~i~0 35)} is VALID [2018-11-23 12:05:59,218 INFO L273 TraceCheckUtils]: 111: Hoare triple {21176#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21176#(<= main_~i~0 35)} is VALID [2018-11-23 12:05:59,219 INFO L273 TraceCheckUtils]: 112: Hoare triple {21176#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21176#(<= main_~i~0 35)} is VALID [2018-11-23 12:05:59,219 INFO L273 TraceCheckUtils]: 113: Hoare triple {21176#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {21177#(<= main_~i~0 36)} is VALID [2018-11-23 12:05:59,220 INFO L273 TraceCheckUtils]: 114: Hoare triple {21177#(<= main_~i~0 36)} assume !(~i~0 < 100000); {21140#false} is VALID [2018-11-23 12:05:59,220 INFO L273 TraceCheckUtils]: 115: Hoare triple {21140#false} havoc ~x~0;~x~0 := 0; {21140#false} is VALID [2018-11-23 12:05:59,220 INFO L273 TraceCheckUtils]: 116: Hoare triple {21140#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {21140#false} is VALID [2018-11-23 12:05:59,221 INFO L256 TraceCheckUtils]: 117: Hoare triple {21140#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {21140#false} is VALID [2018-11-23 12:05:59,221 INFO L273 TraceCheckUtils]: 118: Hoare triple {21140#false} ~cond := #in~cond; {21140#false} is VALID [2018-11-23 12:05:59,221 INFO L273 TraceCheckUtils]: 119: Hoare triple {21140#false} assume 0 == ~cond; {21140#false} is VALID [2018-11-23 12:05:59,221 INFO L273 TraceCheckUtils]: 120: Hoare triple {21140#false} assume !false; {21140#false} is VALID [2018-11-23 12:05:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:59,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:59,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:59,242 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:59,337 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-11-23 12:05:59,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:59,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:59,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {21139#true} call ULTIMATE.init(); {21139#true} is VALID [2018-11-23 12:05:59,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {21139#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21139#true} is VALID [2018-11-23 12:05:59,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {21139#true} assume true; {21139#true} is VALID [2018-11-23 12:05:59,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21139#true} {21139#true} #55#return; {21139#true} is VALID [2018-11-23 12:05:59,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {21139#true} call #t~ret4 := main(); {21139#true} is VALID [2018-11-23 12:05:59,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {21139#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {21196#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:59,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {21196#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21196#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:59,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {21196#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21196#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:59,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {21196#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {21142#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:59,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {21142#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21142#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:59,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {21142#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21142#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:59,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {21142#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {21143#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:59,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {21143#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21143#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:59,634 INFO L273 TraceCheckUtils]: 13: Hoare triple {21143#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21143#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:59,635 INFO L273 TraceCheckUtils]: 14: Hoare triple {21143#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {21144#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:59,635 INFO L273 TraceCheckUtils]: 15: Hoare triple {21144#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21144#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:59,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {21144#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21144#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:59,636 INFO L273 TraceCheckUtils]: 17: Hoare triple {21144#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {21145#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:59,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {21145#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21145#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:59,638 INFO L273 TraceCheckUtils]: 19: Hoare triple {21145#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21145#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:59,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {21145#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {21146#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:59,639 INFO L273 TraceCheckUtils]: 21: Hoare triple {21146#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21146#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:59,639 INFO L273 TraceCheckUtils]: 22: Hoare triple {21146#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21146#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:59,640 INFO L273 TraceCheckUtils]: 23: Hoare triple {21146#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {21147#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:59,641 INFO L273 TraceCheckUtils]: 24: Hoare triple {21147#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21147#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:59,641 INFO L273 TraceCheckUtils]: 25: Hoare triple {21147#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21147#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:59,642 INFO L273 TraceCheckUtils]: 26: Hoare triple {21147#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {21148#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:59,642 INFO L273 TraceCheckUtils]: 27: Hoare triple {21148#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21148#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:59,643 INFO L273 TraceCheckUtils]: 28: Hoare triple {21148#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21148#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:59,644 INFO L273 TraceCheckUtils]: 29: Hoare triple {21148#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {21149#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:59,644 INFO L273 TraceCheckUtils]: 30: Hoare triple {21149#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21149#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:59,645 INFO L273 TraceCheckUtils]: 31: Hoare triple {21149#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21149#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:59,645 INFO L273 TraceCheckUtils]: 32: Hoare triple {21149#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {21150#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:59,646 INFO L273 TraceCheckUtils]: 33: Hoare triple {21150#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21150#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:59,646 INFO L273 TraceCheckUtils]: 34: Hoare triple {21150#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21150#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:59,647 INFO L273 TraceCheckUtils]: 35: Hoare triple {21150#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {21151#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:59,648 INFO L273 TraceCheckUtils]: 36: Hoare triple {21151#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21151#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:59,648 INFO L273 TraceCheckUtils]: 37: Hoare triple {21151#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21151#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:59,649 INFO L273 TraceCheckUtils]: 38: Hoare triple {21151#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {21152#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:59,649 INFO L273 TraceCheckUtils]: 39: Hoare triple {21152#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21152#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:59,650 INFO L273 TraceCheckUtils]: 40: Hoare triple {21152#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21152#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:59,651 INFO L273 TraceCheckUtils]: 41: Hoare triple {21152#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {21153#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:59,651 INFO L273 TraceCheckUtils]: 42: Hoare triple {21153#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21153#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:59,652 INFO L273 TraceCheckUtils]: 43: Hoare triple {21153#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21153#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:59,653 INFO L273 TraceCheckUtils]: 44: Hoare triple {21153#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {21154#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:59,653 INFO L273 TraceCheckUtils]: 45: Hoare triple {21154#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21154#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:59,654 INFO L273 TraceCheckUtils]: 46: Hoare triple {21154#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21154#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:59,654 INFO L273 TraceCheckUtils]: 47: Hoare triple {21154#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {21155#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:59,655 INFO L273 TraceCheckUtils]: 48: Hoare triple {21155#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21155#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:59,655 INFO L273 TraceCheckUtils]: 49: Hoare triple {21155#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21155#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:59,656 INFO L273 TraceCheckUtils]: 50: Hoare triple {21155#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {21156#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:59,657 INFO L273 TraceCheckUtils]: 51: Hoare triple {21156#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21156#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:59,657 INFO L273 TraceCheckUtils]: 52: Hoare triple {21156#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21156#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:59,658 INFO L273 TraceCheckUtils]: 53: Hoare triple {21156#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {21157#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:59,658 INFO L273 TraceCheckUtils]: 54: Hoare triple {21157#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21157#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:59,659 INFO L273 TraceCheckUtils]: 55: Hoare triple {21157#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21157#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:59,660 INFO L273 TraceCheckUtils]: 56: Hoare triple {21157#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {21158#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:59,660 INFO L273 TraceCheckUtils]: 57: Hoare triple {21158#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21158#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:59,661 INFO L273 TraceCheckUtils]: 58: Hoare triple {21158#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21158#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:59,661 INFO L273 TraceCheckUtils]: 59: Hoare triple {21158#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {21159#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:59,662 INFO L273 TraceCheckUtils]: 60: Hoare triple {21159#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21159#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:59,662 INFO L273 TraceCheckUtils]: 61: Hoare triple {21159#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21159#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:59,663 INFO L273 TraceCheckUtils]: 62: Hoare triple {21159#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {21160#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:59,664 INFO L273 TraceCheckUtils]: 63: Hoare triple {21160#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21160#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:59,664 INFO L273 TraceCheckUtils]: 64: Hoare triple {21160#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21160#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:59,665 INFO L273 TraceCheckUtils]: 65: Hoare triple {21160#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {21161#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:59,665 INFO L273 TraceCheckUtils]: 66: Hoare triple {21161#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21161#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:59,666 INFO L273 TraceCheckUtils]: 67: Hoare triple {21161#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21161#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:59,667 INFO L273 TraceCheckUtils]: 68: Hoare triple {21161#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {21162#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:59,667 INFO L273 TraceCheckUtils]: 69: Hoare triple {21162#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21162#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:59,668 INFO L273 TraceCheckUtils]: 70: Hoare triple {21162#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21162#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:59,668 INFO L273 TraceCheckUtils]: 71: Hoare triple {21162#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {21163#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:59,669 INFO L273 TraceCheckUtils]: 72: Hoare triple {21163#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21163#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:59,669 INFO L273 TraceCheckUtils]: 73: Hoare triple {21163#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21163#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:59,670 INFO L273 TraceCheckUtils]: 74: Hoare triple {21163#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {21164#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:59,671 INFO L273 TraceCheckUtils]: 75: Hoare triple {21164#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21164#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:59,671 INFO L273 TraceCheckUtils]: 76: Hoare triple {21164#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21164#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:59,672 INFO L273 TraceCheckUtils]: 77: Hoare triple {21164#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {21165#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:59,672 INFO L273 TraceCheckUtils]: 78: Hoare triple {21165#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21165#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:59,673 INFO L273 TraceCheckUtils]: 79: Hoare triple {21165#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21165#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:59,674 INFO L273 TraceCheckUtils]: 80: Hoare triple {21165#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {21166#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:59,674 INFO L273 TraceCheckUtils]: 81: Hoare triple {21166#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21166#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:59,675 INFO L273 TraceCheckUtils]: 82: Hoare triple {21166#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21166#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:59,675 INFO L273 TraceCheckUtils]: 83: Hoare triple {21166#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {21167#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:59,676 INFO L273 TraceCheckUtils]: 84: Hoare triple {21167#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21167#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:59,677 INFO L273 TraceCheckUtils]: 85: Hoare triple {21167#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21167#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:59,677 INFO L273 TraceCheckUtils]: 86: Hoare triple {21167#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {21168#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:59,678 INFO L273 TraceCheckUtils]: 87: Hoare triple {21168#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21168#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:59,678 INFO L273 TraceCheckUtils]: 88: Hoare triple {21168#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21168#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:59,679 INFO L273 TraceCheckUtils]: 89: Hoare triple {21168#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {21169#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:59,680 INFO L273 TraceCheckUtils]: 90: Hoare triple {21169#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21169#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:59,680 INFO L273 TraceCheckUtils]: 91: Hoare triple {21169#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21169#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:59,681 INFO L273 TraceCheckUtils]: 92: Hoare triple {21169#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {21170#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:59,681 INFO L273 TraceCheckUtils]: 93: Hoare triple {21170#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21170#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:59,682 INFO L273 TraceCheckUtils]: 94: Hoare triple {21170#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21170#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:59,683 INFO L273 TraceCheckUtils]: 95: Hoare triple {21170#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {21171#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:59,683 INFO L273 TraceCheckUtils]: 96: Hoare triple {21171#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21171#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:59,684 INFO L273 TraceCheckUtils]: 97: Hoare triple {21171#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21171#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:59,684 INFO L273 TraceCheckUtils]: 98: Hoare triple {21171#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {21172#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:59,685 INFO L273 TraceCheckUtils]: 99: Hoare triple {21172#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21172#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:59,685 INFO L273 TraceCheckUtils]: 100: Hoare triple {21172#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21172#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:59,686 INFO L273 TraceCheckUtils]: 101: Hoare triple {21172#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {21173#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:59,687 INFO L273 TraceCheckUtils]: 102: Hoare triple {21173#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21173#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:59,687 INFO L273 TraceCheckUtils]: 103: Hoare triple {21173#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21173#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:59,688 INFO L273 TraceCheckUtils]: 104: Hoare triple {21173#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {21174#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:59,688 INFO L273 TraceCheckUtils]: 105: Hoare triple {21174#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21174#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:59,689 INFO L273 TraceCheckUtils]: 106: Hoare triple {21174#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21174#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:59,690 INFO L273 TraceCheckUtils]: 107: Hoare triple {21174#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {21175#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:59,690 INFO L273 TraceCheckUtils]: 108: Hoare triple {21175#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21175#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:59,691 INFO L273 TraceCheckUtils]: 109: Hoare triple {21175#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21175#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:59,692 INFO L273 TraceCheckUtils]: 110: Hoare triple {21175#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {21176#(<= main_~i~0 35)} is VALID [2018-11-23 12:05:59,692 INFO L273 TraceCheckUtils]: 111: Hoare triple {21176#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21176#(<= main_~i~0 35)} is VALID [2018-11-23 12:05:59,693 INFO L273 TraceCheckUtils]: 112: Hoare triple {21176#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {21176#(<= main_~i~0 35)} is VALID [2018-11-23 12:05:59,693 INFO L273 TraceCheckUtils]: 113: Hoare triple {21176#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {21177#(<= main_~i~0 36)} is VALID [2018-11-23 12:05:59,694 INFO L273 TraceCheckUtils]: 114: Hoare triple {21177#(<= main_~i~0 36)} assume !(~i~0 < 100000); {21140#false} is VALID [2018-11-23 12:05:59,694 INFO L273 TraceCheckUtils]: 115: Hoare triple {21140#false} havoc ~x~0;~x~0 := 0; {21140#false} is VALID [2018-11-23 12:05:59,694 INFO L273 TraceCheckUtils]: 116: Hoare triple {21140#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {21140#false} is VALID [2018-11-23 12:05:59,695 INFO L256 TraceCheckUtils]: 117: Hoare triple {21140#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {21140#false} is VALID [2018-11-23 12:05:59,695 INFO L273 TraceCheckUtils]: 118: Hoare triple {21140#false} ~cond := #in~cond; {21140#false} is VALID [2018-11-23 12:05:59,695 INFO L273 TraceCheckUtils]: 119: Hoare triple {21140#false} assume 0 == ~cond; {21140#false} is VALID [2018-11-23 12:05:59,695 INFO L273 TraceCheckUtils]: 120: Hoare triple {21140#false} assume !false; {21140#false} is VALID [2018-11-23 12:05:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:59,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:59,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 12:05:59,725 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 121 [2018-11-23 12:05:59,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:59,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:05:59,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:59,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:05:59,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:05:59,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:05:59,849 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 40 states. [2018-11-23 12:06:00,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:00,611 INFO L93 Difference]: Finished difference Result 142 states and 182 transitions. [2018-11-23 12:06:00,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 12:06:00,611 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 121 [2018-11-23 12:06:00,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:06:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 182 transitions. [2018-11-23 12:06:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:06:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 182 transitions. [2018-11-23 12:06:00,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 182 transitions. [2018-11-23 12:06:00,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:00,790 INFO L225 Difference]: With dead ends: 142 [2018-11-23 12:06:00,790 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 12:06:00,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:06:00,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 12:06:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-11-23 12:06:00,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:00,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 129 states. [2018-11-23 12:06:00,860 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 129 states. [2018-11-23 12:06:00,860 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 129 states. [2018-11-23 12:06:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:00,863 INFO L93 Difference]: Finished difference Result 131 states and 170 transitions. [2018-11-23 12:06:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 170 transitions. [2018-11-23 12:06:00,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:00,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:00,863 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 131 states. [2018-11-23 12:06:00,864 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 131 states. [2018-11-23 12:06:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:00,865 INFO L93 Difference]: Finished difference Result 131 states and 170 transitions. [2018-11-23 12:06:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 170 transitions. [2018-11-23 12:06:00,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:00,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:00,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:00,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 12:06:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 167 transitions. [2018-11-23 12:06:00,867 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 167 transitions. Word has length 121 [2018-11-23 12:06:00,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:00,867 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 167 transitions. [2018-11-23 12:06:00,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:06:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 167 transitions. [2018-11-23 12:06:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:06:00,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:00,868 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:00,868 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:00,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:00,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1448587619, now seen corresponding path program 37 times [2018-11-23 12:06:00,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:00,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:00,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:00,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:00,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:02,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {22167#true} call ULTIMATE.init(); {22167#true} is VALID [2018-11-23 12:06:02,659 INFO L273 TraceCheckUtils]: 1: Hoare triple {22167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22167#true} is VALID [2018-11-23 12:06:02,659 INFO L273 TraceCheckUtils]: 2: Hoare triple {22167#true} assume true; {22167#true} is VALID [2018-11-23 12:06:02,660 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22167#true} {22167#true} #55#return; {22167#true} is VALID [2018-11-23 12:06:02,660 INFO L256 TraceCheckUtils]: 4: Hoare triple {22167#true} call #t~ret4 := main(); {22167#true} is VALID [2018-11-23 12:06:02,660 INFO L273 TraceCheckUtils]: 5: Hoare triple {22167#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {22169#(= main_~i~0 0)} is VALID [2018-11-23 12:06:02,661 INFO L273 TraceCheckUtils]: 6: Hoare triple {22169#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22169#(= main_~i~0 0)} is VALID [2018-11-23 12:06:02,661 INFO L273 TraceCheckUtils]: 7: Hoare triple {22169#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22169#(= main_~i~0 0)} is VALID [2018-11-23 12:06:02,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {22169#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {22170#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:02,663 INFO L273 TraceCheckUtils]: 9: Hoare triple {22170#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22170#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:02,666 INFO L273 TraceCheckUtils]: 10: Hoare triple {22170#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22170#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:02,666 INFO L273 TraceCheckUtils]: 11: Hoare triple {22170#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {22171#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:02,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {22171#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22171#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:02,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {22171#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22171#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:02,671 INFO L273 TraceCheckUtils]: 14: Hoare triple {22171#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {22172#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:02,671 INFO L273 TraceCheckUtils]: 15: Hoare triple {22172#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22172#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:02,673 INFO L273 TraceCheckUtils]: 16: Hoare triple {22172#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22172#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:02,675 INFO L273 TraceCheckUtils]: 17: Hoare triple {22172#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {22173#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:02,678 INFO L273 TraceCheckUtils]: 18: Hoare triple {22173#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22173#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:02,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {22173#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22173#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:02,680 INFO L273 TraceCheckUtils]: 20: Hoare triple {22173#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {22174#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:02,680 INFO L273 TraceCheckUtils]: 21: Hoare triple {22174#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22174#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:02,682 INFO L273 TraceCheckUtils]: 22: Hoare triple {22174#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22174#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:02,682 INFO L273 TraceCheckUtils]: 23: Hoare triple {22174#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {22175#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:02,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {22175#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22175#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:02,684 INFO L273 TraceCheckUtils]: 25: Hoare triple {22175#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22175#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:02,686 INFO L273 TraceCheckUtils]: 26: Hoare triple {22175#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {22176#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:02,686 INFO L273 TraceCheckUtils]: 27: Hoare triple {22176#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22176#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:02,688 INFO L273 TraceCheckUtils]: 28: Hoare triple {22176#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22176#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:02,688 INFO L273 TraceCheckUtils]: 29: Hoare triple {22176#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {22177#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:02,690 INFO L273 TraceCheckUtils]: 30: Hoare triple {22177#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22177#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:02,690 INFO L273 TraceCheckUtils]: 31: Hoare triple {22177#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22177#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:02,692 INFO L273 TraceCheckUtils]: 32: Hoare triple {22177#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {22178#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:02,692 INFO L273 TraceCheckUtils]: 33: Hoare triple {22178#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22178#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:02,694 INFO L273 TraceCheckUtils]: 34: Hoare triple {22178#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22178#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:02,694 INFO L273 TraceCheckUtils]: 35: Hoare triple {22178#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {22179#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:02,694 INFO L273 TraceCheckUtils]: 36: Hoare triple {22179#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22179#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:02,696 INFO L273 TraceCheckUtils]: 37: Hoare triple {22179#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22179#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:02,696 INFO L273 TraceCheckUtils]: 38: Hoare triple {22179#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {22180#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:02,698 INFO L273 TraceCheckUtils]: 39: Hoare triple {22180#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22180#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:02,698 INFO L273 TraceCheckUtils]: 40: Hoare triple {22180#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22180#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:02,700 INFO L273 TraceCheckUtils]: 41: Hoare triple {22180#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {22181#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:02,700 INFO L273 TraceCheckUtils]: 42: Hoare triple {22181#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22181#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:02,702 INFO L273 TraceCheckUtils]: 43: Hoare triple {22181#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22181#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:02,702 INFO L273 TraceCheckUtils]: 44: Hoare triple {22181#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {22182#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:02,704 INFO L273 TraceCheckUtils]: 45: Hoare triple {22182#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22182#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:02,704 INFO L273 TraceCheckUtils]: 46: Hoare triple {22182#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22182#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:02,706 INFO L273 TraceCheckUtils]: 47: Hoare triple {22182#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {22183#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:02,706 INFO L273 TraceCheckUtils]: 48: Hoare triple {22183#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22183#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:02,708 INFO L273 TraceCheckUtils]: 49: Hoare triple {22183#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22183#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:02,708 INFO L273 TraceCheckUtils]: 50: Hoare triple {22183#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {22184#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:02,710 INFO L273 TraceCheckUtils]: 51: Hoare triple {22184#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22184#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:02,710 INFO L273 TraceCheckUtils]: 52: Hoare triple {22184#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22184#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:02,712 INFO L273 TraceCheckUtils]: 53: Hoare triple {22184#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {22185#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:02,712 INFO L273 TraceCheckUtils]: 54: Hoare triple {22185#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22185#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:02,714 INFO L273 TraceCheckUtils]: 55: Hoare triple {22185#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22185#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:02,714 INFO L273 TraceCheckUtils]: 56: Hoare triple {22185#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {22186#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:02,716 INFO L273 TraceCheckUtils]: 57: Hoare triple {22186#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22186#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:02,716 INFO L273 TraceCheckUtils]: 58: Hoare triple {22186#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22186#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:02,718 INFO L273 TraceCheckUtils]: 59: Hoare triple {22186#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {22187#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:02,718 INFO L273 TraceCheckUtils]: 60: Hoare triple {22187#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22187#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:02,720 INFO L273 TraceCheckUtils]: 61: Hoare triple {22187#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22187#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:02,720 INFO L273 TraceCheckUtils]: 62: Hoare triple {22187#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {22188#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:02,722 INFO L273 TraceCheckUtils]: 63: Hoare triple {22188#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22188#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:02,722 INFO L273 TraceCheckUtils]: 64: Hoare triple {22188#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22188#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:02,724 INFO L273 TraceCheckUtils]: 65: Hoare triple {22188#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {22189#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:02,724 INFO L273 TraceCheckUtils]: 66: Hoare triple {22189#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22189#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:02,726 INFO L273 TraceCheckUtils]: 67: Hoare triple {22189#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22189#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:02,726 INFO L273 TraceCheckUtils]: 68: Hoare triple {22189#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {22190#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:02,728 INFO L273 TraceCheckUtils]: 69: Hoare triple {22190#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22190#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:02,728 INFO L273 TraceCheckUtils]: 70: Hoare triple {22190#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22190#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:02,730 INFO L273 TraceCheckUtils]: 71: Hoare triple {22190#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {22191#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:02,730 INFO L273 TraceCheckUtils]: 72: Hoare triple {22191#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22191#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:02,732 INFO L273 TraceCheckUtils]: 73: Hoare triple {22191#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22191#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:02,732 INFO L273 TraceCheckUtils]: 74: Hoare triple {22191#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {22192#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:02,734 INFO L273 TraceCheckUtils]: 75: Hoare triple {22192#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22192#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:02,734 INFO L273 TraceCheckUtils]: 76: Hoare triple {22192#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22192#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:02,736 INFO L273 TraceCheckUtils]: 77: Hoare triple {22192#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {22193#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:02,736 INFO L273 TraceCheckUtils]: 78: Hoare triple {22193#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22193#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:02,738 INFO L273 TraceCheckUtils]: 79: Hoare triple {22193#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22193#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:02,738 INFO L273 TraceCheckUtils]: 80: Hoare triple {22193#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {22194#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:02,740 INFO L273 TraceCheckUtils]: 81: Hoare triple {22194#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22194#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:02,740 INFO L273 TraceCheckUtils]: 82: Hoare triple {22194#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22194#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:02,742 INFO L273 TraceCheckUtils]: 83: Hoare triple {22194#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {22195#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:02,742 INFO L273 TraceCheckUtils]: 84: Hoare triple {22195#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22195#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:02,744 INFO L273 TraceCheckUtils]: 85: Hoare triple {22195#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22195#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:02,744 INFO L273 TraceCheckUtils]: 86: Hoare triple {22195#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {22196#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:02,746 INFO L273 TraceCheckUtils]: 87: Hoare triple {22196#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22196#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:02,746 INFO L273 TraceCheckUtils]: 88: Hoare triple {22196#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22196#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:02,748 INFO L273 TraceCheckUtils]: 89: Hoare triple {22196#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {22197#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:02,748 INFO L273 TraceCheckUtils]: 90: Hoare triple {22197#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22197#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:02,750 INFO L273 TraceCheckUtils]: 91: Hoare triple {22197#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22197#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:02,750 INFO L273 TraceCheckUtils]: 92: Hoare triple {22197#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {22198#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:02,752 INFO L273 TraceCheckUtils]: 93: Hoare triple {22198#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22198#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:02,752 INFO L273 TraceCheckUtils]: 94: Hoare triple {22198#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22198#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:02,754 INFO L273 TraceCheckUtils]: 95: Hoare triple {22198#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {22199#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:02,754 INFO L273 TraceCheckUtils]: 96: Hoare triple {22199#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22199#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:02,756 INFO L273 TraceCheckUtils]: 97: Hoare triple {22199#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22199#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:02,756 INFO L273 TraceCheckUtils]: 98: Hoare triple {22199#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {22200#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:02,758 INFO L273 TraceCheckUtils]: 99: Hoare triple {22200#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22200#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:02,758 INFO L273 TraceCheckUtils]: 100: Hoare triple {22200#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22200#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:02,760 INFO L273 TraceCheckUtils]: 101: Hoare triple {22200#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {22201#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:02,760 INFO L273 TraceCheckUtils]: 102: Hoare triple {22201#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22201#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:02,762 INFO L273 TraceCheckUtils]: 103: Hoare triple {22201#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22201#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:02,762 INFO L273 TraceCheckUtils]: 104: Hoare triple {22201#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {22202#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:02,764 INFO L273 TraceCheckUtils]: 105: Hoare triple {22202#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22202#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:02,764 INFO L273 TraceCheckUtils]: 106: Hoare triple {22202#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22202#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:02,766 INFO L273 TraceCheckUtils]: 107: Hoare triple {22202#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {22203#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:02,766 INFO L273 TraceCheckUtils]: 108: Hoare triple {22203#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22203#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:02,768 INFO L273 TraceCheckUtils]: 109: Hoare triple {22203#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22203#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:02,768 INFO L273 TraceCheckUtils]: 110: Hoare triple {22203#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {22204#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:02,770 INFO L273 TraceCheckUtils]: 111: Hoare triple {22204#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22204#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:02,770 INFO L273 TraceCheckUtils]: 112: Hoare triple {22204#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22204#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:02,772 INFO L273 TraceCheckUtils]: 113: Hoare triple {22204#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {22205#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:02,772 INFO L273 TraceCheckUtils]: 114: Hoare triple {22205#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22205#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:02,774 INFO L273 TraceCheckUtils]: 115: Hoare triple {22205#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22205#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:02,774 INFO L273 TraceCheckUtils]: 116: Hoare triple {22205#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {22206#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:02,776 INFO L273 TraceCheckUtils]: 117: Hoare triple {22206#(<= main_~i~0 37)} assume !(~i~0 < 100000); {22168#false} is VALID [2018-11-23 12:06:02,776 INFO L273 TraceCheckUtils]: 118: Hoare triple {22168#false} havoc ~x~0;~x~0 := 0; {22168#false} is VALID [2018-11-23 12:06:02,776 INFO L273 TraceCheckUtils]: 119: Hoare triple {22168#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {22168#false} is VALID [2018-11-23 12:06:02,776 INFO L256 TraceCheckUtils]: 120: Hoare triple {22168#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {22168#false} is VALID [2018-11-23 12:06:02,776 INFO L273 TraceCheckUtils]: 121: Hoare triple {22168#false} ~cond := #in~cond; {22168#false} is VALID [2018-11-23 12:06:02,776 INFO L273 TraceCheckUtils]: 122: Hoare triple {22168#false} assume 0 == ~cond; {22168#false} is VALID [2018-11-23 12:06:02,776 INFO L273 TraceCheckUtils]: 123: Hoare triple {22168#false} assume !false; {22168#false} is VALID [2018-11-23 12:06:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:02,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:02,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:02,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:02,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:03,238 INFO L256 TraceCheckUtils]: 0: Hoare triple {22167#true} call ULTIMATE.init(); {22167#true} is VALID [2018-11-23 12:06:03,239 INFO L273 TraceCheckUtils]: 1: Hoare triple {22167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22167#true} is VALID [2018-11-23 12:06:03,239 INFO L273 TraceCheckUtils]: 2: Hoare triple {22167#true} assume true; {22167#true} is VALID [2018-11-23 12:06:03,239 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22167#true} {22167#true} #55#return; {22167#true} is VALID [2018-11-23 12:06:03,239 INFO L256 TraceCheckUtils]: 4: Hoare triple {22167#true} call #t~ret4 := main(); {22167#true} is VALID [2018-11-23 12:06:03,240 INFO L273 TraceCheckUtils]: 5: Hoare triple {22167#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {22225#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:03,241 INFO L273 TraceCheckUtils]: 6: Hoare triple {22225#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22225#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:03,241 INFO L273 TraceCheckUtils]: 7: Hoare triple {22225#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22225#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:03,242 INFO L273 TraceCheckUtils]: 8: Hoare triple {22225#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {22170#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:03,242 INFO L273 TraceCheckUtils]: 9: Hoare triple {22170#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22170#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:03,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {22170#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22170#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:03,243 INFO L273 TraceCheckUtils]: 11: Hoare triple {22170#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {22171#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:03,243 INFO L273 TraceCheckUtils]: 12: Hoare triple {22171#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22171#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:03,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {22171#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22171#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:03,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {22171#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {22172#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:03,245 INFO L273 TraceCheckUtils]: 15: Hoare triple {22172#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22172#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:03,245 INFO L273 TraceCheckUtils]: 16: Hoare triple {22172#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22172#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:03,246 INFO L273 TraceCheckUtils]: 17: Hoare triple {22172#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {22173#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:03,246 INFO L273 TraceCheckUtils]: 18: Hoare triple {22173#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22173#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:03,247 INFO L273 TraceCheckUtils]: 19: Hoare triple {22173#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22173#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:03,248 INFO L273 TraceCheckUtils]: 20: Hoare triple {22173#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {22174#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:03,248 INFO L273 TraceCheckUtils]: 21: Hoare triple {22174#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22174#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:03,249 INFO L273 TraceCheckUtils]: 22: Hoare triple {22174#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22174#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:03,249 INFO L273 TraceCheckUtils]: 23: Hoare triple {22174#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {22175#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:03,250 INFO L273 TraceCheckUtils]: 24: Hoare triple {22175#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22175#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:03,250 INFO L273 TraceCheckUtils]: 25: Hoare triple {22175#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22175#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:03,251 INFO L273 TraceCheckUtils]: 26: Hoare triple {22175#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {22176#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:03,252 INFO L273 TraceCheckUtils]: 27: Hoare triple {22176#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22176#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:03,252 INFO L273 TraceCheckUtils]: 28: Hoare triple {22176#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22176#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:03,253 INFO L273 TraceCheckUtils]: 29: Hoare triple {22176#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {22177#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:03,253 INFO L273 TraceCheckUtils]: 30: Hoare triple {22177#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22177#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:03,254 INFO L273 TraceCheckUtils]: 31: Hoare triple {22177#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22177#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:03,255 INFO L273 TraceCheckUtils]: 32: Hoare triple {22177#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {22178#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:03,255 INFO L273 TraceCheckUtils]: 33: Hoare triple {22178#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22178#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:03,256 INFO L273 TraceCheckUtils]: 34: Hoare triple {22178#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22178#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:03,256 INFO L273 TraceCheckUtils]: 35: Hoare triple {22178#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {22179#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:03,257 INFO L273 TraceCheckUtils]: 36: Hoare triple {22179#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22179#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:03,257 INFO L273 TraceCheckUtils]: 37: Hoare triple {22179#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22179#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:03,258 INFO L273 TraceCheckUtils]: 38: Hoare triple {22179#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {22180#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:03,259 INFO L273 TraceCheckUtils]: 39: Hoare triple {22180#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22180#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:03,259 INFO L273 TraceCheckUtils]: 40: Hoare triple {22180#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22180#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:03,260 INFO L273 TraceCheckUtils]: 41: Hoare triple {22180#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {22181#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:03,260 INFO L273 TraceCheckUtils]: 42: Hoare triple {22181#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22181#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:03,261 INFO L273 TraceCheckUtils]: 43: Hoare triple {22181#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22181#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:03,261 INFO L273 TraceCheckUtils]: 44: Hoare triple {22181#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {22182#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:03,262 INFO L273 TraceCheckUtils]: 45: Hoare triple {22182#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22182#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:03,263 INFO L273 TraceCheckUtils]: 46: Hoare triple {22182#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22182#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:03,263 INFO L273 TraceCheckUtils]: 47: Hoare triple {22182#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {22183#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:03,264 INFO L273 TraceCheckUtils]: 48: Hoare triple {22183#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22183#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:03,264 INFO L273 TraceCheckUtils]: 49: Hoare triple {22183#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22183#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:03,265 INFO L273 TraceCheckUtils]: 50: Hoare triple {22183#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {22184#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:03,266 INFO L273 TraceCheckUtils]: 51: Hoare triple {22184#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22184#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:03,266 INFO L273 TraceCheckUtils]: 52: Hoare triple {22184#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22184#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:03,267 INFO L273 TraceCheckUtils]: 53: Hoare triple {22184#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {22185#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:03,267 INFO L273 TraceCheckUtils]: 54: Hoare triple {22185#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22185#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:03,268 INFO L273 TraceCheckUtils]: 55: Hoare triple {22185#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22185#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:03,269 INFO L273 TraceCheckUtils]: 56: Hoare triple {22185#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {22186#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:03,269 INFO L273 TraceCheckUtils]: 57: Hoare triple {22186#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22186#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:03,270 INFO L273 TraceCheckUtils]: 58: Hoare triple {22186#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22186#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:03,270 INFO L273 TraceCheckUtils]: 59: Hoare triple {22186#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {22187#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:03,271 INFO L273 TraceCheckUtils]: 60: Hoare triple {22187#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22187#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:03,271 INFO L273 TraceCheckUtils]: 61: Hoare triple {22187#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22187#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:03,272 INFO L273 TraceCheckUtils]: 62: Hoare triple {22187#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {22188#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:03,273 INFO L273 TraceCheckUtils]: 63: Hoare triple {22188#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22188#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:03,273 INFO L273 TraceCheckUtils]: 64: Hoare triple {22188#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22188#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:03,274 INFO L273 TraceCheckUtils]: 65: Hoare triple {22188#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {22189#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:03,274 INFO L273 TraceCheckUtils]: 66: Hoare triple {22189#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22189#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:03,275 INFO L273 TraceCheckUtils]: 67: Hoare triple {22189#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22189#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:03,276 INFO L273 TraceCheckUtils]: 68: Hoare triple {22189#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {22190#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:03,276 INFO L273 TraceCheckUtils]: 69: Hoare triple {22190#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22190#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:03,277 INFO L273 TraceCheckUtils]: 70: Hoare triple {22190#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22190#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:03,277 INFO L273 TraceCheckUtils]: 71: Hoare triple {22190#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {22191#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:03,278 INFO L273 TraceCheckUtils]: 72: Hoare triple {22191#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22191#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:03,278 INFO L273 TraceCheckUtils]: 73: Hoare triple {22191#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22191#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:03,279 INFO L273 TraceCheckUtils]: 74: Hoare triple {22191#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {22192#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:03,280 INFO L273 TraceCheckUtils]: 75: Hoare triple {22192#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22192#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:03,280 INFO L273 TraceCheckUtils]: 76: Hoare triple {22192#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22192#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:03,281 INFO L273 TraceCheckUtils]: 77: Hoare triple {22192#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {22193#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:03,281 INFO L273 TraceCheckUtils]: 78: Hoare triple {22193#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22193#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:03,282 INFO L273 TraceCheckUtils]: 79: Hoare triple {22193#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22193#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:03,283 INFO L273 TraceCheckUtils]: 80: Hoare triple {22193#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {22194#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:03,283 INFO L273 TraceCheckUtils]: 81: Hoare triple {22194#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22194#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:03,284 INFO L273 TraceCheckUtils]: 82: Hoare triple {22194#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22194#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:03,284 INFO L273 TraceCheckUtils]: 83: Hoare triple {22194#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {22195#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:03,285 INFO L273 TraceCheckUtils]: 84: Hoare triple {22195#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22195#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:03,285 INFO L273 TraceCheckUtils]: 85: Hoare triple {22195#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22195#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:03,286 INFO L273 TraceCheckUtils]: 86: Hoare triple {22195#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {22196#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:03,286 INFO L273 TraceCheckUtils]: 87: Hoare triple {22196#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22196#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:03,287 INFO L273 TraceCheckUtils]: 88: Hoare triple {22196#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22196#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:03,288 INFO L273 TraceCheckUtils]: 89: Hoare triple {22196#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {22197#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:03,288 INFO L273 TraceCheckUtils]: 90: Hoare triple {22197#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22197#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:03,289 INFO L273 TraceCheckUtils]: 91: Hoare triple {22197#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22197#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:03,289 INFO L273 TraceCheckUtils]: 92: Hoare triple {22197#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {22198#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:03,290 INFO L273 TraceCheckUtils]: 93: Hoare triple {22198#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22198#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:03,290 INFO L273 TraceCheckUtils]: 94: Hoare triple {22198#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22198#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:03,291 INFO L273 TraceCheckUtils]: 95: Hoare triple {22198#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {22199#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:03,292 INFO L273 TraceCheckUtils]: 96: Hoare triple {22199#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22199#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:03,292 INFO L273 TraceCheckUtils]: 97: Hoare triple {22199#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22199#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:03,293 INFO L273 TraceCheckUtils]: 98: Hoare triple {22199#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {22200#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:03,293 INFO L273 TraceCheckUtils]: 99: Hoare triple {22200#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22200#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:03,294 INFO L273 TraceCheckUtils]: 100: Hoare triple {22200#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22200#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:03,295 INFO L273 TraceCheckUtils]: 101: Hoare triple {22200#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {22201#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:03,295 INFO L273 TraceCheckUtils]: 102: Hoare triple {22201#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22201#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:03,296 INFO L273 TraceCheckUtils]: 103: Hoare triple {22201#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22201#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:03,296 INFO L273 TraceCheckUtils]: 104: Hoare triple {22201#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {22202#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:03,297 INFO L273 TraceCheckUtils]: 105: Hoare triple {22202#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22202#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:03,297 INFO L273 TraceCheckUtils]: 106: Hoare triple {22202#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22202#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:03,298 INFO L273 TraceCheckUtils]: 107: Hoare triple {22202#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {22203#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:03,299 INFO L273 TraceCheckUtils]: 108: Hoare triple {22203#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22203#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:03,299 INFO L273 TraceCheckUtils]: 109: Hoare triple {22203#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22203#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:03,300 INFO L273 TraceCheckUtils]: 110: Hoare triple {22203#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {22204#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:03,300 INFO L273 TraceCheckUtils]: 111: Hoare triple {22204#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22204#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:03,301 INFO L273 TraceCheckUtils]: 112: Hoare triple {22204#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22204#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:03,302 INFO L273 TraceCheckUtils]: 113: Hoare triple {22204#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {22205#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:03,302 INFO L273 TraceCheckUtils]: 114: Hoare triple {22205#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22205#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:03,303 INFO L273 TraceCheckUtils]: 115: Hoare triple {22205#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {22205#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:03,303 INFO L273 TraceCheckUtils]: 116: Hoare triple {22205#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {22206#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:03,304 INFO L273 TraceCheckUtils]: 117: Hoare triple {22206#(<= main_~i~0 37)} assume !(~i~0 < 100000); {22168#false} is VALID [2018-11-23 12:06:03,304 INFO L273 TraceCheckUtils]: 118: Hoare triple {22168#false} havoc ~x~0;~x~0 := 0; {22168#false} is VALID [2018-11-23 12:06:03,304 INFO L273 TraceCheckUtils]: 119: Hoare triple {22168#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {22168#false} is VALID [2018-11-23 12:06:03,305 INFO L256 TraceCheckUtils]: 120: Hoare triple {22168#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {22168#false} is VALID [2018-11-23 12:06:03,305 INFO L273 TraceCheckUtils]: 121: Hoare triple {22168#false} ~cond := #in~cond; {22168#false} is VALID [2018-11-23 12:06:03,305 INFO L273 TraceCheckUtils]: 122: Hoare triple {22168#false} assume 0 == ~cond; {22168#false} is VALID [2018-11-23 12:06:03,305 INFO L273 TraceCheckUtils]: 123: Hoare triple {22168#false} assume !false; {22168#false} is VALID [2018-11-23 12:06:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:03,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:03,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:06:03,336 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 124 [2018-11-23 12:06:03,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:03,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:06:03,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:03,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:06:03,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:06:03,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:06:03,472 INFO L87 Difference]: Start difference. First operand 129 states and 167 transitions. Second operand 41 states. [2018-11-23 12:06:04,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:04,286 INFO L93 Difference]: Finished difference Result 145 states and 186 transitions. [2018-11-23 12:06:04,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:06:04,287 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 124 [2018-11-23 12:06:04,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:06:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 186 transitions. [2018-11-23 12:06:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:06:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 186 transitions. [2018-11-23 12:06:04,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 186 transitions. [2018-11-23 12:06:04,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:04,462 INFO L225 Difference]: With dead ends: 145 [2018-11-23 12:06:04,462 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 12:06:04,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:06:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 12:06:04,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-11-23 12:06:04,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:04,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 132 states. [2018-11-23 12:06:04,493 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 132 states. [2018-11-23 12:06:04,493 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 132 states. [2018-11-23 12:06:04,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:04,495 INFO L93 Difference]: Finished difference Result 134 states and 174 transitions. [2018-11-23 12:06:04,495 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 174 transitions. [2018-11-23 12:06:04,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:04,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:04,495 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 134 states. [2018-11-23 12:06:04,496 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 134 states. [2018-11-23 12:06:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:04,498 INFO L93 Difference]: Finished difference Result 134 states and 174 transitions. [2018-11-23 12:06:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 174 transitions. [2018-11-23 12:06:04,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:04,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:04,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:04,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 12:06:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2018-11-23 12:06:04,501 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 124 [2018-11-23 12:06:04,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:04,501 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 171 transitions. [2018-11-23 12:06:04,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:06:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 171 transitions. [2018-11-23 12:06:04,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 12:06:04,502 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:04,502 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:04,502 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:04,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:04,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1912266759, now seen corresponding path program 38 times [2018-11-23 12:06:04,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:04,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:04,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:04,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:04,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:05,726 INFO L256 TraceCheckUtils]: 0: Hoare triple {23219#true} call ULTIMATE.init(); {23219#true} is VALID [2018-11-23 12:06:05,727 INFO L273 TraceCheckUtils]: 1: Hoare triple {23219#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23219#true} is VALID [2018-11-23 12:06:05,727 INFO L273 TraceCheckUtils]: 2: Hoare triple {23219#true} assume true; {23219#true} is VALID [2018-11-23 12:06:05,727 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23219#true} {23219#true} #55#return; {23219#true} is VALID [2018-11-23 12:06:05,727 INFO L256 TraceCheckUtils]: 4: Hoare triple {23219#true} call #t~ret4 := main(); {23219#true} is VALID [2018-11-23 12:06:05,727 INFO L273 TraceCheckUtils]: 5: Hoare triple {23219#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {23221#(= main_~i~0 0)} is VALID [2018-11-23 12:06:05,728 INFO L273 TraceCheckUtils]: 6: Hoare triple {23221#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23221#(= main_~i~0 0)} is VALID [2018-11-23 12:06:05,728 INFO L273 TraceCheckUtils]: 7: Hoare triple {23221#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23221#(= main_~i~0 0)} is VALID [2018-11-23 12:06:05,728 INFO L273 TraceCheckUtils]: 8: Hoare triple {23221#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {23222#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:05,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {23222#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23222#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:05,730 INFO L273 TraceCheckUtils]: 10: Hoare triple {23222#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23222#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:05,731 INFO L273 TraceCheckUtils]: 11: Hoare triple {23222#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {23223#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:05,731 INFO L273 TraceCheckUtils]: 12: Hoare triple {23223#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23223#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:05,732 INFO L273 TraceCheckUtils]: 13: Hoare triple {23223#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23223#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:05,732 INFO L273 TraceCheckUtils]: 14: Hoare triple {23223#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {23224#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:05,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {23224#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23224#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:05,733 INFO L273 TraceCheckUtils]: 16: Hoare triple {23224#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23224#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:05,733 INFO L273 TraceCheckUtils]: 17: Hoare triple {23224#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {23225#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:05,734 INFO L273 TraceCheckUtils]: 18: Hoare triple {23225#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23225#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:05,734 INFO L273 TraceCheckUtils]: 19: Hoare triple {23225#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23225#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:05,735 INFO L273 TraceCheckUtils]: 20: Hoare triple {23225#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {23226#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:05,735 INFO L273 TraceCheckUtils]: 21: Hoare triple {23226#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23226#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:05,736 INFO L273 TraceCheckUtils]: 22: Hoare triple {23226#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23226#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:05,737 INFO L273 TraceCheckUtils]: 23: Hoare triple {23226#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {23227#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:05,737 INFO L273 TraceCheckUtils]: 24: Hoare triple {23227#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23227#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:05,738 INFO L273 TraceCheckUtils]: 25: Hoare triple {23227#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23227#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:05,738 INFO L273 TraceCheckUtils]: 26: Hoare triple {23227#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {23228#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:05,739 INFO L273 TraceCheckUtils]: 27: Hoare triple {23228#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23228#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:05,739 INFO L273 TraceCheckUtils]: 28: Hoare triple {23228#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23228#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:05,740 INFO L273 TraceCheckUtils]: 29: Hoare triple {23228#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {23229#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:05,740 INFO L273 TraceCheckUtils]: 30: Hoare triple {23229#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23229#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:05,741 INFO L273 TraceCheckUtils]: 31: Hoare triple {23229#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23229#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:05,742 INFO L273 TraceCheckUtils]: 32: Hoare triple {23229#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {23230#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:05,742 INFO L273 TraceCheckUtils]: 33: Hoare triple {23230#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23230#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:05,743 INFO L273 TraceCheckUtils]: 34: Hoare triple {23230#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23230#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:05,743 INFO L273 TraceCheckUtils]: 35: Hoare triple {23230#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {23231#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:05,744 INFO L273 TraceCheckUtils]: 36: Hoare triple {23231#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23231#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:05,744 INFO L273 TraceCheckUtils]: 37: Hoare triple {23231#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23231#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:05,745 INFO L273 TraceCheckUtils]: 38: Hoare triple {23231#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {23232#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:05,745 INFO L273 TraceCheckUtils]: 39: Hoare triple {23232#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23232#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:05,746 INFO L273 TraceCheckUtils]: 40: Hoare triple {23232#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23232#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:05,747 INFO L273 TraceCheckUtils]: 41: Hoare triple {23232#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {23233#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:05,747 INFO L273 TraceCheckUtils]: 42: Hoare triple {23233#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23233#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:05,748 INFO L273 TraceCheckUtils]: 43: Hoare triple {23233#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23233#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:05,748 INFO L273 TraceCheckUtils]: 44: Hoare triple {23233#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {23234#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:05,749 INFO L273 TraceCheckUtils]: 45: Hoare triple {23234#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23234#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:05,749 INFO L273 TraceCheckUtils]: 46: Hoare triple {23234#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23234#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:05,750 INFO L273 TraceCheckUtils]: 47: Hoare triple {23234#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {23235#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:05,751 INFO L273 TraceCheckUtils]: 48: Hoare triple {23235#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23235#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:05,751 INFO L273 TraceCheckUtils]: 49: Hoare triple {23235#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23235#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:05,752 INFO L273 TraceCheckUtils]: 50: Hoare triple {23235#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {23236#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:05,752 INFO L273 TraceCheckUtils]: 51: Hoare triple {23236#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23236#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:05,753 INFO L273 TraceCheckUtils]: 52: Hoare triple {23236#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23236#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:05,753 INFO L273 TraceCheckUtils]: 53: Hoare triple {23236#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {23237#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:05,754 INFO L273 TraceCheckUtils]: 54: Hoare triple {23237#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23237#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:05,754 INFO L273 TraceCheckUtils]: 55: Hoare triple {23237#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23237#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:05,755 INFO L273 TraceCheckUtils]: 56: Hoare triple {23237#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {23238#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:05,756 INFO L273 TraceCheckUtils]: 57: Hoare triple {23238#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23238#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:05,756 INFO L273 TraceCheckUtils]: 58: Hoare triple {23238#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23238#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:05,757 INFO L273 TraceCheckUtils]: 59: Hoare triple {23238#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {23239#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:05,757 INFO L273 TraceCheckUtils]: 60: Hoare triple {23239#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23239#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:05,758 INFO L273 TraceCheckUtils]: 61: Hoare triple {23239#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23239#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:05,759 INFO L273 TraceCheckUtils]: 62: Hoare triple {23239#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {23240#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:05,759 INFO L273 TraceCheckUtils]: 63: Hoare triple {23240#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23240#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:05,760 INFO L273 TraceCheckUtils]: 64: Hoare triple {23240#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23240#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:05,760 INFO L273 TraceCheckUtils]: 65: Hoare triple {23240#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {23241#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:05,761 INFO L273 TraceCheckUtils]: 66: Hoare triple {23241#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23241#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:05,761 INFO L273 TraceCheckUtils]: 67: Hoare triple {23241#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23241#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:05,762 INFO L273 TraceCheckUtils]: 68: Hoare triple {23241#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {23242#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:05,763 INFO L273 TraceCheckUtils]: 69: Hoare triple {23242#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23242#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:05,763 INFO L273 TraceCheckUtils]: 70: Hoare triple {23242#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23242#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:05,764 INFO L273 TraceCheckUtils]: 71: Hoare triple {23242#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {23243#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:05,764 INFO L273 TraceCheckUtils]: 72: Hoare triple {23243#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23243#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:05,765 INFO L273 TraceCheckUtils]: 73: Hoare triple {23243#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23243#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:05,766 INFO L273 TraceCheckUtils]: 74: Hoare triple {23243#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {23244#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:05,766 INFO L273 TraceCheckUtils]: 75: Hoare triple {23244#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23244#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:05,767 INFO L273 TraceCheckUtils]: 76: Hoare triple {23244#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23244#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:05,767 INFO L273 TraceCheckUtils]: 77: Hoare triple {23244#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {23245#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:05,768 INFO L273 TraceCheckUtils]: 78: Hoare triple {23245#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23245#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:05,768 INFO L273 TraceCheckUtils]: 79: Hoare triple {23245#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23245#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:05,769 INFO L273 TraceCheckUtils]: 80: Hoare triple {23245#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {23246#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:05,769 INFO L273 TraceCheckUtils]: 81: Hoare triple {23246#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23246#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:05,770 INFO L273 TraceCheckUtils]: 82: Hoare triple {23246#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23246#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:05,771 INFO L273 TraceCheckUtils]: 83: Hoare triple {23246#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {23247#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:05,771 INFO L273 TraceCheckUtils]: 84: Hoare triple {23247#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23247#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:05,772 INFO L273 TraceCheckUtils]: 85: Hoare triple {23247#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23247#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:05,772 INFO L273 TraceCheckUtils]: 86: Hoare triple {23247#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {23248#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:05,773 INFO L273 TraceCheckUtils]: 87: Hoare triple {23248#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23248#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:05,773 INFO L273 TraceCheckUtils]: 88: Hoare triple {23248#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23248#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:05,774 INFO L273 TraceCheckUtils]: 89: Hoare triple {23248#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {23249#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:05,775 INFO L273 TraceCheckUtils]: 90: Hoare triple {23249#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23249#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:05,775 INFO L273 TraceCheckUtils]: 91: Hoare triple {23249#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23249#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:05,776 INFO L273 TraceCheckUtils]: 92: Hoare triple {23249#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {23250#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:05,776 INFO L273 TraceCheckUtils]: 93: Hoare triple {23250#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23250#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:05,777 INFO L273 TraceCheckUtils]: 94: Hoare triple {23250#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23250#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:05,777 INFO L273 TraceCheckUtils]: 95: Hoare triple {23250#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {23251#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:05,778 INFO L273 TraceCheckUtils]: 96: Hoare triple {23251#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23251#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:05,778 INFO L273 TraceCheckUtils]: 97: Hoare triple {23251#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23251#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:05,779 INFO L273 TraceCheckUtils]: 98: Hoare triple {23251#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {23252#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:05,780 INFO L273 TraceCheckUtils]: 99: Hoare triple {23252#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23252#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:05,780 INFO L273 TraceCheckUtils]: 100: Hoare triple {23252#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23252#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:05,781 INFO L273 TraceCheckUtils]: 101: Hoare triple {23252#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {23253#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:05,781 INFO L273 TraceCheckUtils]: 102: Hoare triple {23253#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23253#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:05,782 INFO L273 TraceCheckUtils]: 103: Hoare triple {23253#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23253#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:05,783 INFO L273 TraceCheckUtils]: 104: Hoare triple {23253#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {23254#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:05,783 INFO L273 TraceCheckUtils]: 105: Hoare triple {23254#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23254#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:05,784 INFO L273 TraceCheckUtils]: 106: Hoare triple {23254#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23254#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:05,784 INFO L273 TraceCheckUtils]: 107: Hoare triple {23254#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {23255#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:05,785 INFO L273 TraceCheckUtils]: 108: Hoare triple {23255#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23255#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:05,785 INFO L273 TraceCheckUtils]: 109: Hoare triple {23255#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23255#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:05,786 INFO L273 TraceCheckUtils]: 110: Hoare triple {23255#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {23256#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:05,786 INFO L273 TraceCheckUtils]: 111: Hoare triple {23256#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23256#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:05,787 INFO L273 TraceCheckUtils]: 112: Hoare triple {23256#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23256#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:05,788 INFO L273 TraceCheckUtils]: 113: Hoare triple {23256#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {23257#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:05,788 INFO L273 TraceCheckUtils]: 114: Hoare triple {23257#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23257#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:05,788 INFO L273 TraceCheckUtils]: 115: Hoare triple {23257#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23257#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:05,789 INFO L273 TraceCheckUtils]: 116: Hoare triple {23257#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {23258#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:05,790 INFO L273 TraceCheckUtils]: 117: Hoare triple {23258#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23258#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:05,790 INFO L273 TraceCheckUtils]: 118: Hoare triple {23258#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23258#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:05,791 INFO L273 TraceCheckUtils]: 119: Hoare triple {23258#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {23259#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:05,792 INFO L273 TraceCheckUtils]: 120: Hoare triple {23259#(<= main_~i~0 38)} assume !(~i~0 < 100000); {23220#false} is VALID [2018-11-23 12:06:05,792 INFO L273 TraceCheckUtils]: 121: Hoare triple {23220#false} havoc ~x~0;~x~0 := 0; {23220#false} is VALID [2018-11-23 12:06:05,792 INFO L273 TraceCheckUtils]: 122: Hoare triple {23220#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {23220#false} is VALID [2018-11-23 12:06:05,792 INFO L256 TraceCheckUtils]: 123: Hoare triple {23220#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {23220#false} is VALID [2018-11-23 12:06:05,792 INFO L273 TraceCheckUtils]: 124: Hoare triple {23220#false} ~cond := #in~cond; {23220#false} is VALID [2018-11-23 12:06:05,793 INFO L273 TraceCheckUtils]: 125: Hoare triple {23220#false} assume 0 == ~cond; {23220#false} is VALID [2018-11-23 12:06:05,793 INFO L273 TraceCheckUtils]: 126: Hoare triple {23220#false} assume !false; {23220#false} is VALID [2018-11-23 12:06:05,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:05,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:05,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:05,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:05,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:05,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:05,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:06,175 INFO L256 TraceCheckUtils]: 0: Hoare triple {23219#true} call ULTIMATE.init(); {23219#true} is VALID [2018-11-23 12:06:06,176 INFO L273 TraceCheckUtils]: 1: Hoare triple {23219#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23219#true} is VALID [2018-11-23 12:06:06,176 INFO L273 TraceCheckUtils]: 2: Hoare triple {23219#true} assume true; {23219#true} is VALID [2018-11-23 12:06:06,176 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23219#true} {23219#true} #55#return; {23219#true} is VALID [2018-11-23 12:06:06,176 INFO L256 TraceCheckUtils]: 4: Hoare triple {23219#true} call #t~ret4 := main(); {23219#true} is VALID [2018-11-23 12:06:06,177 INFO L273 TraceCheckUtils]: 5: Hoare triple {23219#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {23278#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:06,178 INFO L273 TraceCheckUtils]: 6: Hoare triple {23278#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23278#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:06,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {23278#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23278#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:06,178 INFO L273 TraceCheckUtils]: 8: Hoare triple {23278#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {23222#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:06,179 INFO L273 TraceCheckUtils]: 9: Hoare triple {23222#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23222#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:06,179 INFO L273 TraceCheckUtils]: 10: Hoare triple {23222#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23222#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:06,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {23222#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {23223#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:06,180 INFO L273 TraceCheckUtils]: 12: Hoare triple {23223#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23223#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:06,180 INFO L273 TraceCheckUtils]: 13: Hoare triple {23223#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23223#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:06,181 INFO L273 TraceCheckUtils]: 14: Hoare triple {23223#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {23224#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:06,181 INFO L273 TraceCheckUtils]: 15: Hoare triple {23224#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23224#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:06,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {23224#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23224#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:06,183 INFO L273 TraceCheckUtils]: 17: Hoare triple {23224#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {23225#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:06,183 INFO L273 TraceCheckUtils]: 18: Hoare triple {23225#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23225#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:06,184 INFO L273 TraceCheckUtils]: 19: Hoare triple {23225#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23225#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:06,184 INFO L273 TraceCheckUtils]: 20: Hoare triple {23225#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {23226#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:06,185 INFO L273 TraceCheckUtils]: 21: Hoare triple {23226#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23226#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:06,185 INFO L273 TraceCheckUtils]: 22: Hoare triple {23226#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23226#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:06,186 INFO L273 TraceCheckUtils]: 23: Hoare triple {23226#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {23227#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:06,187 INFO L273 TraceCheckUtils]: 24: Hoare triple {23227#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23227#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:06,187 INFO L273 TraceCheckUtils]: 25: Hoare triple {23227#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23227#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:06,188 INFO L273 TraceCheckUtils]: 26: Hoare triple {23227#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {23228#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:06,188 INFO L273 TraceCheckUtils]: 27: Hoare triple {23228#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23228#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:06,189 INFO L273 TraceCheckUtils]: 28: Hoare triple {23228#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23228#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:06,189 INFO L273 TraceCheckUtils]: 29: Hoare triple {23228#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {23229#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:06,190 INFO L273 TraceCheckUtils]: 30: Hoare triple {23229#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23229#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:06,190 INFO L273 TraceCheckUtils]: 31: Hoare triple {23229#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23229#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:06,191 INFO L273 TraceCheckUtils]: 32: Hoare triple {23229#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {23230#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:06,191 INFO L273 TraceCheckUtils]: 33: Hoare triple {23230#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23230#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:06,192 INFO L273 TraceCheckUtils]: 34: Hoare triple {23230#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23230#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:06,193 INFO L273 TraceCheckUtils]: 35: Hoare triple {23230#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {23231#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:06,193 INFO L273 TraceCheckUtils]: 36: Hoare triple {23231#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23231#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:06,193 INFO L273 TraceCheckUtils]: 37: Hoare triple {23231#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23231#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:06,194 INFO L273 TraceCheckUtils]: 38: Hoare triple {23231#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {23232#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:06,195 INFO L273 TraceCheckUtils]: 39: Hoare triple {23232#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23232#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:06,195 INFO L273 TraceCheckUtils]: 40: Hoare triple {23232#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23232#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:06,196 INFO L273 TraceCheckUtils]: 41: Hoare triple {23232#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {23233#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:06,216 INFO L273 TraceCheckUtils]: 42: Hoare triple {23233#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23233#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:06,230 INFO L273 TraceCheckUtils]: 43: Hoare triple {23233#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23233#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:06,239 INFO L273 TraceCheckUtils]: 44: Hoare triple {23233#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {23234#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:06,243 INFO L273 TraceCheckUtils]: 45: Hoare triple {23234#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23234#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:06,243 INFO L273 TraceCheckUtils]: 46: Hoare triple {23234#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23234#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:06,244 INFO L273 TraceCheckUtils]: 47: Hoare triple {23234#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {23235#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:06,244 INFO L273 TraceCheckUtils]: 48: Hoare triple {23235#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23235#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:06,245 INFO L273 TraceCheckUtils]: 49: Hoare triple {23235#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23235#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:06,245 INFO L273 TraceCheckUtils]: 50: Hoare triple {23235#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {23236#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:06,245 INFO L273 TraceCheckUtils]: 51: Hoare triple {23236#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23236#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:06,246 INFO L273 TraceCheckUtils]: 52: Hoare triple {23236#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23236#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:06,246 INFO L273 TraceCheckUtils]: 53: Hoare triple {23236#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {23237#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:06,246 INFO L273 TraceCheckUtils]: 54: Hoare triple {23237#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23237#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:06,247 INFO L273 TraceCheckUtils]: 55: Hoare triple {23237#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23237#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:06,247 INFO L273 TraceCheckUtils]: 56: Hoare triple {23237#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {23238#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:06,248 INFO L273 TraceCheckUtils]: 57: Hoare triple {23238#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23238#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:06,248 INFO L273 TraceCheckUtils]: 58: Hoare triple {23238#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23238#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:06,249 INFO L273 TraceCheckUtils]: 59: Hoare triple {23238#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {23239#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:06,249 INFO L273 TraceCheckUtils]: 60: Hoare triple {23239#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23239#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:06,250 INFO L273 TraceCheckUtils]: 61: Hoare triple {23239#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23239#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:06,251 INFO L273 TraceCheckUtils]: 62: Hoare triple {23239#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {23240#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:06,251 INFO L273 TraceCheckUtils]: 63: Hoare triple {23240#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23240#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:06,251 INFO L273 TraceCheckUtils]: 64: Hoare triple {23240#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23240#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:06,252 INFO L273 TraceCheckUtils]: 65: Hoare triple {23240#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {23241#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:06,253 INFO L273 TraceCheckUtils]: 66: Hoare triple {23241#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23241#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:06,253 INFO L273 TraceCheckUtils]: 67: Hoare triple {23241#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23241#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:06,254 INFO L273 TraceCheckUtils]: 68: Hoare triple {23241#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {23242#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:06,254 INFO L273 TraceCheckUtils]: 69: Hoare triple {23242#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23242#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:06,255 INFO L273 TraceCheckUtils]: 70: Hoare triple {23242#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23242#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:06,255 INFO L273 TraceCheckUtils]: 71: Hoare triple {23242#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {23243#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:06,256 INFO L273 TraceCheckUtils]: 72: Hoare triple {23243#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23243#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:06,256 INFO L273 TraceCheckUtils]: 73: Hoare triple {23243#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23243#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:06,257 INFO L273 TraceCheckUtils]: 74: Hoare triple {23243#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {23244#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:06,258 INFO L273 TraceCheckUtils]: 75: Hoare triple {23244#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23244#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:06,258 INFO L273 TraceCheckUtils]: 76: Hoare triple {23244#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23244#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:06,259 INFO L273 TraceCheckUtils]: 77: Hoare triple {23244#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {23245#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:06,259 INFO L273 TraceCheckUtils]: 78: Hoare triple {23245#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23245#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:06,260 INFO L273 TraceCheckUtils]: 79: Hoare triple {23245#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23245#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:06,260 INFO L273 TraceCheckUtils]: 80: Hoare triple {23245#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {23246#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:06,261 INFO L273 TraceCheckUtils]: 81: Hoare triple {23246#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23246#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:06,261 INFO L273 TraceCheckUtils]: 82: Hoare triple {23246#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23246#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:06,262 INFO L273 TraceCheckUtils]: 83: Hoare triple {23246#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {23247#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:06,263 INFO L273 TraceCheckUtils]: 84: Hoare triple {23247#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23247#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:06,263 INFO L273 TraceCheckUtils]: 85: Hoare triple {23247#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23247#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:06,264 INFO L273 TraceCheckUtils]: 86: Hoare triple {23247#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {23248#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:06,264 INFO L273 TraceCheckUtils]: 87: Hoare triple {23248#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23248#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:06,265 INFO L273 TraceCheckUtils]: 88: Hoare triple {23248#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23248#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:06,266 INFO L273 TraceCheckUtils]: 89: Hoare triple {23248#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {23249#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:06,266 INFO L273 TraceCheckUtils]: 90: Hoare triple {23249#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23249#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:06,266 INFO L273 TraceCheckUtils]: 91: Hoare triple {23249#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23249#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:06,267 INFO L273 TraceCheckUtils]: 92: Hoare triple {23249#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {23250#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:06,268 INFO L273 TraceCheckUtils]: 93: Hoare triple {23250#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23250#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:06,268 INFO L273 TraceCheckUtils]: 94: Hoare triple {23250#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23250#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:06,269 INFO L273 TraceCheckUtils]: 95: Hoare triple {23250#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {23251#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:06,269 INFO L273 TraceCheckUtils]: 96: Hoare triple {23251#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23251#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:06,270 INFO L273 TraceCheckUtils]: 97: Hoare triple {23251#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23251#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:06,270 INFO L273 TraceCheckUtils]: 98: Hoare triple {23251#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {23252#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:06,271 INFO L273 TraceCheckUtils]: 99: Hoare triple {23252#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23252#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:06,271 INFO L273 TraceCheckUtils]: 100: Hoare triple {23252#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23252#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:06,272 INFO L273 TraceCheckUtils]: 101: Hoare triple {23252#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {23253#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:06,273 INFO L273 TraceCheckUtils]: 102: Hoare triple {23253#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23253#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:06,273 INFO L273 TraceCheckUtils]: 103: Hoare triple {23253#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23253#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:06,274 INFO L273 TraceCheckUtils]: 104: Hoare triple {23253#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {23254#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:06,274 INFO L273 TraceCheckUtils]: 105: Hoare triple {23254#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23254#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:06,275 INFO L273 TraceCheckUtils]: 106: Hoare triple {23254#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23254#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:06,275 INFO L273 TraceCheckUtils]: 107: Hoare triple {23254#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {23255#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:06,276 INFO L273 TraceCheckUtils]: 108: Hoare triple {23255#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23255#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:06,276 INFO L273 TraceCheckUtils]: 109: Hoare triple {23255#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23255#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:06,277 INFO L273 TraceCheckUtils]: 110: Hoare triple {23255#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {23256#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:06,277 INFO L273 TraceCheckUtils]: 111: Hoare triple {23256#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23256#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:06,278 INFO L273 TraceCheckUtils]: 112: Hoare triple {23256#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23256#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:06,278 INFO L273 TraceCheckUtils]: 113: Hoare triple {23256#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {23257#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:06,279 INFO L273 TraceCheckUtils]: 114: Hoare triple {23257#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23257#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:06,279 INFO L273 TraceCheckUtils]: 115: Hoare triple {23257#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23257#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:06,280 INFO L273 TraceCheckUtils]: 116: Hoare triple {23257#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {23258#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:06,281 INFO L273 TraceCheckUtils]: 117: Hoare triple {23258#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23258#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:06,281 INFO L273 TraceCheckUtils]: 118: Hoare triple {23258#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {23258#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:06,282 INFO L273 TraceCheckUtils]: 119: Hoare triple {23258#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {23259#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:06,282 INFO L273 TraceCheckUtils]: 120: Hoare triple {23259#(<= main_~i~0 38)} assume !(~i~0 < 100000); {23220#false} is VALID [2018-11-23 12:06:06,283 INFO L273 TraceCheckUtils]: 121: Hoare triple {23220#false} havoc ~x~0;~x~0 := 0; {23220#false} is VALID [2018-11-23 12:06:06,283 INFO L273 TraceCheckUtils]: 122: Hoare triple {23220#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {23220#false} is VALID [2018-11-23 12:06:06,283 INFO L256 TraceCheckUtils]: 123: Hoare triple {23220#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {23220#false} is VALID [2018-11-23 12:06:06,283 INFO L273 TraceCheckUtils]: 124: Hoare triple {23220#false} ~cond := #in~cond; {23220#false} is VALID [2018-11-23 12:06:06,283 INFO L273 TraceCheckUtils]: 125: Hoare triple {23220#false} assume 0 == ~cond; {23220#false} is VALID [2018-11-23 12:06:06,284 INFO L273 TraceCheckUtils]: 126: Hoare triple {23220#false} assume !false; {23220#false} is VALID [2018-11-23 12:06:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:06,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:06,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:06:06,316 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 127 [2018-11-23 12:06:06,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:06,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:06:06,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:06,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:06:06,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:06:06,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:06:06,468 INFO L87 Difference]: Start difference. First operand 132 states and 171 transitions. Second operand 42 states. [2018-11-23 12:06:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:07,150 INFO L93 Difference]: Finished difference Result 148 states and 190 transitions. [2018-11-23 12:06:07,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:06:07,150 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 127 [2018-11-23 12:06:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:07,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:06:07,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 190 transitions. [2018-11-23 12:06:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:06:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 190 transitions. [2018-11-23 12:06:07,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 190 transitions. [2018-11-23 12:06:07,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:07,334 INFO L225 Difference]: With dead ends: 148 [2018-11-23 12:06:07,334 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 12:06:07,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:06:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 12:06:07,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-23 12:06:07,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:07,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 135 states. [2018-11-23 12:06:07,368 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 135 states. [2018-11-23 12:06:07,369 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 135 states. [2018-11-23 12:06:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:07,371 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2018-11-23 12:06:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 178 transitions. [2018-11-23 12:06:07,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:07,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:07,372 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 137 states. [2018-11-23 12:06:07,372 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 137 states. [2018-11-23 12:06:07,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:07,373 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2018-11-23 12:06:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 178 transitions. [2018-11-23 12:06:07,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:07,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:07,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:07,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:07,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 12:06:07,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2018-11-23 12:06:07,376 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 127 [2018-11-23 12:06:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:07,376 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2018-11-23 12:06:07,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:06:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2018-11-23 12:06:07,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:06:07,376 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:07,377 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:07,377 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:07,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:07,377 INFO L82 PathProgramCache]: Analyzing trace with hash -847437405, now seen corresponding path program 39 times [2018-11-23 12:06:07,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:07,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:07,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:07,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:07,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:08,681 INFO L256 TraceCheckUtils]: 0: Hoare triple {24295#true} call ULTIMATE.init(); {24295#true} is VALID [2018-11-23 12:06:08,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {24295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24295#true} is VALID [2018-11-23 12:06:08,682 INFO L273 TraceCheckUtils]: 2: Hoare triple {24295#true} assume true; {24295#true} is VALID [2018-11-23 12:06:08,682 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24295#true} {24295#true} #55#return; {24295#true} is VALID [2018-11-23 12:06:08,682 INFO L256 TraceCheckUtils]: 4: Hoare triple {24295#true} call #t~ret4 := main(); {24295#true} is VALID [2018-11-23 12:06:08,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {24295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {24297#(= main_~i~0 0)} is VALID [2018-11-23 12:06:08,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {24297#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24297#(= main_~i~0 0)} is VALID [2018-11-23 12:06:08,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {24297#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24297#(= main_~i~0 0)} is VALID [2018-11-23 12:06:08,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {24297#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {24298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:08,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {24298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:08,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {24298#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:08,685 INFO L273 TraceCheckUtils]: 11: Hoare triple {24298#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {24299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:08,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {24299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:08,686 INFO L273 TraceCheckUtils]: 13: Hoare triple {24299#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:08,687 INFO L273 TraceCheckUtils]: 14: Hoare triple {24299#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {24300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:08,687 INFO L273 TraceCheckUtils]: 15: Hoare triple {24300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:08,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {24300#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:08,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {24300#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {24301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:08,689 INFO L273 TraceCheckUtils]: 18: Hoare triple {24301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:08,689 INFO L273 TraceCheckUtils]: 19: Hoare triple {24301#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:08,690 INFO L273 TraceCheckUtils]: 20: Hoare triple {24301#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {24302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:08,691 INFO L273 TraceCheckUtils]: 21: Hoare triple {24302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:08,691 INFO L273 TraceCheckUtils]: 22: Hoare triple {24302#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:08,692 INFO L273 TraceCheckUtils]: 23: Hoare triple {24302#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {24303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:08,692 INFO L273 TraceCheckUtils]: 24: Hoare triple {24303#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:08,693 INFO L273 TraceCheckUtils]: 25: Hoare triple {24303#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:08,694 INFO L273 TraceCheckUtils]: 26: Hoare triple {24303#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {24304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:08,694 INFO L273 TraceCheckUtils]: 27: Hoare triple {24304#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:08,695 INFO L273 TraceCheckUtils]: 28: Hoare triple {24304#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:08,695 INFO L273 TraceCheckUtils]: 29: Hoare triple {24304#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {24305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:08,696 INFO L273 TraceCheckUtils]: 30: Hoare triple {24305#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:08,696 INFO L273 TraceCheckUtils]: 31: Hoare triple {24305#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:08,697 INFO L273 TraceCheckUtils]: 32: Hoare triple {24305#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {24306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:08,697 INFO L273 TraceCheckUtils]: 33: Hoare triple {24306#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:08,698 INFO L273 TraceCheckUtils]: 34: Hoare triple {24306#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:08,699 INFO L273 TraceCheckUtils]: 35: Hoare triple {24306#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {24307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:08,699 INFO L273 TraceCheckUtils]: 36: Hoare triple {24307#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:08,700 INFO L273 TraceCheckUtils]: 37: Hoare triple {24307#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:08,700 INFO L273 TraceCheckUtils]: 38: Hoare triple {24307#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {24308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:08,701 INFO L273 TraceCheckUtils]: 39: Hoare triple {24308#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:08,701 INFO L273 TraceCheckUtils]: 40: Hoare triple {24308#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:08,702 INFO L273 TraceCheckUtils]: 41: Hoare triple {24308#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {24309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:08,703 INFO L273 TraceCheckUtils]: 42: Hoare triple {24309#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:08,703 INFO L273 TraceCheckUtils]: 43: Hoare triple {24309#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:08,705 INFO L273 TraceCheckUtils]: 44: Hoare triple {24309#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {24310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:08,706 INFO L273 TraceCheckUtils]: 45: Hoare triple {24310#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:08,706 INFO L273 TraceCheckUtils]: 46: Hoare triple {24310#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:08,707 INFO L273 TraceCheckUtils]: 47: Hoare triple {24310#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {24311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:08,707 INFO L273 TraceCheckUtils]: 48: Hoare triple {24311#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:08,708 INFO L273 TraceCheckUtils]: 49: Hoare triple {24311#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:08,709 INFO L273 TraceCheckUtils]: 50: Hoare triple {24311#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {24312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:08,709 INFO L273 TraceCheckUtils]: 51: Hoare triple {24312#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:08,710 INFO L273 TraceCheckUtils]: 52: Hoare triple {24312#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:08,710 INFO L273 TraceCheckUtils]: 53: Hoare triple {24312#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {24313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:08,711 INFO L273 TraceCheckUtils]: 54: Hoare triple {24313#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:08,711 INFO L273 TraceCheckUtils]: 55: Hoare triple {24313#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:08,712 INFO L273 TraceCheckUtils]: 56: Hoare triple {24313#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {24314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:08,713 INFO L273 TraceCheckUtils]: 57: Hoare triple {24314#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:08,713 INFO L273 TraceCheckUtils]: 58: Hoare triple {24314#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:08,714 INFO L273 TraceCheckUtils]: 59: Hoare triple {24314#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {24315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:08,714 INFO L273 TraceCheckUtils]: 60: Hoare triple {24315#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:08,715 INFO L273 TraceCheckUtils]: 61: Hoare triple {24315#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:08,715 INFO L273 TraceCheckUtils]: 62: Hoare triple {24315#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {24316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:08,716 INFO L273 TraceCheckUtils]: 63: Hoare triple {24316#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:08,716 INFO L273 TraceCheckUtils]: 64: Hoare triple {24316#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:08,717 INFO L273 TraceCheckUtils]: 65: Hoare triple {24316#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {24317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:08,717 INFO L273 TraceCheckUtils]: 66: Hoare triple {24317#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:08,718 INFO L273 TraceCheckUtils]: 67: Hoare triple {24317#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:08,719 INFO L273 TraceCheckUtils]: 68: Hoare triple {24317#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {24318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:08,719 INFO L273 TraceCheckUtils]: 69: Hoare triple {24318#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:08,719 INFO L273 TraceCheckUtils]: 70: Hoare triple {24318#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:08,720 INFO L273 TraceCheckUtils]: 71: Hoare triple {24318#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {24319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:08,721 INFO L273 TraceCheckUtils]: 72: Hoare triple {24319#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:08,721 INFO L273 TraceCheckUtils]: 73: Hoare triple {24319#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:08,722 INFO L273 TraceCheckUtils]: 74: Hoare triple {24319#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {24320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:08,722 INFO L273 TraceCheckUtils]: 75: Hoare triple {24320#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:08,723 INFO L273 TraceCheckUtils]: 76: Hoare triple {24320#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:08,723 INFO L273 TraceCheckUtils]: 77: Hoare triple {24320#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {24321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:08,724 INFO L273 TraceCheckUtils]: 78: Hoare triple {24321#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:08,724 INFO L273 TraceCheckUtils]: 79: Hoare triple {24321#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:08,725 INFO L273 TraceCheckUtils]: 80: Hoare triple {24321#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {24322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:08,725 INFO L273 TraceCheckUtils]: 81: Hoare triple {24322#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:08,726 INFO L273 TraceCheckUtils]: 82: Hoare triple {24322#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:08,727 INFO L273 TraceCheckUtils]: 83: Hoare triple {24322#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {24323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:08,727 INFO L273 TraceCheckUtils]: 84: Hoare triple {24323#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:08,728 INFO L273 TraceCheckUtils]: 85: Hoare triple {24323#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:08,728 INFO L273 TraceCheckUtils]: 86: Hoare triple {24323#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {24324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:08,729 INFO L273 TraceCheckUtils]: 87: Hoare triple {24324#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:08,729 INFO L273 TraceCheckUtils]: 88: Hoare triple {24324#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:08,730 INFO L273 TraceCheckUtils]: 89: Hoare triple {24324#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {24325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:08,731 INFO L273 TraceCheckUtils]: 90: Hoare triple {24325#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:08,731 INFO L273 TraceCheckUtils]: 91: Hoare triple {24325#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:08,732 INFO L273 TraceCheckUtils]: 92: Hoare triple {24325#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {24326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:08,732 INFO L273 TraceCheckUtils]: 93: Hoare triple {24326#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:08,733 INFO L273 TraceCheckUtils]: 94: Hoare triple {24326#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:08,734 INFO L273 TraceCheckUtils]: 95: Hoare triple {24326#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {24327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:08,734 INFO L273 TraceCheckUtils]: 96: Hoare triple {24327#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:08,735 INFO L273 TraceCheckUtils]: 97: Hoare triple {24327#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:08,735 INFO L273 TraceCheckUtils]: 98: Hoare triple {24327#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {24328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:08,736 INFO L273 TraceCheckUtils]: 99: Hoare triple {24328#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:08,736 INFO L273 TraceCheckUtils]: 100: Hoare triple {24328#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:08,737 INFO L273 TraceCheckUtils]: 101: Hoare triple {24328#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {24329#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:08,738 INFO L273 TraceCheckUtils]: 102: Hoare triple {24329#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24329#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:08,738 INFO L273 TraceCheckUtils]: 103: Hoare triple {24329#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24329#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:08,739 INFO L273 TraceCheckUtils]: 104: Hoare triple {24329#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {24330#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:08,739 INFO L273 TraceCheckUtils]: 105: Hoare triple {24330#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24330#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:08,740 INFO L273 TraceCheckUtils]: 106: Hoare triple {24330#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24330#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:08,740 INFO L273 TraceCheckUtils]: 107: Hoare triple {24330#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {24331#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:08,741 INFO L273 TraceCheckUtils]: 108: Hoare triple {24331#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24331#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:08,741 INFO L273 TraceCheckUtils]: 109: Hoare triple {24331#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24331#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:08,742 INFO L273 TraceCheckUtils]: 110: Hoare triple {24331#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {24332#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:08,743 INFO L273 TraceCheckUtils]: 111: Hoare triple {24332#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24332#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:08,743 INFO L273 TraceCheckUtils]: 112: Hoare triple {24332#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24332#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:08,744 INFO L273 TraceCheckUtils]: 113: Hoare triple {24332#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {24333#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:08,744 INFO L273 TraceCheckUtils]: 114: Hoare triple {24333#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24333#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:08,745 INFO L273 TraceCheckUtils]: 115: Hoare triple {24333#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24333#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:08,745 INFO L273 TraceCheckUtils]: 116: Hoare triple {24333#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {24334#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:08,746 INFO L273 TraceCheckUtils]: 117: Hoare triple {24334#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24334#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:08,746 INFO L273 TraceCheckUtils]: 118: Hoare triple {24334#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24334#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:08,747 INFO L273 TraceCheckUtils]: 119: Hoare triple {24334#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {24335#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:08,747 INFO L273 TraceCheckUtils]: 120: Hoare triple {24335#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24335#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:08,748 INFO L273 TraceCheckUtils]: 121: Hoare triple {24335#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24335#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:08,749 INFO L273 TraceCheckUtils]: 122: Hoare triple {24335#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {24336#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:08,749 INFO L273 TraceCheckUtils]: 123: Hoare triple {24336#(<= main_~i~0 39)} assume !(~i~0 < 100000); {24296#false} is VALID [2018-11-23 12:06:08,749 INFO L273 TraceCheckUtils]: 124: Hoare triple {24296#false} havoc ~x~0;~x~0 := 0; {24296#false} is VALID [2018-11-23 12:06:08,750 INFO L273 TraceCheckUtils]: 125: Hoare triple {24296#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {24296#false} is VALID [2018-11-23 12:06:08,750 INFO L256 TraceCheckUtils]: 126: Hoare triple {24296#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {24296#false} is VALID [2018-11-23 12:06:08,750 INFO L273 TraceCheckUtils]: 127: Hoare triple {24296#false} ~cond := #in~cond; {24296#false} is VALID [2018-11-23 12:06:08,750 INFO L273 TraceCheckUtils]: 128: Hoare triple {24296#false} assume 0 == ~cond; {24296#false} is VALID [2018-11-23 12:06:08,750 INFO L273 TraceCheckUtils]: 129: Hoare triple {24296#false} assume !false; {24296#false} is VALID [2018-11-23 12:06:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:08,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:08,765 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:08,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:08,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-23 12:06:08,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:08,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:09,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {24295#true} call ULTIMATE.init(); {24295#true} is VALID [2018-11-23 12:06:09,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {24295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24295#true} is VALID [2018-11-23 12:06:09,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {24295#true} assume true; {24295#true} is VALID [2018-11-23 12:06:09,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24295#true} {24295#true} #55#return; {24295#true} is VALID [2018-11-23 12:06:09,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {24295#true} call #t~ret4 := main(); {24295#true} is VALID [2018-11-23 12:06:09,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {24295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {24355#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:09,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {24355#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24355#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:09,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {24355#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24355#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:09,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {24355#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {24298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:09,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {24298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:09,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {24298#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:09,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {24298#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {24299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:09,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {24299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:09,290 INFO L273 TraceCheckUtils]: 13: Hoare triple {24299#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:09,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {24299#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {24300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:09,292 INFO L273 TraceCheckUtils]: 15: Hoare triple {24300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:09,292 INFO L273 TraceCheckUtils]: 16: Hoare triple {24300#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:09,293 INFO L273 TraceCheckUtils]: 17: Hoare triple {24300#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {24301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:09,293 INFO L273 TraceCheckUtils]: 18: Hoare triple {24301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:09,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {24301#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:09,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {24301#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {24302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:09,295 INFO L273 TraceCheckUtils]: 21: Hoare triple {24302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:09,296 INFO L273 TraceCheckUtils]: 22: Hoare triple {24302#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:09,296 INFO L273 TraceCheckUtils]: 23: Hoare triple {24302#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {24303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:09,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {24303#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:09,297 INFO L273 TraceCheckUtils]: 25: Hoare triple {24303#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:09,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {24303#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {24304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:09,299 INFO L273 TraceCheckUtils]: 27: Hoare triple {24304#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:09,299 INFO L273 TraceCheckUtils]: 28: Hoare triple {24304#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:09,300 INFO L273 TraceCheckUtils]: 29: Hoare triple {24304#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {24305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:09,300 INFO L273 TraceCheckUtils]: 30: Hoare triple {24305#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:09,301 INFO L273 TraceCheckUtils]: 31: Hoare triple {24305#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:09,302 INFO L273 TraceCheckUtils]: 32: Hoare triple {24305#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {24306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:09,302 INFO L273 TraceCheckUtils]: 33: Hoare triple {24306#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:09,303 INFO L273 TraceCheckUtils]: 34: Hoare triple {24306#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:09,303 INFO L273 TraceCheckUtils]: 35: Hoare triple {24306#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {24307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:09,304 INFO L273 TraceCheckUtils]: 36: Hoare triple {24307#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:09,304 INFO L273 TraceCheckUtils]: 37: Hoare triple {24307#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:09,305 INFO L273 TraceCheckUtils]: 38: Hoare triple {24307#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {24308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:09,305 INFO L273 TraceCheckUtils]: 39: Hoare triple {24308#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:09,306 INFO L273 TraceCheckUtils]: 40: Hoare triple {24308#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:09,306 INFO L273 TraceCheckUtils]: 41: Hoare triple {24308#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {24309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:09,326 INFO L273 TraceCheckUtils]: 42: Hoare triple {24309#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:09,334 INFO L273 TraceCheckUtils]: 43: Hoare triple {24309#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:09,348 INFO L273 TraceCheckUtils]: 44: Hoare triple {24309#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {24310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:09,355 INFO L273 TraceCheckUtils]: 45: Hoare triple {24310#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:09,355 INFO L273 TraceCheckUtils]: 46: Hoare triple {24310#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:09,356 INFO L273 TraceCheckUtils]: 47: Hoare triple {24310#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {24311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:09,356 INFO L273 TraceCheckUtils]: 48: Hoare triple {24311#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:09,356 INFO L273 TraceCheckUtils]: 49: Hoare triple {24311#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:09,357 INFO L273 TraceCheckUtils]: 50: Hoare triple {24311#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {24312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:09,357 INFO L273 TraceCheckUtils]: 51: Hoare triple {24312#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:09,357 INFO L273 TraceCheckUtils]: 52: Hoare triple {24312#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:09,358 INFO L273 TraceCheckUtils]: 53: Hoare triple {24312#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {24313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:09,358 INFO L273 TraceCheckUtils]: 54: Hoare triple {24313#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:09,358 INFO L273 TraceCheckUtils]: 55: Hoare triple {24313#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:09,359 INFO L273 TraceCheckUtils]: 56: Hoare triple {24313#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {24314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:09,360 INFO L273 TraceCheckUtils]: 57: Hoare triple {24314#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:09,360 INFO L273 TraceCheckUtils]: 58: Hoare triple {24314#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:09,361 INFO L273 TraceCheckUtils]: 59: Hoare triple {24314#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {24315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:09,361 INFO L273 TraceCheckUtils]: 60: Hoare triple {24315#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:09,362 INFO L273 TraceCheckUtils]: 61: Hoare triple {24315#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:09,363 INFO L273 TraceCheckUtils]: 62: Hoare triple {24315#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {24316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:09,363 INFO L273 TraceCheckUtils]: 63: Hoare triple {24316#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:09,364 INFO L273 TraceCheckUtils]: 64: Hoare triple {24316#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:09,364 INFO L273 TraceCheckUtils]: 65: Hoare triple {24316#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {24317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:09,365 INFO L273 TraceCheckUtils]: 66: Hoare triple {24317#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:09,365 INFO L273 TraceCheckUtils]: 67: Hoare triple {24317#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:09,366 INFO L273 TraceCheckUtils]: 68: Hoare triple {24317#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {24318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:09,367 INFO L273 TraceCheckUtils]: 69: Hoare triple {24318#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:09,367 INFO L273 TraceCheckUtils]: 70: Hoare triple {24318#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:09,368 INFO L273 TraceCheckUtils]: 71: Hoare triple {24318#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {24319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:09,368 INFO L273 TraceCheckUtils]: 72: Hoare triple {24319#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:09,369 INFO L273 TraceCheckUtils]: 73: Hoare triple {24319#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:09,369 INFO L273 TraceCheckUtils]: 74: Hoare triple {24319#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {24320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:09,370 INFO L273 TraceCheckUtils]: 75: Hoare triple {24320#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:09,370 INFO L273 TraceCheckUtils]: 76: Hoare triple {24320#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:09,371 INFO L273 TraceCheckUtils]: 77: Hoare triple {24320#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {24321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:09,372 INFO L273 TraceCheckUtils]: 78: Hoare triple {24321#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:09,372 INFO L273 TraceCheckUtils]: 79: Hoare triple {24321#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:09,373 INFO L273 TraceCheckUtils]: 80: Hoare triple {24321#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {24322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:09,373 INFO L273 TraceCheckUtils]: 81: Hoare triple {24322#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:09,374 INFO L273 TraceCheckUtils]: 82: Hoare triple {24322#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:09,375 INFO L273 TraceCheckUtils]: 83: Hoare triple {24322#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {24323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:09,375 INFO L273 TraceCheckUtils]: 84: Hoare triple {24323#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:09,376 INFO L273 TraceCheckUtils]: 85: Hoare triple {24323#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:09,376 INFO L273 TraceCheckUtils]: 86: Hoare triple {24323#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {24324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:09,377 INFO L273 TraceCheckUtils]: 87: Hoare triple {24324#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:09,377 INFO L273 TraceCheckUtils]: 88: Hoare triple {24324#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:09,378 INFO L273 TraceCheckUtils]: 89: Hoare triple {24324#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {24325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:09,378 INFO L273 TraceCheckUtils]: 90: Hoare triple {24325#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:09,379 INFO L273 TraceCheckUtils]: 91: Hoare triple {24325#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:09,379 INFO L273 TraceCheckUtils]: 92: Hoare triple {24325#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {24326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:09,380 INFO L273 TraceCheckUtils]: 93: Hoare triple {24326#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:09,380 INFO L273 TraceCheckUtils]: 94: Hoare triple {24326#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:09,381 INFO L273 TraceCheckUtils]: 95: Hoare triple {24326#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {24327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:09,382 INFO L273 TraceCheckUtils]: 96: Hoare triple {24327#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:09,382 INFO L273 TraceCheckUtils]: 97: Hoare triple {24327#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:09,383 INFO L273 TraceCheckUtils]: 98: Hoare triple {24327#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {24328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:09,383 INFO L273 TraceCheckUtils]: 99: Hoare triple {24328#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:09,384 INFO L273 TraceCheckUtils]: 100: Hoare triple {24328#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:09,384 INFO L273 TraceCheckUtils]: 101: Hoare triple {24328#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {24329#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:09,385 INFO L273 TraceCheckUtils]: 102: Hoare triple {24329#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24329#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:09,385 INFO L273 TraceCheckUtils]: 103: Hoare triple {24329#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24329#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:09,386 INFO L273 TraceCheckUtils]: 104: Hoare triple {24329#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {24330#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:09,388 INFO L273 TraceCheckUtils]: 105: Hoare triple {24330#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24330#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:09,389 INFO L273 TraceCheckUtils]: 106: Hoare triple {24330#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24330#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:09,389 INFO L273 TraceCheckUtils]: 107: Hoare triple {24330#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {24331#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:09,389 INFO L273 TraceCheckUtils]: 108: Hoare triple {24331#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24331#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:09,390 INFO L273 TraceCheckUtils]: 109: Hoare triple {24331#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24331#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:09,390 INFO L273 TraceCheckUtils]: 110: Hoare triple {24331#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {24332#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:09,390 INFO L273 TraceCheckUtils]: 111: Hoare triple {24332#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24332#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:09,391 INFO L273 TraceCheckUtils]: 112: Hoare triple {24332#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24332#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:09,391 INFO L273 TraceCheckUtils]: 113: Hoare triple {24332#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {24333#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:09,391 INFO L273 TraceCheckUtils]: 114: Hoare triple {24333#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24333#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:09,392 INFO L273 TraceCheckUtils]: 115: Hoare triple {24333#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24333#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:09,392 INFO L273 TraceCheckUtils]: 116: Hoare triple {24333#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {24334#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:09,393 INFO L273 TraceCheckUtils]: 117: Hoare triple {24334#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24334#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:09,393 INFO L273 TraceCheckUtils]: 118: Hoare triple {24334#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24334#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:09,394 INFO L273 TraceCheckUtils]: 119: Hoare triple {24334#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {24335#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:09,394 INFO L273 TraceCheckUtils]: 120: Hoare triple {24335#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24335#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:09,395 INFO L273 TraceCheckUtils]: 121: Hoare triple {24335#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {24335#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:09,396 INFO L273 TraceCheckUtils]: 122: Hoare triple {24335#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {24336#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:09,396 INFO L273 TraceCheckUtils]: 123: Hoare triple {24336#(<= main_~i~0 39)} assume !(~i~0 < 100000); {24296#false} is VALID [2018-11-23 12:06:09,397 INFO L273 TraceCheckUtils]: 124: Hoare triple {24296#false} havoc ~x~0;~x~0 := 0; {24296#false} is VALID [2018-11-23 12:06:09,397 INFO L273 TraceCheckUtils]: 125: Hoare triple {24296#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {24296#false} is VALID [2018-11-23 12:06:09,397 INFO L256 TraceCheckUtils]: 126: Hoare triple {24296#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {24296#false} is VALID [2018-11-23 12:06:09,397 INFO L273 TraceCheckUtils]: 127: Hoare triple {24296#false} ~cond := #in~cond; {24296#false} is VALID [2018-11-23 12:06:09,397 INFO L273 TraceCheckUtils]: 128: Hoare triple {24296#false} assume 0 == ~cond; {24296#false} is VALID [2018-11-23 12:06:09,397 INFO L273 TraceCheckUtils]: 129: Hoare triple {24296#false} assume !false; {24296#false} is VALID [2018-11-23 12:06:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:09,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:09,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-23 12:06:09,429 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 130 [2018-11-23 12:06:09,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:09,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:06:09,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:09,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:06:09,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:06:09,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:06:09,555 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand 43 states. [2018-11-23 12:06:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:10,164 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2018-11-23 12:06:10,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:06:10,164 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 130 [2018-11-23 12:06:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:06:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 194 transitions. [2018-11-23 12:06:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:06:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 194 transitions. [2018-11-23 12:06:10,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 194 transitions. [2018-11-23 12:06:10,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:10,347 INFO L225 Difference]: With dead ends: 151 [2018-11-23 12:06:10,347 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 12:06:10,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:06:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 12:06:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-11-23 12:06:10,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:10,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 138 states. [2018-11-23 12:06:10,427 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 138 states. [2018-11-23 12:06:10,427 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 138 states. [2018-11-23 12:06:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:10,429 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2018-11-23 12:06:10,429 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2018-11-23 12:06:10,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:10,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:10,429 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 140 states. [2018-11-23 12:06:10,429 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 140 states. [2018-11-23 12:06:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:10,431 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2018-11-23 12:06:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2018-11-23 12:06:10,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:10,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:10,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:10,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:10,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 12:06:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2018-11-23 12:06:10,433 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 130 [2018-11-23 12:06:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:10,434 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2018-11-23 12:06:10,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:06:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2018-11-23 12:06:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 12:06:10,435 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:10,435 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:10,435 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:10,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:10,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1144600647, now seen corresponding path program 40 times [2018-11-23 12:06:10,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:10,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:10,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:10,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:10,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:11,472 INFO L256 TraceCheckUtils]: 0: Hoare triple {25395#true} call ULTIMATE.init(); {25395#true} is VALID [2018-11-23 12:06:11,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {25395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25395#true} is VALID [2018-11-23 12:06:11,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {25395#true} assume true; {25395#true} is VALID [2018-11-23 12:06:11,473 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25395#true} {25395#true} #55#return; {25395#true} is VALID [2018-11-23 12:06:11,473 INFO L256 TraceCheckUtils]: 4: Hoare triple {25395#true} call #t~ret4 := main(); {25395#true} is VALID [2018-11-23 12:06:11,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {25395#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {25397#(= main_~i~0 0)} is VALID [2018-11-23 12:06:11,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {25397#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25397#(= main_~i~0 0)} is VALID [2018-11-23 12:06:11,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {25397#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25397#(= main_~i~0 0)} is VALID [2018-11-23 12:06:11,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {25397#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {25398#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:11,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {25398#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25398#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:11,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {25398#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25398#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:11,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {25398#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {25399#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:11,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {25399#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25399#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:11,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {25399#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25399#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:11,479 INFO L273 TraceCheckUtils]: 14: Hoare triple {25399#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {25400#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:11,479 INFO L273 TraceCheckUtils]: 15: Hoare triple {25400#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25400#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:11,480 INFO L273 TraceCheckUtils]: 16: Hoare triple {25400#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25400#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:11,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {25400#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {25401#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:11,481 INFO L273 TraceCheckUtils]: 18: Hoare triple {25401#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25401#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:11,481 INFO L273 TraceCheckUtils]: 19: Hoare triple {25401#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25401#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:11,482 INFO L273 TraceCheckUtils]: 20: Hoare triple {25401#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {25402#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:11,482 INFO L273 TraceCheckUtils]: 21: Hoare triple {25402#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25402#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:11,483 INFO L273 TraceCheckUtils]: 22: Hoare triple {25402#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25402#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:11,484 INFO L273 TraceCheckUtils]: 23: Hoare triple {25402#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {25403#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:11,484 INFO L273 TraceCheckUtils]: 24: Hoare triple {25403#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25403#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:11,485 INFO L273 TraceCheckUtils]: 25: Hoare triple {25403#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25403#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:11,485 INFO L273 TraceCheckUtils]: 26: Hoare triple {25403#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {25404#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:11,486 INFO L273 TraceCheckUtils]: 27: Hoare triple {25404#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25404#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:11,486 INFO L273 TraceCheckUtils]: 28: Hoare triple {25404#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25404#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:11,487 INFO L273 TraceCheckUtils]: 29: Hoare triple {25404#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {25405#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:11,488 INFO L273 TraceCheckUtils]: 30: Hoare triple {25405#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25405#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:11,488 INFO L273 TraceCheckUtils]: 31: Hoare triple {25405#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25405#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:11,489 INFO L273 TraceCheckUtils]: 32: Hoare triple {25405#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {25406#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:11,489 INFO L273 TraceCheckUtils]: 33: Hoare triple {25406#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25406#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:11,490 INFO L273 TraceCheckUtils]: 34: Hoare triple {25406#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25406#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:11,490 INFO L273 TraceCheckUtils]: 35: Hoare triple {25406#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {25407#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:11,491 INFO L273 TraceCheckUtils]: 36: Hoare triple {25407#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25407#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:11,491 INFO L273 TraceCheckUtils]: 37: Hoare triple {25407#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25407#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:11,492 INFO L273 TraceCheckUtils]: 38: Hoare triple {25407#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {25408#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:11,493 INFO L273 TraceCheckUtils]: 39: Hoare triple {25408#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25408#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:11,493 INFO L273 TraceCheckUtils]: 40: Hoare triple {25408#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25408#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:11,494 INFO L273 TraceCheckUtils]: 41: Hoare triple {25408#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {25409#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:11,494 INFO L273 TraceCheckUtils]: 42: Hoare triple {25409#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25409#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:11,495 INFO L273 TraceCheckUtils]: 43: Hoare triple {25409#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25409#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:11,496 INFO L273 TraceCheckUtils]: 44: Hoare triple {25409#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {25410#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:11,496 INFO L273 TraceCheckUtils]: 45: Hoare triple {25410#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25410#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:11,497 INFO L273 TraceCheckUtils]: 46: Hoare triple {25410#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25410#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:11,497 INFO L273 TraceCheckUtils]: 47: Hoare triple {25410#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {25411#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:11,498 INFO L273 TraceCheckUtils]: 48: Hoare triple {25411#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25411#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:11,498 INFO L273 TraceCheckUtils]: 49: Hoare triple {25411#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25411#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:11,499 INFO L273 TraceCheckUtils]: 50: Hoare triple {25411#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {25412#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:11,500 INFO L273 TraceCheckUtils]: 51: Hoare triple {25412#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25412#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:11,500 INFO L273 TraceCheckUtils]: 52: Hoare triple {25412#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25412#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:11,501 INFO L273 TraceCheckUtils]: 53: Hoare triple {25412#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {25413#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:11,501 INFO L273 TraceCheckUtils]: 54: Hoare triple {25413#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25413#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:11,502 INFO L273 TraceCheckUtils]: 55: Hoare triple {25413#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25413#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:11,502 INFO L273 TraceCheckUtils]: 56: Hoare triple {25413#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {25414#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:11,503 INFO L273 TraceCheckUtils]: 57: Hoare triple {25414#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25414#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:11,503 INFO L273 TraceCheckUtils]: 58: Hoare triple {25414#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25414#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:11,504 INFO L273 TraceCheckUtils]: 59: Hoare triple {25414#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {25415#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:11,505 INFO L273 TraceCheckUtils]: 60: Hoare triple {25415#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25415#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:11,505 INFO L273 TraceCheckUtils]: 61: Hoare triple {25415#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25415#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:11,506 INFO L273 TraceCheckUtils]: 62: Hoare triple {25415#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {25416#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:11,506 INFO L273 TraceCheckUtils]: 63: Hoare triple {25416#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25416#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:11,507 INFO L273 TraceCheckUtils]: 64: Hoare triple {25416#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25416#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:11,508 INFO L273 TraceCheckUtils]: 65: Hoare triple {25416#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {25417#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:11,508 INFO L273 TraceCheckUtils]: 66: Hoare triple {25417#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25417#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:11,509 INFO L273 TraceCheckUtils]: 67: Hoare triple {25417#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25417#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:11,509 INFO L273 TraceCheckUtils]: 68: Hoare triple {25417#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {25418#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:11,510 INFO L273 TraceCheckUtils]: 69: Hoare triple {25418#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25418#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:11,510 INFO L273 TraceCheckUtils]: 70: Hoare triple {25418#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25418#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:11,511 INFO L273 TraceCheckUtils]: 71: Hoare triple {25418#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {25419#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:11,511 INFO L273 TraceCheckUtils]: 72: Hoare triple {25419#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25419#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:11,512 INFO L273 TraceCheckUtils]: 73: Hoare triple {25419#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25419#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:11,513 INFO L273 TraceCheckUtils]: 74: Hoare triple {25419#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {25420#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:11,513 INFO L273 TraceCheckUtils]: 75: Hoare triple {25420#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25420#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:11,514 INFO L273 TraceCheckUtils]: 76: Hoare triple {25420#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25420#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:11,514 INFO L273 TraceCheckUtils]: 77: Hoare triple {25420#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {25421#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:11,515 INFO L273 TraceCheckUtils]: 78: Hoare triple {25421#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25421#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:11,515 INFO L273 TraceCheckUtils]: 79: Hoare triple {25421#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25421#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:11,516 INFO L273 TraceCheckUtils]: 80: Hoare triple {25421#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {25422#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:11,517 INFO L273 TraceCheckUtils]: 81: Hoare triple {25422#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25422#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:11,517 INFO L273 TraceCheckUtils]: 82: Hoare triple {25422#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25422#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:11,518 INFO L273 TraceCheckUtils]: 83: Hoare triple {25422#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {25423#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:11,518 INFO L273 TraceCheckUtils]: 84: Hoare triple {25423#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25423#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:11,519 INFO L273 TraceCheckUtils]: 85: Hoare triple {25423#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25423#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:11,520 INFO L273 TraceCheckUtils]: 86: Hoare triple {25423#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {25424#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:11,520 INFO L273 TraceCheckUtils]: 87: Hoare triple {25424#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25424#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:11,521 INFO L273 TraceCheckUtils]: 88: Hoare triple {25424#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25424#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:11,521 INFO L273 TraceCheckUtils]: 89: Hoare triple {25424#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {25425#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:11,522 INFO L273 TraceCheckUtils]: 90: Hoare triple {25425#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25425#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:11,522 INFO L273 TraceCheckUtils]: 91: Hoare triple {25425#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25425#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:11,523 INFO L273 TraceCheckUtils]: 92: Hoare triple {25425#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {25426#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:11,523 INFO L273 TraceCheckUtils]: 93: Hoare triple {25426#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25426#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:11,524 INFO L273 TraceCheckUtils]: 94: Hoare triple {25426#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25426#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:11,525 INFO L273 TraceCheckUtils]: 95: Hoare triple {25426#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {25427#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:11,525 INFO L273 TraceCheckUtils]: 96: Hoare triple {25427#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25427#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:11,526 INFO L273 TraceCheckUtils]: 97: Hoare triple {25427#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25427#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:11,526 INFO L273 TraceCheckUtils]: 98: Hoare triple {25427#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {25428#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:11,527 INFO L273 TraceCheckUtils]: 99: Hoare triple {25428#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25428#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:11,527 INFO L273 TraceCheckUtils]: 100: Hoare triple {25428#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25428#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:11,528 INFO L273 TraceCheckUtils]: 101: Hoare triple {25428#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {25429#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:11,529 INFO L273 TraceCheckUtils]: 102: Hoare triple {25429#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25429#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:11,529 INFO L273 TraceCheckUtils]: 103: Hoare triple {25429#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25429#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:11,530 INFO L273 TraceCheckUtils]: 104: Hoare triple {25429#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {25430#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:11,530 INFO L273 TraceCheckUtils]: 105: Hoare triple {25430#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25430#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:11,531 INFO L273 TraceCheckUtils]: 106: Hoare triple {25430#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25430#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:11,531 INFO L273 TraceCheckUtils]: 107: Hoare triple {25430#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {25431#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:11,532 INFO L273 TraceCheckUtils]: 108: Hoare triple {25431#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25431#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:11,532 INFO L273 TraceCheckUtils]: 109: Hoare triple {25431#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25431#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:11,533 INFO L273 TraceCheckUtils]: 110: Hoare triple {25431#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {25432#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:11,534 INFO L273 TraceCheckUtils]: 111: Hoare triple {25432#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25432#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:11,534 INFO L273 TraceCheckUtils]: 112: Hoare triple {25432#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25432#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:11,535 INFO L273 TraceCheckUtils]: 113: Hoare triple {25432#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {25433#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:11,535 INFO L273 TraceCheckUtils]: 114: Hoare triple {25433#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25433#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:11,536 INFO L273 TraceCheckUtils]: 115: Hoare triple {25433#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25433#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:11,537 INFO L273 TraceCheckUtils]: 116: Hoare triple {25433#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {25434#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:11,537 INFO L273 TraceCheckUtils]: 117: Hoare triple {25434#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25434#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:11,538 INFO L273 TraceCheckUtils]: 118: Hoare triple {25434#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25434#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:11,538 INFO L273 TraceCheckUtils]: 119: Hoare triple {25434#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {25435#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:11,539 INFO L273 TraceCheckUtils]: 120: Hoare triple {25435#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25435#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:11,539 INFO L273 TraceCheckUtils]: 121: Hoare triple {25435#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25435#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:11,540 INFO L273 TraceCheckUtils]: 122: Hoare triple {25435#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {25436#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:11,540 INFO L273 TraceCheckUtils]: 123: Hoare triple {25436#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25436#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:11,541 INFO L273 TraceCheckUtils]: 124: Hoare triple {25436#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25436#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:11,542 INFO L273 TraceCheckUtils]: 125: Hoare triple {25436#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {25437#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:11,542 INFO L273 TraceCheckUtils]: 126: Hoare triple {25437#(<= main_~i~0 40)} assume !(~i~0 < 100000); {25396#false} is VALID [2018-11-23 12:06:11,543 INFO L273 TraceCheckUtils]: 127: Hoare triple {25396#false} havoc ~x~0;~x~0 := 0; {25396#false} is VALID [2018-11-23 12:06:11,543 INFO L273 TraceCheckUtils]: 128: Hoare triple {25396#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {25396#false} is VALID [2018-11-23 12:06:11,543 INFO L256 TraceCheckUtils]: 129: Hoare triple {25396#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {25396#false} is VALID [2018-11-23 12:06:11,543 INFO L273 TraceCheckUtils]: 130: Hoare triple {25396#false} ~cond := #in~cond; {25396#false} is VALID [2018-11-23 12:06:11,543 INFO L273 TraceCheckUtils]: 131: Hoare triple {25396#false} assume 0 == ~cond; {25396#false} is VALID [2018-11-23 12:06:11,544 INFO L273 TraceCheckUtils]: 132: Hoare triple {25396#false} assume !false; {25396#false} is VALID [2018-11-23 12:06:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:11,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:11,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:11,566 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:11,622 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:11,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:11,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:11,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {25395#true} call ULTIMATE.init(); {25395#true} is VALID [2018-11-23 12:06:11,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {25395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25395#true} is VALID [2018-11-23 12:06:11,957 INFO L273 TraceCheckUtils]: 2: Hoare triple {25395#true} assume true; {25395#true} is VALID [2018-11-23 12:06:11,957 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25395#true} {25395#true} #55#return; {25395#true} is VALID [2018-11-23 12:06:11,958 INFO L256 TraceCheckUtils]: 4: Hoare triple {25395#true} call #t~ret4 := main(); {25395#true} is VALID [2018-11-23 12:06:11,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {25395#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {25456#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:11,959 INFO L273 TraceCheckUtils]: 6: Hoare triple {25456#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25456#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:11,959 INFO L273 TraceCheckUtils]: 7: Hoare triple {25456#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25456#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:11,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {25456#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {25398#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:11,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {25398#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25398#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:11,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {25398#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25398#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:11,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {25398#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {25399#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:11,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {25399#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25399#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:11,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {25399#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25399#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:11,962 INFO L273 TraceCheckUtils]: 14: Hoare triple {25399#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {25400#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:11,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {25400#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25400#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:11,963 INFO L273 TraceCheckUtils]: 16: Hoare triple {25400#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25400#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:11,964 INFO L273 TraceCheckUtils]: 17: Hoare triple {25400#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {25401#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:11,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {25401#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25401#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:11,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {25401#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25401#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:11,966 INFO L273 TraceCheckUtils]: 20: Hoare triple {25401#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {25402#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:11,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {25402#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25402#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:11,967 INFO L273 TraceCheckUtils]: 22: Hoare triple {25402#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25402#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:11,967 INFO L273 TraceCheckUtils]: 23: Hoare triple {25402#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {25403#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:11,968 INFO L273 TraceCheckUtils]: 24: Hoare triple {25403#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25403#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:11,968 INFO L273 TraceCheckUtils]: 25: Hoare triple {25403#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25403#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:11,969 INFO L273 TraceCheckUtils]: 26: Hoare triple {25403#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {25404#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:11,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {25404#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25404#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:11,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {25404#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25404#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:11,971 INFO L273 TraceCheckUtils]: 29: Hoare triple {25404#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {25405#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:11,971 INFO L273 TraceCheckUtils]: 30: Hoare triple {25405#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25405#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:11,972 INFO L273 TraceCheckUtils]: 31: Hoare triple {25405#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25405#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:11,972 INFO L273 TraceCheckUtils]: 32: Hoare triple {25405#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {25406#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:11,973 INFO L273 TraceCheckUtils]: 33: Hoare triple {25406#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25406#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:11,973 INFO L273 TraceCheckUtils]: 34: Hoare triple {25406#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25406#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:11,974 INFO L273 TraceCheckUtils]: 35: Hoare triple {25406#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {25407#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:11,975 INFO L273 TraceCheckUtils]: 36: Hoare triple {25407#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25407#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:11,975 INFO L273 TraceCheckUtils]: 37: Hoare triple {25407#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25407#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:11,976 INFO L273 TraceCheckUtils]: 38: Hoare triple {25407#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {25408#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:11,976 INFO L273 TraceCheckUtils]: 39: Hoare triple {25408#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25408#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:11,977 INFO L273 TraceCheckUtils]: 40: Hoare triple {25408#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25408#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:11,978 INFO L273 TraceCheckUtils]: 41: Hoare triple {25408#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {25409#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:11,978 INFO L273 TraceCheckUtils]: 42: Hoare triple {25409#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25409#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:11,979 INFO L273 TraceCheckUtils]: 43: Hoare triple {25409#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25409#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:11,979 INFO L273 TraceCheckUtils]: 44: Hoare triple {25409#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {25410#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:11,980 INFO L273 TraceCheckUtils]: 45: Hoare triple {25410#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25410#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:11,980 INFO L273 TraceCheckUtils]: 46: Hoare triple {25410#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25410#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:11,981 INFO L273 TraceCheckUtils]: 47: Hoare triple {25410#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {25411#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:11,982 INFO L273 TraceCheckUtils]: 48: Hoare triple {25411#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25411#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:11,982 INFO L273 TraceCheckUtils]: 49: Hoare triple {25411#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25411#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:11,983 INFO L273 TraceCheckUtils]: 50: Hoare triple {25411#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {25412#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:11,983 INFO L273 TraceCheckUtils]: 51: Hoare triple {25412#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25412#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:11,984 INFO L273 TraceCheckUtils]: 52: Hoare triple {25412#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25412#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:11,984 INFO L273 TraceCheckUtils]: 53: Hoare triple {25412#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {25413#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:11,985 INFO L273 TraceCheckUtils]: 54: Hoare triple {25413#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25413#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:11,985 INFO L273 TraceCheckUtils]: 55: Hoare triple {25413#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25413#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:11,986 INFO L273 TraceCheckUtils]: 56: Hoare triple {25413#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {25414#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:11,987 INFO L273 TraceCheckUtils]: 57: Hoare triple {25414#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25414#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:11,987 INFO L273 TraceCheckUtils]: 58: Hoare triple {25414#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25414#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:11,988 INFO L273 TraceCheckUtils]: 59: Hoare triple {25414#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {25415#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:11,988 INFO L273 TraceCheckUtils]: 60: Hoare triple {25415#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25415#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:11,989 INFO L273 TraceCheckUtils]: 61: Hoare triple {25415#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25415#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:11,990 INFO L273 TraceCheckUtils]: 62: Hoare triple {25415#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {25416#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:11,990 INFO L273 TraceCheckUtils]: 63: Hoare triple {25416#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25416#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:11,991 INFO L273 TraceCheckUtils]: 64: Hoare triple {25416#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25416#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:11,991 INFO L273 TraceCheckUtils]: 65: Hoare triple {25416#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {25417#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:11,992 INFO L273 TraceCheckUtils]: 66: Hoare triple {25417#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25417#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:11,992 INFO L273 TraceCheckUtils]: 67: Hoare triple {25417#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25417#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:11,993 INFO L273 TraceCheckUtils]: 68: Hoare triple {25417#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {25418#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:11,993 INFO L273 TraceCheckUtils]: 69: Hoare triple {25418#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25418#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:11,994 INFO L273 TraceCheckUtils]: 70: Hoare triple {25418#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25418#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:11,995 INFO L273 TraceCheckUtils]: 71: Hoare triple {25418#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {25419#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:11,995 INFO L273 TraceCheckUtils]: 72: Hoare triple {25419#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25419#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:11,996 INFO L273 TraceCheckUtils]: 73: Hoare triple {25419#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25419#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:11,996 INFO L273 TraceCheckUtils]: 74: Hoare triple {25419#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {25420#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:11,997 INFO L273 TraceCheckUtils]: 75: Hoare triple {25420#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25420#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:11,997 INFO L273 TraceCheckUtils]: 76: Hoare triple {25420#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25420#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:11,998 INFO L273 TraceCheckUtils]: 77: Hoare triple {25420#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {25421#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:11,999 INFO L273 TraceCheckUtils]: 78: Hoare triple {25421#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25421#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:11,999 INFO L273 TraceCheckUtils]: 79: Hoare triple {25421#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25421#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:12,000 INFO L273 TraceCheckUtils]: 80: Hoare triple {25421#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {25422#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:12,000 INFO L273 TraceCheckUtils]: 81: Hoare triple {25422#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25422#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:12,001 INFO L273 TraceCheckUtils]: 82: Hoare triple {25422#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25422#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:12,002 INFO L273 TraceCheckUtils]: 83: Hoare triple {25422#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {25423#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:12,002 INFO L273 TraceCheckUtils]: 84: Hoare triple {25423#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25423#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:12,003 INFO L273 TraceCheckUtils]: 85: Hoare triple {25423#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25423#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:12,003 INFO L273 TraceCheckUtils]: 86: Hoare triple {25423#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {25424#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:12,004 INFO L273 TraceCheckUtils]: 87: Hoare triple {25424#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25424#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:12,004 INFO L273 TraceCheckUtils]: 88: Hoare triple {25424#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25424#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:12,005 INFO L273 TraceCheckUtils]: 89: Hoare triple {25424#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {25425#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:12,005 INFO L273 TraceCheckUtils]: 90: Hoare triple {25425#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25425#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:12,006 INFO L273 TraceCheckUtils]: 91: Hoare triple {25425#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25425#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:12,007 INFO L273 TraceCheckUtils]: 92: Hoare triple {25425#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {25426#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:12,007 INFO L273 TraceCheckUtils]: 93: Hoare triple {25426#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25426#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:12,008 INFO L273 TraceCheckUtils]: 94: Hoare triple {25426#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25426#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:12,008 INFO L273 TraceCheckUtils]: 95: Hoare triple {25426#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {25427#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:12,009 INFO L273 TraceCheckUtils]: 96: Hoare triple {25427#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25427#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:12,009 INFO L273 TraceCheckUtils]: 97: Hoare triple {25427#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25427#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:12,010 INFO L273 TraceCheckUtils]: 98: Hoare triple {25427#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {25428#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:12,011 INFO L273 TraceCheckUtils]: 99: Hoare triple {25428#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25428#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:12,011 INFO L273 TraceCheckUtils]: 100: Hoare triple {25428#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25428#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:12,012 INFO L273 TraceCheckUtils]: 101: Hoare triple {25428#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {25429#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:12,012 INFO L273 TraceCheckUtils]: 102: Hoare triple {25429#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25429#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:12,013 INFO L273 TraceCheckUtils]: 103: Hoare triple {25429#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25429#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:12,013 INFO L273 TraceCheckUtils]: 104: Hoare triple {25429#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {25430#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:12,014 INFO L273 TraceCheckUtils]: 105: Hoare triple {25430#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25430#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:12,014 INFO L273 TraceCheckUtils]: 106: Hoare triple {25430#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25430#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:12,015 INFO L273 TraceCheckUtils]: 107: Hoare triple {25430#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {25431#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:12,016 INFO L273 TraceCheckUtils]: 108: Hoare triple {25431#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25431#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:12,016 INFO L273 TraceCheckUtils]: 109: Hoare triple {25431#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25431#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:12,017 INFO L273 TraceCheckUtils]: 110: Hoare triple {25431#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {25432#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:12,017 INFO L273 TraceCheckUtils]: 111: Hoare triple {25432#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25432#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:12,018 INFO L273 TraceCheckUtils]: 112: Hoare triple {25432#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25432#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:12,019 INFO L273 TraceCheckUtils]: 113: Hoare triple {25432#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {25433#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:12,019 INFO L273 TraceCheckUtils]: 114: Hoare triple {25433#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25433#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:12,020 INFO L273 TraceCheckUtils]: 115: Hoare triple {25433#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25433#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:12,020 INFO L273 TraceCheckUtils]: 116: Hoare triple {25433#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {25434#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:12,021 INFO L273 TraceCheckUtils]: 117: Hoare triple {25434#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25434#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:12,021 INFO L273 TraceCheckUtils]: 118: Hoare triple {25434#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25434#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:12,022 INFO L273 TraceCheckUtils]: 119: Hoare triple {25434#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {25435#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:12,023 INFO L273 TraceCheckUtils]: 120: Hoare triple {25435#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25435#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:12,023 INFO L273 TraceCheckUtils]: 121: Hoare triple {25435#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25435#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:12,024 INFO L273 TraceCheckUtils]: 122: Hoare triple {25435#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {25436#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:12,024 INFO L273 TraceCheckUtils]: 123: Hoare triple {25436#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25436#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:12,025 INFO L273 TraceCheckUtils]: 124: Hoare triple {25436#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {25436#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:12,025 INFO L273 TraceCheckUtils]: 125: Hoare triple {25436#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {25437#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:12,026 INFO L273 TraceCheckUtils]: 126: Hoare triple {25437#(<= main_~i~0 40)} assume !(~i~0 < 100000); {25396#false} is VALID [2018-11-23 12:06:12,026 INFO L273 TraceCheckUtils]: 127: Hoare triple {25396#false} havoc ~x~0;~x~0 := 0; {25396#false} is VALID [2018-11-23 12:06:12,026 INFO L273 TraceCheckUtils]: 128: Hoare triple {25396#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {25396#false} is VALID [2018-11-23 12:06:12,027 INFO L256 TraceCheckUtils]: 129: Hoare triple {25396#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {25396#false} is VALID [2018-11-23 12:06:12,027 INFO L273 TraceCheckUtils]: 130: Hoare triple {25396#false} ~cond := #in~cond; {25396#false} is VALID [2018-11-23 12:06:12,027 INFO L273 TraceCheckUtils]: 131: Hoare triple {25396#false} assume 0 == ~cond; {25396#false} is VALID [2018-11-23 12:06:12,027 INFO L273 TraceCheckUtils]: 132: Hoare triple {25396#false} assume !false; {25396#false} is VALID [2018-11-23 12:06:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:12,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:12,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 12:06:12,058 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 133 [2018-11-23 12:06:12,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:12,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 12:06:12,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:12,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 12:06:12,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 12:06:12,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:06:12,193 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. Second operand 44 states. [2018-11-23 12:06:13,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:13,279 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2018-11-23 12:06:13,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:06:13,280 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 133 [2018-11-23 12:06:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:06:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 198 transitions. [2018-11-23 12:06:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:06:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 198 transitions. [2018-11-23 12:06:13,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 198 transitions. [2018-11-23 12:06:13,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:13,468 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:06:13,469 INFO L226 Difference]: Without dead ends: 143 [2018-11-23 12:06:13,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:06:13,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-23 12:06:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-11-23 12:06:13,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:13,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 141 states. [2018-11-23 12:06:13,509 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 141 states. [2018-11-23 12:06:13,509 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 141 states. [2018-11-23 12:06:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:13,511 INFO L93 Difference]: Finished difference Result 143 states and 186 transitions. [2018-11-23 12:06:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2018-11-23 12:06:13,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:13,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:13,512 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 143 states. [2018-11-23 12:06:13,512 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 143 states. [2018-11-23 12:06:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:13,514 INFO L93 Difference]: Finished difference Result 143 states and 186 transitions. [2018-11-23 12:06:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2018-11-23 12:06:13,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:13,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:13,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:13,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 12:06:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2018-11-23 12:06:13,517 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 133 [2018-11-23 12:06:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:13,517 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2018-11-23 12:06:13,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 12:06:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2018-11-23 12:06:13,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 12:06:13,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:13,518 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:13,519 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:13,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:13,519 INFO L82 PathProgramCache]: Analyzing trace with hash -2007146013, now seen corresponding path program 41 times [2018-11-23 12:06:13,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:13,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:13,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:13,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:13,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:14,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {26519#true} call ULTIMATE.init(); {26519#true} is VALID [2018-11-23 12:06:14,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {26519#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26519#true} is VALID [2018-11-23 12:06:14,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {26519#true} assume true; {26519#true} is VALID [2018-11-23 12:06:14,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26519#true} {26519#true} #55#return; {26519#true} is VALID [2018-11-23 12:06:14,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {26519#true} call #t~ret4 := main(); {26519#true} is VALID [2018-11-23 12:06:14,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {26519#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {26521#(= main_~i~0 0)} is VALID [2018-11-23 12:06:14,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {26521#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26521#(= main_~i~0 0)} is VALID [2018-11-23 12:06:14,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {26521#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26521#(= main_~i~0 0)} is VALID [2018-11-23 12:06:14,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {26521#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {26522#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:14,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {26522#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26522#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:14,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {26522#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26522#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:14,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {26522#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {26523#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:14,982 INFO L273 TraceCheckUtils]: 12: Hoare triple {26523#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26523#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:14,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {26523#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26523#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:14,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {26523#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {26524#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:14,983 INFO L273 TraceCheckUtils]: 15: Hoare triple {26524#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26524#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:14,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {26524#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26524#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:14,984 INFO L273 TraceCheckUtils]: 17: Hoare triple {26524#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {26525#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:14,985 INFO L273 TraceCheckUtils]: 18: Hoare triple {26525#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26525#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:14,985 INFO L273 TraceCheckUtils]: 19: Hoare triple {26525#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26525#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:14,986 INFO L273 TraceCheckUtils]: 20: Hoare triple {26525#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {26526#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:14,987 INFO L273 TraceCheckUtils]: 21: Hoare triple {26526#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26526#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:14,987 INFO L273 TraceCheckUtils]: 22: Hoare triple {26526#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26526#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:14,988 INFO L273 TraceCheckUtils]: 23: Hoare triple {26526#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {26527#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:14,988 INFO L273 TraceCheckUtils]: 24: Hoare triple {26527#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26527#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:14,989 INFO L273 TraceCheckUtils]: 25: Hoare triple {26527#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26527#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:14,990 INFO L273 TraceCheckUtils]: 26: Hoare triple {26527#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {26528#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:14,990 INFO L273 TraceCheckUtils]: 27: Hoare triple {26528#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26528#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:14,991 INFO L273 TraceCheckUtils]: 28: Hoare triple {26528#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26528#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:14,991 INFO L273 TraceCheckUtils]: 29: Hoare triple {26528#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {26529#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:14,992 INFO L273 TraceCheckUtils]: 30: Hoare triple {26529#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26529#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:14,992 INFO L273 TraceCheckUtils]: 31: Hoare triple {26529#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26529#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:14,993 INFO L273 TraceCheckUtils]: 32: Hoare triple {26529#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {26530#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:14,994 INFO L273 TraceCheckUtils]: 33: Hoare triple {26530#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26530#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:14,994 INFO L273 TraceCheckUtils]: 34: Hoare triple {26530#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26530#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:14,995 INFO L273 TraceCheckUtils]: 35: Hoare triple {26530#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {26531#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:14,995 INFO L273 TraceCheckUtils]: 36: Hoare triple {26531#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26531#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:14,996 INFO L273 TraceCheckUtils]: 37: Hoare triple {26531#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26531#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:14,996 INFO L273 TraceCheckUtils]: 38: Hoare triple {26531#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {26532#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:14,997 INFO L273 TraceCheckUtils]: 39: Hoare triple {26532#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26532#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:14,997 INFO L273 TraceCheckUtils]: 40: Hoare triple {26532#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26532#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:14,998 INFO L273 TraceCheckUtils]: 41: Hoare triple {26532#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {26533#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:14,999 INFO L273 TraceCheckUtils]: 42: Hoare triple {26533#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26533#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:14,999 INFO L273 TraceCheckUtils]: 43: Hoare triple {26533#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26533#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:15,000 INFO L273 TraceCheckUtils]: 44: Hoare triple {26533#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {26534#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,000 INFO L273 TraceCheckUtils]: 45: Hoare triple {26534#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26534#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,001 INFO L273 TraceCheckUtils]: 46: Hoare triple {26534#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26534#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,002 INFO L273 TraceCheckUtils]: 47: Hoare triple {26534#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {26535#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,002 INFO L273 TraceCheckUtils]: 48: Hoare triple {26535#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26535#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,003 INFO L273 TraceCheckUtils]: 49: Hoare triple {26535#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26535#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,003 INFO L273 TraceCheckUtils]: 50: Hoare triple {26535#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {26536#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,004 INFO L273 TraceCheckUtils]: 51: Hoare triple {26536#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26536#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,004 INFO L273 TraceCheckUtils]: 52: Hoare triple {26536#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26536#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,005 INFO L273 TraceCheckUtils]: 53: Hoare triple {26536#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {26537#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,005 INFO L273 TraceCheckUtils]: 54: Hoare triple {26537#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26537#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,006 INFO L273 TraceCheckUtils]: 55: Hoare triple {26537#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26537#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,007 INFO L273 TraceCheckUtils]: 56: Hoare triple {26537#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {26538#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,007 INFO L273 TraceCheckUtils]: 57: Hoare triple {26538#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26538#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,008 INFO L273 TraceCheckUtils]: 58: Hoare triple {26538#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26538#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,008 INFO L273 TraceCheckUtils]: 59: Hoare triple {26538#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {26539#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,009 INFO L273 TraceCheckUtils]: 60: Hoare triple {26539#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26539#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,009 INFO L273 TraceCheckUtils]: 61: Hoare triple {26539#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26539#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,010 INFO L273 TraceCheckUtils]: 62: Hoare triple {26539#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {26540#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,011 INFO L273 TraceCheckUtils]: 63: Hoare triple {26540#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26540#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,011 INFO L273 TraceCheckUtils]: 64: Hoare triple {26540#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26540#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,012 INFO L273 TraceCheckUtils]: 65: Hoare triple {26540#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {26541#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,012 INFO L273 TraceCheckUtils]: 66: Hoare triple {26541#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26541#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,013 INFO L273 TraceCheckUtils]: 67: Hoare triple {26541#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26541#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,013 INFO L273 TraceCheckUtils]: 68: Hoare triple {26541#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {26542#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,014 INFO L273 TraceCheckUtils]: 69: Hoare triple {26542#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26542#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,014 INFO L273 TraceCheckUtils]: 70: Hoare triple {26542#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26542#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,015 INFO L273 TraceCheckUtils]: 71: Hoare triple {26542#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {26543#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,016 INFO L273 TraceCheckUtils]: 72: Hoare triple {26543#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26543#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,016 INFO L273 TraceCheckUtils]: 73: Hoare triple {26543#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26543#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,017 INFO L273 TraceCheckUtils]: 74: Hoare triple {26543#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {26544#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,017 INFO L273 TraceCheckUtils]: 75: Hoare triple {26544#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26544#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,018 INFO L273 TraceCheckUtils]: 76: Hoare triple {26544#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26544#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,019 INFO L273 TraceCheckUtils]: 77: Hoare triple {26544#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {26545#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,019 INFO L273 TraceCheckUtils]: 78: Hoare triple {26545#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26545#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,020 INFO L273 TraceCheckUtils]: 79: Hoare triple {26545#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26545#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,020 INFO L273 TraceCheckUtils]: 80: Hoare triple {26545#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {26546#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,021 INFO L273 TraceCheckUtils]: 81: Hoare triple {26546#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26546#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,021 INFO L273 TraceCheckUtils]: 82: Hoare triple {26546#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26546#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,022 INFO L273 TraceCheckUtils]: 83: Hoare triple {26546#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {26547#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:15,022 INFO L273 TraceCheckUtils]: 84: Hoare triple {26547#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26547#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:15,023 INFO L273 TraceCheckUtils]: 85: Hoare triple {26547#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26547#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:15,024 INFO L273 TraceCheckUtils]: 86: Hoare triple {26547#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {26548#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:15,024 INFO L273 TraceCheckUtils]: 87: Hoare triple {26548#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26548#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:15,025 INFO L273 TraceCheckUtils]: 88: Hoare triple {26548#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26548#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:15,025 INFO L273 TraceCheckUtils]: 89: Hoare triple {26548#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {26549#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:15,026 INFO L273 TraceCheckUtils]: 90: Hoare triple {26549#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26549#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:15,026 INFO L273 TraceCheckUtils]: 91: Hoare triple {26549#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26549#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:15,027 INFO L273 TraceCheckUtils]: 92: Hoare triple {26549#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {26550#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:15,028 INFO L273 TraceCheckUtils]: 93: Hoare triple {26550#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26550#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:15,028 INFO L273 TraceCheckUtils]: 94: Hoare triple {26550#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26550#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:15,029 INFO L273 TraceCheckUtils]: 95: Hoare triple {26550#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {26551#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:15,029 INFO L273 TraceCheckUtils]: 96: Hoare triple {26551#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26551#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:15,030 INFO L273 TraceCheckUtils]: 97: Hoare triple {26551#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26551#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:15,030 INFO L273 TraceCheckUtils]: 98: Hoare triple {26551#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {26552#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:15,031 INFO L273 TraceCheckUtils]: 99: Hoare triple {26552#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26552#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:15,031 INFO L273 TraceCheckUtils]: 100: Hoare triple {26552#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26552#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:15,032 INFO L273 TraceCheckUtils]: 101: Hoare triple {26552#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {26553#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:15,033 INFO L273 TraceCheckUtils]: 102: Hoare triple {26553#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26553#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:15,033 INFO L273 TraceCheckUtils]: 103: Hoare triple {26553#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26553#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:15,034 INFO L273 TraceCheckUtils]: 104: Hoare triple {26553#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {26554#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:15,034 INFO L273 TraceCheckUtils]: 105: Hoare triple {26554#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26554#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:15,035 INFO L273 TraceCheckUtils]: 106: Hoare triple {26554#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26554#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:15,036 INFO L273 TraceCheckUtils]: 107: Hoare triple {26554#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {26555#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:15,036 INFO L273 TraceCheckUtils]: 108: Hoare triple {26555#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26555#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:15,037 INFO L273 TraceCheckUtils]: 109: Hoare triple {26555#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26555#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:15,037 INFO L273 TraceCheckUtils]: 110: Hoare triple {26555#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {26556#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:15,038 INFO L273 TraceCheckUtils]: 111: Hoare triple {26556#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26556#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:15,038 INFO L273 TraceCheckUtils]: 112: Hoare triple {26556#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26556#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:15,039 INFO L273 TraceCheckUtils]: 113: Hoare triple {26556#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {26557#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:15,040 INFO L273 TraceCheckUtils]: 114: Hoare triple {26557#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26557#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:15,040 INFO L273 TraceCheckUtils]: 115: Hoare triple {26557#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26557#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:15,041 INFO L273 TraceCheckUtils]: 116: Hoare triple {26557#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {26558#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:15,041 INFO L273 TraceCheckUtils]: 117: Hoare triple {26558#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26558#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:15,042 INFO L273 TraceCheckUtils]: 118: Hoare triple {26558#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26558#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:15,042 INFO L273 TraceCheckUtils]: 119: Hoare triple {26558#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {26559#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:15,043 INFO L273 TraceCheckUtils]: 120: Hoare triple {26559#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26559#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:15,044 INFO L273 TraceCheckUtils]: 121: Hoare triple {26559#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26559#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:15,044 INFO L273 TraceCheckUtils]: 122: Hoare triple {26559#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {26560#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:15,045 INFO L273 TraceCheckUtils]: 123: Hoare triple {26560#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26560#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:15,045 INFO L273 TraceCheckUtils]: 124: Hoare triple {26560#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26560#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:15,046 INFO L273 TraceCheckUtils]: 125: Hoare triple {26560#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {26561#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:15,046 INFO L273 TraceCheckUtils]: 126: Hoare triple {26561#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26561#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:15,047 INFO L273 TraceCheckUtils]: 127: Hoare triple {26561#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26561#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:15,048 INFO L273 TraceCheckUtils]: 128: Hoare triple {26561#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {26562#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:15,048 INFO L273 TraceCheckUtils]: 129: Hoare triple {26562#(<= main_~i~0 41)} assume !(~i~0 < 100000); {26520#false} is VALID [2018-11-23 12:06:15,049 INFO L273 TraceCheckUtils]: 130: Hoare triple {26520#false} havoc ~x~0;~x~0 := 0; {26520#false} is VALID [2018-11-23 12:06:15,049 INFO L273 TraceCheckUtils]: 131: Hoare triple {26520#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {26520#false} is VALID [2018-11-23 12:06:15,049 INFO L256 TraceCheckUtils]: 132: Hoare triple {26520#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {26520#false} is VALID [2018-11-23 12:06:15,049 INFO L273 TraceCheckUtils]: 133: Hoare triple {26520#false} ~cond := #in~cond; {26520#false} is VALID [2018-11-23 12:06:15,049 INFO L273 TraceCheckUtils]: 134: Hoare triple {26520#false} assume 0 == ~cond; {26520#false} is VALID [2018-11-23 12:06:15,049 INFO L273 TraceCheckUtils]: 135: Hoare triple {26520#false} assume !false; {26520#false} is VALID [2018-11-23 12:06:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:15,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:15,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:15,069 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:15,162 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-11-23 12:06:15,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:15,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:15,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {26519#true} call ULTIMATE.init(); {26519#true} is VALID [2018-11-23 12:06:15,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {26519#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26519#true} is VALID [2018-11-23 12:06:15,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {26519#true} assume true; {26519#true} is VALID [2018-11-23 12:06:15,484 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26519#true} {26519#true} #55#return; {26519#true} is VALID [2018-11-23 12:06:15,484 INFO L256 TraceCheckUtils]: 4: Hoare triple {26519#true} call #t~ret4 := main(); {26519#true} is VALID [2018-11-23 12:06:15,485 INFO L273 TraceCheckUtils]: 5: Hoare triple {26519#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {26581#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:15,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {26581#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26581#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:15,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {26581#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26581#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:15,487 INFO L273 TraceCheckUtils]: 8: Hoare triple {26581#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {26522#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:15,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {26522#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26522#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:15,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {26522#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26522#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:15,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {26522#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {26523#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:15,488 INFO L273 TraceCheckUtils]: 12: Hoare triple {26523#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26523#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:15,489 INFO L273 TraceCheckUtils]: 13: Hoare triple {26523#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26523#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:15,489 INFO L273 TraceCheckUtils]: 14: Hoare triple {26523#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {26524#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:15,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {26524#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26524#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:15,490 INFO L273 TraceCheckUtils]: 16: Hoare triple {26524#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26524#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:15,491 INFO L273 TraceCheckUtils]: 17: Hoare triple {26524#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {26525#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:15,491 INFO L273 TraceCheckUtils]: 18: Hoare triple {26525#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26525#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:15,492 INFO L273 TraceCheckUtils]: 19: Hoare triple {26525#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26525#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:15,492 INFO L273 TraceCheckUtils]: 20: Hoare triple {26525#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {26526#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:15,493 INFO L273 TraceCheckUtils]: 21: Hoare triple {26526#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26526#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:15,493 INFO L273 TraceCheckUtils]: 22: Hoare triple {26526#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26526#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:15,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {26526#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {26527#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:15,494 INFO L273 TraceCheckUtils]: 24: Hoare triple {26527#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26527#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:15,495 INFO L273 TraceCheckUtils]: 25: Hoare triple {26527#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26527#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:15,496 INFO L273 TraceCheckUtils]: 26: Hoare triple {26527#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {26528#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:15,496 INFO L273 TraceCheckUtils]: 27: Hoare triple {26528#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26528#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:15,497 INFO L273 TraceCheckUtils]: 28: Hoare triple {26528#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26528#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:15,497 INFO L273 TraceCheckUtils]: 29: Hoare triple {26528#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {26529#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:15,498 INFO L273 TraceCheckUtils]: 30: Hoare triple {26529#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26529#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:15,498 INFO L273 TraceCheckUtils]: 31: Hoare triple {26529#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26529#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:15,499 INFO L273 TraceCheckUtils]: 32: Hoare triple {26529#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {26530#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:15,500 INFO L273 TraceCheckUtils]: 33: Hoare triple {26530#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26530#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:15,500 INFO L273 TraceCheckUtils]: 34: Hoare triple {26530#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26530#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:15,501 INFO L273 TraceCheckUtils]: 35: Hoare triple {26530#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {26531#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:15,501 INFO L273 TraceCheckUtils]: 36: Hoare triple {26531#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26531#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:15,502 INFO L273 TraceCheckUtils]: 37: Hoare triple {26531#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26531#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:15,502 INFO L273 TraceCheckUtils]: 38: Hoare triple {26531#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {26532#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:15,503 INFO L273 TraceCheckUtils]: 39: Hoare triple {26532#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26532#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:15,503 INFO L273 TraceCheckUtils]: 40: Hoare triple {26532#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26532#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:15,504 INFO L273 TraceCheckUtils]: 41: Hoare triple {26532#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {26533#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:15,505 INFO L273 TraceCheckUtils]: 42: Hoare triple {26533#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26533#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:15,505 INFO L273 TraceCheckUtils]: 43: Hoare triple {26533#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26533#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:15,506 INFO L273 TraceCheckUtils]: 44: Hoare triple {26533#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {26534#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,506 INFO L273 TraceCheckUtils]: 45: Hoare triple {26534#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26534#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,507 INFO L273 TraceCheckUtils]: 46: Hoare triple {26534#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26534#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,508 INFO L273 TraceCheckUtils]: 47: Hoare triple {26534#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {26535#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,508 INFO L273 TraceCheckUtils]: 48: Hoare triple {26535#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26535#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,509 INFO L273 TraceCheckUtils]: 49: Hoare triple {26535#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26535#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,509 INFO L273 TraceCheckUtils]: 50: Hoare triple {26535#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {26536#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,510 INFO L273 TraceCheckUtils]: 51: Hoare triple {26536#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26536#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,510 INFO L273 TraceCheckUtils]: 52: Hoare triple {26536#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26536#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,511 INFO L273 TraceCheckUtils]: 53: Hoare triple {26536#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {26537#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,512 INFO L273 TraceCheckUtils]: 54: Hoare triple {26537#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26537#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,512 INFO L273 TraceCheckUtils]: 55: Hoare triple {26537#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26537#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,513 INFO L273 TraceCheckUtils]: 56: Hoare triple {26537#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {26538#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,513 INFO L273 TraceCheckUtils]: 57: Hoare triple {26538#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26538#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,514 INFO L273 TraceCheckUtils]: 58: Hoare triple {26538#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26538#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,514 INFO L273 TraceCheckUtils]: 59: Hoare triple {26538#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {26539#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,515 INFO L273 TraceCheckUtils]: 60: Hoare triple {26539#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26539#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,515 INFO L273 TraceCheckUtils]: 61: Hoare triple {26539#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26539#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,516 INFO L273 TraceCheckUtils]: 62: Hoare triple {26539#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {26540#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,517 INFO L273 TraceCheckUtils]: 63: Hoare triple {26540#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26540#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,517 INFO L273 TraceCheckUtils]: 64: Hoare triple {26540#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26540#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,518 INFO L273 TraceCheckUtils]: 65: Hoare triple {26540#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {26541#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,518 INFO L273 TraceCheckUtils]: 66: Hoare triple {26541#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26541#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,519 INFO L273 TraceCheckUtils]: 67: Hoare triple {26541#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26541#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,520 INFO L273 TraceCheckUtils]: 68: Hoare triple {26541#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {26542#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,520 INFO L273 TraceCheckUtils]: 69: Hoare triple {26542#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26542#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,521 INFO L273 TraceCheckUtils]: 70: Hoare triple {26542#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26542#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,521 INFO L273 TraceCheckUtils]: 71: Hoare triple {26542#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {26543#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,522 INFO L273 TraceCheckUtils]: 72: Hoare triple {26543#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26543#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,522 INFO L273 TraceCheckUtils]: 73: Hoare triple {26543#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26543#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,523 INFO L273 TraceCheckUtils]: 74: Hoare triple {26543#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {26544#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,523 INFO L273 TraceCheckUtils]: 75: Hoare triple {26544#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26544#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,524 INFO L273 TraceCheckUtils]: 76: Hoare triple {26544#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26544#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,525 INFO L273 TraceCheckUtils]: 77: Hoare triple {26544#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {26545#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,525 INFO L273 TraceCheckUtils]: 78: Hoare triple {26545#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26545#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,526 INFO L273 TraceCheckUtils]: 79: Hoare triple {26545#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26545#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,526 INFO L273 TraceCheckUtils]: 80: Hoare triple {26545#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {26546#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,527 INFO L273 TraceCheckUtils]: 81: Hoare triple {26546#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26546#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,527 INFO L273 TraceCheckUtils]: 82: Hoare triple {26546#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26546#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,528 INFO L273 TraceCheckUtils]: 83: Hoare triple {26546#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {26547#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:15,529 INFO L273 TraceCheckUtils]: 84: Hoare triple {26547#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26547#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:15,529 INFO L273 TraceCheckUtils]: 85: Hoare triple {26547#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26547#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:15,530 INFO L273 TraceCheckUtils]: 86: Hoare triple {26547#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {26548#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:15,530 INFO L273 TraceCheckUtils]: 87: Hoare triple {26548#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26548#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:15,531 INFO L273 TraceCheckUtils]: 88: Hoare triple {26548#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26548#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:15,531 INFO L273 TraceCheckUtils]: 89: Hoare triple {26548#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {26549#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:15,532 INFO L273 TraceCheckUtils]: 90: Hoare triple {26549#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26549#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:15,532 INFO L273 TraceCheckUtils]: 91: Hoare triple {26549#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26549#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:15,533 INFO L273 TraceCheckUtils]: 92: Hoare triple {26549#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {26550#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:15,534 INFO L273 TraceCheckUtils]: 93: Hoare triple {26550#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26550#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:15,534 INFO L273 TraceCheckUtils]: 94: Hoare triple {26550#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26550#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:15,535 INFO L273 TraceCheckUtils]: 95: Hoare triple {26550#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {26551#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:15,535 INFO L273 TraceCheckUtils]: 96: Hoare triple {26551#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26551#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:15,536 INFO L273 TraceCheckUtils]: 97: Hoare triple {26551#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26551#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:15,537 INFO L273 TraceCheckUtils]: 98: Hoare triple {26551#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {26552#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:15,537 INFO L273 TraceCheckUtils]: 99: Hoare triple {26552#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26552#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:15,538 INFO L273 TraceCheckUtils]: 100: Hoare triple {26552#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26552#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:15,538 INFO L273 TraceCheckUtils]: 101: Hoare triple {26552#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {26553#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:15,539 INFO L273 TraceCheckUtils]: 102: Hoare triple {26553#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26553#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:15,548 INFO L273 TraceCheckUtils]: 103: Hoare triple {26553#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26553#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:15,548 INFO L273 TraceCheckUtils]: 104: Hoare triple {26553#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {26554#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:15,548 INFO L273 TraceCheckUtils]: 105: Hoare triple {26554#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26554#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:15,549 INFO L273 TraceCheckUtils]: 106: Hoare triple {26554#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26554#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:15,549 INFO L273 TraceCheckUtils]: 107: Hoare triple {26554#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {26555#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:15,549 INFO L273 TraceCheckUtils]: 108: Hoare triple {26555#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26555#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:15,550 INFO L273 TraceCheckUtils]: 109: Hoare triple {26555#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26555#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:15,550 INFO L273 TraceCheckUtils]: 110: Hoare triple {26555#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {26556#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:15,550 INFO L273 TraceCheckUtils]: 111: Hoare triple {26556#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26556#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:15,551 INFO L273 TraceCheckUtils]: 112: Hoare triple {26556#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26556#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:15,551 INFO L273 TraceCheckUtils]: 113: Hoare triple {26556#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {26557#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:15,552 INFO L273 TraceCheckUtils]: 114: Hoare triple {26557#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26557#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:15,552 INFO L273 TraceCheckUtils]: 115: Hoare triple {26557#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26557#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:15,553 INFO L273 TraceCheckUtils]: 116: Hoare triple {26557#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {26558#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:15,553 INFO L273 TraceCheckUtils]: 117: Hoare triple {26558#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26558#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:15,554 INFO L273 TraceCheckUtils]: 118: Hoare triple {26558#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26558#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:15,555 INFO L273 TraceCheckUtils]: 119: Hoare triple {26558#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {26559#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:15,555 INFO L273 TraceCheckUtils]: 120: Hoare triple {26559#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26559#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:15,556 INFO L273 TraceCheckUtils]: 121: Hoare triple {26559#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26559#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:15,556 INFO L273 TraceCheckUtils]: 122: Hoare triple {26559#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {26560#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:15,557 INFO L273 TraceCheckUtils]: 123: Hoare triple {26560#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26560#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:15,557 INFO L273 TraceCheckUtils]: 124: Hoare triple {26560#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26560#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:15,558 INFO L273 TraceCheckUtils]: 125: Hoare triple {26560#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {26561#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:15,559 INFO L273 TraceCheckUtils]: 126: Hoare triple {26561#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26561#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:15,559 INFO L273 TraceCheckUtils]: 127: Hoare triple {26561#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {26561#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:15,560 INFO L273 TraceCheckUtils]: 128: Hoare triple {26561#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {26562#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:15,560 INFO L273 TraceCheckUtils]: 129: Hoare triple {26562#(<= main_~i~0 41)} assume !(~i~0 < 100000); {26520#false} is VALID [2018-11-23 12:06:15,561 INFO L273 TraceCheckUtils]: 130: Hoare triple {26520#false} havoc ~x~0;~x~0 := 0; {26520#false} is VALID [2018-11-23 12:06:15,561 INFO L273 TraceCheckUtils]: 131: Hoare triple {26520#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {26520#false} is VALID [2018-11-23 12:06:15,561 INFO L256 TraceCheckUtils]: 132: Hoare triple {26520#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {26520#false} is VALID [2018-11-23 12:06:15,561 INFO L273 TraceCheckUtils]: 133: Hoare triple {26520#false} ~cond := #in~cond; {26520#false} is VALID [2018-11-23 12:06:15,561 INFO L273 TraceCheckUtils]: 134: Hoare triple {26520#false} assume 0 == ~cond; {26520#false} is VALID [2018-11-23 12:06:15,561 INFO L273 TraceCheckUtils]: 135: Hoare triple {26520#false} assume !false; {26520#false} is VALID [2018-11-23 12:06:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:15,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:15,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-11-23 12:06:15,593 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 136 [2018-11-23 12:06:15,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:15,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 12:06:15,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:15,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 12:06:15,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 12:06:15,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:06:15,751 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand 45 states. [2018-11-23 12:06:16,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:16,254 INFO L93 Difference]: Finished difference Result 157 states and 202 transitions. [2018-11-23 12:06:16,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 12:06:16,254 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 136 [2018-11-23 12:06:16,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:06:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 202 transitions. [2018-11-23 12:06:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:06:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 202 transitions. [2018-11-23 12:06:16,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 202 transitions. [2018-11-23 12:06:16,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:16,461 INFO L225 Difference]: With dead ends: 157 [2018-11-23 12:06:16,461 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:06:16,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:06:16,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:06:16,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-11-23 12:06:16,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:16,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 144 states. [2018-11-23 12:06:16,492 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 144 states. [2018-11-23 12:06:16,492 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 144 states. [2018-11-23 12:06:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:16,495 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2018-11-23 12:06:16,495 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-11-23 12:06:16,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:16,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:16,495 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 146 states. [2018-11-23 12:06:16,495 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 146 states. [2018-11-23 12:06:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:16,497 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2018-11-23 12:06:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-11-23 12:06:16,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:16,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:16,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:16,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 12:06:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2018-11-23 12:06:16,500 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 136 [2018-11-23 12:06:16,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:16,500 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2018-11-23 12:06:16,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 12:06:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2018-11-23 12:06:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 12:06:16,501 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:16,501 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:16,501 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:16,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:16,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1306812551, now seen corresponding path program 42 times [2018-11-23 12:06:16,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:16,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:16,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:16,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:16,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:17,576 INFO L256 TraceCheckUtils]: 0: Hoare triple {27667#true} call ULTIMATE.init(); {27667#true} is VALID [2018-11-23 12:06:17,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {27667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27667#true} is VALID [2018-11-23 12:06:17,577 INFO L273 TraceCheckUtils]: 2: Hoare triple {27667#true} assume true; {27667#true} is VALID [2018-11-23 12:06:17,577 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27667#true} {27667#true} #55#return; {27667#true} is VALID [2018-11-23 12:06:17,577 INFO L256 TraceCheckUtils]: 4: Hoare triple {27667#true} call #t~ret4 := main(); {27667#true} is VALID [2018-11-23 12:06:17,577 INFO L273 TraceCheckUtils]: 5: Hoare triple {27667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {27669#(= main_~i~0 0)} is VALID [2018-11-23 12:06:17,578 INFO L273 TraceCheckUtils]: 6: Hoare triple {27669#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27669#(= main_~i~0 0)} is VALID [2018-11-23 12:06:17,578 INFO L273 TraceCheckUtils]: 7: Hoare triple {27669#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27669#(= main_~i~0 0)} is VALID [2018-11-23 12:06:17,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {27669#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {27670#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:17,579 INFO L273 TraceCheckUtils]: 9: Hoare triple {27670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27670#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:17,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {27670#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27670#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:17,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {27670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {27671#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:17,580 INFO L273 TraceCheckUtils]: 12: Hoare triple {27671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27671#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:17,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {27671#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27671#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:17,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {27671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {27672#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:17,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {27672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27672#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:17,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {27672#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27672#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:17,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {27672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {27673#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:17,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {27673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27673#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:17,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {27673#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27673#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:17,585 INFO L273 TraceCheckUtils]: 20: Hoare triple {27673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {27674#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:17,585 INFO L273 TraceCheckUtils]: 21: Hoare triple {27674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27674#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:17,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {27674#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27674#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:17,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {27674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {27675#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:17,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {27675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27675#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:17,588 INFO L273 TraceCheckUtils]: 25: Hoare triple {27675#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27675#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:17,588 INFO L273 TraceCheckUtils]: 26: Hoare triple {27675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {27676#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:17,589 INFO L273 TraceCheckUtils]: 27: Hoare triple {27676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27676#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:17,589 INFO L273 TraceCheckUtils]: 28: Hoare triple {27676#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27676#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:17,590 INFO L273 TraceCheckUtils]: 29: Hoare triple {27676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {27677#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:17,591 INFO L273 TraceCheckUtils]: 30: Hoare triple {27677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27677#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:17,591 INFO L273 TraceCheckUtils]: 31: Hoare triple {27677#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27677#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:17,592 INFO L273 TraceCheckUtils]: 32: Hoare triple {27677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {27678#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:17,592 INFO L273 TraceCheckUtils]: 33: Hoare triple {27678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27678#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:17,593 INFO L273 TraceCheckUtils]: 34: Hoare triple {27678#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27678#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:17,593 INFO L273 TraceCheckUtils]: 35: Hoare triple {27678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {27679#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:17,594 INFO L273 TraceCheckUtils]: 36: Hoare triple {27679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27679#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:17,594 INFO L273 TraceCheckUtils]: 37: Hoare triple {27679#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27679#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:17,595 INFO L273 TraceCheckUtils]: 38: Hoare triple {27679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {27680#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:17,596 INFO L273 TraceCheckUtils]: 39: Hoare triple {27680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27680#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:17,596 INFO L273 TraceCheckUtils]: 40: Hoare triple {27680#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27680#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:17,597 INFO L273 TraceCheckUtils]: 41: Hoare triple {27680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {27681#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:17,597 INFO L273 TraceCheckUtils]: 42: Hoare triple {27681#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27681#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:17,598 INFO L273 TraceCheckUtils]: 43: Hoare triple {27681#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27681#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:17,599 INFO L273 TraceCheckUtils]: 44: Hoare triple {27681#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {27682#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:17,599 INFO L273 TraceCheckUtils]: 45: Hoare triple {27682#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27682#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:17,600 INFO L273 TraceCheckUtils]: 46: Hoare triple {27682#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27682#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:17,600 INFO L273 TraceCheckUtils]: 47: Hoare triple {27682#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {27683#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:17,601 INFO L273 TraceCheckUtils]: 48: Hoare triple {27683#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27683#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:17,601 INFO L273 TraceCheckUtils]: 49: Hoare triple {27683#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27683#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:17,602 INFO L273 TraceCheckUtils]: 50: Hoare triple {27683#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {27684#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:17,602 INFO L273 TraceCheckUtils]: 51: Hoare triple {27684#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27684#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:17,603 INFO L273 TraceCheckUtils]: 52: Hoare triple {27684#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27684#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:17,604 INFO L273 TraceCheckUtils]: 53: Hoare triple {27684#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {27685#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:17,604 INFO L273 TraceCheckUtils]: 54: Hoare triple {27685#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27685#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:17,605 INFO L273 TraceCheckUtils]: 55: Hoare triple {27685#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27685#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:17,605 INFO L273 TraceCheckUtils]: 56: Hoare triple {27685#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {27686#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:17,606 INFO L273 TraceCheckUtils]: 57: Hoare triple {27686#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27686#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:17,606 INFO L273 TraceCheckUtils]: 58: Hoare triple {27686#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27686#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:17,607 INFO L273 TraceCheckUtils]: 59: Hoare triple {27686#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {27687#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:17,608 INFO L273 TraceCheckUtils]: 60: Hoare triple {27687#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27687#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:17,608 INFO L273 TraceCheckUtils]: 61: Hoare triple {27687#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27687#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:17,609 INFO L273 TraceCheckUtils]: 62: Hoare triple {27687#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {27688#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:17,609 INFO L273 TraceCheckUtils]: 63: Hoare triple {27688#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27688#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:17,610 INFO L273 TraceCheckUtils]: 64: Hoare triple {27688#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27688#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:17,611 INFO L273 TraceCheckUtils]: 65: Hoare triple {27688#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {27689#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:17,611 INFO L273 TraceCheckUtils]: 66: Hoare triple {27689#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27689#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:17,612 INFO L273 TraceCheckUtils]: 67: Hoare triple {27689#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27689#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:17,612 INFO L273 TraceCheckUtils]: 68: Hoare triple {27689#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {27690#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:17,613 INFO L273 TraceCheckUtils]: 69: Hoare triple {27690#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27690#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:17,613 INFO L273 TraceCheckUtils]: 70: Hoare triple {27690#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27690#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:17,614 INFO L273 TraceCheckUtils]: 71: Hoare triple {27690#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {27691#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:17,614 INFO L273 TraceCheckUtils]: 72: Hoare triple {27691#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27691#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:17,615 INFO L273 TraceCheckUtils]: 73: Hoare triple {27691#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27691#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:17,616 INFO L273 TraceCheckUtils]: 74: Hoare triple {27691#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {27692#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:17,616 INFO L273 TraceCheckUtils]: 75: Hoare triple {27692#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27692#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:17,617 INFO L273 TraceCheckUtils]: 76: Hoare triple {27692#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27692#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:17,617 INFO L273 TraceCheckUtils]: 77: Hoare triple {27692#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {27693#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:17,618 INFO L273 TraceCheckUtils]: 78: Hoare triple {27693#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27693#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:17,618 INFO L273 TraceCheckUtils]: 79: Hoare triple {27693#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27693#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:17,619 INFO L273 TraceCheckUtils]: 80: Hoare triple {27693#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {27694#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:17,620 INFO L273 TraceCheckUtils]: 81: Hoare triple {27694#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27694#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:17,620 INFO L273 TraceCheckUtils]: 82: Hoare triple {27694#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27694#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:17,621 INFO L273 TraceCheckUtils]: 83: Hoare triple {27694#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {27695#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:17,621 INFO L273 TraceCheckUtils]: 84: Hoare triple {27695#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27695#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:17,622 INFO L273 TraceCheckUtils]: 85: Hoare triple {27695#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27695#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:17,622 INFO L273 TraceCheckUtils]: 86: Hoare triple {27695#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {27696#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:17,623 INFO L273 TraceCheckUtils]: 87: Hoare triple {27696#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27696#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:17,623 INFO L273 TraceCheckUtils]: 88: Hoare triple {27696#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27696#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:17,624 INFO L273 TraceCheckUtils]: 89: Hoare triple {27696#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {27697#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:17,625 INFO L273 TraceCheckUtils]: 90: Hoare triple {27697#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27697#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:17,625 INFO L273 TraceCheckUtils]: 91: Hoare triple {27697#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27697#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:17,626 INFO L273 TraceCheckUtils]: 92: Hoare triple {27697#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {27698#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:17,626 INFO L273 TraceCheckUtils]: 93: Hoare triple {27698#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27698#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:17,627 INFO L273 TraceCheckUtils]: 94: Hoare triple {27698#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27698#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:17,628 INFO L273 TraceCheckUtils]: 95: Hoare triple {27698#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {27699#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:17,628 INFO L273 TraceCheckUtils]: 96: Hoare triple {27699#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27699#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:17,629 INFO L273 TraceCheckUtils]: 97: Hoare triple {27699#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27699#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:17,629 INFO L273 TraceCheckUtils]: 98: Hoare triple {27699#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {27700#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:17,630 INFO L273 TraceCheckUtils]: 99: Hoare triple {27700#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27700#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:17,630 INFO L273 TraceCheckUtils]: 100: Hoare triple {27700#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27700#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:17,631 INFO L273 TraceCheckUtils]: 101: Hoare triple {27700#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {27701#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:17,632 INFO L273 TraceCheckUtils]: 102: Hoare triple {27701#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27701#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:17,632 INFO L273 TraceCheckUtils]: 103: Hoare triple {27701#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27701#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:17,633 INFO L273 TraceCheckUtils]: 104: Hoare triple {27701#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {27702#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:17,633 INFO L273 TraceCheckUtils]: 105: Hoare triple {27702#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27702#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:17,634 INFO L273 TraceCheckUtils]: 106: Hoare triple {27702#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27702#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:17,634 INFO L273 TraceCheckUtils]: 107: Hoare triple {27702#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {27703#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:17,635 INFO L273 TraceCheckUtils]: 108: Hoare triple {27703#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27703#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:17,635 INFO L273 TraceCheckUtils]: 109: Hoare triple {27703#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27703#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:17,636 INFO L273 TraceCheckUtils]: 110: Hoare triple {27703#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {27704#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:17,637 INFO L273 TraceCheckUtils]: 111: Hoare triple {27704#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27704#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:17,637 INFO L273 TraceCheckUtils]: 112: Hoare triple {27704#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27704#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:17,638 INFO L273 TraceCheckUtils]: 113: Hoare triple {27704#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {27705#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:17,638 INFO L273 TraceCheckUtils]: 114: Hoare triple {27705#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27705#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:17,639 INFO L273 TraceCheckUtils]: 115: Hoare triple {27705#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27705#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:17,640 INFO L273 TraceCheckUtils]: 116: Hoare triple {27705#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {27706#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:17,640 INFO L273 TraceCheckUtils]: 117: Hoare triple {27706#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27706#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:17,641 INFO L273 TraceCheckUtils]: 118: Hoare triple {27706#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27706#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:17,641 INFO L273 TraceCheckUtils]: 119: Hoare triple {27706#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {27707#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:17,642 INFO L273 TraceCheckUtils]: 120: Hoare triple {27707#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27707#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:17,642 INFO L273 TraceCheckUtils]: 121: Hoare triple {27707#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27707#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:17,643 INFO L273 TraceCheckUtils]: 122: Hoare triple {27707#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {27708#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:17,643 INFO L273 TraceCheckUtils]: 123: Hoare triple {27708#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27708#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:17,644 INFO L273 TraceCheckUtils]: 124: Hoare triple {27708#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27708#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:17,645 INFO L273 TraceCheckUtils]: 125: Hoare triple {27708#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {27709#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:17,645 INFO L273 TraceCheckUtils]: 126: Hoare triple {27709#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27709#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:17,646 INFO L273 TraceCheckUtils]: 127: Hoare triple {27709#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27709#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:17,646 INFO L273 TraceCheckUtils]: 128: Hoare triple {27709#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {27710#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:17,647 INFO L273 TraceCheckUtils]: 129: Hoare triple {27710#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27710#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:17,647 INFO L273 TraceCheckUtils]: 130: Hoare triple {27710#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27710#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:17,648 INFO L273 TraceCheckUtils]: 131: Hoare triple {27710#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {27711#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:17,649 INFO L273 TraceCheckUtils]: 132: Hoare triple {27711#(<= main_~i~0 42)} assume !(~i~0 < 100000); {27668#false} is VALID [2018-11-23 12:06:17,649 INFO L273 TraceCheckUtils]: 133: Hoare triple {27668#false} havoc ~x~0;~x~0 := 0; {27668#false} is VALID [2018-11-23 12:06:17,649 INFO L273 TraceCheckUtils]: 134: Hoare triple {27668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {27668#false} is VALID [2018-11-23 12:06:17,649 INFO L256 TraceCheckUtils]: 135: Hoare triple {27668#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {27668#false} is VALID [2018-11-23 12:06:17,650 INFO L273 TraceCheckUtils]: 136: Hoare triple {27668#false} ~cond := #in~cond; {27668#false} is VALID [2018-11-23 12:06:17,650 INFO L273 TraceCheckUtils]: 137: Hoare triple {27668#false} assume 0 == ~cond; {27668#false} is VALID [2018-11-23 12:06:17,650 INFO L273 TraceCheckUtils]: 138: Hoare triple {27668#false} assume !false; {27668#false} is VALID [2018-11-23 12:06:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:17,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:17,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:17,670 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:17,774 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-11-23 12:06:17,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:17,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:18,412 INFO L256 TraceCheckUtils]: 0: Hoare triple {27667#true} call ULTIMATE.init(); {27667#true} is VALID [2018-11-23 12:06:18,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {27667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27667#true} is VALID [2018-11-23 12:06:18,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {27667#true} assume true; {27667#true} is VALID [2018-11-23 12:06:18,412 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27667#true} {27667#true} #55#return; {27667#true} is VALID [2018-11-23 12:06:18,413 INFO L256 TraceCheckUtils]: 4: Hoare triple {27667#true} call #t~ret4 := main(); {27667#true} is VALID [2018-11-23 12:06:18,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {27667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {27730#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:18,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {27730#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27730#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:18,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {27730#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27730#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:18,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {27730#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {27670#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:18,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {27670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27670#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:18,419 INFO L273 TraceCheckUtils]: 10: Hoare triple {27670#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27670#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:18,419 INFO L273 TraceCheckUtils]: 11: Hoare triple {27670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {27671#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:18,421 INFO L273 TraceCheckUtils]: 12: Hoare triple {27671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27671#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:18,421 INFO L273 TraceCheckUtils]: 13: Hoare triple {27671#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27671#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:18,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {27671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {27672#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:18,423 INFO L273 TraceCheckUtils]: 15: Hoare triple {27672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27672#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:18,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {27672#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27672#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:18,425 INFO L273 TraceCheckUtils]: 17: Hoare triple {27672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {27673#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:18,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {27673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27673#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:18,427 INFO L273 TraceCheckUtils]: 19: Hoare triple {27673#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27673#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:18,429 INFO L273 TraceCheckUtils]: 20: Hoare triple {27673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {27674#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:18,429 INFO L273 TraceCheckUtils]: 21: Hoare triple {27674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27674#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:18,431 INFO L273 TraceCheckUtils]: 22: Hoare triple {27674#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27674#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:18,431 INFO L273 TraceCheckUtils]: 23: Hoare triple {27674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {27675#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:18,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {27675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27675#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:18,433 INFO L273 TraceCheckUtils]: 25: Hoare triple {27675#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27675#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:18,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {27675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {27676#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:18,434 INFO L273 TraceCheckUtils]: 27: Hoare triple {27676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27676#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:18,435 INFO L273 TraceCheckUtils]: 28: Hoare triple {27676#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27676#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:18,435 INFO L273 TraceCheckUtils]: 29: Hoare triple {27676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {27677#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:18,435 INFO L273 TraceCheckUtils]: 30: Hoare triple {27677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27677#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:18,436 INFO L273 TraceCheckUtils]: 31: Hoare triple {27677#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27677#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:18,436 INFO L273 TraceCheckUtils]: 32: Hoare triple {27677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {27678#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:18,436 INFO L273 TraceCheckUtils]: 33: Hoare triple {27678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27678#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:18,437 INFO L273 TraceCheckUtils]: 34: Hoare triple {27678#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27678#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:18,437 INFO L273 TraceCheckUtils]: 35: Hoare triple {27678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {27679#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:18,438 INFO L273 TraceCheckUtils]: 36: Hoare triple {27679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27679#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:18,438 INFO L273 TraceCheckUtils]: 37: Hoare triple {27679#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27679#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:18,439 INFO L273 TraceCheckUtils]: 38: Hoare triple {27679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {27680#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:18,440 INFO L273 TraceCheckUtils]: 39: Hoare triple {27680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27680#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:18,440 INFO L273 TraceCheckUtils]: 40: Hoare triple {27680#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27680#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:18,441 INFO L273 TraceCheckUtils]: 41: Hoare triple {27680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {27681#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:18,441 INFO L273 TraceCheckUtils]: 42: Hoare triple {27681#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27681#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:18,442 INFO L273 TraceCheckUtils]: 43: Hoare triple {27681#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27681#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:18,442 INFO L273 TraceCheckUtils]: 44: Hoare triple {27681#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {27682#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:18,443 INFO L273 TraceCheckUtils]: 45: Hoare triple {27682#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27682#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:18,443 INFO L273 TraceCheckUtils]: 46: Hoare triple {27682#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27682#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:18,444 INFO L273 TraceCheckUtils]: 47: Hoare triple {27682#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {27683#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:18,445 INFO L273 TraceCheckUtils]: 48: Hoare triple {27683#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27683#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:18,445 INFO L273 TraceCheckUtils]: 49: Hoare triple {27683#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27683#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:18,446 INFO L273 TraceCheckUtils]: 50: Hoare triple {27683#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {27684#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:18,446 INFO L273 TraceCheckUtils]: 51: Hoare triple {27684#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27684#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:18,447 INFO L273 TraceCheckUtils]: 52: Hoare triple {27684#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27684#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:18,448 INFO L273 TraceCheckUtils]: 53: Hoare triple {27684#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {27685#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:18,448 INFO L273 TraceCheckUtils]: 54: Hoare triple {27685#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27685#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:18,449 INFO L273 TraceCheckUtils]: 55: Hoare triple {27685#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27685#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:18,449 INFO L273 TraceCheckUtils]: 56: Hoare triple {27685#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {27686#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:18,450 INFO L273 TraceCheckUtils]: 57: Hoare triple {27686#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27686#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:18,450 INFO L273 TraceCheckUtils]: 58: Hoare triple {27686#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27686#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:18,451 INFO L273 TraceCheckUtils]: 59: Hoare triple {27686#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {27687#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:18,452 INFO L273 TraceCheckUtils]: 60: Hoare triple {27687#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27687#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:18,452 INFO L273 TraceCheckUtils]: 61: Hoare triple {27687#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27687#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:18,453 INFO L273 TraceCheckUtils]: 62: Hoare triple {27687#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {27688#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:18,453 INFO L273 TraceCheckUtils]: 63: Hoare triple {27688#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27688#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:18,454 INFO L273 TraceCheckUtils]: 64: Hoare triple {27688#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27688#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:18,454 INFO L273 TraceCheckUtils]: 65: Hoare triple {27688#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {27689#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:18,455 INFO L273 TraceCheckUtils]: 66: Hoare triple {27689#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27689#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:18,455 INFO L273 TraceCheckUtils]: 67: Hoare triple {27689#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27689#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:18,456 INFO L273 TraceCheckUtils]: 68: Hoare triple {27689#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {27690#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:18,457 INFO L273 TraceCheckUtils]: 69: Hoare triple {27690#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27690#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:18,457 INFO L273 TraceCheckUtils]: 70: Hoare triple {27690#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27690#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:18,458 INFO L273 TraceCheckUtils]: 71: Hoare triple {27690#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {27691#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:18,458 INFO L273 TraceCheckUtils]: 72: Hoare triple {27691#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27691#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:18,459 INFO L273 TraceCheckUtils]: 73: Hoare triple {27691#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27691#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:18,460 INFO L273 TraceCheckUtils]: 74: Hoare triple {27691#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {27692#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:18,460 INFO L273 TraceCheckUtils]: 75: Hoare triple {27692#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27692#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:18,461 INFO L273 TraceCheckUtils]: 76: Hoare triple {27692#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27692#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:18,461 INFO L273 TraceCheckUtils]: 77: Hoare triple {27692#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {27693#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:18,462 INFO L273 TraceCheckUtils]: 78: Hoare triple {27693#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27693#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:18,462 INFO L273 TraceCheckUtils]: 79: Hoare triple {27693#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27693#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:18,463 INFO L273 TraceCheckUtils]: 80: Hoare triple {27693#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {27694#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:18,463 INFO L273 TraceCheckUtils]: 81: Hoare triple {27694#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27694#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:18,464 INFO L273 TraceCheckUtils]: 82: Hoare triple {27694#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27694#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:18,465 INFO L273 TraceCheckUtils]: 83: Hoare triple {27694#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {27695#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:18,465 INFO L273 TraceCheckUtils]: 84: Hoare triple {27695#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27695#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:18,466 INFO L273 TraceCheckUtils]: 85: Hoare triple {27695#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27695#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:18,466 INFO L273 TraceCheckUtils]: 86: Hoare triple {27695#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {27696#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:18,467 INFO L273 TraceCheckUtils]: 87: Hoare triple {27696#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27696#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:18,467 INFO L273 TraceCheckUtils]: 88: Hoare triple {27696#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27696#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:18,468 INFO L273 TraceCheckUtils]: 89: Hoare triple {27696#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {27697#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:18,469 INFO L273 TraceCheckUtils]: 90: Hoare triple {27697#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27697#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:18,469 INFO L273 TraceCheckUtils]: 91: Hoare triple {27697#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27697#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:18,470 INFO L273 TraceCheckUtils]: 92: Hoare triple {27697#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {27698#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:18,470 INFO L273 TraceCheckUtils]: 93: Hoare triple {27698#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27698#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:18,471 INFO L273 TraceCheckUtils]: 94: Hoare triple {27698#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27698#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:18,471 INFO L273 TraceCheckUtils]: 95: Hoare triple {27698#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {27699#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:18,472 INFO L273 TraceCheckUtils]: 96: Hoare triple {27699#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27699#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:18,472 INFO L273 TraceCheckUtils]: 97: Hoare triple {27699#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27699#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:18,473 INFO L273 TraceCheckUtils]: 98: Hoare triple {27699#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {27700#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:18,474 INFO L273 TraceCheckUtils]: 99: Hoare triple {27700#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27700#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:18,474 INFO L273 TraceCheckUtils]: 100: Hoare triple {27700#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27700#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:18,475 INFO L273 TraceCheckUtils]: 101: Hoare triple {27700#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {27701#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:18,475 INFO L273 TraceCheckUtils]: 102: Hoare triple {27701#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27701#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:18,476 INFO L273 TraceCheckUtils]: 103: Hoare triple {27701#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27701#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:18,477 INFO L273 TraceCheckUtils]: 104: Hoare triple {27701#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {27702#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:18,477 INFO L273 TraceCheckUtils]: 105: Hoare triple {27702#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27702#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:18,478 INFO L273 TraceCheckUtils]: 106: Hoare triple {27702#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27702#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:18,478 INFO L273 TraceCheckUtils]: 107: Hoare triple {27702#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {27703#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:18,479 INFO L273 TraceCheckUtils]: 108: Hoare triple {27703#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27703#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:18,479 INFO L273 TraceCheckUtils]: 109: Hoare triple {27703#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27703#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:18,480 INFO L273 TraceCheckUtils]: 110: Hoare triple {27703#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {27704#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:18,480 INFO L273 TraceCheckUtils]: 111: Hoare triple {27704#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27704#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:18,481 INFO L273 TraceCheckUtils]: 112: Hoare triple {27704#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27704#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:18,482 INFO L273 TraceCheckUtils]: 113: Hoare triple {27704#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {27705#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:18,482 INFO L273 TraceCheckUtils]: 114: Hoare triple {27705#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27705#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:18,483 INFO L273 TraceCheckUtils]: 115: Hoare triple {27705#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27705#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:18,483 INFO L273 TraceCheckUtils]: 116: Hoare triple {27705#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {27706#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:18,484 INFO L273 TraceCheckUtils]: 117: Hoare triple {27706#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27706#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:18,484 INFO L273 TraceCheckUtils]: 118: Hoare triple {27706#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27706#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:18,485 INFO L273 TraceCheckUtils]: 119: Hoare triple {27706#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {27707#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:18,486 INFO L273 TraceCheckUtils]: 120: Hoare triple {27707#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27707#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:18,486 INFO L273 TraceCheckUtils]: 121: Hoare triple {27707#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27707#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:18,487 INFO L273 TraceCheckUtils]: 122: Hoare triple {27707#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {27708#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:18,487 INFO L273 TraceCheckUtils]: 123: Hoare triple {27708#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27708#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:18,488 INFO L273 TraceCheckUtils]: 124: Hoare triple {27708#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27708#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:18,489 INFO L273 TraceCheckUtils]: 125: Hoare triple {27708#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {27709#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:18,489 INFO L273 TraceCheckUtils]: 126: Hoare triple {27709#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27709#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:18,490 INFO L273 TraceCheckUtils]: 127: Hoare triple {27709#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27709#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:18,490 INFO L273 TraceCheckUtils]: 128: Hoare triple {27709#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {27710#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:18,491 INFO L273 TraceCheckUtils]: 129: Hoare triple {27710#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27710#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:18,491 INFO L273 TraceCheckUtils]: 130: Hoare triple {27710#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {27710#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:18,492 INFO L273 TraceCheckUtils]: 131: Hoare triple {27710#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {27711#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:18,493 INFO L273 TraceCheckUtils]: 132: Hoare triple {27711#(<= main_~i~0 42)} assume !(~i~0 < 100000); {27668#false} is VALID [2018-11-23 12:06:18,493 INFO L273 TraceCheckUtils]: 133: Hoare triple {27668#false} havoc ~x~0;~x~0 := 0; {27668#false} is VALID [2018-11-23 12:06:18,493 INFO L273 TraceCheckUtils]: 134: Hoare triple {27668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {27668#false} is VALID [2018-11-23 12:06:18,493 INFO L256 TraceCheckUtils]: 135: Hoare triple {27668#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {27668#false} is VALID [2018-11-23 12:06:18,493 INFO L273 TraceCheckUtils]: 136: Hoare triple {27668#false} ~cond := #in~cond; {27668#false} is VALID [2018-11-23 12:06:18,494 INFO L273 TraceCheckUtils]: 137: Hoare triple {27668#false} assume 0 == ~cond; {27668#false} is VALID [2018-11-23 12:06:18,494 INFO L273 TraceCheckUtils]: 138: Hoare triple {27668#false} assume !false; {27668#false} is VALID [2018-11-23 12:06:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:18,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:18,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2018-11-23 12:06:18,525 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 139 [2018-11-23 12:06:18,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:18,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:06:18,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:18,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:06:18,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:06:18,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:06:18,665 INFO L87 Difference]: Start difference. First operand 144 states and 187 transitions. Second operand 46 states. [2018-11-23 12:06:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:19,748 INFO L93 Difference]: Finished difference Result 160 states and 206 transitions. [2018-11-23 12:06:19,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 12:06:19,748 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 139 [2018-11-23 12:06:19,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:06:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 206 transitions. [2018-11-23 12:06:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:06:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 206 transitions. [2018-11-23 12:06:19,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 206 transitions. [2018-11-23 12:06:20,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:20,004 INFO L225 Difference]: With dead ends: 160 [2018-11-23 12:06:20,004 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 12:06:20,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:06:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 12:06:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-11-23 12:06:20,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:20,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 147 states. [2018-11-23 12:06:20,068 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 147 states. [2018-11-23 12:06:20,068 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 147 states. [2018-11-23 12:06:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:20,070 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2018-11-23 12:06:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2018-11-23 12:06:20,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:20,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:20,071 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 149 states. [2018-11-23 12:06:20,071 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 149 states. [2018-11-23 12:06:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:20,073 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2018-11-23 12:06:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2018-11-23 12:06:20,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:20,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:20,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:20,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 12:06:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 191 transitions. [2018-11-23 12:06:20,075 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 191 transitions. Word has length 139 [2018-11-23 12:06:20,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:20,075 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 191 transitions. [2018-11-23 12:06:20,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:06:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 191 transitions. [2018-11-23 12:06:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-23 12:06:20,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:20,076 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:20,076 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:20,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1671197219, now seen corresponding path program 43 times [2018-11-23 12:06:20,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:20,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:20,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:20,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:20,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:21,139 INFO L256 TraceCheckUtils]: 0: Hoare triple {28839#true} call ULTIMATE.init(); {28839#true} is VALID [2018-11-23 12:06:21,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {28839#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28839#true} is VALID [2018-11-23 12:06:21,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {28839#true} assume true; {28839#true} is VALID [2018-11-23 12:06:21,139 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28839#true} {28839#true} #55#return; {28839#true} is VALID [2018-11-23 12:06:21,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {28839#true} call #t~ret4 := main(); {28839#true} is VALID [2018-11-23 12:06:21,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {28839#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {28841#(= main_~i~0 0)} is VALID [2018-11-23 12:06:21,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {28841#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28841#(= main_~i~0 0)} is VALID [2018-11-23 12:06:21,141 INFO L273 TraceCheckUtils]: 7: Hoare triple {28841#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28841#(= main_~i~0 0)} is VALID [2018-11-23 12:06:21,142 INFO L273 TraceCheckUtils]: 8: Hoare triple {28841#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {28842#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:21,142 INFO L273 TraceCheckUtils]: 9: Hoare triple {28842#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28842#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:21,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {28842#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28842#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:21,144 INFO L273 TraceCheckUtils]: 11: Hoare triple {28842#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {28843#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:21,144 INFO L273 TraceCheckUtils]: 12: Hoare triple {28843#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28843#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:21,145 INFO L273 TraceCheckUtils]: 13: Hoare triple {28843#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28843#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:21,145 INFO L273 TraceCheckUtils]: 14: Hoare triple {28843#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {28844#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:21,146 INFO L273 TraceCheckUtils]: 15: Hoare triple {28844#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28844#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:21,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {28844#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28844#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:21,147 INFO L273 TraceCheckUtils]: 17: Hoare triple {28844#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {28845#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:21,148 INFO L273 TraceCheckUtils]: 18: Hoare triple {28845#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28845#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:21,148 INFO L273 TraceCheckUtils]: 19: Hoare triple {28845#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28845#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:21,149 INFO L273 TraceCheckUtils]: 20: Hoare triple {28845#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {28846#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:21,149 INFO L273 TraceCheckUtils]: 21: Hoare triple {28846#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28846#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:21,150 INFO L273 TraceCheckUtils]: 22: Hoare triple {28846#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28846#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:21,150 INFO L273 TraceCheckUtils]: 23: Hoare triple {28846#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {28847#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:21,151 INFO L273 TraceCheckUtils]: 24: Hoare triple {28847#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28847#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:21,151 INFO L273 TraceCheckUtils]: 25: Hoare triple {28847#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28847#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:21,152 INFO L273 TraceCheckUtils]: 26: Hoare triple {28847#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {28848#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:21,153 INFO L273 TraceCheckUtils]: 27: Hoare triple {28848#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28848#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:21,153 INFO L273 TraceCheckUtils]: 28: Hoare triple {28848#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28848#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:21,154 INFO L273 TraceCheckUtils]: 29: Hoare triple {28848#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {28849#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:21,154 INFO L273 TraceCheckUtils]: 30: Hoare triple {28849#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28849#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:21,155 INFO L273 TraceCheckUtils]: 31: Hoare triple {28849#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28849#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:21,156 INFO L273 TraceCheckUtils]: 32: Hoare triple {28849#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {28850#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:21,156 INFO L273 TraceCheckUtils]: 33: Hoare triple {28850#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28850#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:21,157 INFO L273 TraceCheckUtils]: 34: Hoare triple {28850#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28850#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:21,157 INFO L273 TraceCheckUtils]: 35: Hoare triple {28850#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {28851#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:21,158 INFO L273 TraceCheckUtils]: 36: Hoare triple {28851#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28851#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:21,158 INFO L273 TraceCheckUtils]: 37: Hoare triple {28851#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28851#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:21,159 INFO L273 TraceCheckUtils]: 38: Hoare triple {28851#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {28852#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:21,160 INFO L273 TraceCheckUtils]: 39: Hoare triple {28852#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28852#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:21,160 INFO L273 TraceCheckUtils]: 40: Hoare triple {28852#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28852#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:21,161 INFO L273 TraceCheckUtils]: 41: Hoare triple {28852#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {28853#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:21,161 INFO L273 TraceCheckUtils]: 42: Hoare triple {28853#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28853#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:21,162 INFO L273 TraceCheckUtils]: 43: Hoare triple {28853#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28853#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:21,162 INFO L273 TraceCheckUtils]: 44: Hoare triple {28853#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {28854#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:21,163 INFO L273 TraceCheckUtils]: 45: Hoare triple {28854#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28854#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:21,163 INFO L273 TraceCheckUtils]: 46: Hoare triple {28854#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28854#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:21,164 INFO L273 TraceCheckUtils]: 47: Hoare triple {28854#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {28855#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:21,165 INFO L273 TraceCheckUtils]: 48: Hoare triple {28855#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28855#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:21,165 INFO L273 TraceCheckUtils]: 49: Hoare triple {28855#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28855#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:21,166 INFO L273 TraceCheckUtils]: 50: Hoare triple {28855#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {28856#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:21,166 INFO L273 TraceCheckUtils]: 51: Hoare triple {28856#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28856#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:21,167 INFO L273 TraceCheckUtils]: 52: Hoare triple {28856#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28856#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:21,168 INFO L273 TraceCheckUtils]: 53: Hoare triple {28856#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {28857#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:21,168 INFO L273 TraceCheckUtils]: 54: Hoare triple {28857#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28857#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:21,169 INFO L273 TraceCheckUtils]: 55: Hoare triple {28857#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28857#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:21,169 INFO L273 TraceCheckUtils]: 56: Hoare triple {28857#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {28858#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:21,170 INFO L273 TraceCheckUtils]: 57: Hoare triple {28858#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28858#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:21,170 INFO L273 TraceCheckUtils]: 58: Hoare triple {28858#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28858#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:21,171 INFO L273 TraceCheckUtils]: 59: Hoare triple {28858#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {28859#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:21,172 INFO L273 TraceCheckUtils]: 60: Hoare triple {28859#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28859#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:21,172 INFO L273 TraceCheckUtils]: 61: Hoare triple {28859#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28859#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:21,173 INFO L273 TraceCheckUtils]: 62: Hoare triple {28859#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {28860#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:21,173 INFO L273 TraceCheckUtils]: 63: Hoare triple {28860#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28860#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:21,174 INFO L273 TraceCheckUtils]: 64: Hoare triple {28860#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28860#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:21,174 INFO L273 TraceCheckUtils]: 65: Hoare triple {28860#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {28861#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:21,175 INFO L273 TraceCheckUtils]: 66: Hoare triple {28861#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28861#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:21,175 INFO L273 TraceCheckUtils]: 67: Hoare triple {28861#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28861#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:21,176 INFO L273 TraceCheckUtils]: 68: Hoare triple {28861#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {28862#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:21,177 INFO L273 TraceCheckUtils]: 69: Hoare triple {28862#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28862#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:21,177 INFO L273 TraceCheckUtils]: 70: Hoare triple {28862#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28862#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:21,178 INFO L273 TraceCheckUtils]: 71: Hoare triple {28862#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {28863#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:21,178 INFO L273 TraceCheckUtils]: 72: Hoare triple {28863#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28863#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:21,179 INFO L273 TraceCheckUtils]: 73: Hoare triple {28863#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28863#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:21,179 INFO L273 TraceCheckUtils]: 74: Hoare triple {28863#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {28864#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:21,180 INFO L273 TraceCheckUtils]: 75: Hoare triple {28864#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28864#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:21,181 INFO L273 TraceCheckUtils]: 76: Hoare triple {28864#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28864#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:21,181 INFO L273 TraceCheckUtils]: 77: Hoare triple {28864#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {28865#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:21,182 INFO L273 TraceCheckUtils]: 78: Hoare triple {28865#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28865#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:21,182 INFO L273 TraceCheckUtils]: 79: Hoare triple {28865#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28865#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:21,183 INFO L273 TraceCheckUtils]: 80: Hoare triple {28865#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {28866#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:21,183 INFO L273 TraceCheckUtils]: 81: Hoare triple {28866#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28866#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:21,184 INFO L273 TraceCheckUtils]: 82: Hoare triple {28866#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28866#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:21,185 INFO L273 TraceCheckUtils]: 83: Hoare triple {28866#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {28867#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:21,185 INFO L273 TraceCheckUtils]: 84: Hoare triple {28867#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28867#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:21,186 INFO L273 TraceCheckUtils]: 85: Hoare triple {28867#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28867#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:21,186 INFO L273 TraceCheckUtils]: 86: Hoare triple {28867#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {28868#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:21,187 INFO L273 TraceCheckUtils]: 87: Hoare triple {28868#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28868#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:21,187 INFO L273 TraceCheckUtils]: 88: Hoare triple {28868#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28868#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:21,188 INFO L273 TraceCheckUtils]: 89: Hoare triple {28868#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {28869#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:21,189 INFO L273 TraceCheckUtils]: 90: Hoare triple {28869#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28869#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:21,189 INFO L273 TraceCheckUtils]: 91: Hoare triple {28869#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28869#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:21,190 INFO L273 TraceCheckUtils]: 92: Hoare triple {28869#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {28870#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:21,190 INFO L273 TraceCheckUtils]: 93: Hoare triple {28870#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28870#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:21,191 INFO L273 TraceCheckUtils]: 94: Hoare triple {28870#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28870#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:21,191 INFO L273 TraceCheckUtils]: 95: Hoare triple {28870#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {28871#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:21,192 INFO L273 TraceCheckUtils]: 96: Hoare triple {28871#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28871#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:21,192 INFO L273 TraceCheckUtils]: 97: Hoare triple {28871#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28871#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:21,193 INFO L273 TraceCheckUtils]: 98: Hoare triple {28871#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {28872#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:21,194 INFO L273 TraceCheckUtils]: 99: Hoare triple {28872#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28872#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:21,194 INFO L273 TraceCheckUtils]: 100: Hoare triple {28872#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28872#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:21,195 INFO L273 TraceCheckUtils]: 101: Hoare triple {28872#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {28873#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:21,195 INFO L273 TraceCheckUtils]: 102: Hoare triple {28873#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28873#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:21,196 INFO L273 TraceCheckUtils]: 103: Hoare triple {28873#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28873#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:21,197 INFO L273 TraceCheckUtils]: 104: Hoare triple {28873#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {28874#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:21,197 INFO L273 TraceCheckUtils]: 105: Hoare triple {28874#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28874#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:21,198 INFO L273 TraceCheckUtils]: 106: Hoare triple {28874#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28874#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:21,198 INFO L273 TraceCheckUtils]: 107: Hoare triple {28874#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {28875#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:21,199 INFO L273 TraceCheckUtils]: 108: Hoare triple {28875#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28875#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:21,199 INFO L273 TraceCheckUtils]: 109: Hoare triple {28875#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28875#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:21,200 INFO L273 TraceCheckUtils]: 110: Hoare triple {28875#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {28876#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:21,200 INFO L273 TraceCheckUtils]: 111: Hoare triple {28876#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28876#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:21,201 INFO L273 TraceCheckUtils]: 112: Hoare triple {28876#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28876#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:21,202 INFO L273 TraceCheckUtils]: 113: Hoare triple {28876#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {28877#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:21,202 INFO L273 TraceCheckUtils]: 114: Hoare triple {28877#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28877#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:21,203 INFO L273 TraceCheckUtils]: 115: Hoare triple {28877#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28877#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:21,203 INFO L273 TraceCheckUtils]: 116: Hoare triple {28877#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {28878#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:21,204 INFO L273 TraceCheckUtils]: 117: Hoare triple {28878#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28878#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:21,204 INFO L273 TraceCheckUtils]: 118: Hoare triple {28878#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28878#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:21,205 INFO L273 TraceCheckUtils]: 119: Hoare triple {28878#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {28879#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:21,206 INFO L273 TraceCheckUtils]: 120: Hoare triple {28879#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28879#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:21,206 INFO L273 TraceCheckUtils]: 121: Hoare triple {28879#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28879#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:21,207 INFO L273 TraceCheckUtils]: 122: Hoare triple {28879#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {28880#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:21,207 INFO L273 TraceCheckUtils]: 123: Hoare triple {28880#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28880#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:21,208 INFO L273 TraceCheckUtils]: 124: Hoare triple {28880#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28880#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:21,208 INFO L273 TraceCheckUtils]: 125: Hoare triple {28880#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {28881#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:21,209 INFO L273 TraceCheckUtils]: 126: Hoare triple {28881#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28881#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:21,209 INFO L273 TraceCheckUtils]: 127: Hoare triple {28881#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28881#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:21,210 INFO L273 TraceCheckUtils]: 128: Hoare triple {28881#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {28882#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:21,211 INFO L273 TraceCheckUtils]: 129: Hoare triple {28882#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28882#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:21,211 INFO L273 TraceCheckUtils]: 130: Hoare triple {28882#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28882#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:21,212 INFO L273 TraceCheckUtils]: 131: Hoare triple {28882#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {28883#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:21,212 INFO L273 TraceCheckUtils]: 132: Hoare triple {28883#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28883#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:21,213 INFO L273 TraceCheckUtils]: 133: Hoare triple {28883#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28883#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:21,214 INFO L273 TraceCheckUtils]: 134: Hoare triple {28883#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {28884#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:21,214 INFO L273 TraceCheckUtils]: 135: Hoare triple {28884#(<= main_~i~0 43)} assume !(~i~0 < 100000); {28840#false} is VALID [2018-11-23 12:06:21,214 INFO L273 TraceCheckUtils]: 136: Hoare triple {28840#false} havoc ~x~0;~x~0 := 0; {28840#false} is VALID [2018-11-23 12:06:21,215 INFO L273 TraceCheckUtils]: 137: Hoare triple {28840#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {28840#false} is VALID [2018-11-23 12:06:21,215 INFO L256 TraceCheckUtils]: 138: Hoare triple {28840#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {28840#false} is VALID [2018-11-23 12:06:21,215 INFO L273 TraceCheckUtils]: 139: Hoare triple {28840#false} ~cond := #in~cond; {28840#false} is VALID [2018-11-23 12:06:21,215 INFO L273 TraceCheckUtils]: 140: Hoare triple {28840#false} assume 0 == ~cond; {28840#false} is VALID [2018-11-23 12:06:21,215 INFO L273 TraceCheckUtils]: 141: Hoare triple {28840#false} assume !false; {28840#false} is VALID [2018-11-23 12:06:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:21,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:21,229 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:21,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:21,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:21,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {28839#true} call ULTIMATE.init(); {28839#true} is VALID [2018-11-23 12:06:21,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {28839#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28839#true} is VALID [2018-11-23 12:06:21,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {28839#true} assume true; {28839#true} is VALID [2018-11-23 12:06:21,789 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28839#true} {28839#true} #55#return; {28839#true} is VALID [2018-11-23 12:06:21,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {28839#true} call #t~ret4 := main(); {28839#true} is VALID [2018-11-23 12:06:21,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {28839#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {28903#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:21,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {28903#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28903#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:21,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {28903#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28903#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:21,792 INFO L273 TraceCheckUtils]: 8: Hoare triple {28903#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {28842#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:21,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {28842#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28842#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:21,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {28842#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28842#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:21,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {28842#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {28843#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:21,793 INFO L273 TraceCheckUtils]: 12: Hoare triple {28843#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28843#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:21,794 INFO L273 TraceCheckUtils]: 13: Hoare triple {28843#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28843#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:21,794 INFO L273 TraceCheckUtils]: 14: Hoare triple {28843#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {28844#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:21,795 INFO L273 TraceCheckUtils]: 15: Hoare triple {28844#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28844#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:21,795 INFO L273 TraceCheckUtils]: 16: Hoare triple {28844#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28844#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:21,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {28844#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {28845#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:21,797 INFO L273 TraceCheckUtils]: 18: Hoare triple {28845#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28845#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:21,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {28845#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28845#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:21,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {28845#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {28846#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:21,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {28846#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28846#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:21,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {28846#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28846#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:21,800 INFO L273 TraceCheckUtils]: 23: Hoare triple {28846#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {28847#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:21,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {28847#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28847#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:21,801 INFO L273 TraceCheckUtils]: 25: Hoare triple {28847#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28847#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:21,801 INFO L273 TraceCheckUtils]: 26: Hoare triple {28847#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {28848#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:21,802 INFO L273 TraceCheckUtils]: 27: Hoare triple {28848#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28848#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:21,802 INFO L273 TraceCheckUtils]: 28: Hoare triple {28848#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28848#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:21,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {28848#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {28849#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:21,803 INFO L273 TraceCheckUtils]: 30: Hoare triple {28849#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28849#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:21,804 INFO L273 TraceCheckUtils]: 31: Hoare triple {28849#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28849#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:21,805 INFO L273 TraceCheckUtils]: 32: Hoare triple {28849#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {28850#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:21,805 INFO L273 TraceCheckUtils]: 33: Hoare triple {28850#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28850#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:21,806 INFO L273 TraceCheckUtils]: 34: Hoare triple {28850#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28850#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:21,806 INFO L273 TraceCheckUtils]: 35: Hoare triple {28850#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {28851#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:21,807 INFO L273 TraceCheckUtils]: 36: Hoare triple {28851#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28851#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:21,807 INFO L273 TraceCheckUtils]: 37: Hoare triple {28851#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28851#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:21,808 INFO L273 TraceCheckUtils]: 38: Hoare triple {28851#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {28852#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:21,809 INFO L273 TraceCheckUtils]: 39: Hoare triple {28852#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28852#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:21,809 INFO L273 TraceCheckUtils]: 40: Hoare triple {28852#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28852#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:21,810 INFO L273 TraceCheckUtils]: 41: Hoare triple {28852#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {28853#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:21,810 INFO L273 TraceCheckUtils]: 42: Hoare triple {28853#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28853#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:21,811 INFO L273 TraceCheckUtils]: 43: Hoare triple {28853#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28853#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:21,811 INFO L273 TraceCheckUtils]: 44: Hoare triple {28853#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {28854#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:21,812 INFO L273 TraceCheckUtils]: 45: Hoare triple {28854#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28854#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:21,812 INFO L273 TraceCheckUtils]: 46: Hoare triple {28854#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28854#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:21,813 INFO L273 TraceCheckUtils]: 47: Hoare triple {28854#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {28855#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:21,814 INFO L273 TraceCheckUtils]: 48: Hoare triple {28855#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28855#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:21,814 INFO L273 TraceCheckUtils]: 49: Hoare triple {28855#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28855#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:21,815 INFO L273 TraceCheckUtils]: 50: Hoare triple {28855#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {28856#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:21,815 INFO L273 TraceCheckUtils]: 51: Hoare triple {28856#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28856#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:21,816 INFO L273 TraceCheckUtils]: 52: Hoare triple {28856#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28856#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:21,817 INFO L273 TraceCheckUtils]: 53: Hoare triple {28856#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {28857#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:21,817 INFO L273 TraceCheckUtils]: 54: Hoare triple {28857#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28857#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:21,818 INFO L273 TraceCheckUtils]: 55: Hoare triple {28857#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28857#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:21,818 INFO L273 TraceCheckUtils]: 56: Hoare triple {28857#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {28858#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:21,819 INFO L273 TraceCheckUtils]: 57: Hoare triple {28858#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28858#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:21,819 INFO L273 TraceCheckUtils]: 58: Hoare triple {28858#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28858#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:21,820 INFO L273 TraceCheckUtils]: 59: Hoare triple {28858#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {28859#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:21,821 INFO L273 TraceCheckUtils]: 60: Hoare triple {28859#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28859#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:21,821 INFO L273 TraceCheckUtils]: 61: Hoare triple {28859#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28859#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:21,822 INFO L273 TraceCheckUtils]: 62: Hoare triple {28859#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {28860#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:21,822 INFO L273 TraceCheckUtils]: 63: Hoare triple {28860#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28860#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:21,823 INFO L273 TraceCheckUtils]: 64: Hoare triple {28860#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28860#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:21,823 INFO L273 TraceCheckUtils]: 65: Hoare triple {28860#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {28861#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:21,824 INFO L273 TraceCheckUtils]: 66: Hoare triple {28861#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28861#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:21,824 INFO L273 TraceCheckUtils]: 67: Hoare triple {28861#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28861#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:21,825 INFO L273 TraceCheckUtils]: 68: Hoare triple {28861#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {28862#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:21,826 INFO L273 TraceCheckUtils]: 69: Hoare triple {28862#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28862#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:21,826 INFO L273 TraceCheckUtils]: 70: Hoare triple {28862#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28862#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:21,827 INFO L273 TraceCheckUtils]: 71: Hoare triple {28862#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {28863#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:21,827 INFO L273 TraceCheckUtils]: 72: Hoare triple {28863#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28863#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:21,828 INFO L273 TraceCheckUtils]: 73: Hoare triple {28863#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28863#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:21,829 INFO L273 TraceCheckUtils]: 74: Hoare triple {28863#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {28864#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:21,829 INFO L273 TraceCheckUtils]: 75: Hoare triple {28864#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28864#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:21,830 INFO L273 TraceCheckUtils]: 76: Hoare triple {28864#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28864#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:21,830 INFO L273 TraceCheckUtils]: 77: Hoare triple {28864#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {28865#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:21,831 INFO L273 TraceCheckUtils]: 78: Hoare triple {28865#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28865#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:21,831 INFO L273 TraceCheckUtils]: 79: Hoare triple {28865#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28865#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:21,832 INFO L273 TraceCheckUtils]: 80: Hoare triple {28865#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {28866#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:21,832 INFO L273 TraceCheckUtils]: 81: Hoare triple {28866#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28866#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:21,833 INFO L273 TraceCheckUtils]: 82: Hoare triple {28866#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28866#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:21,834 INFO L273 TraceCheckUtils]: 83: Hoare triple {28866#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {28867#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:21,834 INFO L273 TraceCheckUtils]: 84: Hoare triple {28867#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28867#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:21,834 INFO L273 TraceCheckUtils]: 85: Hoare triple {28867#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28867#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:21,835 INFO L273 TraceCheckUtils]: 86: Hoare triple {28867#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {28868#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:21,836 INFO L273 TraceCheckUtils]: 87: Hoare triple {28868#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28868#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:21,836 INFO L273 TraceCheckUtils]: 88: Hoare triple {28868#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28868#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:21,837 INFO L273 TraceCheckUtils]: 89: Hoare triple {28868#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {28869#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:21,837 INFO L273 TraceCheckUtils]: 90: Hoare triple {28869#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28869#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:21,838 INFO L273 TraceCheckUtils]: 91: Hoare triple {28869#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28869#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:21,839 INFO L273 TraceCheckUtils]: 92: Hoare triple {28869#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {28870#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:21,839 INFO L273 TraceCheckUtils]: 93: Hoare triple {28870#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28870#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:21,840 INFO L273 TraceCheckUtils]: 94: Hoare triple {28870#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28870#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:21,840 INFO L273 TraceCheckUtils]: 95: Hoare triple {28870#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {28871#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:21,841 INFO L273 TraceCheckUtils]: 96: Hoare triple {28871#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28871#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:21,841 INFO L273 TraceCheckUtils]: 97: Hoare triple {28871#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28871#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:21,842 INFO L273 TraceCheckUtils]: 98: Hoare triple {28871#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {28872#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:21,843 INFO L273 TraceCheckUtils]: 99: Hoare triple {28872#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28872#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:21,843 INFO L273 TraceCheckUtils]: 100: Hoare triple {28872#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28872#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:21,844 INFO L273 TraceCheckUtils]: 101: Hoare triple {28872#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {28873#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:21,844 INFO L273 TraceCheckUtils]: 102: Hoare triple {28873#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28873#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:21,845 INFO L273 TraceCheckUtils]: 103: Hoare triple {28873#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28873#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:21,845 INFO L273 TraceCheckUtils]: 104: Hoare triple {28873#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {28874#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:21,846 INFO L273 TraceCheckUtils]: 105: Hoare triple {28874#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28874#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:21,846 INFO L273 TraceCheckUtils]: 106: Hoare triple {28874#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28874#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:21,847 INFO L273 TraceCheckUtils]: 107: Hoare triple {28874#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {28875#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:21,848 INFO L273 TraceCheckUtils]: 108: Hoare triple {28875#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28875#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:21,848 INFO L273 TraceCheckUtils]: 109: Hoare triple {28875#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28875#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:21,849 INFO L273 TraceCheckUtils]: 110: Hoare triple {28875#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {28876#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:21,849 INFO L273 TraceCheckUtils]: 111: Hoare triple {28876#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28876#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:21,850 INFO L273 TraceCheckUtils]: 112: Hoare triple {28876#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28876#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:21,851 INFO L273 TraceCheckUtils]: 113: Hoare triple {28876#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {28877#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:21,851 INFO L273 TraceCheckUtils]: 114: Hoare triple {28877#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28877#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:21,852 INFO L273 TraceCheckUtils]: 115: Hoare triple {28877#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28877#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:21,852 INFO L273 TraceCheckUtils]: 116: Hoare triple {28877#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {28878#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:21,853 INFO L273 TraceCheckUtils]: 117: Hoare triple {28878#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28878#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:21,853 INFO L273 TraceCheckUtils]: 118: Hoare triple {28878#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28878#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:21,854 INFO L273 TraceCheckUtils]: 119: Hoare triple {28878#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {28879#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:21,855 INFO L273 TraceCheckUtils]: 120: Hoare triple {28879#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28879#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:21,855 INFO L273 TraceCheckUtils]: 121: Hoare triple {28879#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28879#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:21,856 INFO L273 TraceCheckUtils]: 122: Hoare triple {28879#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {28880#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:21,856 INFO L273 TraceCheckUtils]: 123: Hoare triple {28880#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28880#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:21,857 INFO L273 TraceCheckUtils]: 124: Hoare triple {28880#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28880#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:21,858 INFO L273 TraceCheckUtils]: 125: Hoare triple {28880#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {28881#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:21,858 INFO L273 TraceCheckUtils]: 126: Hoare triple {28881#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28881#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:21,859 INFO L273 TraceCheckUtils]: 127: Hoare triple {28881#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28881#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:21,859 INFO L273 TraceCheckUtils]: 128: Hoare triple {28881#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {28882#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:21,860 INFO L273 TraceCheckUtils]: 129: Hoare triple {28882#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28882#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:21,860 INFO L273 TraceCheckUtils]: 130: Hoare triple {28882#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28882#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:21,861 INFO L273 TraceCheckUtils]: 131: Hoare triple {28882#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {28883#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:21,861 INFO L273 TraceCheckUtils]: 132: Hoare triple {28883#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28883#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:21,862 INFO L273 TraceCheckUtils]: 133: Hoare triple {28883#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {28883#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:21,863 INFO L273 TraceCheckUtils]: 134: Hoare triple {28883#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {28884#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:21,863 INFO L273 TraceCheckUtils]: 135: Hoare triple {28884#(<= main_~i~0 43)} assume !(~i~0 < 100000); {28840#false} is VALID [2018-11-23 12:06:21,864 INFO L273 TraceCheckUtils]: 136: Hoare triple {28840#false} havoc ~x~0;~x~0 := 0; {28840#false} is VALID [2018-11-23 12:06:21,864 INFO L273 TraceCheckUtils]: 137: Hoare triple {28840#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {28840#false} is VALID [2018-11-23 12:06:21,864 INFO L256 TraceCheckUtils]: 138: Hoare triple {28840#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {28840#false} is VALID [2018-11-23 12:06:21,864 INFO L273 TraceCheckUtils]: 139: Hoare triple {28840#false} ~cond := #in~cond; {28840#false} is VALID [2018-11-23 12:06:21,864 INFO L273 TraceCheckUtils]: 140: Hoare triple {28840#false} assume 0 == ~cond; {28840#false} is VALID [2018-11-23 12:06:21,864 INFO L273 TraceCheckUtils]: 141: Hoare triple {28840#false} assume !false; {28840#false} is VALID [2018-11-23 12:06:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:21,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:21,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2018-11-23 12:06:21,897 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 142 [2018-11-23 12:06:21,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:21,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 12:06:22,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:22,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 12:06:22,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 12:06:22,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:06:22,039 INFO L87 Difference]: Start difference. First operand 147 states and 191 transitions. Second operand 47 states. [2018-11-23 12:06:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,730 INFO L93 Difference]: Finished difference Result 163 states and 210 transitions. [2018-11-23 12:06:22,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:06:22,730 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 142 [2018-11-23 12:06:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:06:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 210 transitions. [2018-11-23 12:06:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:06:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 210 transitions. [2018-11-23 12:06:22,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 210 transitions. [2018-11-23 12:06:22,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:22,938 INFO L225 Difference]: With dead ends: 163 [2018-11-23 12:06:22,938 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 12:06:22,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:06:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 12:06:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-11-23 12:06:22,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:22,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 150 states. [2018-11-23 12:06:22,972 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 150 states. [2018-11-23 12:06:22,972 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 150 states. [2018-11-23 12:06:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,974 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2018-11-23 12:06:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2018-11-23 12:06:22,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:22,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:22,974 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 152 states. [2018-11-23 12:06:22,974 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 152 states. [2018-11-23 12:06:22,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,976 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2018-11-23 12:06:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2018-11-23 12:06:22,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:22,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:22,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:22,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 12:06:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 195 transitions. [2018-11-23 12:06:22,979 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 195 transitions. Word has length 142 [2018-11-23 12:06:22,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:22,979 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 195 transitions. [2018-11-23 12:06:22,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 12:06:22,979 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 195 transitions. [2018-11-23 12:06:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 12:06:22,979 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:22,980 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:22,980 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:22,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:22,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1579178183, now seen corresponding path program 44 times [2018-11-23 12:06:22,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:22,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:22,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:22,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:22,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:24,260 INFO L256 TraceCheckUtils]: 0: Hoare triple {30035#true} call ULTIMATE.init(); {30035#true} is VALID [2018-11-23 12:06:24,260 INFO L273 TraceCheckUtils]: 1: Hoare triple {30035#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30035#true} is VALID [2018-11-23 12:06:24,261 INFO L273 TraceCheckUtils]: 2: Hoare triple {30035#true} assume true; {30035#true} is VALID [2018-11-23 12:06:24,261 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30035#true} {30035#true} #55#return; {30035#true} is VALID [2018-11-23 12:06:24,261 INFO L256 TraceCheckUtils]: 4: Hoare triple {30035#true} call #t~ret4 := main(); {30035#true} is VALID [2018-11-23 12:06:24,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {30035#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {30037#(= main_~i~0 0)} is VALID [2018-11-23 12:06:24,262 INFO L273 TraceCheckUtils]: 6: Hoare triple {30037#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30037#(= main_~i~0 0)} is VALID [2018-11-23 12:06:24,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {30037#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30037#(= main_~i~0 0)} is VALID [2018-11-23 12:06:24,263 INFO L273 TraceCheckUtils]: 8: Hoare triple {30037#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {30038#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:24,263 INFO L273 TraceCheckUtils]: 9: Hoare triple {30038#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30038#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:24,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {30038#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30038#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:24,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {30038#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {30039#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:24,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {30039#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30039#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:24,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {30039#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30039#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:24,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {30039#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {30040#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:24,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {30040#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30040#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:24,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {30040#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30040#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:24,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {30040#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {30041#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:24,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {30041#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30041#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:24,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {30041#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30041#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:24,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {30041#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {30042#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:24,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {30042#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30042#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:24,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {30042#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30042#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:24,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {30042#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {30043#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:24,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {30043#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30043#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:24,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {30043#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30043#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:24,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {30043#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {30044#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:24,272 INFO L273 TraceCheckUtils]: 27: Hoare triple {30044#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30044#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:24,273 INFO L273 TraceCheckUtils]: 28: Hoare triple {30044#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30044#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:24,273 INFO L273 TraceCheckUtils]: 29: Hoare triple {30044#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {30045#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:24,274 INFO L273 TraceCheckUtils]: 30: Hoare triple {30045#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30045#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:24,274 INFO L273 TraceCheckUtils]: 31: Hoare triple {30045#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30045#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:24,275 INFO L273 TraceCheckUtils]: 32: Hoare triple {30045#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {30046#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:24,275 INFO L273 TraceCheckUtils]: 33: Hoare triple {30046#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30046#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:24,276 INFO L273 TraceCheckUtils]: 34: Hoare triple {30046#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30046#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:24,277 INFO L273 TraceCheckUtils]: 35: Hoare triple {30046#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {30047#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:24,277 INFO L273 TraceCheckUtils]: 36: Hoare triple {30047#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30047#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:24,278 INFO L273 TraceCheckUtils]: 37: Hoare triple {30047#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30047#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:24,278 INFO L273 TraceCheckUtils]: 38: Hoare triple {30047#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {30048#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:24,279 INFO L273 TraceCheckUtils]: 39: Hoare triple {30048#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30048#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:24,279 INFO L273 TraceCheckUtils]: 40: Hoare triple {30048#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30048#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:24,280 INFO L273 TraceCheckUtils]: 41: Hoare triple {30048#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {30049#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:24,281 INFO L273 TraceCheckUtils]: 42: Hoare triple {30049#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30049#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:24,281 INFO L273 TraceCheckUtils]: 43: Hoare triple {30049#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30049#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:24,282 INFO L273 TraceCheckUtils]: 44: Hoare triple {30049#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {30050#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:24,282 INFO L273 TraceCheckUtils]: 45: Hoare triple {30050#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30050#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:24,283 INFO L273 TraceCheckUtils]: 46: Hoare triple {30050#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30050#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:24,283 INFO L273 TraceCheckUtils]: 47: Hoare triple {30050#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {30051#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:24,284 INFO L273 TraceCheckUtils]: 48: Hoare triple {30051#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30051#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:24,284 INFO L273 TraceCheckUtils]: 49: Hoare triple {30051#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30051#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:24,285 INFO L273 TraceCheckUtils]: 50: Hoare triple {30051#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {30052#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:24,286 INFO L273 TraceCheckUtils]: 51: Hoare triple {30052#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30052#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:24,286 INFO L273 TraceCheckUtils]: 52: Hoare triple {30052#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30052#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:24,287 INFO L273 TraceCheckUtils]: 53: Hoare triple {30052#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {30053#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:24,287 INFO L273 TraceCheckUtils]: 54: Hoare triple {30053#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30053#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:24,288 INFO L273 TraceCheckUtils]: 55: Hoare triple {30053#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30053#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:24,289 INFO L273 TraceCheckUtils]: 56: Hoare triple {30053#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {30054#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:24,289 INFO L273 TraceCheckUtils]: 57: Hoare triple {30054#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30054#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:24,290 INFO L273 TraceCheckUtils]: 58: Hoare triple {30054#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30054#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:24,290 INFO L273 TraceCheckUtils]: 59: Hoare triple {30054#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {30055#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:24,291 INFO L273 TraceCheckUtils]: 60: Hoare triple {30055#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30055#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:24,291 INFO L273 TraceCheckUtils]: 61: Hoare triple {30055#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30055#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:24,292 INFO L273 TraceCheckUtils]: 62: Hoare triple {30055#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {30056#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:24,292 INFO L273 TraceCheckUtils]: 63: Hoare triple {30056#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30056#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:24,293 INFO L273 TraceCheckUtils]: 64: Hoare triple {30056#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30056#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:24,294 INFO L273 TraceCheckUtils]: 65: Hoare triple {30056#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {30057#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:24,294 INFO L273 TraceCheckUtils]: 66: Hoare triple {30057#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30057#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:24,295 INFO L273 TraceCheckUtils]: 67: Hoare triple {30057#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30057#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:24,295 INFO L273 TraceCheckUtils]: 68: Hoare triple {30057#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {30058#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:24,296 INFO L273 TraceCheckUtils]: 69: Hoare triple {30058#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30058#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:24,296 INFO L273 TraceCheckUtils]: 70: Hoare triple {30058#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30058#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:24,297 INFO L273 TraceCheckUtils]: 71: Hoare triple {30058#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {30059#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:24,298 INFO L273 TraceCheckUtils]: 72: Hoare triple {30059#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30059#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:24,298 INFO L273 TraceCheckUtils]: 73: Hoare triple {30059#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30059#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:24,299 INFO L273 TraceCheckUtils]: 74: Hoare triple {30059#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {30060#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:24,299 INFO L273 TraceCheckUtils]: 75: Hoare triple {30060#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30060#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:24,300 INFO L273 TraceCheckUtils]: 76: Hoare triple {30060#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30060#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:24,301 INFO L273 TraceCheckUtils]: 77: Hoare triple {30060#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {30061#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:24,301 INFO L273 TraceCheckUtils]: 78: Hoare triple {30061#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30061#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:24,302 INFO L273 TraceCheckUtils]: 79: Hoare triple {30061#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30061#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:24,302 INFO L273 TraceCheckUtils]: 80: Hoare triple {30061#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {30062#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:24,303 INFO L273 TraceCheckUtils]: 81: Hoare triple {30062#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30062#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:24,303 INFO L273 TraceCheckUtils]: 82: Hoare triple {30062#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30062#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:24,304 INFO L273 TraceCheckUtils]: 83: Hoare triple {30062#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {30063#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:24,304 INFO L273 TraceCheckUtils]: 84: Hoare triple {30063#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30063#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:24,305 INFO L273 TraceCheckUtils]: 85: Hoare triple {30063#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30063#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:24,306 INFO L273 TraceCheckUtils]: 86: Hoare triple {30063#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {30064#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:24,306 INFO L273 TraceCheckUtils]: 87: Hoare triple {30064#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30064#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:24,307 INFO L273 TraceCheckUtils]: 88: Hoare triple {30064#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30064#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:24,307 INFO L273 TraceCheckUtils]: 89: Hoare triple {30064#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {30065#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:24,308 INFO L273 TraceCheckUtils]: 90: Hoare triple {30065#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30065#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:24,308 INFO L273 TraceCheckUtils]: 91: Hoare triple {30065#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30065#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:24,309 INFO L273 TraceCheckUtils]: 92: Hoare triple {30065#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {30066#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:24,310 INFO L273 TraceCheckUtils]: 93: Hoare triple {30066#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30066#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:24,310 INFO L273 TraceCheckUtils]: 94: Hoare triple {30066#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30066#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:24,311 INFO L273 TraceCheckUtils]: 95: Hoare triple {30066#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {30067#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:24,311 INFO L273 TraceCheckUtils]: 96: Hoare triple {30067#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30067#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:24,312 INFO L273 TraceCheckUtils]: 97: Hoare triple {30067#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30067#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:24,313 INFO L273 TraceCheckUtils]: 98: Hoare triple {30067#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {30068#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:24,313 INFO L273 TraceCheckUtils]: 99: Hoare triple {30068#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30068#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:24,314 INFO L273 TraceCheckUtils]: 100: Hoare triple {30068#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30068#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:24,314 INFO L273 TraceCheckUtils]: 101: Hoare triple {30068#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {30069#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:24,315 INFO L273 TraceCheckUtils]: 102: Hoare triple {30069#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30069#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:24,315 INFO L273 TraceCheckUtils]: 103: Hoare triple {30069#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30069#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:24,316 INFO L273 TraceCheckUtils]: 104: Hoare triple {30069#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {30070#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:24,316 INFO L273 TraceCheckUtils]: 105: Hoare triple {30070#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30070#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:24,317 INFO L273 TraceCheckUtils]: 106: Hoare triple {30070#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30070#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:24,318 INFO L273 TraceCheckUtils]: 107: Hoare triple {30070#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {30071#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:24,318 INFO L273 TraceCheckUtils]: 108: Hoare triple {30071#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30071#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:24,319 INFO L273 TraceCheckUtils]: 109: Hoare triple {30071#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30071#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:24,319 INFO L273 TraceCheckUtils]: 110: Hoare triple {30071#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {30072#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:24,320 INFO L273 TraceCheckUtils]: 111: Hoare triple {30072#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30072#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:24,320 INFO L273 TraceCheckUtils]: 112: Hoare triple {30072#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30072#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:24,321 INFO L273 TraceCheckUtils]: 113: Hoare triple {30072#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {30073#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:24,322 INFO L273 TraceCheckUtils]: 114: Hoare triple {30073#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30073#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:24,322 INFO L273 TraceCheckUtils]: 115: Hoare triple {30073#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30073#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:24,323 INFO L273 TraceCheckUtils]: 116: Hoare triple {30073#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {30074#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:24,323 INFO L273 TraceCheckUtils]: 117: Hoare triple {30074#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30074#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:24,324 INFO L273 TraceCheckUtils]: 118: Hoare triple {30074#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30074#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:24,324 INFO L273 TraceCheckUtils]: 119: Hoare triple {30074#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {30075#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:24,325 INFO L273 TraceCheckUtils]: 120: Hoare triple {30075#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30075#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:24,325 INFO L273 TraceCheckUtils]: 121: Hoare triple {30075#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30075#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:24,326 INFO L273 TraceCheckUtils]: 122: Hoare triple {30075#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {30076#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:24,327 INFO L273 TraceCheckUtils]: 123: Hoare triple {30076#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30076#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:24,327 INFO L273 TraceCheckUtils]: 124: Hoare triple {30076#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30076#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:24,328 INFO L273 TraceCheckUtils]: 125: Hoare triple {30076#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {30077#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:24,328 INFO L273 TraceCheckUtils]: 126: Hoare triple {30077#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30077#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:24,329 INFO L273 TraceCheckUtils]: 127: Hoare triple {30077#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30077#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:24,330 INFO L273 TraceCheckUtils]: 128: Hoare triple {30077#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {30078#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:24,330 INFO L273 TraceCheckUtils]: 129: Hoare triple {30078#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30078#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:24,331 INFO L273 TraceCheckUtils]: 130: Hoare triple {30078#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30078#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:24,331 INFO L273 TraceCheckUtils]: 131: Hoare triple {30078#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {30079#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:24,332 INFO L273 TraceCheckUtils]: 132: Hoare triple {30079#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30079#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:24,332 INFO L273 TraceCheckUtils]: 133: Hoare triple {30079#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30079#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:24,333 INFO L273 TraceCheckUtils]: 134: Hoare triple {30079#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {30080#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:24,334 INFO L273 TraceCheckUtils]: 135: Hoare triple {30080#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30080#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:24,334 INFO L273 TraceCheckUtils]: 136: Hoare triple {30080#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30080#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:24,335 INFO L273 TraceCheckUtils]: 137: Hoare triple {30080#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {30081#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:24,335 INFO L273 TraceCheckUtils]: 138: Hoare triple {30081#(<= main_~i~0 44)} assume !(~i~0 < 100000); {30036#false} is VALID [2018-11-23 12:06:24,336 INFO L273 TraceCheckUtils]: 139: Hoare triple {30036#false} havoc ~x~0;~x~0 := 0; {30036#false} is VALID [2018-11-23 12:06:24,336 INFO L273 TraceCheckUtils]: 140: Hoare triple {30036#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {30036#false} is VALID [2018-11-23 12:06:24,336 INFO L256 TraceCheckUtils]: 141: Hoare triple {30036#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {30036#false} is VALID [2018-11-23 12:06:24,336 INFO L273 TraceCheckUtils]: 142: Hoare triple {30036#false} ~cond := #in~cond; {30036#false} is VALID [2018-11-23 12:06:24,336 INFO L273 TraceCheckUtils]: 143: Hoare triple {30036#false} assume 0 == ~cond; {30036#false} is VALID [2018-11-23 12:06:24,336 INFO L273 TraceCheckUtils]: 144: Hoare triple {30036#false} assume !false; {30036#false} is VALID [2018-11-23 12:06:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:24,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:24,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:24,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:24,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:24,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:24,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:24,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {30035#true} call ULTIMATE.init(); {30035#true} is VALID [2018-11-23 12:06:24,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {30035#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30035#true} is VALID [2018-11-23 12:06:24,892 INFO L273 TraceCheckUtils]: 2: Hoare triple {30035#true} assume true; {30035#true} is VALID [2018-11-23 12:06:24,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30035#true} {30035#true} #55#return; {30035#true} is VALID [2018-11-23 12:06:24,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {30035#true} call #t~ret4 := main(); {30035#true} is VALID [2018-11-23 12:06:24,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {30035#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {30100#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:24,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {30100#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30100#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:24,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {30100#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30100#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:24,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {30100#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {30038#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:24,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {30038#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30038#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:24,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {30038#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30038#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:24,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {30038#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {30039#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:24,896 INFO L273 TraceCheckUtils]: 12: Hoare triple {30039#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30039#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:24,897 INFO L273 TraceCheckUtils]: 13: Hoare triple {30039#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30039#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:24,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {30039#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {30040#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:24,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {30040#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30040#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:24,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {30040#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30040#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:24,899 INFO L273 TraceCheckUtils]: 17: Hoare triple {30040#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {30041#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:24,900 INFO L273 TraceCheckUtils]: 18: Hoare triple {30041#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30041#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:24,900 INFO L273 TraceCheckUtils]: 19: Hoare triple {30041#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30041#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:24,901 INFO L273 TraceCheckUtils]: 20: Hoare triple {30041#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {30042#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:24,901 INFO L273 TraceCheckUtils]: 21: Hoare triple {30042#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30042#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:24,902 INFO L273 TraceCheckUtils]: 22: Hoare triple {30042#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30042#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:24,903 INFO L273 TraceCheckUtils]: 23: Hoare triple {30042#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {30043#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:24,903 INFO L273 TraceCheckUtils]: 24: Hoare triple {30043#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30043#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:24,904 INFO L273 TraceCheckUtils]: 25: Hoare triple {30043#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30043#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:24,904 INFO L273 TraceCheckUtils]: 26: Hoare triple {30043#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {30044#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:24,905 INFO L273 TraceCheckUtils]: 27: Hoare triple {30044#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30044#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:24,905 INFO L273 TraceCheckUtils]: 28: Hoare triple {30044#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30044#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:24,906 INFO L273 TraceCheckUtils]: 29: Hoare triple {30044#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {30045#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:24,906 INFO L273 TraceCheckUtils]: 30: Hoare triple {30045#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30045#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:24,907 INFO L273 TraceCheckUtils]: 31: Hoare triple {30045#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30045#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:24,908 INFO L273 TraceCheckUtils]: 32: Hoare triple {30045#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {30046#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:24,908 INFO L273 TraceCheckUtils]: 33: Hoare triple {30046#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30046#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:24,909 INFO L273 TraceCheckUtils]: 34: Hoare triple {30046#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30046#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:24,909 INFO L273 TraceCheckUtils]: 35: Hoare triple {30046#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {30047#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:24,910 INFO L273 TraceCheckUtils]: 36: Hoare triple {30047#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30047#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:24,910 INFO L273 TraceCheckUtils]: 37: Hoare triple {30047#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30047#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:24,911 INFO L273 TraceCheckUtils]: 38: Hoare triple {30047#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {30048#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:24,912 INFO L273 TraceCheckUtils]: 39: Hoare triple {30048#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30048#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:24,912 INFO L273 TraceCheckUtils]: 40: Hoare triple {30048#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30048#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:24,913 INFO L273 TraceCheckUtils]: 41: Hoare triple {30048#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {30049#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:24,913 INFO L273 TraceCheckUtils]: 42: Hoare triple {30049#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30049#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:24,914 INFO L273 TraceCheckUtils]: 43: Hoare triple {30049#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30049#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:24,914 INFO L273 TraceCheckUtils]: 44: Hoare triple {30049#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {30050#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:24,915 INFO L273 TraceCheckUtils]: 45: Hoare triple {30050#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30050#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:24,915 INFO L273 TraceCheckUtils]: 46: Hoare triple {30050#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30050#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:24,916 INFO L273 TraceCheckUtils]: 47: Hoare triple {30050#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {30051#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:24,917 INFO L273 TraceCheckUtils]: 48: Hoare triple {30051#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30051#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:24,917 INFO L273 TraceCheckUtils]: 49: Hoare triple {30051#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30051#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:24,918 INFO L273 TraceCheckUtils]: 50: Hoare triple {30051#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {30052#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:24,918 INFO L273 TraceCheckUtils]: 51: Hoare triple {30052#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30052#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:24,919 INFO L273 TraceCheckUtils]: 52: Hoare triple {30052#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30052#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:24,920 INFO L273 TraceCheckUtils]: 53: Hoare triple {30052#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {30053#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:24,920 INFO L273 TraceCheckUtils]: 54: Hoare triple {30053#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30053#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:24,921 INFO L273 TraceCheckUtils]: 55: Hoare triple {30053#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30053#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:24,921 INFO L273 TraceCheckUtils]: 56: Hoare triple {30053#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {30054#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:24,922 INFO L273 TraceCheckUtils]: 57: Hoare triple {30054#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30054#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:24,922 INFO L273 TraceCheckUtils]: 58: Hoare triple {30054#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30054#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:24,923 INFO L273 TraceCheckUtils]: 59: Hoare triple {30054#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {30055#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:24,924 INFO L273 TraceCheckUtils]: 60: Hoare triple {30055#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30055#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:24,924 INFO L273 TraceCheckUtils]: 61: Hoare triple {30055#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30055#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:24,925 INFO L273 TraceCheckUtils]: 62: Hoare triple {30055#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {30056#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:24,925 INFO L273 TraceCheckUtils]: 63: Hoare triple {30056#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30056#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:24,926 INFO L273 TraceCheckUtils]: 64: Hoare triple {30056#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30056#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:24,926 INFO L273 TraceCheckUtils]: 65: Hoare triple {30056#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {30057#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:24,927 INFO L273 TraceCheckUtils]: 66: Hoare triple {30057#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30057#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:24,927 INFO L273 TraceCheckUtils]: 67: Hoare triple {30057#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30057#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:24,928 INFO L273 TraceCheckUtils]: 68: Hoare triple {30057#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {30058#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:24,929 INFO L273 TraceCheckUtils]: 69: Hoare triple {30058#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30058#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:24,929 INFO L273 TraceCheckUtils]: 70: Hoare triple {30058#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30058#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:24,930 INFO L273 TraceCheckUtils]: 71: Hoare triple {30058#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {30059#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:24,930 INFO L273 TraceCheckUtils]: 72: Hoare triple {30059#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30059#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:24,931 INFO L273 TraceCheckUtils]: 73: Hoare triple {30059#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30059#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:24,932 INFO L273 TraceCheckUtils]: 74: Hoare triple {30059#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {30060#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:24,932 INFO L273 TraceCheckUtils]: 75: Hoare triple {30060#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30060#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:24,933 INFO L273 TraceCheckUtils]: 76: Hoare triple {30060#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30060#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:24,933 INFO L273 TraceCheckUtils]: 77: Hoare triple {30060#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {30061#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:24,934 INFO L273 TraceCheckUtils]: 78: Hoare triple {30061#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30061#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:24,934 INFO L273 TraceCheckUtils]: 79: Hoare triple {30061#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30061#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:24,935 INFO L273 TraceCheckUtils]: 80: Hoare triple {30061#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {30062#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:24,935 INFO L273 TraceCheckUtils]: 81: Hoare triple {30062#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30062#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:24,936 INFO L273 TraceCheckUtils]: 82: Hoare triple {30062#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30062#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:24,937 INFO L273 TraceCheckUtils]: 83: Hoare triple {30062#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {30063#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:24,937 INFO L273 TraceCheckUtils]: 84: Hoare triple {30063#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30063#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:24,938 INFO L273 TraceCheckUtils]: 85: Hoare triple {30063#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30063#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:24,938 INFO L273 TraceCheckUtils]: 86: Hoare triple {30063#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {30064#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:24,939 INFO L273 TraceCheckUtils]: 87: Hoare triple {30064#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30064#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:24,939 INFO L273 TraceCheckUtils]: 88: Hoare triple {30064#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30064#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:24,940 INFO L273 TraceCheckUtils]: 89: Hoare triple {30064#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {30065#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:24,941 INFO L273 TraceCheckUtils]: 90: Hoare triple {30065#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30065#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:24,941 INFO L273 TraceCheckUtils]: 91: Hoare triple {30065#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30065#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:24,942 INFO L273 TraceCheckUtils]: 92: Hoare triple {30065#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {30066#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:24,942 INFO L273 TraceCheckUtils]: 93: Hoare triple {30066#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30066#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:24,943 INFO L273 TraceCheckUtils]: 94: Hoare triple {30066#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30066#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:24,943 INFO L273 TraceCheckUtils]: 95: Hoare triple {30066#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {30067#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:24,944 INFO L273 TraceCheckUtils]: 96: Hoare triple {30067#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30067#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:24,944 INFO L273 TraceCheckUtils]: 97: Hoare triple {30067#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30067#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:24,945 INFO L273 TraceCheckUtils]: 98: Hoare triple {30067#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {30068#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:24,946 INFO L273 TraceCheckUtils]: 99: Hoare triple {30068#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30068#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:24,946 INFO L273 TraceCheckUtils]: 100: Hoare triple {30068#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30068#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:24,947 INFO L273 TraceCheckUtils]: 101: Hoare triple {30068#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {30069#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:24,947 INFO L273 TraceCheckUtils]: 102: Hoare triple {30069#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30069#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:24,948 INFO L273 TraceCheckUtils]: 103: Hoare triple {30069#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30069#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:24,949 INFO L273 TraceCheckUtils]: 104: Hoare triple {30069#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {30070#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:24,949 INFO L273 TraceCheckUtils]: 105: Hoare triple {30070#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30070#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:24,950 INFO L273 TraceCheckUtils]: 106: Hoare triple {30070#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30070#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:24,950 INFO L273 TraceCheckUtils]: 107: Hoare triple {30070#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {30071#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:24,951 INFO L273 TraceCheckUtils]: 108: Hoare triple {30071#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30071#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:24,951 INFO L273 TraceCheckUtils]: 109: Hoare triple {30071#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30071#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:24,952 INFO L273 TraceCheckUtils]: 110: Hoare triple {30071#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {30072#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:24,953 INFO L273 TraceCheckUtils]: 111: Hoare triple {30072#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30072#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:24,953 INFO L273 TraceCheckUtils]: 112: Hoare triple {30072#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30072#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:24,954 INFO L273 TraceCheckUtils]: 113: Hoare triple {30072#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {30073#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:24,954 INFO L273 TraceCheckUtils]: 114: Hoare triple {30073#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30073#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:24,955 INFO L273 TraceCheckUtils]: 115: Hoare triple {30073#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30073#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:24,955 INFO L273 TraceCheckUtils]: 116: Hoare triple {30073#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {30074#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:24,956 INFO L273 TraceCheckUtils]: 117: Hoare triple {30074#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30074#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:24,956 INFO L273 TraceCheckUtils]: 118: Hoare triple {30074#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30074#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:24,957 INFO L273 TraceCheckUtils]: 119: Hoare triple {30074#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {30075#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:24,958 INFO L273 TraceCheckUtils]: 120: Hoare triple {30075#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30075#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:24,958 INFO L273 TraceCheckUtils]: 121: Hoare triple {30075#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30075#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:24,959 INFO L273 TraceCheckUtils]: 122: Hoare triple {30075#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {30076#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:24,959 INFO L273 TraceCheckUtils]: 123: Hoare triple {30076#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30076#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:24,960 INFO L273 TraceCheckUtils]: 124: Hoare triple {30076#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30076#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:24,961 INFO L273 TraceCheckUtils]: 125: Hoare triple {30076#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {30077#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:24,961 INFO L273 TraceCheckUtils]: 126: Hoare triple {30077#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30077#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:24,962 INFO L273 TraceCheckUtils]: 127: Hoare triple {30077#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30077#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:24,962 INFO L273 TraceCheckUtils]: 128: Hoare triple {30077#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {30078#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:24,963 INFO L273 TraceCheckUtils]: 129: Hoare triple {30078#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30078#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:24,963 INFO L273 TraceCheckUtils]: 130: Hoare triple {30078#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30078#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:24,964 INFO L273 TraceCheckUtils]: 131: Hoare triple {30078#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {30079#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:24,964 INFO L273 TraceCheckUtils]: 132: Hoare triple {30079#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30079#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:24,965 INFO L273 TraceCheckUtils]: 133: Hoare triple {30079#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30079#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:24,966 INFO L273 TraceCheckUtils]: 134: Hoare triple {30079#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {30080#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:24,966 INFO L273 TraceCheckUtils]: 135: Hoare triple {30080#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30080#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:24,967 INFO L273 TraceCheckUtils]: 136: Hoare triple {30080#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {30080#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:24,967 INFO L273 TraceCheckUtils]: 137: Hoare triple {30080#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {30081#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:24,968 INFO L273 TraceCheckUtils]: 138: Hoare triple {30081#(<= main_~i~0 44)} assume !(~i~0 < 100000); {30036#false} is VALID [2018-11-23 12:06:24,968 INFO L273 TraceCheckUtils]: 139: Hoare triple {30036#false} havoc ~x~0;~x~0 := 0; {30036#false} is VALID [2018-11-23 12:06:24,968 INFO L273 TraceCheckUtils]: 140: Hoare triple {30036#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {30036#false} is VALID [2018-11-23 12:06:24,969 INFO L256 TraceCheckUtils]: 141: Hoare triple {30036#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {30036#false} is VALID [2018-11-23 12:06:24,969 INFO L273 TraceCheckUtils]: 142: Hoare triple {30036#false} ~cond := #in~cond; {30036#false} is VALID [2018-11-23 12:06:24,969 INFO L273 TraceCheckUtils]: 143: Hoare triple {30036#false} assume 0 == ~cond; {30036#false} is VALID [2018-11-23 12:06:24,969 INFO L273 TraceCheckUtils]: 144: Hoare triple {30036#false} assume !false; {30036#false} is VALID [2018-11-23 12:06:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:25,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:25,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2018-11-23 12:06:25,002 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 145 [2018-11-23 12:06:25,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:25,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:06:25,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:25,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:06:25,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:06:25,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:06:25,148 INFO L87 Difference]: Start difference. First operand 150 states and 195 transitions. Second operand 48 states. [2018-11-23 12:06:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:25,672 INFO L93 Difference]: Finished difference Result 166 states and 214 transitions. [2018-11-23 12:06:25,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 12:06:25,672 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 145 [2018-11-23 12:06:25,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:06:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 214 transitions. [2018-11-23 12:06:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:06:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 214 transitions. [2018-11-23 12:06:25,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 214 transitions. [2018-11-23 12:06:25,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:25,877 INFO L225 Difference]: With dead ends: 166 [2018-11-23 12:06:25,877 INFO L226 Difference]: Without dead ends: 155 [2018-11-23 12:06:25,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:06:25,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-23 12:06:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-11-23 12:06:25,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:25,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 153 states. [2018-11-23 12:06:25,916 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 153 states. [2018-11-23 12:06:25,916 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 153 states. [2018-11-23 12:06:25,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:25,919 INFO L93 Difference]: Finished difference Result 155 states and 202 transitions. [2018-11-23 12:06:25,919 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 202 transitions. [2018-11-23 12:06:25,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:25,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:25,920 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 155 states. [2018-11-23 12:06:25,920 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 155 states. [2018-11-23 12:06:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:25,922 INFO L93 Difference]: Finished difference Result 155 states and 202 transitions. [2018-11-23 12:06:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 202 transitions. [2018-11-23 12:06:25,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:25,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:25,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:25,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 12:06:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 199 transitions. [2018-11-23 12:06:25,924 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 199 transitions. Word has length 145 [2018-11-23 12:06:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:25,924 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 199 transitions. [2018-11-23 12:06:25,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:06:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 199 transitions. [2018-11-23 12:06:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:06:25,925 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:25,925 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:25,925 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:25,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:25,925 INFO L82 PathProgramCache]: Analyzing trace with hash 819876451, now seen corresponding path program 45 times [2018-11-23 12:06:25,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:25,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:25,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:25,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:25,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:27,186 INFO L256 TraceCheckUtils]: 0: Hoare triple {31255#true} call ULTIMATE.init(); {31255#true} is VALID [2018-11-23 12:06:27,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {31255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31255#true} is VALID [2018-11-23 12:06:27,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {31255#true} assume true; {31255#true} is VALID [2018-11-23 12:06:27,186 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31255#true} {31255#true} #55#return; {31255#true} is VALID [2018-11-23 12:06:27,187 INFO L256 TraceCheckUtils]: 4: Hoare triple {31255#true} call #t~ret4 := main(); {31255#true} is VALID [2018-11-23 12:06:27,187 INFO L273 TraceCheckUtils]: 5: Hoare triple {31255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {31257#(= main_~i~0 0)} is VALID [2018-11-23 12:06:27,188 INFO L273 TraceCheckUtils]: 6: Hoare triple {31257#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31257#(= main_~i~0 0)} is VALID [2018-11-23 12:06:27,188 INFO L273 TraceCheckUtils]: 7: Hoare triple {31257#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31257#(= main_~i~0 0)} is VALID [2018-11-23 12:06:27,189 INFO L273 TraceCheckUtils]: 8: Hoare triple {31257#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {31258#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:27,189 INFO L273 TraceCheckUtils]: 9: Hoare triple {31258#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31258#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:27,190 INFO L273 TraceCheckUtils]: 10: Hoare triple {31258#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31258#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:27,190 INFO L273 TraceCheckUtils]: 11: Hoare triple {31258#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {31259#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:27,191 INFO L273 TraceCheckUtils]: 12: Hoare triple {31259#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31259#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:27,191 INFO L273 TraceCheckUtils]: 13: Hoare triple {31259#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31259#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:27,192 INFO L273 TraceCheckUtils]: 14: Hoare triple {31259#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {31260#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:27,193 INFO L273 TraceCheckUtils]: 15: Hoare triple {31260#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31260#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:27,193 INFO L273 TraceCheckUtils]: 16: Hoare triple {31260#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31260#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:27,194 INFO L273 TraceCheckUtils]: 17: Hoare triple {31260#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {31261#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:27,194 INFO L273 TraceCheckUtils]: 18: Hoare triple {31261#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31261#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:27,195 INFO L273 TraceCheckUtils]: 19: Hoare triple {31261#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31261#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:27,196 INFO L273 TraceCheckUtils]: 20: Hoare triple {31261#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {31262#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:27,196 INFO L273 TraceCheckUtils]: 21: Hoare triple {31262#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31262#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:27,197 INFO L273 TraceCheckUtils]: 22: Hoare triple {31262#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31262#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:27,197 INFO L273 TraceCheckUtils]: 23: Hoare triple {31262#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {31263#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:27,198 INFO L273 TraceCheckUtils]: 24: Hoare triple {31263#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31263#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:27,198 INFO L273 TraceCheckUtils]: 25: Hoare triple {31263#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31263#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:27,199 INFO L273 TraceCheckUtils]: 26: Hoare triple {31263#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {31264#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:27,199 INFO L273 TraceCheckUtils]: 27: Hoare triple {31264#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31264#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:27,200 INFO L273 TraceCheckUtils]: 28: Hoare triple {31264#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31264#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:27,201 INFO L273 TraceCheckUtils]: 29: Hoare triple {31264#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {31265#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:27,201 INFO L273 TraceCheckUtils]: 30: Hoare triple {31265#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31265#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:27,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {31265#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31265#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:27,202 INFO L273 TraceCheckUtils]: 32: Hoare triple {31265#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {31266#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:27,203 INFO L273 TraceCheckUtils]: 33: Hoare triple {31266#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31266#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:27,203 INFO L273 TraceCheckUtils]: 34: Hoare triple {31266#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31266#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:27,204 INFO L273 TraceCheckUtils]: 35: Hoare triple {31266#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {31267#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:27,205 INFO L273 TraceCheckUtils]: 36: Hoare triple {31267#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31267#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:27,205 INFO L273 TraceCheckUtils]: 37: Hoare triple {31267#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31267#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:27,206 INFO L273 TraceCheckUtils]: 38: Hoare triple {31267#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {31268#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:27,206 INFO L273 TraceCheckUtils]: 39: Hoare triple {31268#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31268#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:27,207 INFO L273 TraceCheckUtils]: 40: Hoare triple {31268#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31268#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:27,207 INFO L273 TraceCheckUtils]: 41: Hoare triple {31268#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {31269#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:27,208 INFO L273 TraceCheckUtils]: 42: Hoare triple {31269#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31269#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:27,208 INFO L273 TraceCheckUtils]: 43: Hoare triple {31269#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31269#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:27,209 INFO L273 TraceCheckUtils]: 44: Hoare triple {31269#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {31270#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:27,210 INFO L273 TraceCheckUtils]: 45: Hoare triple {31270#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31270#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:27,210 INFO L273 TraceCheckUtils]: 46: Hoare triple {31270#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31270#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:27,211 INFO L273 TraceCheckUtils]: 47: Hoare triple {31270#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {31271#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:27,211 INFO L273 TraceCheckUtils]: 48: Hoare triple {31271#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31271#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:27,212 INFO L273 TraceCheckUtils]: 49: Hoare triple {31271#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31271#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:27,213 INFO L273 TraceCheckUtils]: 50: Hoare triple {31271#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {31272#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:27,213 INFO L273 TraceCheckUtils]: 51: Hoare triple {31272#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31272#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:27,214 INFO L273 TraceCheckUtils]: 52: Hoare triple {31272#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31272#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:27,214 INFO L273 TraceCheckUtils]: 53: Hoare triple {31272#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {31273#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:27,215 INFO L273 TraceCheckUtils]: 54: Hoare triple {31273#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31273#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:27,215 INFO L273 TraceCheckUtils]: 55: Hoare triple {31273#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31273#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:27,216 INFO L273 TraceCheckUtils]: 56: Hoare triple {31273#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {31274#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:27,217 INFO L273 TraceCheckUtils]: 57: Hoare triple {31274#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31274#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:27,217 INFO L273 TraceCheckUtils]: 58: Hoare triple {31274#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31274#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:27,218 INFO L273 TraceCheckUtils]: 59: Hoare triple {31274#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {31275#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:27,218 INFO L273 TraceCheckUtils]: 60: Hoare triple {31275#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31275#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:27,219 INFO L273 TraceCheckUtils]: 61: Hoare triple {31275#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31275#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:27,219 INFO L273 TraceCheckUtils]: 62: Hoare triple {31275#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {31276#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:27,220 INFO L273 TraceCheckUtils]: 63: Hoare triple {31276#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31276#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:27,220 INFO L273 TraceCheckUtils]: 64: Hoare triple {31276#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31276#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:27,221 INFO L273 TraceCheckUtils]: 65: Hoare triple {31276#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {31277#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:27,222 INFO L273 TraceCheckUtils]: 66: Hoare triple {31277#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31277#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:27,222 INFO L273 TraceCheckUtils]: 67: Hoare triple {31277#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31277#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:27,223 INFO L273 TraceCheckUtils]: 68: Hoare triple {31277#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {31278#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:27,223 INFO L273 TraceCheckUtils]: 69: Hoare triple {31278#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31278#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:27,224 INFO L273 TraceCheckUtils]: 70: Hoare triple {31278#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31278#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:27,225 INFO L273 TraceCheckUtils]: 71: Hoare triple {31278#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {31279#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:27,225 INFO L273 TraceCheckUtils]: 72: Hoare triple {31279#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31279#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:27,226 INFO L273 TraceCheckUtils]: 73: Hoare triple {31279#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31279#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:27,226 INFO L273 TraceCheckUtils]: 74: Hoare triple {31279#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {31280#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:27,227 INFO L273 TraceCheckUtils]: 75: Hoare triple {31280#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31280#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:27,227 INFO L273 TraceCheckUtils]: 76: Hoare triple {31280#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31280#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:27,228 INFO L273 TraceCheckUtils]: 77: Hoare triple {31280#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {31281#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:27,228 INFO L273 TraceCheckUtils]: 78: Hoare triple {31281#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31281#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:27,229 INFO L273 TraceCheckUtils]: 79: Hoare triple {31281#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31281#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:27,230 INFO L273 TraceCheckUtils]: 80: Hoare triple {31281#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {31282#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:27,230 INFO L273 TraceCheckUtils]: 81: Hoare triple {31282#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31282#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:27,231 INFO L273 TraceCheckUtils]: 82: Hoare triple {31282#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31282#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:27,231 INFO L273 TraceCheckUtils]: 83: Hoare triple {31282#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {31283#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:27,232 INFO L273 TraceCheckUtils]: 84: Hoare triple {31283#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31283#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:27,232 INFO L273 TraceCheckUtils]: 85: Hoare triple {31283#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31283#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:27,233 INFO L273 TraceCheckUtils]: 86: Hoare triple {31283#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {31284#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:27,234 INFO L273 TraceCheckUtils]: 87: Hoare triple {31284#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31284#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:27,234 INFO L273 TraceCheckUtils]: 88: Hoare triple {31284#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31284#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:27,235 INFO L273 TraceCheckUtils]: 89: Hoare triple {31284#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {31285#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:27,235 INFO L273 TraceCheckUtils]: 90: Hoare triple {31285#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31285#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:27,236 INFO L273 TraceCheckUtils]: 91: Hoare triple {31285#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31285#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:27,236 INFO L273 TraceCheckUtils]: 92: Hoare triple {31285#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {31286#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:27,237 INFO L273 TraceCheckUtils]: 93: Hoare triple {31286#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31286#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:27,237 INFO L273 TraceCheckUtils]: 94: Hoare triple {31286#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31286#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:27,238 INFO L273 TraceCheckUtils]: 95: Hoare triple {31286#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {31287#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:27,239 INFO L273 TraceCheckUtils]: 96: Hoare triple {31287#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31287#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:27,239 INFO L273 TraceCheckUtils]: 97: Hoare triple {31287#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31287#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:27,240 INFO L273 TraceCheckUtils]: 98: Hoare triple {31287#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {31288#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:27,240 INFO L273 TraceCheckUtils]: 99: Hoare triple {31288#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31288#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:27,241 INFO L273 TraceCheckUtils]: 100: Hoare triple {31288#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31288#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:27,242 INFO L273 TraceCheckUtils]: 101: Hoare triple {31288#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {31289#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:27,242 INFO L273 TraceCheckUtils]: 102: Hoare triple {31289#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31289#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:27,243 INFO L273 TraceCheckUtils]: 103: Hoare triple {31289#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31289#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:27,243 INFO L273 TraceCheckUtils]: 104: Hoare triple {31289#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {31290#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:27,244 INFO L273 TraceCheckUtils]: 105: Hoare triple {31290#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31290#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:27,244 INFO L273 TraceCheckUtils]: 106: Hoare triple {31290#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31290#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:27,245 INFO L273 TraceCheckUtils]: 107: Hoare triple {31290#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {31291#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:27,246 INFO L273 TraceCheckUtils]: 108: Hoare triple {31291#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31291#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:27,246 INFO L273 TraceCheckUtils]: 109: Hoare triple {31291#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31291#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:27,247 INFO L273 TraceCheckUtils]: 110: Hoare triple {31291#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {31292#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:27,247 INFO L273 TraceCheckUtils]: 111: Hoare triple {31292#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31292#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:27,248 INFO L273 TraceCheckUtils]: 112: Hoare triple {31292#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31292#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:27,248 INFO L273 TraceCheckUtils]: 113: Hoare triple {31292#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {31293#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:27,249 INFO L273 TraceCheckUtils]: 114: Hoare triple {31293#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31293#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:27,249 INFO L273 TraceCheckUtils]: 115: Hoare triple {31293#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31293#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:27,250 INFO L273 TraceCheckUtils]: 116: Hoare triple {31293#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {31294#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:27,251 INFO L273 TraceCheckUtils]: 117: Hoare triple {31294#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31294#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:27,251 INFO L273 TraceCheckUtils]: 118: Hoare triple {31294#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31294#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:27,252 INFO L273 TraceCheckUtils]: 119: Hoare triple {31294#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {31295#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:27,252 INFO L273 TraceCheckUtils]: 120: Hoare triple {31295#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31295#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:27,253 INFO L273 TraceCheckUtils]: 121: Hoare triple {31295#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31295#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:27,254 INFO L273 TraceCheckUtils]: 122: Hoare triple {31295#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {31296#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:27,254 INFO L273 TraceCheckUtils]: 123: Hoare triple {31296#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31296#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:27,255 INFO L273 TraceCheckUtils]: 124: Hoare triple {31296#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31296#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:27,255 INFO L273 TraceCheckUtils]: 125: Hoare triple {31296#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {31297#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:27,256 INFO L273 TraceCheckUtils]: 126: Hoare triple {31297#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31297#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:27,256 INFO L273 TraceCheckUtils]: 127: Hoare triple {31297#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31297#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:27,257 INFO L273 TraceCheckUtils]: 128: Hoare triple {31297#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {31298#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:27,257 INFO L273 TraceCheckUtils]: 129: Hoare triple {31298#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31298#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:27,258 INFO L273 TraceCheckUtils]: 130: Hoare triple {31298#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31298#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:27,259 INFO L273 TraceCheckUtils]: 131: Hoare triple {31298#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {31299#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:27,259 INFO L273 TraceCheckUtils]: 132: Hoare triple {31299#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31299#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:27,260 INFO L273 TraceCheckUtils]: 133: Hoare triple {31299#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31299#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:27,260 INFO L273 TraceCheckUtils]: 134: Hoare triple {31299#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {31300#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:27,261 INFO L273 TraceCheckUtils]: 135: Hoare triple {31300#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31300#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:27,261 INFO L273 TraceCheckUtils]: 136: Hoare triple {31300#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31300#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:27,262 INFO L273 TraceCheckUtils]: 137: Hoare triple {31300#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {31301#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:27,263 INFO L273 TraceCheckUtils]: 138: Hoare triple {31301#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31301#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:27,263 INFO L273 TraceCheckUtils]: 139: Hoare triple {31301#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31301#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:27,264 INFO L273 TraceCheckUtils]: 140: Hoare triple {31301#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {31302#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:27,264 INFO L273 TraceCheckUtils]: 141: Hoare triple {31302#(<= main_~i~0 45)} assume !(~i~0 < 100000); {31256#false} is VALID [2018-11-23 12:06:27,265 INFO L273 TraceCheckUtils]: 142: Hoare triple {31256#false} havoc ~x~0;~x~0 := 0; {31256#false} is VALID [2018-11-23 12:06:27,265 INFO L273 TraceCheckUtils]: 143: Hoare triple {31256#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {31256#false} is VALID [2018-11-23 12:06:27,265 INFO L256 TraceCheckUtils]: 144: Hoare triple {31256#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {31256#false} is VALID [2018-11-23 12:06:27,265 INFO L273 TraceCheckUtils]: 145: Hoare triple {31256#false} ~cond := #in~cond; {31256#false} is VALID [2018-11-23 12:06:27,265 INFO L273 TraceCheckUtils]: 146: Hoare triple {31256#false} assume 0 == ~cond; {31256#false} is VALID [2018-11-23 12:06:27,266 INFO L273 TraceCheckUtils]: 147: Hoare triple {31256#false} assume !false; {31256#false} is VALID [2018-11-23 12:06:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:27,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:27,280 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:27,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:27,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-11-23 12:06:27,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:27,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:27,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {31255#true} call ULTIMATE.init(); {31255#true} is VALID [2018-11-23 12:06:27,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {31255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31255#true} is VALID [2018-11-23 12:06:27,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {31255#true} assume true; {31255#true} is VALID [2018-11-23 12:06:27,834 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31255#true} {31255#true} #55#return; {31255#true} is VALID [2018-11-23 12:06:27,834 INFO L256 TraceCheckUtils]: 4: Hoare triple {31255#true} call #t~ret4 := main(); {31255#true} is VALID [2018-11-23 12:06:27,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {31255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {31321#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:27,835 INFO L273 TraceCheckUtils]: 6: Hoare triple {31321#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31321#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:27,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {31321#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31321#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:27,836 INFO L273 TraceCheckUtils]: 8: Hoare triple {31321#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {31258#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:27,836 INFO L273 TraceCheckUtils]: 9: Hoare triple {31258#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31258#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:27,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {31258#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31258#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:27,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {31258#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {31259#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:27,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {31259#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31259#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:27,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {31259#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31259#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:27,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {31259#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {31260#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:27,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {31260#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31260#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:27,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {31260#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31260#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:27,840 INFO L273 TraceCheckUtils]: 17: Hoare triple {31260#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {31261#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:27,841 INFO L273 TraceCheckUtils]: 18: Hoare triple {31261#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31261#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:27,841 INFO L273 TraceCheckUtils]: 19: Hoare triple {31261#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31261#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:27,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {31261#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {31262#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:27,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {31262#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31262#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:27,843 INFO L273 TraceCheckUtils]: 22: Hoare triple {31262#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31262#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:27,844 INFO L273 TraceCheckUtils]: 23: Hoare triple {31262#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {31263#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:27,844 INFO L273 TraceCheckUtils]: 24: Hoare triple {31263#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31263#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:27,845 INFO L273 TraceCheckUtils]: 25: Hoare triple {31263#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31263#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:27,846 INFO L273 TraceCheckUtils]: 26: Hoare triple {31263#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {31264#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:27,846 INFO L273 TraceCheckUtils]: 27: Hoare triple {31264#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31264#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:27,847 INFO L273 TraceCheckUtils]: 28: Hoare triple {31264#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31264#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:27,847 INFO L273 TraceCheckUtils]: 29: Hoare triple {31264#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {31265#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:27,848 INFO L273 TraceCheckUtils]: 30: Hoare triple {31265#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31265#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:27,848 INFO L273 TraceCheckUtils]: 31: Hoare triple {31265#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31265#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:27,849 INFO L273 TraceCheckUtils]: 32: Hoare triple {31265#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {31266#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:27,849 INFO L273 TraceCheckUtils]: 33: Hoare triple {31266#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31266#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:27,850 INFO L273 TraceCheckUtils]: 34: Hoare triple {31266#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31266#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:27,851 INFO L273 TraceCheckUtils]: 35: Hoare triple {31266#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {31267#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:27,851 INFO L273 TraceCheckUtils]: 36: Hoare triple {31267#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31267#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:27,852 INFO L273 TraceCheckUtils]: 37: Hoare triple {31267#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31267#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:27,852 INFO L273 TraceCheckUtils]: 38: Hoare triple {31267#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {31268#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:27,853 INFO L273 TraceCheckUtils]: 39: Hoare triple {31268#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31268#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:27,853 INFO L273 TraceCheckUtils]: 40: Hoare triple {31268#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31268#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:27,854 INFO L273 TraceCheckUtils]: 41: Hoare triple {31268#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {31269#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:27,855 INFO L273 TraceCheckUtils]: 42: Hoare triple {31269#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31269#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:27,855 INFO L273 TraceCheckUtils]: 43: Hoare triple {31269#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31269#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:27,856 INFO L273 TraceCheckUtils]: 44: Hoare triple {31269#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {31270#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:27,856 INFO L273 TraceCheckUtils]: 45: Hoare triple {31270#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31270#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:27,857 INFO L273 TraceCheckUtils]: 46: Hoare triple {31270#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31270#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:27,858 INFO L273 TraceCheckUtils]: 47: Hoare triple {31270#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {31271#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:27,858 INFO L273 TraceCheckUtils]: 48: Hoare triple {31271#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31271#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:27,859 INFO L273 TraceCheckUtils]: 49: Hoare triple {31271#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31271#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:27,859 INFO L273 TraceCheckUtils]: 50: Hoare triple {31271#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {31272#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:27,860 INFO L273 TraceCheckUtils]: 51: Hoare triple {31272#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31272#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:27,860 INFO L273 TraceCheckUtils]: 52: Hoare triple {31272#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31272#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:27,861 INFO L273 TraceCheckUtils]: 53: Hoare triple {31272#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {31273#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:27,861 INFO L273 TraceCheckUtils]: 54: Hoare triple {31273#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31273#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:27,862 INFO L273 TraceCheckUtils]: 55: Hoare triple {31273#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31273#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:27,863 INFO L273 TraceCheckUtils]: 56: Hoare triple {31273#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {31274#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:27,863 INFO L273 TraceCheckUtils]: 57: Hoare triple {31274#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31274#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:27,864 INFO L273 TraceCheckUtils]: 58: Hoare triple {31274#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31274#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:27,864 INFO L273 TraceCheckUtils]: 59: Hoare triple {31274#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {31275#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:27,865 INFO L273 TraceCheckUtils]: 60: Hoare triple {31275#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31275#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:27,865 INFO L273 TraceCheckUtils]: 61: Hoare triple {31275#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31275#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:27,866 INFO L273 TraceCheckUtils]: 62: Hoare triple {31275#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {31276#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:27,867 INFO L273 TraceCheckUtils]: 63: Hoare triple {31276#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31276#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:27,867 INFO L273 TraceCheckUtils]: 64: Hoare triple {31276#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31276#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:27,868 INFO L273 TraceCheckUtils]: 65: Hoare triple {31276#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {31277#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:27,868 INFO L273 TraceCheckUtils]: 66: Hoare triple {31277#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31277#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:27,869 INFO L273 TraceCheckUtils]: 67: Hoare triple {31277#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31277#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:27,870 INFO L273 TraceCheckUtils]: 68: Hoare triple {31277#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {31278#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:27,870 INFO L273 TraceCheckUtils]: 69: Hoare triple {31278#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31278#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:27,871 INFO L273 TraceCheckUtils]: 70: Hoare triple {31278#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31278#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:27,871 INFO L273 TraceCheckUtils]: 71: Hoare triple {31278#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {31279#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:27,872 INFO L273 TraceCheckUtils]: 72: Hoare triple {31279#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31279#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:27,872 INFO L273 TraceCheckUtils]: 73: Hoare triple {31279#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31279#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:27,873 INFO L273 TraceCheckUtils]: 74: Hoare triple {31279#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {31280#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:27,874 INFO L273 TraceCheckUtils]: 75: Hoare triple {31280#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31280#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:27,874 INFO L273 TraceCheckUtils]: 76: Hoare triple {31280#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31280#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:27,875 INFO L273 TraceCheckUtils]: 77: Hoare triple {31280#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {31281#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:27,875 INFO L273 TraceCheckUtils]: 78: Hoare triple {31281#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31281#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:27,876 INFO L273 TraceCheckUtils]: 79: Hoare triple {31281#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31281#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:27,876 INFO L273 TraceCheckUtils]: 80: Hoare triple {31281#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {31282#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:27,877 INFO L273 TraceCheckUtils]: 81: Hoare triple {31282#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31282#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:27,877 INFO L273 TraceCheckUtils]: 82: Hoare triple {31282#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31282#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:27,878 INFO L273 TraceCheckUtils]: 83: Hoare triple {31282#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {31283#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:27,878 INFO L273 TraceCheckUtils]: 84: Hoare triple {31283#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31283#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:27,879 INFO L273 TraceCheckUtils]: 85: Hoare triple {31283#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31283#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:27,880 INFO L273 TraceCheckUtils]: 86: Hoare triple {31283#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {31284#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:27,880 INFO L273 TraceCheckUtils]: 87: Hoare triple {31284#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31284#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:27,881 INFO L273 TraceCheckUtils]: 88: Hoare triple {31284#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31284#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:27,881 INFO L273 TraceCheckUtils]: 89: Hoare triple {31284#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {31285#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:27,882 INFO L273 TraceCheckUtils]: 90: Hoare triple {31285#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31285#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:27,882 INFO L273 TraceCheckUtils]: 91: Hoare triple {31285#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31285#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:27,883 INFO L273 TraceCheckUtils]: 92: Hoare triple {31285#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {31286#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:27,883 INFO L273 TraceCheckUtils]: 93: Hoare triple {31286#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31286#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:27,884 INFO L273 TraceCheckUtils]: 94: Hoare triple {31286#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31286#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:27,885 INFO L273 TraceCheckUtils]: 95: Hoare triple {31286#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {31287#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:27,885 INFO L273 TraceCheckUtils]: 96: Hoare triple {31287#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31287#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:27,886 INFO L273 TraceCheckUtils]: 97: Hoare triple {31287#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31287#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:27,886 INFO L273 TraceCheckUtils]: 98: Hoare triple {31287#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {31288#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:27,887 INFO L273 TraceCheckUtils]: 99: Hoare triple {31288#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31288#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:27,887 INFO L273 TraceCheckUtils]: 100: Hoare triple {31288#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31288#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:27,888 INFO L273 TraceCheckUtils]: 101: Hoare triple {31288#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {31289#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:27,888 INFO L273 TraceCheckUtils]: 102: Hoare triple {31289#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31289#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:27,889 INFO L273 TraceCheckUtils]: 103: Hoare triple {31289#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31289#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:27,890 INFO L273 TraceCheckUtils]: 104: Hoare triple {31289#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {31290#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:27,890 INFO L273 TraceCheckUtils]: 105: Hoare triple {31290#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31290#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:27,891 INFO L273 TraceCheckUtils]: 106: Hoare triple {31290#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31290#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:27,891 INFO L273 TraceCheckUtils]: 107: Hoare triple {31290#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {31291#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:27,892 INFO L273 TraceCheckUtils]: 108: Hoare triple {31291#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31291#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:27,892 INFO L273 TraceCheckUtils]: 109: Hoare triple {31291#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31291#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:27,893 INFO L273 TraceCheckUtils]: 110: Hoare triple {31291#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {31292#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:27,893 INFO L273 TraceCheckUtils]: 111: Hoare triple {31292#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31292#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:27,894 INFO L273 TraceCheckUtils]: 112: Hoare triple {31292#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31292#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:27,895 INFO L273 TraceCheckUtils]: 113: Hoare triple {31292#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {31293#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:27,895 INFO L273 TraceCheckUtils]: 114: Hoare triple {31293#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31293#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:27,896 INFO L273 TraceCheckUtils]: 115: Hoare triple {31293#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31293#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:27,896 INFO L273 TraceCheckUtils]: 116: Hoare triple {31293#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {31294#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:27,897 INFO L273 TraceCheckUtils]: 117: Hoare triple {31294#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31294#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:27,897 INFO L273 TraceCheckUtils]: 118: Hoare triple {31294#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31294#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:27,898 INFO L273 TraceCheckUtils]: 119: Hoare triple {31294#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {31295#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:27,899 INFO L273 TraceCheckUtils]: 120: Hoare triple {31295#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31295#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:27,899 INFO L273 TraceCheckUtils]: 121: Hoare triple {31295#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31295#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:27,900 INFO L273 TraceCheckUtils]: 122: Hoare triple {31295#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {31296#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:27,900 INFO L273 TraceCheckUtils]: 123: Hoare triple {31296#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31296#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:27,901 INFO L273 TraceCheckUtils]: 124: Hoare triple {31296#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31296#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:27,901 INFO L273 TraceCheckUtils]: 125: Hoare triple {31296#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {31297#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:27,902 INFO L273 TraceCheckUtils]: 126: Hoare triple {31297#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31297#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:27,902 INFO L273 TraceCheckUtils]: 127: Hoare triple {31297#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31297#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:27,903 INFO L273 TraceCheckUtils]: 128: Hoare triple {31297#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {31298#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:27,904 INFO L273 TraceCheckUtils]: 129: Hoare triple {31298#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31298#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:27,904 INFO L273 TraceCheckUtils]: 130: Hoare triple {31298#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31298#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:27,905 INFO L273 TraceCheckUtils]: 131: Hoare triple {31298#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {31299#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:27,905 INFO L273 TraceCheckUtils]: 132: Hoare triple {31299#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31299#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:27,906 INFO L273 TraceCheckUtils]: 133: Hoare triple {31299#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31299#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:27,907 INFO L273 TraceCheckUtils]: 134: Hoare triple {31299#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {31300#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:27,907 INFO L273 TraceCheckUtils]: 135: Hoare triple {31300#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31300#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:27,908 INFO L273 TraceCheckUtils]: 136: Hoare triple {31300#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31300#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:27,908 INFO L273 TraceCheckUtils]: 137: Hoare triple {31300#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {31301#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:27,909 INFO L273 TraceCheckUtils]: 138: Hoare triple {31301#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31301#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:27,909 INFO L273 TraceCheckUtils]: 139: Hoare triple {31301#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {31301#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:27,910 INFO L273 TraceCheckUtils]: 140: Hoare triple {31301#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {31302#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:27,911 INFO L273 TraceCheckUtils]: 141: Hoare triple {31302#(<= main_~i~0 45)} assume !(~i~0 < 100000); {31256#false} is VALID [2018-11-23 12:06:27,911 INFO L273 TraceCheckUtils]: 142: Hoare triple {31256#false} havoc ~x~0;~x~0 := 0; {31256#false} is VALID [2018-11-23 12:06:27,911 INFO L273 TraceCheckUtils]: 143: Hoare triple {31256#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {31256#false} is VALID [2018-11-23 12:06:27,911 INFO L256 TraceCheckUtils]: 144: Hoare triple {31256#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {31256#false} is VALID [2018-11-23 12:06:27,911 INFO L273 TraceCheckUtils]: 145: Hoare triple {31256#false} ~cond := #in~cond; {31256#false} is VALID [2018-11-23 12:06:27,912 INFO L273 TraceCheckUtils]: 146: Hoare triple {31256#false} assume 0 == ~cond; {31256#false} is VALID [2018-11-23 12:06:27,912 INFO L273 TraceCheckUtils]: 147: Hoare triple {31256#false} assume !false; {31256#false} is VALID [2018-11-23 12:06:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:27,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:27,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-11-23 12:06:27,954 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 148 [2018-11-23 12:06:27,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:27,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:06:28,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:28,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:06:28,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:06:28,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:06:28,175 INFO L87 Difference]: Start difference. First operand 153 states and 199 transitions. Second operand 49 states. [2018-11-23 12:06:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:28,881 INFO L93 Difference]: Finished difference Result 169 states and 218 transitions. [2018-11-23 12:06:28,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:06:28,881 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 148 [2018-11-23 12:06:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:06:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2018-11-23 12:06:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:06:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2018-11-23 12:06:28,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 218 transitions. [2018-11-23 12:06:29,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:29,091 INFO L225 Difference]: With dead ends: 169 [2018-11-23 12:06:29,091 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 12:06:29,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:06:29,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 12:06:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2018-11-23 12:06:29,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:29,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 156 states. [2018-11-23 12:06:29,129 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 156 states. [2018-11-23 12:06:29,129 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 156 states. [2018-11-23 12:06:29,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:29,131 INFO L93 Difference]: Finished difference Result 158 states and 206 transitions. [2018-11-23 12:06:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2018-11-23 12:06:29,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:29,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:29,132 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 158 states. [2018-11-23 12:06:29,132 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 158 states. [2018-11-23 12:06:29,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:29,134 INFO L93 Difference]: Finished difference Result 158 states and 206 transitions. [2018-11-23 12:06:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2018-11-23 12:06:29,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:29,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:29,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:29,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 12:06:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 203 transitions. [2018-11-23 12:06:29,138 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 203 transitions. Word has length 148 [2018-11-23 12:06:29,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:29,138 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 203 transitions. [2018-11-23 12:06:29,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:06:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2018-11-23 12:06:29,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 12:06:29,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:29,139 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:29,140 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:29,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:29,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1494294791, now seen corresponding path program 46 times [2018-11-23 12:06:29,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:29,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:29,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:29,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:29,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:30,439 INFO L256 TraceCheckUtils]: 0: Hoare triple {32499#true} call ULTIMATE.init(); {32499#true} is VALID [2018-11-23 12:06:30,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {32499#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32499#true} is VALID [2018-11-23 12:06:30,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {32499#true} assume true; {32499#true} is VALID [2018-11-23 12:06:30,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32499#true} {32499#true} #55#return; {32499#true} is VALID [2018-11-23 12:06:30,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {32499#true} call #t~ret4 := main(); {32499#true} is VALID [2018-11-23 12:06:30,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {32499#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {32501#(= main_~i~0 0)} is VALID [2018-11-23 12:06:30,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {32501#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32501#(= main_~i~0 0)} is VALID [2018-11-23 12:06:30,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {32501#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32501#(= main_~i~0 0)} is VALID [2018-11-23 12:06:30,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {32501#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {32502#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:30,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {32502#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32502#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:30,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {32502#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32502#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:30,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {32502#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {32503#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:30,443 INFO L273 TraceCheckUtils]: 12: Hoare triple {32503#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32503#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:30,444 INFO L273 TraceCheckUtils]: 13: Hoare triple {32503#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32503#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:30,444 INFO L273 TraceCheckUtils]: 14: Hoare triple {32503#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {32504#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:30,445 INFO L273 TraceCheckUtils]: 15: Hoare triple {32504#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32504#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:30,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {32504#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32504#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:30,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {32504#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {32505#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:30,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {32505#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32505#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:30,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {32505#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32505#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:30,447 INFO L273 TraceCheckUtils]: 20: Hoare triple {32505#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {32506#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:30,448 INFO L273 TraceCheckUtils]: 21: Hoare triple {32506#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32506#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:30,448 INFO L273 TraceCheckUtils]: 22: Hoare triple {32506#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32506#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:30,449 INFO L273 TraceCheckUtils]: 23: Hoare triple {32506#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {32507#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:30,450 INFO L273 TraceCheckUtils]: 24: Hoare triple {32507#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32507#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:30,450 INFO L273 TraceCheckUtils]: 25: Hoare triple {32507#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32507#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:30,451 INFO L273 TraceCheckUtils]: 26: Hoare triple {32507#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {32508#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:30,451 INFO L273 TraceCheckUtils]: 27: Hoare triple {32508#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32508#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:30,452 INFO L273 TraceCheckUtils]: 28: Hoare triple {32508#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32508#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:30,453 INFO L273 TraceCheckUtils]: 29: Hoare triple {32508#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {32509#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:30,453 INFO L273 TraceCheckUtils]: 30: Hoare triple {32509#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32509#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:30,454 INFO L273 TraceCheckUtils]: 31: Hoare triple {32509#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32509#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:30,454 INFO L273 TraceCheckUtils]: 32: Hoare triple {32509#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {32510#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:30,455 INFO L273 TraceCheckUtils]: 33: Hoare triple {32510#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32510#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:30,455 INFO L273 TraceCheckUtils]: 34: Hoare triple {32510#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32510#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:30,456 INFO L273 TraceCheckUtils]: 35: Hoare triple {32510#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {32511#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:30,457 INFO L273 TraceCheckUtils]: 36: Hoare triple {32511#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32511#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:30,457 INFO L273 TraceCheckUtils]: 37: Hoare triple {32511#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32511#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:30,458 INFO L273 TraceCheckUtils]: 38: Hoare triple {32511#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {32512#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:30,458 INFO L273 TraceCheckUtils]: 39: Hoare triple {32512#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32512#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:30,459 INFO L273 TraceCheckUtils]: 40: Hoare triple {32512#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32512#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:30,459 INFO L273 TraceCheckUtils]: 41: Hoare triple {32512#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {32513#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:30,460 INFO L273 TraceCheckUtils]: 42: Hoare triple {32513#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32513#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:30,460 INFO L273 TraceCheckUtils]: 43: Hoare triple {32513#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32513#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:30,461 INFO L273 TraceCheckUtils]: 44: Hoare triple {32513#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {32514#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:30,462 INFO L273 TraceCheckUtils]: 45: Hoare triple {32514#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32514#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:30,462 INFO L273 TraceCheckUtils]: 46: Hoare triple {32514#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32514#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:30,463 INFO L273 TraceCheckUtils]: 47: Hoare triple {32514#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {32515#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:30,463 INFO L273 TraceCheckUtils]: 48: Hoare triple {32515#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32515#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:30,464 INFO L273 TraceCheckUtils]: 49: Hoare triple {32515#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32515#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:30,464 INFO L273 TraceCheckUtils]: 50: Hoare triple {32515#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {32516#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:30,465 INFO L273 TraceCheckUtils]: 51: Hoare triple {32516#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32516#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:30,465 INFO L273 TraceCheckUtils]: 52: Hoare triple {32516#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32516#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:30,466 INFO L273 TraceCheckUtils]: 53: Hoare triple {32516#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {32517#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:30,467 INFO L273 TraceCheckUtils]: 54: Hoare triple {32517#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32517#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:30,467 INFO L273 TraceCheckUtils]: 55: Hoare triple {32517#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32517#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:30,468 INFO L273 TraceCheckUtils]: 56: Hoare triple {32517#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {32518#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:30,468 INFO L273 TraceCheckUtils]: 57: Hoare triple {32518#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32518#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:30,469 INFO L273 TraceCheckUtils]: 58: Hoare triple {32518#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32518#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:30,470 INFO L273 TraceCheckUtils]: 59: Hoare triple {32518#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {32519#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:30,470 INFO L273 TraceCheckUtils]: 60: Hoare triple {32519#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32519#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:30,471 INFO L273 TraceCheckUtils]: 61: Hoare triple {32519#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32519#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:30,471 INFO L273 TraceCheckUtils]: 62: Hoare triple {32519#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {32520#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:30,472 INFO L273 TraceCheckUtils]: 63: Hoare triple {32520#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32520#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:30,472 INFO L273 TraceCheckUtils]: 64: Hoare triple {32520#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32520#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:30,473 INFO L273 TraceCheckUtils]: 65: Hoare triple {32520#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {32521#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:30,474 INFO L273 TraceCheckUtils]: 66: Hoare triple {32521#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32521#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:30,474 INFO L273 TraceCheckUtils]: 67: Hoare triple {32521#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32521#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:30,475 INFO L273 TraceCheckUtils]: 68: Hoare triple {32521#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {32522#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:30,475 INFO L273 TraceCheckUtils]: 69: Hoare triple {32522#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32522#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:30,476 INFO L273 TraceCheckUtils]: 70: Hoare triple {32522#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32522#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:30,476 INFO L273 TraceCheckUtils]: 71: Hoare triple {32522#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {32523#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:30,477 INFO L273 TraceCheckUtils]: 72: Hoare triple {32523#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32523#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:30,477 INFO L273 TraceCheckUtils]: 73: Hoare triple {32523#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32523#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:30,478 INFO L273 TraceCheckUtils]: 74: Hoare triple {32523#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {32524#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:30,479 INFO L273 TraceCheckUtils]: 75: Hoare triple {32524#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32524#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:30,479 INFO L273 TraceCheckUtils]: 76: Hoare triple {32524#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32524#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:30,480 INFO L273 TraceCheckUtils]: 77: Hoare triple {32524#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {32525#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:30,480 INFO L273 TraceCheckUtils]: 78: Hoare triple {32525#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32525#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:30,481 INFO L273 TraceCheckUtils]: 79: Hoare triple {32525#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32525#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:30,482 INFO L273 TraceCheckUtils]: 80: Hoare triple {32525#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {32526#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:30,482 INFO L273 TraceCheckUtils]: 81: Hoare triple {32526#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32526#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:30,483 INFO L273 TraceCheckUtils]: 82: Hoare triple {32526#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32526#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:30,483 INFO L273 TraceCheckUtils]: 83: Hoare triple {32526#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {32527#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:30,484 INFO L273 TraceCheckUtils]: 84: Hoare triple {32527#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32527#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:30,484 INFO L273 TraceCheckUtils]: 85: Hoare triple {32527#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32527#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:30,485 INFO L273 TraceCheckUtils]: 86: Hoare triple {32527#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {32528#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:30,485 INFO L273 TraceCheckUtils]: 87: Hoare triple {32528#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32528#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:30,486 INFO L273 TraceCheckUtils]: 88: Hoare triple {32528#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32528#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:30,487 INFO L273 TraceCheckUtils]: 89: Hoare triple {32528#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {32529#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:30,487 INFO L273 TraceCheckUtils]: 90: Hoare triple {32529#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32529#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:30,488 INFO L273 TraceCheckUtils]: 91: Hoare triple {32529#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32529#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:30,488 INFO L273 TraceCheckUtils]: 92: Hoare triple {32529#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {32530#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:30,489 INFO L273 TraceCheckUtils]: 93: Hoare triple {32530#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32530#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:30,489 INFO L273 TraceCheckUtils]: 94: Hoare triple {32530#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32530#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:30,490 INFO L273 TraceCheckUtils]: 95: Hoare triple {32530#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {32531#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:30,491 INFO L273 TraceCheckUtils]: 96: Hoare triple {32531#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32531#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:30,491 INFO L273 TraceCheckUtils]: 97: Hoare triple {32531#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32531#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:30,492 INFO L273 TraceCheckUtils]: 98: Hoare triple {32531#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {32532#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:30,492 INFO L273 TraceCheckUtils]: 99: Hoare triple {32532#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32532#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:30,493 INFO L273 TraceCheckUtils]: 100: Hoare triple {32532#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32532#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:30,494 INFO L273 TraceCheckUtils]: 101: Hoare triple {32532#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {32533#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:30,494 INFO L273 TraceCheckUtils]: 102: Hoare triple {32533#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32533#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:30,495 INFO L273 TraceCheckUtils]: 103: Hoare triple {32533#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32533#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:30,495 INFO L273 TraceCheckUtils]: 104: Hoare triple {32533#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {32534#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:30,496 INFO L273 TraceCheckUtils]: 105: Hoare triple {32534#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32534#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:30,496 INFO L273 TraceCheckUtils]: 106: Hoare triple {32534#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32534#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:30,497 INFO L273 TraceCheckUtils]: 107: Hoare triple {32534#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {32535#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:30,497 INFO L273 TraceCheckUtils]: 108: Hoare triple {32535#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32535#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:30,498 INFO L273 TraceCheckUtils]: 109: Hoare triple {32535#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32535#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:30,499 INFO L273 TraceCheckUtils]: 110: Hoare triple {32535#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {32536#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:30,499 INFO L273 TraceCheckUtils]: 111: Hoare triple {32536#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32536#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:30,500 INFO L273 TraceCheckUtils]: 112: Hoare triple {32536#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32536#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:30,500 INFO L273 TraceCheckUtils]: 113: Hoare triple {32536#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {32537#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:30,501 INFO L273 TraceCheckUtils]: 114: Hoare triple {32537#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32537#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:30,501 INFO L273 TraceCheckUtils]: 115: Hoare triple {32537#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32537#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:30,502 INFO L273 TraceCheckUtils]: 116: Hoare triple {32537#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {32538#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:30,503 INFO L273 TraceCheckUtils]: 117: Hoare triple {32538#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32538#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:30,503 INFO L273 TraceCheckUtils]: 118: Hoare triple {32538#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32538#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:30,504 INFO L273 TraceCheckUtils]: 119: Hoare triple {32538#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {32539#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:30,504 INFO L273 TraceCheckUtils]: 120: Hoare triple {32539#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32539#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:30,505 INFO L273 TraceCheckUtils]: 121: Hoare triple {32539#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32539#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:30,506 INFO L273 TraceCheckUtils]: 122: Hoare triple {32539#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {32540#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:30,506 INFO L273 TraceCheckUtils]: 123: Hoare triple {32540#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32540#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:30,506 INFO L273 TraceCheckUtils]: 124: Hoare triple {32540#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32540#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:30,507 INFO L273 TraceCheckUtils]: 125: Hoare triple {32540#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {32541#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:30,508 INFO L273 TraceCheckUtils]: 126: Hoare triple {32541#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32541#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:30,508 INFO L273 TraceCheckUtils]: 127: Hoare triple {32541#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32541#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:30,509 INFO L273 TraceCheckUtils]: 128: Hoare triple {32541#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {32542#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:30,509 INFO L273 TraceCheckUtils]: 129: Hoare triple {32542#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32542#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:30,510 INFO L273 TraceCheckUtils]: 130: Hoare triple {32542#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32542#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:30,511 INFO L273 TraceCheckUtils]: 131: Hoare triple {32542#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {32543#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:30,511 INFO L273 TraceCheckUtils]: 132: Hoare triple {32543#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32543#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:30,512 INFO L273 TraceCheckUtils]: 133: Hoare triple {32543#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32543#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:30,512 INFO L273 TraceCheckUtils]: 134: Hoare triple {32543#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {32544#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:30,513 INFO L273 TraceCheckUtils]: 135: Hoare triple {32544#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32544#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:30,513 INFO L273 TraceCheckUtils]: 136: Hoare triple {32544#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32544#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:30,514 INFO L273 TraceCheckUtils]: 137: Hoare triple {32544#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {32545#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:30,515 INFO L273 TraceCheckUtils]: 138: Hoare triple {32545#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32545#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:30,515 INFO L273 TraceCheckUtils]: 139: Hoare triple {32545#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32545#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:30,516 INFO L273 TraceCheckUtils]: 140: Hoare triple {32545#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {32546#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:30,516 INFO L273 TraceCheckUtils]: 141: Hoare triple {32546#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32546#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:30,517 INFO L273 TraceCheckUtils]: 142: Hoare triple {32546#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32546#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:30,517 INFO L273 TraceCheckUtils]: 143: Hoare triple {32546#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {32547#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:30,518 INFO L273 TraceCheckUtils]: 144: Hoare triple {32547#(<= main_~i~0 46)} assume !(~i~0 < 100000); {32500#false} is VALID [2018-11-23 12:06:30,518 INFO L273 TraceCheckUtils]: 145: Hoare triple {32500#false} havoc ~x~0;~x~0 := 0; {32500#false} is VALID [2018-11-23 12:06:30,519 INFO L273 TraceCheckUtils]: 146: Hoare triple {32500#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {32500#false} is VALID [2018-11-23 12:06:30,519 INFO L256 TraceCheckUtils]: 147: Hoare triple {32500#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {32500#false} is VALID [2018-11-23 12:06:30,519 INFO L273 TraceCheckUtils]: 148: Hoare triple {32500#false} ~cond := #in~cond; {32500#false} is VALID [2018-11-23 12:06:30,519 INFO L273 TraceCheckUtils]: 149: Hoare triple {32500#false} assume 0 == ~cond; {32500#false} is VALID [2018-11-23 12:06:30,519 INFO L273 TraceCheckUtils]: 150: Hoare triple {32500#false} assume !false; {32500#false} is VALID [2018-11-23 12:06:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:30,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:30,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:30,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:30,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:30,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:30,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:30,980 INFO L256 TraceCheckUtils]: 0: Hoare triple {32499#true} call ULTIMATE.init(); {32499#true} is VALID [2018-11-23 12:06:30,980 INFO L273 TraceCheckUtils]: 1: Hoare triple {32499#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32499#true} is VALID [2018-11-23 12:06:30,981 INFO L273 TraceCheckUtils]: 2: Hoare triple {32499#true} assume true; {32499#true} is VALID [2018-11-23 12:06:30,981 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32499#true} {32499#true} #55#return; {32499#true} is VALID [2018-11-23 12:06:30,981 INFO L256 TraceCheckUtils]: 4: Hoare triple {32499#true} call #t~ret4 := main(); {32499#true} is VALID [2018-11-23 12:06:30,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {32499#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {32566#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:30,982 INFO L273 TraceCheckUtils]: 6: Hoare triple {32566#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32566#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:30,982 INFO L273 TraceCheckUtils]: 7: Hoare triple {32566#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32566#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:30,983 INFO L273 TraceCheckUtils]: 8: Hoare triple {32566#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {32502#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:30,983 INFO L273 TraceCheckUtils]: 9: Hoare triple {32502#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32502#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:30,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {32502#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32502#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:30,984 INFO L273 TraceCheckUtils]: 11: Hoare triple {32502#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {32503#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:30,984 INFO L273 TraceCheckUtils]: 12: Hoare triple {32503#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32503#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:30,985 INFO L273 TraceCheckUtils]: 13: Hoare triple {32503#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32503#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:30,986 INFO L273 TraceCheckUtils]: 14: Hoare triple {32503#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {32504#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:30,986 INFO L273 TraceCheckUtils]: 15: Hoare triple {32504#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32504#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:30,987 INFO L273 TraceCheckUtils]: 16: Hoare triple {32504#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32504#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:30,987 INFO L273 TraceCheckUtils]: 17: Hoare triple {32504#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {32505#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:30,988 INFO L273 TraceCheckUtils]: 18: Hoare triple {32505#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32505#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:30,988 INFO L273 TraceCheckUtils]: 19: Hoare triple {32505#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32505#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:30,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {32505#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {32506#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:30,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {32506#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32506#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:30,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {32506#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32506#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:30,991 INFO L273 TraceCheckUtils]: 23: Hoare triple {32506#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {32507#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:30,991 INFO L273 TraceCheckUtils]: 24: Hoare triple {32507#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32507#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:30,992 INFO L273 TraceCheckUtils]: 25: Hoare triple {32507#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32507#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:30,992 INFO L273 TraceCheckUtils]: 26: Hoare triple {32507#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {32508#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:30,993 INFO L273 TraceCheckUtils]: 27: Hoare triple {32508#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32508#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:30,993 INFO L273 TraceCheckUtils]: 28: Hoare triple {32508#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32508#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:30,994 INFO L273 TraceCheckUtils]: 29: Hoare triple {32508#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {32509#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:30,995 INFO L273 TraceCheckUtils]: 30: Hoare triple {32509#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32509#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:30,995 INFO L273 TraceCheckUtils]: 31: Hoare triple {32509#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32509#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:30,996 INFO L273 TraceCheckUtils]: 32: Hoare triple {32509#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {32510#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:30,996 INFO L273 TraceCheckUtils]: 33: Hoare triple {32510#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32510#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:30,997 INFO L273 TraceCheckUtils]: 34: Hoare triple {32510#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32510#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:30,997 INFO L273 TraceCheckUtils]: 35: Hoare triple {32510#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {32511#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:30,998 INFO L273 TraceCheckUtils]: 36: Hoare triple {32511#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32511#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:30,998 INFO L273 TraceCheckUtils]: 37: Hoare triple {32511#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32511#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:30,999 INFO L273 TraceCheckUtils]: 38: Hoare triple {32511#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {32512#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:31,000 INFO L273 TraceCheckUtils]: 39: Hoare triple {32512#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32512#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:31,000 INFO L273 TraceCheckUtils]: 40: Hoare triple {32512#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32512#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:31,001 INFO L273 TraceCheckUtils]: 41: Hoare triple {32512#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {32513#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:31,001 INFO L273 TraceCheckUtils]: 42: Hoare triple {32513#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32513#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:31,002 INFO L273 TraceCheckUtils]: 43: Hoare triple {32513#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32513#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:31,003 INFO L273 TraceCheckUtils]: 44: Hoare triple {32513#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {32514#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:31,003 INFO L273 TraceCheckUtils]: 45: Hoare triple {32514#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32514#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:31,004 INFO L273 TraceCheckUtils]: 46: Hoare triple {32514#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32514#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:31,004 INFO L273 TraceCheckUtils]: 47: Hoare triple {32514#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {32515#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:31,005 INFO L273 TraceCheckUtils]: 48: Hoare triple {32515#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32515#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:31,005 INFO L273 TraceCheckUtils]: 49: Hoare triple {32515#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32515#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:31,006 INFO L273 TraceCheckUtils]: 50: Hoare triple {32515#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {32516#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:31,006 INFO L273 TraceCheckUtils]: 51: Hoare triple {32516#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32516#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:31,007 INFO L273 TraceCheckUtils]: 52: Hoare triple {32516#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32516#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:31,008 INFO L273 TraceCheckUtils]: 53: Hoare triple {32516#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {32517#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:31,008 INFO L273 TraceCheckUtils]: 54: Hoare triple {32517#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32517#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:31,009 INFO L273 TraceCheckUtils]: 55: Hoare triple {32517#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32517#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:31,009 INFO L273 TraceCheckUtils]: 56: Hoare triple {32517#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {32518#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:31,010 INFO L273 TraceCheckUtils]: 57: Hoare triple {32518#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32518#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:31,010 INFO L273 TraceCheckUtils]: 58: Hoare triple {32518#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32518#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:31,011 INFO L273 TraceCheckUtils]: 59: Hoare triple {32518#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {32519#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:31,012 INFO L273 TraceCheckUtils]: 60: Hoare triple {32519#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32519#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:31,012 INFO L273 TraceCheckUtils]: 61: Hoare triple {32519#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32519#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:31,013 INFO L273 TraceCheckUtils]: 62: Hoare triple {32519#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {32520#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:31,013 INFO L273 TraceCheckUtils]: 63: Hoare triple {32520#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32520#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:31,014 INFO L273 TraceCheckUtils]: 64: Hoare triple {32520#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32520#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:31,014 INFO L273 TraceCheckUtils]: 65: Hoare triple {32520#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {32521#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:31,015 INFO L273 TraceCheckUtils]: 66: Hoare triple {32521#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32521#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:31,015 INFO L273 TraceCheckUtils]: 67: Hoare triple {32521#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32521#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:31,016 INFO L273 TraceCheckUtils]: 68: Hoare triple {32521#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {32522#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:31,017 INFO L273 TraceCheckUtils]: 69: Hoare triple {32522#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32522#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:31,017 INFO L273 TraceCheckUtils]: 70: Hoare triple {32522#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32522#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:31,018 INFO L273 TraceCheckUtils]: 71: Hoare triple {32522#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {32523#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:31,018 INFO L273 TraceCheckUtils]: 72: Hoare triple {32523#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32523#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:31,019 INFO L273 TraceCheckUtils]: 73: Hoare triple {32523#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32523#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:31,020 INFO L273 TraceCheckUtils]: 74: Hoare triple {32523#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {32524#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:31,020 INFO L273 TraceCheckUtils]: 75: Hoare triple {32524#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32524#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:31,021 INFO L273 TraceCheckUtils]: 76: Hoare triple {32524#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32524#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:31,021 INFO L273 TraceCheckUtils]: 77: Hoare triple {32524#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {32525#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:31,022 INFO L273 TraceCheckUtils]: 78: Hoare triple {32525#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32525#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:31,022 INFO L273 TraceCheckUtils]: 79: Hoare triple {32525#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32525#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:31,023 INFO L273 TraceCheckUtils]: 80: Hoare triple {32525#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {32526#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:31,023 INFO L273 TraceCheckUtils]: 81: Hoare triple {32526#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32526#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:31,024 INFO L273 TraceCheckUtils]: 82: Hoare triple {32526#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32526#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:31,025 INFO L273 TraceCheckUtils]: 83: Hoare triple {32526#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {32527#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:31,025 INFO L273 TraceCheckUtils]: 84: Hoare triple {32527#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32527#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:31,026 INFO L273 TraceCheckUtils]: 85: Hoare triple {32527#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32527#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:31,026 INFO L273 TraceCheckUtils]: 86: Hoare triple {32527#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {32528#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:31,027 INFO L273 TraceCheckUtils]: 87: Hoare triple {32528#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32528#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:31,027 INFO L273 TraceCheckUtils]: 88: Hoare triple {32528#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32528#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:31,028 INFO L273 TraceCheckUtils]: 89: Hoare triple {32528#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {32529#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:31,029 INFO L273 TraceCheckUtils]: 90: Hoare triple {32529#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32529#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:31,029 INFO L273 TraceCheckUtils]: 91: Hoare triple {32529#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32529#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:31,030 INFO L273 TraceCheckUtils]: 92: Hoare triple {32529#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {32530#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:31,030 INFO L273 TraceCheckUtils]: 93: Hoare triple {32530#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32530#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:31,031 INFO L273 TraceCheckUtils]: 94: Hoare triple {32530#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32530#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:31,031 INFO L273 TraceCheckUtils]: 95: Hoare triple {32530#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {32531#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:31,032 INFO L273 TraceCheckUtils]: 96: Hoare triple {32531#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32531#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:31,032 INFO L273 TraceCheckUtils]: 97: Hoare triple {32531#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32531#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:31,033 INFO L273 TraceCheckUtils]: 98: Hoare triple {32531#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {32532#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:31,034 INFO L273 TraceCheckUtils]: 99: Hoare triple {32532#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32532#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:31,034 INFO L273 TraceCheckUtils]: 100: Hoare triple {32532#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32532#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:31,035 INFO L273 TraceCheckUtils]: 101: Hoare triple {32532#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {32533#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:31,035 INFO L273 TraceCheckUtils]: 102: Hoare triple {32533#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32533#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:31,036 INFO L273 TraceCheckUtils]: 103: Hoare triple {32533#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32533#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:31,037 INFO L273 TraceCheckUtils]: 104: Hoare triple {32533#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {32534#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:31,037 INFO L273 TraceCheckUtils]: 105: Hoare triple {32534#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32534#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:31,038 INFO L273 TraceCheckUtils]: 106: Hoare triple {32534#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32534#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:31,038 INFO L273 TraceCheckUtils]: 107: Hoare triple {32534#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {32535#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:31,039 INFO L273 TraceCheckUtils]: 108: Hoare triple {32535#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32535#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:31,039 INFO L273 TraceCheckUtils]: 109: Hoare triple {32535#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32535#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:31,040 INFO L273 TraceCheckUtils]: 110: Hoare triple {32535#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {32536#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:31,041 INFO L273 TraceCheckUtils]: 111: Hoare triple {32536#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32536#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:31,041 INFO L273 TraceCheckUtils]: 112: Hoare triple {32536#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32536#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:31,042 INFO L273 TraceCheckUtils]: 113: Hoare triple {32536#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {32537#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:31,042 INFO L273 TraceCheckUtils]: 114: Hoare triple {32537#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32537#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:31,043 INFO L273 TraceCheckUtils]: 115: Hoare triple {32537#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32537#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:31,043 INFO L273 TraceCheckUtils]: 116: Hoare triple {32537#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {32538#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:31,044 INFO L273 TraceCheckUtils]: 117: Hoare triple {32538#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32538#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:31,044 INFO L273 TraceCheckUtils]: 118: Hoare triple {32538#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32538#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:31,045 INFO L273 TraceCheckUtils]: 119: Hoare triple {32538#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {32539#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:31,046 INFO L273 TraceCheckUtils]: 120: Hoare triple {32539#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32539#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:31,046 INFO L273 TraceCheckUtils]: 121: Hoare triple {32539#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32539#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:31,047 INFO L273 TraceCheckUtils]: 122: Hoare triple {32539#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {32540#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:31,047 INFO L273 TraceCheckUtils]: 123: Hoare triple {32540#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32540#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:31,048 INFO L273 TraceCheckUtils]: 124: Hoare triple {32540#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32540#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:31,049 INFO L273 TraceCheckUtils]: 125: Hoare triple {32540#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {32541#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:31,049 INFO L273 TraceCheckUtils]: 126: Hoare triple {32541#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32541#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:31,050 INFO L273 TraceCheckUtils]: 127: Hoare triple {32541#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32541#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:31,050 INFO L273 TraceCheckUtils]: 128: Hoare triple {32541#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {32542#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:31,051 INFO L273 TraceCheckUtils]: 129: Hoare triple {32542#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32542#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:31,051 INFO L273 TraceCheckUtils]: 130: Hoare triple {32542#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32542#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:31,052 INFO L273 TraceCheckUtils]: 131: Hoare triple {32542#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {32543#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:31,052 INFO L273 TraceCheckUtils]: 132: Hoare triple {32543#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32543#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:31,053 INFO L273 TraceCheckUtils]: 133: Hoare triple {32543#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32543#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:31,054 INFO L273 TraceCheckUtils]: 134: Hoare triple {32543#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {32544#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:31,054 INFO L273 TraceCheckUtils]: 135: Hoare triple {32544#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32544#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:31,055 INFO L273 TraceCheckUtils]: 136: Hoare triple {32544#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32544#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:31,055 INFO L273 TraceCheckUtils]: 137: Hoare triple {32544#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {32545#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:31,056 INFO L273 TraceCheckUtils]: 138: Hoare triple {32545#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32545#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:31,056 INFO L273 TraceCheckUtils]: 139: Hoare triple {32545#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32545#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:31,057 INFO L273 TraceCheckUtils]: 140: Hoare triple {32545#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {32546#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:31,058 INFO L273 TraceCheckUtils]: 141: Hoare triple {32546#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32546#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:31,058 INFO L273 TraceCheckUtils]: 142: Hoare triple {32546#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {32546#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:31,059 INFO L273 TraceCheckUtils]: 143: Hoare triple {32546#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {32547#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:31,059 INFO L273 TraceCheckUtils]: 144: Hoare triple {32547#(<= main_~i~0 46)} assume !(~i~0 < 100000); {32500#false} is VALID [2018-11-23 12:06:31,060 INFO L273 TraceCheckUtils]: 145: Hoare triple {32500#false} havoc ~x~0;~x~0 := 0; {32500#false} is VALID [2018-11-23 12:06:31,060 INFO L273 TraceCheckUtils]: 146: Hoare triple {32500#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {32500#false} is VALID [2018-11-23 12:06:31,060 INFO L256 TraceCheckUtils]: 147: Hoare triple {32500#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {32500#false} is VALID [2018-11-23 12:06:31,060 INFO L273 TraceCheckUtils]: 148: Hoare triple {32500#false} ~cond := #in~cond; {32500#false} is VALID [2018-11-23 12:06:31,060 INFO L273 TraceCheckUtils]: 149: Hoare triple {32500#false} assume 0 == ~cond; {32500#false} is VALID [2018-11-23 12:06:31,061 INFO L273 TraceCheckUtils]: 150: Hoare triple {32500#false} assume !false; {32500#false} is VALID [2018-11-23 12:06:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:31,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:31,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2018-11-23 12:06:31,094 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 151 [2018-11-23 12:06:31,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:31,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 12:06:31,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:31,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 12:06:31,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 12:06:31,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:06:31,244 INFO L87 Difference]: Start difference. First operand 156 states and 203 transitions. Second operand 50 states. [2018-11-23 12:06:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:32,130 INFO L93 Difference]: Finished difference Result 172 states and 222 transitions. [2018-11-23 12:06:32,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:06:32,131 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 151 [2018-11-23 12:06:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:06:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 222 transitions. [2018-11-23 12:06:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:06:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 222 transitions. [2018-11-23 12:06:32,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 222 transitions. [2018-11-23 12:06:32,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:32,345 INFO L225 Difference]: With dead ends: 172 [2018-11-23 12:06:32,345 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 12:06:32,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:06:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 12:06:32,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-11-23 12:06:32,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:32,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 159 states. [2018-11-23 12:06:32,423 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 159 states. [2018-11-23 12:06:32,423 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 159 states. [2018-11-23 12:06:32,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:32,425 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2018-11-23 12:06:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2018-11-23 12:06:32,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:32,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:32,426 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 161 states. [2018-11-23 12:06:32,426 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 161 states. [2018-11-23 12:06:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:32,428 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2018-11-23 12:06:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2018-11-23 12:06:32,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:32,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:32,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:32,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 12:06:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 207 transitions. [2018-11-23 12:06:32,430 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 207 transitions. Word has length 151 [2018-11-23 12:06:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:32,430 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 207 transitions. [2018-11-23 12:06:32,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 12:06:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 207 transitions. [2018-11-23 12:06:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-23 12:06:32,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:32,431 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:32,431 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:32,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:32,432 INFO L82 PathProgramCache]: Analyzing trace with hash -154729821, now seen corresponding path program 47 times [2018-11-23 12:06:32,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:32,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:32,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:32,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:32,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:33,859 INFO L256 TraceCheckUtils]: 0: Hoare triple {33767#true} call ULTIMATE.init(); {33767#true} is VALID [2018-11-23 12:06:33,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {33767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33767#true} is VALID [2018-11-23 12:06:33,859 INFO L273 TraceCheckUtils]: 2: Hoare triple {33767#true} assume true; {33767#true} is VALID [2018-11-23 12:06:33,859 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33767#true} {33767#true} #55#return; {33767#true} is VALID [2018-11-23 12:06:33,860 INFO L256 TraceCheckUtils]: 4: Hoare triple {33767#true} call #t~ret4 := main(); {33767#true} is VALID [2018-11-23 12:06:33,860 INFO L273 TraceCheckUtils]: 5: Hoare triple {33767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {33769#(= main_~i~0 0)} is VALID [2018-11-23 12:06:33,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {33769#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33769#(= main_~i~0 0)} is VALID [2018-11-23 12:06:33,861 INFO L273 TraceCheckUtils]: 7: Hoare triple {33769#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33769#(= main_~i~0 0)} is VALID [2018-11-23 12:06:33,861 INFO L273 TraceCheckUtils]: 8: Hoare triple {33769#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {33770#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:33,862 INFO L273 TraceCheckUtils]: 9: Hoare triple {33770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33770#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:33,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {33770#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33770#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:33,862 INFO L273 TraceCheckUtils]: 11: Hoare triple {33770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {33771#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:33,863 INFO L273 TraceCheckUtils]: 12: Hoare triple {33771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33771#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:33,863 INFO L273 TraceCheckUtils]: 13: Hoare triple {33771#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33771#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:33,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {33771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {33772#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:33,864 INFO L273 TraceCheckUtils]: 15: Hoare triple {33772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33772#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:33,865 INFO L273 TraceCheckUtils]: 16: Hoare triple {33772#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33772#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:33,866 INFO L273 TraceCheckUtils]: 17: Hoare triple {33772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {33773#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:33,866 INFO L273 TraceCheckUtils]: 18: Hoare triple {33773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33773#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:33,867 INFO L273 TraceCheckUtils]: 19: Hoare triple {33773#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33773#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:33,867 INFO L273 TraceCheckUtils]: 20: Hoare triple {33773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {33774#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:33,868 INFO L273 TraceCheckUtils]: 21: Hoare triple {33774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33774#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:33,868 INFO L273 TraceCheckUtils]: 22: Hoare triple {33774#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33774#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:33,869 INFO L273 TraceCheckUtils]: 23: Hoare triple {33774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {33775#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:33,870 INFO L273 TraceCheckUtils]: 24: Hoare triple {33775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33775#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:33,870 INFO L273 TraceCheckUtils]: 25: Hoare triple {33775#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33775#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:33,871 INFO L273 TraceCheckUtils]: 26: Hoare triple {33775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {33776#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:33,871 INFO L273 TraceCheckUtils]: 27: Hoare triple {33776#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33776#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:33,872 INFO L273 TraceCheckUtils]: 28: Hoare triple {33776#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33776#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:33,872 INFO L273 TraceCheckUtils]: 29: Hoare triple {33776#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {33777#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:33,873 INFO L273 TraceCheckUtils]: 30: Hoare triple {33777#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33777#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:33,873 INFO L273 TraceCheckUtils]: 31: Hoare triple {33777#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33777#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:33,874 INFO L273 TraceCheckUtils]: 32: Hoare triple {33777#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {33778#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:33,875 INFO L273 TraceCheckUtils]: 33: Hoare triple {33778#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33778#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:33,875 INFO L273 TraceCheckUtils]: 34: Hoare triple {33778#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33778#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:33,876 INFO L273 TraceCheckUtils]: 35: Hoare triple {33778#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {33779#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:33,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {33779#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33779#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:33,877 INFO L273 TraceCheckUtils]: 37: Hoare triple {33779#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33779#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:33,877 INFO L273 TraceCheckUtils]: 38: Hoare triple {33779#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {33780#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:33,878 INFO L273 TraceCheckUtils]: 39: Hoare triple {33780#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33780#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:33,878 INFO L273 TraceCheckUtils]: 40: Hoare triple {33780#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33780#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:33,879 INFO L273 TraceCheckUtils]: 41: Hoare triple {33780#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {33781#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:33,880 INFO L273 TraceCheckUtils]: 42: Hoare triple {33781#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33781#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:33,880 INFO L273 TraceCheckUtils]: 43: Hoare triple {33781#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33781#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:33,881 INFO L273 TraceCheckUtils]: 44: Hoare triple {33781#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {33782#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:33,881 INFO L273 TraceCheckUtils]: 45: Hoare triple {33782#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33782#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:33,882 INFO L273 TraceCheckUtils]: 46: Hoare triple {33782#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33782#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:33,883 INFO L273 TraceCheckUtils]: 47: Hoare triple {33782#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {33783#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:33,883 INFO L273 TraceCheckUtils]: 48: Hoare triple {33783#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33783#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:33,884 INFO L273 TraceCheckUtils]: 49: Hoare triple {33783#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33783#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:33,884 INFO L273 TraceCheckUtils]: 50: Hoare triple {33783#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {33784#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:33,885 INFO L273 TraceCheckUtils]: 51: Hoare triple {33784#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33784#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:33,885 INFO L273 TraceCheckUtils]: 52: Hoare triple {33784#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33784#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:33,886 INFO L273 TraceCheckUtils]: 53: Hoare triple {33784#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {33785#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:33,886 INFO L273 TraceCheckUtils]: 54: Hoare triple {33785#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33785#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:33,887 INFO L273 TraceCheckUtils]: 55: Hoare triple {33785#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33785#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:33,888 INFO L273 TraceCheckUtils]: 56: Hoare triple {33785#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {33786#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:33,888 INFO L273 TraceCheckUtils]: 57: Hoare triple {33786#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33786#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:33,889 INFO L273 TraceCheckUtils]: 58: Hoare triple {33786#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33786#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:33,889 INFO L273 TraceCheckUtils]: 59: Hoare triple {33786#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {33787#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:33,890 INFO L273 TraceCheckUtils]: 60: Hoare triple {33787#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33787#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:33,890 INFO L273 TraceCheckUtils]: 61: Hoare triple {33787#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33787#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:33,891 INFO L273 TraceCheckUtils]: 62: Hoare triple {33787#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {33788#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:33,892 INFO L273 TraceCheckUtils]: 63: Hoare triple {33788#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33788#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:33,892 INFO L273 TraceCheckUtils]: 64: Hoare triple {33788#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33788#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:33,893 INFO L273 TraceCheckUtils]: 65: Hoare triple {33788#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {33789#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:33,893 INFO L273 TraceCheckUtils]: 66: Hoare triple {33789#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33789#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:33,894 INFO L273 TraceCheckUtils]: 67: Hoare triple {33789#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33789#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:33,894 INFO L273 TraceCheckUtils]: 68: Hoare triple {33789#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {33790#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:33,895 INFO L273 TraceCheckUtils]: 69: Hoare triple {33790#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33790#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:33,895 INFO L273 TraceCheckUtils]: 70: Hoare triple {33790#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33790#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:33,896 INFO L273 TraceCheckUtils]: 71: Hoare triple {33790#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {33791#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:33,897 INFO L273 TraceCheckUtils]: 72: Hoare triple {33791#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33791#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:33,897 INFO L273 TraceCheckUtils]: 73: Hoare triple {33791#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33791#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:33,898 INFO L273 TraceCheckUtils]: 74: Hoare triple {33791#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {33792#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:33,898 INFO L273 TraceCheckUtils]: 75: Hoare triple {33792#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33792#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:33,899 INFO L273 TraceCheckUtils]: 76: Hoare triple {33792#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33792#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:33,900 INFO L273 TraceCheckUtils]: 77: Hoare triple {33792#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {33793#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:33,900 INFO L273 TraceCheckUtils]: 78: Hoare triple {33793#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33793#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:33,901 INFO L273 TraceCheckUtils]: 79: Hoare triple {33793#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33793#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:33,901 INFO L273 TraceCheckUtils]: 80: Hoare triple {33793#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {33794#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:33,902 INFO L273 TraceCheckUtils]: 81: Hoare triple {33794#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33794#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:33,902 INFO L273 TraceCheckUtils]: 82: Hoare triple {33794#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33794#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:33,903 INFO L273 TraceCheckUtils]: 83: Hoare triple {33794#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {33795#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:33,903 INFO L273 TraceCheckUtils]: 84: Hoare triple {33795#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33795#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:33,904 INFO L273 TraceCheckUtils]: 85: Hoare triple {33795#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33795#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:33,905 INFO L273 TraceCheckUtils]: 86: Hoare triple {33795#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {33796#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:33,905 INFO L273 TraceCheckUtils]: 87: Hoare triple {33796#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33796#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:33,906 INFO L273 TraceCheckUtils]: 88: Hoare triple {33796#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33796#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:33,906 INFO L273 TraceCheckUtils]: 89: Hoare triple {33796#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {33797#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:33,907 INFO L273 TraceCheckUtils]: 90: Hoare triple {33797#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33797#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:33,907 INFO L273 TraceCheckUtils]: 91: Hoare triple {33797#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33797#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:33,908 INFO L273 TraceCheckUtils]: 92: Hoare triple {33797#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {33798#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:33,909 INFO L273 TraceCheckUtils]: 93: Hoare triple {33798#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33798#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:33,909 INFO L273 TraceCheckUtils]: 94: Hoare triple {33798#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33798#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:33,910 INFO L273 TraceCheckUtils]: 95: Hoare triple {33798#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {33799#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:33,910 INFO L273 TraceCheckUtils]: 96: Hoare triple {33799#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33799#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:33,911 INFO L273 TraceCheckUtils]: 97: Hoare triple {33799#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33799#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:33,911 INFO L273 TraceCheckUtils]: 98: Hoare triple {33799#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {33800#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:33,912 INFO L273 TraceCheckUtils]: 99: Hoare triple {33800#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33800#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:33,912 INFO L273 TraceCheckUtils]: 100: Hoare triple {33800#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33800#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:33,913 INFO L273 TraceCheckUtils]: 101: Hoare triple {33800#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {33801#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:33,914 INFO L273 TraceCheckUtils]: 102: Hoare triple {33801#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33801#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:33,914 INFO L273 TraceCheckUtils]: 103: Hoare triple {33801#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33801#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:33,915 INFO L273 TraceCheckUtils]: 104: Hoare triple {33801#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {33802#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:33,915 INFO L273 TraceCheckUtils]: 105: Hoare triple {33802#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33802#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:33,916 INFO L273 TraceCheckUtils]: 106: Hoare triple {33802#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33802#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:33,917 INFO L273 TraceCheckUtils]: 107: Hoare triple {33802#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {33803#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:33,917 INFO L273 TraceCheckUtils]: 108: Hoare triple {33803#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33803#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:33,918 INFO L273 TraceCheckUtils]: 109: Hoare triple {33803#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33803#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:33,918 INFO L273 TraceCheckUtils]: 110: Hoare triple {33803#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {33804#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:33,919 INFO L273 TraceCheckUtils]: 111: Hoare triple {33804#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33804#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:33,919 INFO L273 TraceCheckUtils]: 112: Hoare triple {33804#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33804#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:33,920 INFO L273 TraceCheckUtils]: 113: Hoare triple {33804#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {33805#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:33,921 INFO L273 TraceCheckUtils]: 114: Hoare triple {33805#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33805#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:33,921 INFO L273 TraceCheckUtils]: 115: Hoare triple {33805#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33805#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:33,922 INFO L273 TraceCheckUtils]: 116: Hoare triple {33805#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {33806#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:33,922 INFO L273 TraceCheckUtils]: 117: Hoare triple {33806#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33806#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:33,923 INFO L273 TraceCheckUtils]: 118: Hoare triple {33806#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33806#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:33,923 INFO L273 TraceCheckUtils]: 119: Hoare triple {33806#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {33807#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:33,924 INFO L273 TraceCheckUtils]: 120: Hoare triple {33807#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33807#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:33,924 INFO L273 TraceCheckUtils]: 121: Hoare triple {33807#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33807#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:33,925 INFO L273 TraceCheckUtils]: 122: Hoare triple {33807#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {33808#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:33,926 INFO L273 TraceCheckUtils]: 123: Hoare triple {33808#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33808#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:33,926 INFO L273 TraceCheckUtils]: 124: Hoare triple {33808#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33808#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:33,927 INFO L273 TraceCheckUtils]: 125: Hoare triple {33808#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {33809#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:33,927 INFO L273 TraceCheckUtils]: 126: Hoare triple {33809#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33809#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:33,928 INFO L273 TraceCheckUtils]: 127: Hoare triple {33809#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33809#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:33,928 INFO L273 TraceCheckUtils]: 128: Hoare triple {33809#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {33810#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:33,929 INFO L273 TraceCheckUtils]: 129: Hoare triple {33810#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33810#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:33,929 INFO L273 TraceCheckUtils]: 130: Hoare triple {33810#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33810#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:33,930 INFO L273 TraceCheckUtils]: 131: Hoare triple {33810#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {33811#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:33,931 INFO L273 TraceCheckUtils]: 132: Hoare triple {33811#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33811#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:33,931 INFO L273 TraceCheckUtils]: 133: Hoare triple {33811#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33811#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:33,932 INFO L273 TraceCheckUtils]: 134: Hoare triple {33811#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {33812#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:33,932 INFO L273 TraceCheckUtils]: 135: Hoare triple {33812#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33812#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:33,933 INFO L273 TraceCheckUtils]: 136: Hoare triple {33812#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33812#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:33,934 INFO L273 TraceCheckUtils]: 137: Hoare triple {33812#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {33813#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:33,934 INFO L273 TraceCheckUtils]: 138: Hoare triple {33813#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33813#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:33,935 INFO L273 TraceCheckUtils]: 139: Hoare triple {33813#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33813#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:33,935 INFO L273 TraceCheckUtils]: 140: Hoare triple {33813#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {33814#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:33,936 INFO L273 TraceCheckUtils]: 141: Hoare triple {33814#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33814#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:33,936 INFO L273 TraceCheckUtils]: 142: Hoare triple {33814#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33814#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:33,937 INFO L273 TraceCheckUtils]: 143: Hoare triple {33814#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {33815#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:33,938 INFO L273 TraceCheckUtils]: 144: Hoare triple {33815#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33815#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:33,938 INFO L273 TraceCheckUtils]: 145: Hoare triple {33815#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33815#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:33,939 INFO L273 TraceCheckUtils]: 146: Hoare triple {33815#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {33816#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:33,939 INFO L273 TraceCheckUtils]: 147: Hoare triple {33816#(<= main_~i~0 47)} assume !(~i~0 < 100000); {33768#false} is VALID [2018-11-23 12:06:33,940 INFO L273 TraceCheckUtils]: 148: Hoare triple {33768#false} havoc ~x~0;~x~0 := 0; {33768#false} is VALID [2018-11-23 12:06:33,940 INFO L273 TraceCheckUtils]: 149: Hoare triple {33768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {33768#false} is VALID [2018-11-23 12:06:33,940 INFO L256 TraceCheckUtils]: 150: Hoare triple {33768#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {33768#false} is VALID [2018-11-23 12:06:33,940 INFO L273 TraceCheckUtils]: 151: Hoare triple {33768#false} ~cond := #in~cond; {33768#false} is VALID [2018-11-23 12:06:33,940 INFO L273 TraceCheckUtils]: 152: Hoare triple {33768#false} assume 0 == ~cond; {33768#false} is VALID [2018-11-23 12:06:33,941 INFO L273 TraceCheckUtils]: 153: Hoare triple {33768#false} assume !false; {33768#false} is VALID [2018-11-23 12:06:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:33,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:33,955 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:33,975 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:34,155 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-11-23 12:06:34,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:34,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:34,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {33767#true} call ULTIMATE.init(); {33767#true} is VALID [2018-11-23 12:06:34,517 INFO L273 TraceCheckUtils]: 1: Hoare triple {33767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33767#true} is VALID [2018-11-23 12:06:34,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {33767#true} assume true; {33767#true} is VALID [2018-11-23 12:06:34,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33767#true} {33767#true} #55#return; {33767#true} is VALID [2018-11-23 12:06:34,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {33767#true} call #t~ret4 := main(); {33767#true} is VALID [2018-11-23 12:06:34,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {33767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {33835#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:34,519 INFO L273 TraceCheckUtils]: 6: Hoare triple {33835#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33835#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:34,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {33835#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33835#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:34,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {33835#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {33770#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:34,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {33770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33770#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:34,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {33770#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33770#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:34,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {33770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {33771#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:34,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {33771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33771#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:34,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {33771#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33771#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:34,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {33771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {33772#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:34,524 INFO L273 TraceCheckUtils]: 15: Hoare triple {33772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33772#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:34,524 INFO L273 TraceCheckUtils]: 16: Hoare triple {33772#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33772#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:34,525 INFO L273 TraceCheckUtils]: 17: Hoare triple {33772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {33773#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:34,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {33773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33773#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:34,526 INFO L273 TraceCheckUtils]: 19: Hoare triple {33773#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33773#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:34,527 INFO L273 TraceCheckUtils]: 20: Hoare triple {33773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {33774#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:34,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {33774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33774#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:34,528 INFO L273 TraceCheckUtils]: 22: Hoare triple {33774#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33774#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:34,529 INFO L273 TraceCheckUtils]: 23: Hoare triple {33774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {33775#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:34,529 INFO L273 TraceCheckUtils]: 24: Hoare triple {33775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33775#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:34,530 INFO L273 TraceCheckUtils]: 25: Hoare triple {33775#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33775#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:34,530 INFO L273 TraceCheckUtils]: 26: Hoare triple {33775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {33776#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:34,531 INFO L273 TraceCheckUtils]: 27: Hoare triple {33776#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33776#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:34,531 INFO L273 TraceCheckUtils]: 28: Hoare triple {33776#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33776#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:34,532 INFO L273 TraceCheckUtils]: 29: Hoare triple {33776#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {33777#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:34,532 INFO L273 TraceCheckUtils]: 30: Hoare triple {33777#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33777#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:34,533 INFO L273 TraceCheckUtils]: 31: Hoare triple {33777#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33777#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:34,534 INFO L273 TraceCheckUtils]: 32: Hoare triple {33777#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {33778#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:34,534 INFO L273 TraceCheckUtils]: 33: Hoare triple {33778#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33778#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:34,535 INFO L273 TraceCheckUtils]: 34: Hoare triple {33778#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33778#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:34,535 INFO L273 TraceCheckUtils]: 35: Hoare triple {33778#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {33779#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:34,536 INFO L273 TraceCheckUtils]: 36: Hoare triple {33779#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33779#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:34,536 INFO L273 TraceCheckUtils]: 37: Hoare triple {33779#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33779#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:34,537 INFO L273 TraceCheckUtils]: 38: Hoare triple {33779#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {33780#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:34,538 INFO L273 TraceCheckUtils]: 39: Hoare triple {33780#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33780#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:34,538 INFO L273 TraceCheckUtils]: 40: Hoare triple {33780#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33780#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:34,539 INFO L273 TraceCheckUtils]: 41: Hoare triple {33780#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {33781#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:34,539 INFO L273 TraceCheckUtils]: 42: Hoare triple {33781#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33781#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:34,540 INFO L273 TraceCheckUtils]: 43: Hoare triple {33781#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33781#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:34,540 INFO L273 TraceCheckUtils]: 44: Hoare triple {33781#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {33782#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:34,541 INFO L273 TraceCheckUtils]: 45: Hoare triple {33782#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33782#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:34,541 INFO L273 TraceCheckUtils]: 46: Hoare triple {33782#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33782#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:34,542 INFO L273 TraceCheckUtils]: 47: Hoare triple {33782#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {33783#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:34,543 INFO L273 TraceCheckUtils]: 48: Hoare triple {33783#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33783#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:34,543 INFO L273 TraceCheckUtils]: 49: Hoare triple {33783#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33783#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:34,544 INFO L273 TraceCheckUtils]: 50: Hoare triple {33783#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {33784#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:34,544 INFO L273 TraceCheckUtils]: 51: Hoare triple {33784#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33784#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:34,545 INFO L273 TraceCheckUtils]: 52: Hoare triple {33784#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33784#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:34,546 INFO L273 TraceCheckUtils]: 53: Hoare triple {33784#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {33785#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:34,546 INFO L273 TraceCheckUtils]: 54: Hoare triple {33785#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33785#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:34,547 INFO L273 TraceCheckUtils]: 55: Hoare triple {33785#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33785#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:34,547 INFO L273 TraceCheckUtils]: 56: Hoare triple {33785#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {33786#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:34,548 INFO L273 TraceCheckUtils]: 57: Hoare triple {33786#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33786#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:34,548 INFO L273 TraceCheckUtils]: 58: Hoare triple {33786#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33786#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:34,549 INFO L273 TraceCheckUtils]: 59: Hoare triple {33786#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {33787#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:34,549 INFO L273 TraceCheckUtils]: 60: Hoare triple {33787#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33787#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:34,550 INFO L273 TraceCheckUtils]: 61: Hoare triple {33787#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33787#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:34,551 INFO L273 TraceCheckUtils]: 62: Hoare triple {33787#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {33788#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:34,551 INFO L273 TraceCheckUtils]: 63: Hoare triple {33788#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33788#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:34,552 INFO L273 TraceCheckUtils]: 64: Hoare triple {33788#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33788#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:34,552 INFO L273 TraceCheckUtils]: 65: Hoare triple {33788#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {33789#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:34,553 INFO L273 TraceCheckUtils]: 66: Hoare triple {33789#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33789#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:34,553 INFO L273 TraceCheckUtils]: 67: Hoare triple {33789#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33789#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:34,554 INFO L273 TraceCheckUtils]: 68: Hoare triple {33789#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {33790#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:34,555 INFO L273 TraceCheckUtils]: 69: Hoare triple {33790#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33790#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:34,555 INFO L273 TraceCheckUtils]: 70: Hoare triple {33790#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33790#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:34,556 INFO L273 TraceCheckUtils]: 71: Hoare triple {33790#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {33791#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:34,556 INFO L273 TraceCheckUtils]: 72: Hoare triple {33791#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33791#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:34,557 INFO L273 TraceCheckUtils]: 73: Hoare triple {33791#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33791#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:34,558 INFO L273 TraceCheckUtils]: 74: Hoare triple {33791#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {33792#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:34,558 INFO L273 TraceCheckUtils]: 75: Hoare triple {33792#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33792#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:34,582 INFO L273 TraceCheckUtils]: 76: Hoare triple {33792#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33792#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:34,586 INFO L273 TraceCheckUtils]: 77: Hoare triple {33792#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {33793#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:34,586 INFO L273 TraceCheckUtils]: 78: Hoare triple {33793#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33793#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:34,588 INFO L273 TraceCheckUtils]: 79: Hoare triple {33793#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33793#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:34,588 INFO L273 TraceCheckUtils]: 80: Hoare triple {33793#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {33794#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:34,590 INFO L273 TraceCheckUtils]: 81: Hoare triple {33794#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33794#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:34,590 INFO L273 TraceCheckUtils]: 82: Hoare triple {33794#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33794#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:34,590 INFO L273 TraceCheckUtils]: 83: Hoare triple {33794#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {33795#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:34,591 INFO L273 TraceCheckUtils]: 84: Hoare triple {33795#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33795#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:34,592 INFO L273 TraceCheckUtils]: 85: Hoare triple {33795#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33795#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:34,592 INFO L273 TraceCheckUtils]: 86: Hoare triple {33795#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {33796#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:34,594 INFO L273 TraceCheckUtils]: 87: Hoare triple {33796#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33796#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:34,594 INFO L273 TraceCheckUtils]: 88: Hoare triple {33796#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33796#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:34,594 INFO L273 TraceCheckUtils]: 89: Hoare triple {33796#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {33797#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:34,595 INFO L273 TraceCheckUtils]: 90: Hoare triple {33797#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33797#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:34,595 INFO L273 TraceCheckUtils]: 91: Hoare triple {33797#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33797#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:34,595 INFO L273 TraceCheckUtils]: 92: Hoare triple {33797#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {33798#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:34,596 INFO L273 TraceCheckUtils]: 93: Hoare triple {33798#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33798#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:34,596 INFO L273 TraceCheckUtils]: 94: Hoare triple {33798#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33798#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:34,596 INFO L273 TraceCheckUtils]: 95: Hoare triple {33798#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {33799#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:34,597 INFO L273 TraceCheckUtils]: 96: Hoare triple {33799#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33799#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:34,597 INFO L273 TraceCheckUtils]: 97: Hoare triple {33799#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33799#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:34,598 INFO L273 TraceCheckUtils]: 98: Hoare triple {33799#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {33800#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:34,598 INFO L273 TraceCheckUtils]: 99: Hoare triple {33800#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33800#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:34,599 INFO L273 TraceCheckUtils]: 100: Hoare triple {33800#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33800#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:34,599 INFO L273 TraceCheckUtils]: 101: Hoare triple {33800#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {33801#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:34,600 INFO L273 TraceCheckUtils]: 102: Hoare triple {33801#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33801#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:34,600 INFO L273 TraceCheckUtils]: 103: Hoare triple {33801#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33801#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:34,601 INFO L273 TraceCheckUtils]: 104: Hoare triple {33801#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {33802#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:34,601 INFO L273 TraceCheckUtils]: 105: Hoare triple {33802#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33802#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:34,602 INFO L273 TraceCheckUtils]: 106: Hoare triple {33802#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33802#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:34,603 INFO L273 TraceCheckUtils]: 107: Hoare triple {33802#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {33803#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:34,603 INFO L273 TraceCheckUtils]: 108: Hoare triple {33803#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33803#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:34,604 INFO L273 TraceCheckUtils]: 109: Hoare triple {33803#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33803#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:34,604 INFO L273 TraceCheckUtils]: 110: Hoare triple {33803#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {33804#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:34,605 INFO L273 TraceCheckUtils]: 111: Hoare triple {33804#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33804#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:34,605 INFO L273 TraceCheckUtils]: 112: Hoare triple {33804#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33804#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:34,606 INFO L273 TraceCheckUtils]: 113: Hoare triple {33804#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {33805#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:34,607 INFO L273 TraceCheckUtils]: 114: Hoare triple {33805#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33805#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:34,607 INFO L273 TraceCheckUtils]: 115: Hoare triple {33805#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33805#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:34,608 INFO L273 TraceCheckUtils]: 116: Hoare triple {33805#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {33806#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:34,608 INFO L273 TraceCheckUtils]: 117: Hoare triple {33806#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33806#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:34,609 INFO L273 TraceCheckUtils]: 118: Hoare triple {33806#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33806#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:34,609 INFO L273 TraceCheckUtils]: 119: Hoare triple {33806#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {33807#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:34,610 INFO L273 TraceCheckUtils]: 120: Hoare triple {33807#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33807#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:34,610 INFO L273 TraceCheckUtils]: 121: Hoare triple {33807#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33807#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:34,611 INFO L273 TraceCheckUtils]: 122: Hoare triple {33807#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {33808#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:34,612 INFO L273 TraceCheckUtils]: 123: Hoare triple {33808#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33808#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:34,612 INFO L273 TraceCheckUtils]: 124: Hoare triple {33808#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33808#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:34,613 INFO L273 TraceCheckUtils]: 125: Hoare triple {33808#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {33809#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:34,613 INFO L273 TraceCheckUtils]: 126: Hoare triple {33809#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33809#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:34,614 INFO L273 TraceCheckUtils]: 127: Hoare triple {33809#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33809#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:34,615 INFO L273 TraceCheckUtils]: 128: Hoare triple {33809#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {33810#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:34,615 INFO L273 TraceCheckUtils]: 129: Hoare triple {33810#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33810#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:34,616 INFO L273 TraceCheckUtils]: 130: Hoare triple {33810#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33810#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:34,616 INFO L273 TraceCheckUtils]: 131: Hoare triple {33810#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {33811#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:34,617 INFO L273 TraceCheckUtils]: 132: Hoare triple {33811#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33811#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:34,617 INFO L273 TraceCheckUtils]: 133: Hoare triple {33811#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33811#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:34,618 INFO L273 TraceCheckUtils]: 134: Hoare triple {33811#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {33812#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:34,619 INFO L273 TraceCheckUtils]: 135: Hoare triple {33812#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33812#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:34,619 INFO L273 TraceCheckUtils]: 136: Hoare triple {33812#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33812#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:34,620 INFO L273 TraceCheckUtils]: 137: Hoare triple {33812#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {33813#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:34,620 INFO L273 TraceCheckUtils]: 138: Hoare triple {33813#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33813#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:34,621 INFO L273 TraceCheckUtils]: 139: Hoare triple {33813#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33813#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:34,621 INFO L273 TraceCheckUtils]: 140: Hoare triple {33813#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {33814#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:34,622 INFO L273 TraceCheckUtils]: 141: Hoare triple {33814#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33814#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:34,622 INFO L273 TraceCheckUtils]: 142: Hoare triple {33814#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33814#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:34,623 INFO L273 TraceCheckUtils]: 143: Hoare triple {33814#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {33815#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:34,624 INFO L273 TraceCheckUtils]: 144: Hoare triple {33815#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33815#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:34,624 INFO L273 TraceCheckUtils]: 145: Hoare triple {33815#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {33815#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:34,625 INFO L273 TraceCheckUtils]: 146: Hoare triple {33815#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {33816#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:34,626 INFO L273 TraceCheckUtils]: 147: Hoare triple {33816#(<= main_~i~0 47)} assume !(~i~0 < 100000); {33768#false} is VALID [2018-11-23 12:06:34,626 INFO L273 TraceCheckUtils]: 148: Hoare triple {33768#false} havoc ~x~0;~x~0 := 0; {33768#false} is VALID [2018-11-23 12:06:34,626 INFO L273 TraceCheckUtils]: 149: Hoare triple {33768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {33768#false} is VALID [2018-11-23 12:06:34,626 INFO L256 TraceCheckUtils]: 150: Hoare triple {33768#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {33768#false} is VALID [2018-11-23 12:06:34,626 INFO L273 TraceCheckUtils]: 151: Hoare triple {33768#false} ~cond := #in~cond; {33768#false} is VALID [2018-11-23 12:06:34,626 INFO L273 TraceCheckUtils]: 152: Hoare triple {33768#false} assume 0 == ~cond; {33768#false} is VALID [2018-11-23 12:06:34,627 INFO L273 TraceCheckUtils]: 153: Hoare triple {33768#false} assume !false; {33768#false} is VALID [2018-11-23 12:06:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:34,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:34,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2018-11-23 12:06:34,660 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 154 [2018-11-23 12:06:34,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:34,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 12:06:34,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:34,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 12:06:34,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 12:06:34,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:06:34,816 INFO L87 Difference]: Start difference. First operand 159 states and 207 transitions. Second operand 51 states. [2018-11-23 12:06:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:35,573 INFO L93 Difference]: Finished difference Result 175 states and 226 transitions. [2018-11-23 12:06:35,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 12:06:35,573 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 154 [2018-11-23 12:06:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:06:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 226 transitions. [2018-11-23 12:06:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:06:35,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 226 transitions. [2018-11-23 12:06:35,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 226 transitions. [2018-11-23 12:06:35,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:35,789 INFO L225 Difference]: With dead ends: 175 [2018-11-23 12:06:35,789 INFO L226 Difference]: Without dead ends: 164 [2018-11-23 12:06:35,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:06:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-23 12:06:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2018-11-23 12:06:35,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:35,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand 162 states. [2018-11-23 12:06:35,830 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 162 states. [2018-11-23 12:06:35,830 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 162 states. [2018-11-23 12:06:35,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:35,833 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2018-11-23 12:06:35,833 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 214 transitions. [2018-11-23 12:06:35,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:35,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:35,833 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 164 states. [2018-11-23 12:06:35,833 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 164 states. [2018-11-23 12:06:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:35,836 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2018-11-23 12:06:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 214 transitions. [2018-11-23 12:06:35,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:35,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:35,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:35,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 12:06:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 211 transitions. [2018-11-23 12:06:35,839 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 211 transitions. Word has length 154 [2018-11-23 12:06:35,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:35,840 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 211 transitions. [2018-11-23 12:06:35,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 12:06:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 211 transitions. [2018-11-23 12:06:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-23 12:06:35,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:35,841 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:35,841 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:35,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:35,841 INFO L82 PathProgramCache]: Analyzing trace with hash -2010822983, now seen corresponding path program 48 times [2018-11-23 12:06:35,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:35,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:35,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:35,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:35,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:37,025 INFO L256 TraceCheckUtils]: 0: Hoare triple {35059#true} call ULTIMATE.init(); {35059#true} is VALID [2018-11-23 12:06:37,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {35059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35059#true} is VALID [2018-11-23 12:06:37,026 INFO L273 TraceCheckUtils]: 2: Hoare triple {35059#true} assume true; {35059#true} is VALID [2018-11-23 12:06:37,026 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35059#true} {35059#true} #55#return; {35059#true} is VALID [2018-11-23 12:06:37,026 INFO L256 TraceCheckUtils]: 4: Hoare triple {35059#true} call #t~ret4 := main(); {35059#true} is VALID [2018-11-23 12:06:37,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {35059#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {35061#(= main_~i~0 0)} is VALID [2018-11-23 12:06:37,027 INFO L273 TraceCheckUtils]: 6: Hoare triple {35061#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35061#(= main_~i~0 0)} is VALID [2018-11-23 12:06:37,028 INFO L273 TraceCheckUtils]: 7: Hoare triple {35061#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35061#(= main_~i~0 0)} is VALID [2018-11-23 12:06:37,028 INFO L273 TraceCheckUtils]: 8: Hoare triple {35061#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {35062#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:37,029 INFO L273 TraceCheckUtils]: 9: Hoare triple {35062#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35062#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:37,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {35062#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35062#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:37,029 INFO L273 TraceCheckUtils]: 11: Hoare triple {35062#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {35063#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:37,030 INFO L273 TraceCheckUtils]: 12: Hoare triple {35063#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35063#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:37,030 INFO L273 TraceCheckUtils]: 13: Hoare triple {35063#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35063#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:37,030 INFO L273 TraceCheckUtils]: 14: Hoare triple {35063#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {35064#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:37,031 INFO L273 TraceCheckUtils]: 15: Hoare triple {35064#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35064#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:37,031 INFO L273 TraceCheckUtils]: 16: Hoare triple {35064#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35064#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:37,032 INFO L273 TraceCheckUtils]: 17: Hoare triple {35064#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {35065#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:37,032 INFO L273 TraceCheckUtils]: 18: Hoare triple {35065#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35065#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:37,033 INFO L273 TraceCheckUtils]: 19: Hoare triple {35065#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35065#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:37,033 INFO L273 TraceCheckUtils]: 20: Hoare triple {35065#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {35066#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:37,034 INFO L273 TraceCheckUtils]: 21: Hoare triple {35066#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35066#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:37,034 INFO L273 TraceCheckUtils]: 22: Hoare triple {35066#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35066#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:37,035 INFO L273 TraceCheckUtils]: 23: Hoare triple {35066#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {35067#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:37,035 INFO L273 TraceCheckUtils]: 24: Hoare triple {35067#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35067#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:37,036 INFO L273 TraceCheckUtils]: 25: Hoare triple {35067#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35067#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:37,037 INFO L273 TraceCheckUtils]: 26: Hoare triple {35067#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {35068#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:37,037 INFO L273 TraceCheckUtils]: 27: Hoare triple {35068#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35068#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:37,038 INFO L273 TraceCheckUtils]: 28: Hoare triple {35068#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35068#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:37,038 INFO L273 TraceCheckUtils]: 29: Hoare triple {35068#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {35069#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:37,039 INFO L273 TraceCheckUtils]: 30: Hoare triple {35069#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35069#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:37,039 INFO L273 TraceCheckUtils]: 31: Hoare triple {35069#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35069#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:37,040 INFO L273 TraceCheckUtils]: 32: Hoare triple {35069#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {35070#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:37,041 INFO L273 TraceCheckUtils]: 33: Hoare triple {35070#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35070#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:37,041 INFO L273 TraceCheckUtils]: 34: Hoare triple {35070#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35070#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:37,042 INFO L273 TraceCheckUtils]: 35: Hoare triple {35070#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {35071#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:37,042 INFO L273 TraceCheckUtils]: 36: Hoare triple {35071#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35071#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:37,043 INFO L273 TraceCheckUtils]: 37: Hoare triple {35071#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35071#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:37,043 INFO L273 TraceCheckUtils]: 38: Hoare triple {35071#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {35072#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:37,044 INFO L273 TraceCheckUtils]: 39: Hoare triple {35072#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35072#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:37,044 INFO L273 TraceCheckUtils]: 40: Hoare triple {35072#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35072#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:37,045 INFO L273 TraceCheckUtils]: 41: Hoare triple {35072#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {35073#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:37,046 INFO L273 TraceCheckUtils]: 42: Hoare triple {35073#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35073#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:37,046 INFO L273 TraceCheckUtils]: 43: Hoare triple {35073#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35073#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:37,047 INFO L273 TraceCheckUtils]: 44: Hoare triple {35073#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {35074#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:37,047 INFO L273 TraceCheckUtils]: 45: Hoare triple {35074#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35074#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:37,048 INFO L273 TraceCheckUtils]: 46: Hoare triple {35074#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35074#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:37,049 INFO L273 TraceCheckUtils]: 47: Hoare triple {35074#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {35075#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:37,049 INFO L273 TraceCheckUtils]: 48: Hoare triple {35075#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35075#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:37,050 INFO L273 TraceCheckUtils]: 49: Hoare triple {35075#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35075#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:37,050 INFO L273 TraceCheckUtils]: 50: Hoare triple {35075#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {35076#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:37,051 INFO L273 TraceCheckUtils]: 51: Hoare triple {35076#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35076#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:37,051 INFO L273 TraceCheckUtils]: 52: Hoare triple {35076#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35076#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:37,052 INFO L273 TraceCheckUtils]: 53: Hoare triple {35076#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {35077#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:37,052 INFO L273 TraceCheckUtils]: 54: Hoare triple {35077#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35077#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:37,053 INFO L273 TraceCheckUtils]: 55: Hoare triple {35077#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35077#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:37,054 INFO L273 TraceCheckUtils]: 56: Hoare triple {35077#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {35078#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:37,054 INFO L273 TraceCheckUtils]: 57: Hoare triple {35078#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35078#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:37,055 INFO L273 TraceCheckUtils]: 58: Hoare triple {35078#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35078#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:37,055 INFO L273 TraceCheckUtils]: 59: Hoare triple {35078#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {35079#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:37,056 INFO L273 TraceCheckUtils]: 60: Hoare triple {35079#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35079#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:37,056 INFO L273 TraceCheckUtils]: 61: Hoare triple {35079#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35079#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:37,057 INFO L273 TraceCheckUtils]: 62: Hoare triple {35079#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {35080#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:37,058 INFO L273 TraceCheckUtils]: 63: Hoare triple {35080#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35080#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:37,058 INFO L273 TraceCheckUtils]: 64: Hoare triple {35080#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35080#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:37,059 INFO L273 TraceCheckUtils]: 65: Hoare triple {35080#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {35081#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:37,059 INFO L273 TraceCheckUtils]: 66: Hoare triple {35081#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35081#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:37,060 INFO L273 TraceCheckUtils]: 67: Hoare triple {35081#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35081#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:37,060 INFO L273 TraceCheckUtils]: 68: Hoare triple {35081#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {35082#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:37,061 INFO L273 TraceCheckUtils]: 69: Hoare triple {35082#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35082#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:37,061 INFO L273 TraceCheckUtils]: 70: Hoare triple {35082#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35082#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:37,062 INFO L273 TraceCheckUtils]: 71: Hoare triple {35082#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {35083#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:37,063 INFO L273 TraceCheckUtils]: 72: Hoare triple {35083#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35083#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:37,063 INFO L273 TraceCheckUtils]: 73: Hoare triple {35083#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35083#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:37,064 INFO L273 TraceCheckUtils]: 74: Hoare triple {35083#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {35084#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:37,064 INFO L273 TraceCheckUtils]: 75: Hoare triple {35084#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35084#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:37,065 INFO L273 TraceCheckUtils]: 76: Hoare triple {35084#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35084#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:37,066 INFO L273 TraceCheckUtils]: 77: Hoare triple {35084#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {35085#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:37,066 INFO L273 TraceCheckUtils]: 78: Hoare triple {35085#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35085#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:37,067 INFO L273 TraceCheckUtils]: 79: Hoare triple {35085#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35085#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:37,067 INFO L273 TraceCheckUtils]: 80: Hoare triple {35085#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {35086#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:37,068 INFO L273 TraceCheckUtils]: 81: Hoare triple {35086#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35086#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:37,068 INFO L273 TraceCheckUtils]: 82: Hoare triple {35086#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35086#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:37,069 INFO L273 TraceCheckUtils]: 83: Hoare triple {35086#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {35087#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:37,070 INFO L273 TraceCheckUtils]: 84: Hoare triple {35087#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35087#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:37,070 INFO L273 TraceCheckUtils]: 85: Hoare triple {35087#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35087#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:37,071 INFO L273 TraceCheckUtils]: 86: Hoare triple {35087#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {35088#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:37,071 INFO L273 TraceCheckUtils]: 87: Hoare triple {35088#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35088#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:37,072 INFO L273 TraceCheckUtils]: 88: Hoare triple {35088#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35088#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:37,072 INFO L273 TraceCheckUtils]: 89: Hoare triple {35088#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {35089#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:37,073 INFO L273 TraceCheckUtils]: 90: Hoare triple {35089#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35089#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:37,073 INFO L273 TraceCheckUtils]: 91: Hoare triple {35089#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35089#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:37,074 INFO L273 TraceCheckUtils]: 92: Hoare triple {35089#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {35090#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:37,075 INFO L273 TraceCheckUtils]: 93: Hoare triple {35090#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35090#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:37,075 INFO L273 TraceCheckUtils]: 94: Hoare triple {35090#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35090#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:37,076 INFO L273 TraceCheckUtils]: 95: Hoare triple {35090#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {35091#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:37,076 INFO L273 TraceCheckUtils]: 96: Hoare triple {35091#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35091#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:37,077 INFO L273 TraceCheckUtils]: 97: Hoare triple {35091#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35091#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:37,078 INFO L273 TraceCheckUtils]: 98: Hoare triple {35091#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {35092#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:37,078 INFO L273 TraceCheckUtils]: 99: Hoare triple {35092#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35092#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:37,079 INFO L273 TraceCheckUtils]: 100: Hoare triple {35092#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35092#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:37,079 INFO L273 TraceCheckUtils]: 101: Hoare triple {35092#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {35093#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:37,080 INFO L273 TraceCheckUtils]: 102: Hoare triple {35093#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35093#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:37,080 INFO L273 TraceCheckUtils]: 103: Hoare triple {35093#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35093#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:37,081 INFO L273 TraceCheckUtils]: 104: Hoare triple {35093#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {35094#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:37,082 INFO L273 TraceCheckUtils]: 105: Hoare triple {35094#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35094#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:37,082 INFO L273 TraceCheckUtils]: 106: Hoare triple {35094#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35094#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:37,083 INFO L273 TraceCheckUtils]: 107: Hoare triple {35094#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {35095#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:37,083 INFO L273 TraceCheckUtils]: 108: Hoare triple {35095#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35095#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:37,084 INFO L273 TraceCheckUtils]: 109: Hoare triple {35095#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35095#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:37,084 INFO L273 TraceCheckUtils]: 110: Hoare triple {35095#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {35096#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:37,085 INFO L273 TraceCheckUtils]: 111: Hoare triple {35096#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35096#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:37,085 INFO L273 TraceCheckUtils]: 112: Hoare triple {35096#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35096#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:37,086 INFO L273 TraceCheckUtils]: 113: Hoare triple {35096#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {35097#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:37,087 INFO L273 TraceCheckUtils]: 114: Hoare triple {35097#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35097#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:37,087 INFO L273 TraceCheckUtils]: 115: Hoare triple {35097#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35097#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:37,088 INFO L273 TraceCheckUtils]: 116: Hoare triple {35097#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {35098#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:37,088 INFO L273 TraceCheckUtils]: 117: Hoare triple {35098#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35098#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:37,089 INFO L273 TraceCheckUtils]: 118: Hoare triple {35098#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35098#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:37,089 INFO L273 TraceCheckUtils]: 119: Hoare triple {35098#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {35099#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:37,090 INFO L273 TraceCheckUtils]: 120: Hoare triple {35099#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35099#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:37,090 INFO L273 TraceCheckUtils]: 121: Hoare triple {35099#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35099#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:37,091 INFO L273 TraceCheckUtils]: 122: Hoare triple {35099#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {35100#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:37,092 INFO L273 TraceCheckUtils]: 123: Hoare triple {35100#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35100#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:37,092 INFO L273 TraceCheckUtils]: 124: Hoare triple {35100#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35100#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:37,093 INFO L273 TraceCheckUtils]: 125: Hoare triple {35100#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {35101#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:37,093 INFO L273 TraceCheckUtils]: 126: Hoare triple {35101#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35101#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:37,094 INFO L273 TraceCheckUtils]: 127: Hoare triple {35101#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35101#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:37,095 INFO L273 TraceCheckUtils]: 128: Hoare triple {35101#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {35102#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:37,095 INFO L273 TraceCheckUtils]: 129: Hoare triple {35102#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35102#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:37,096 INFO L273 TraceCheckUtils]: 130: Hoare triple {35102#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35102#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:37,096 INFO L273 TraceCheckUtils]: 131: Hoare triple {35102#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {35103#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:37,097 INFO L273 TraceCheckUtils]: 132: Hoare triple {35103#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35103#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:37,097 INFO L273 TraceCheckUtils]: 133: Hoare triple {35103#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35103#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:37,098 INFO L273 TraceCheckUtils]: 134: Hoare triple {35103#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {35104#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:37,099 INFO L273 TraceCheckUtils]: 135: Hoare triple {35104#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35104#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:37,099 INFO L273 TraceCheckUtils]: 136: Hoare triple {35104#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35104#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:37,100 INFO L273 TraceCheckUtils]: 137: Hoare triple {35104#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {35105#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:37,100 INFO L273 TraceCheckUtils]: 138: Hoare triple {35105#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35105#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:37,101 INFO L273 TraceCheckUtils]: 139: Hoare triple {35105#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35105#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:37,102 INFO L273 TraceCheckUtils]: 140: Hoare triple {35105#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {35106#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:37,102 INFO L273 TraceCheckUtils]: 141: Hoare triple {35106#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35106#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:37,103 INFO L273 TraceCheckUtils]: 142: Hoare triple {35106#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35106#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:37,103 INFO L273 TraceCheckUtils]: 143: Hoare triple {35106#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {35107#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:37,104 INFO L273 TraceCheckUtils]: 144: Hoare triple {35107#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35107#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:37,104 INFO L273 TraceCheckUtils]: 145: Hoare triple {35107#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35107#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:37,105 INFO L273 TraceCheckUtils]: 146: Hoare triple {35107#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {35108#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:37,105 INFO L273 TraceCheckUtils]: 147: Hoare triple {35108#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35108#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:37,106 INFO L273 TraceCheckUtils]: 148: Hoare triple {35108#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35108#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:37,107 INFO L273 TraceCheckUtils]: 149: Hoare triple {35108#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {35109#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:37,107 INFO L273 TraceCheckUtils]: 150: Hoare triple {35109#(<= main_~i~0 48)} assume !(~i~0 < 100000); {35060#false} is VALID [2018-11-23 12:06:37,108 INFO L273 TraceCheckUtils]: 151: Hoare triple {35060#false} havoc ~x~0;~x~0 := 0; {35060#false} is VALID [2018-11-23 12:06:37,108 INFO L273 TraceCheckUtils]: 152: Hoare triple {35060#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {35060#false} is VALID [2018-11-23 12:06:37,108 INFO L256 TraceCheckUtils]: 153: Hoare triple {35060#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {35060#false} is VALID [2018-11-23 12:06:37,108 INFO L273 TraceCheckUtils]: 154: Hoare triple {35060#false} ~cond := #in~cond; {35060#false} is VALID [2018-11-23 12:06:37,108 INFO L273 TraceCheckUtils]: 155: Hoare triple {35060#false} assume 0 == ~cond; {35060#false} is VALID [2018-11-23 12:06:37,108 INFO L273 TraceCheckUtils]: 156: Hoare triple {35060#false} assume !false; {35060#false} is VALID [2018-11-23 12:06:37,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:37,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:37,126 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:37,137 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:37,746 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-11-23 12:06:37,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:37,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:38,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {35059#true} call ULTIMATE.init(); {35059#true} is VALID [2018-11-23 12:06:38,875 INFO L273 TraceCheckUtils]: 1: Hoare triple {35059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35059#true} is VALID [2018-11-23 12:06:38,875 INFO L273 TraceCheckUtils]: 2: Hoare triple {35059#true} assume true; {35059#true} is VALID [2018-11-23 12:06:38,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35059#true} {35059#true} #55#return; {35059#true} is VALID [2018-11-23 12:06:38,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {35059#true} call #t~ret4 := main(); {35059#true} is VALID [2018-11-23 12:06:38,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {35059#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {35128#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:38,877 INFO L273 TraceCheckUtils]: 6: Hoare triple {35128#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35128#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:38,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {35128#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35128#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:38,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {35128#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {35062#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:38,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {35062#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35062#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:38,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {35062#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35062#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:38,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {35062#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {35063#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:38,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {35063#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35063#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:38,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {35063#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35063#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:38,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {35063#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {35064#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:38,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {35064#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35064#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:38,881 INFO L273 TraceCheckUtils]: 16: Hoare triple {35064#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35064#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:38,882 INFO L273 TraceCheckUtils]: 17: Hoare triple {35064#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {35065#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:38,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {35065#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35065#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:38,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {35065#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35065#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:38,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {35065#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {35066#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:38,884 INFO L273 TraceCheckUtils]: 21: Hoare triple {35066#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35066#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:38,885 INFO L273 TraceCheckUtils]: 22: Hoare triple {35066#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35066#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:38,885 INFO L273 TraceCheckUtils]: 23: Hoare triple {35066#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {35067#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:38,886 INFO L273 TraceCheckUtils]: 24: Hoare triple {35067#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35067#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:38,886 INFO L273 TraceCheckUtils]: 25: Hoare triple {35067#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35067#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:38,887 INFO L273 TraceCheckUtils]: 26: Hoare triple {35067#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {35068#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:38,888 INFO L273 TraceCheckUtils]: 27: Hoare triple {35068#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35068#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:38,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {35068#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35068#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:38,889 INFO L273 TraceCheckUtils]: 29: Hoare triple {35068#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {35069#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:38,889 INFO L273 TraceCheckUtils]: 30: Hoare triple {35069#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35069#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:38,890 INFO L273 TraceCheckUtils]: 31: Hoare triple {35069#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35069#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:38,891 INFO L273 TraceCheckUtils]: 32: Hoare triple {35069#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {35070#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:38,891 INFO L273 TraceCheckUtils]: 33: Hoare triple {35070#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35070#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:38,892 INFO L273 TraceCheckUtils]: 34: Hoare triple {35070#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35070#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:38,892 INFO L273 TraceCheckUtils]: 35: Hoare triple {35070#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {35071#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:38,893 INFO L273 TraceCheckUtils]: 36: Hoare triple {35071#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35071#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:38,893 INFO L273 TraceCheckUtils]: 37: Hoare triple {35071#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35071#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:38,894 INFO L273 TraceCheckUtils]: 38: Hoare triple {35071#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {35072#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:38,894 INFO L273 TraceCheckUtils]: 39: Hoare triple {35072#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35072#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:38,895 INFO L273 TraceCheckUtils]: 40: Hoare triple {35072#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35072#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:38,896 INFO L273 TraceCheckUtils]: 41: Hoare triple {35072#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {35073#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:38,896 INFO L273 TraceCheckUtils]: 42: Hoare triple {35073#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35073#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:38,897 INFO L273 TraceCheckUtils]: 43: Hoare triple {35073#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35073#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:38,897 INFO L273 TraceCheckUtils]: 44: Hoare triple {35073#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {35074#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:38,898 INFO L273 TraceCheckUtils]: 45: Hoare triple {35074#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35074#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:38,898 INFO L273 TraceCheckUtils]: 46: Hoare triple {35074#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35074#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:38,899 INFO L273 TraceCheckUtils]: 47: Hoare triple {35074#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {35075#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:38,900 INFO L273 TraceCheckUtils]: 48: Hoare triple {35075#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35075#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:38,900 INFO L273 TraceCheckUtils]: 49: Hoare triple {35075#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35075#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:38,901 INFO L273 TraceCheckUtils]: 50: Hoare triple {35075#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {35076#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:38,901 INFO L273 TraceCheckUtils]: 51: Hoare triple {35076#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35076#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:38,902 INFO L273 TraceCheckUtils]: 52: Hoare triple {35076#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35076#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:38,903 INFO L273 TraceCheckUtils]: 53: Hoare triple {35076#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {35077#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:38,903 INFO L273 TraceCheckUtils]: 54: Hoare triple {35077#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35077#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:38,904 INFO L273 TraceCheckUtils]: 55: Hoare triple {35077#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35077#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:38,904 INFO L273 TraceCheckUtils]: 56: Hoare triple {35077#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {35078#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:38,905 INFO L273 TraceCheckUtils]: 57: Hoare triple {35078#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35078#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:38,905 INFO L273 TraceCheckUtils]: 58: Hoare triple {35078#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35078#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:38,906 INFO L273 TraceCheckUtils]: 59: Hoare triple {35078#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {35079#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:38,907 INFO L273 TraceCheckUtils]: 60: Hoare triple {35079#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35079#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:38,907 INFO L273 TraceCheckUtils]: 61: Hoare triple {35079#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35079#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:38,908 INFO L273 TraceCheckUtils]: 62: Hoare triple {35079#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {35080#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:38,908 INFO L273 TraceCheckUtils]: 63: Hoare triple {35080#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35080#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:38,909 INFO L273 TraceCheckUtils]: 64: Hoare triple {35080#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35080#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:38,910 INFO L273 TraceCheckUtils]: 65: Hoare triple {35080#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {35081#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:38,910 INFO L273 TraceCheckUtils]: 66: Hoare triple {35081#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35081#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:38,911 INFO L273 TraceCheckUtils]: 67: Hoare triple {35081#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35081#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:38,911 INFO L273 TraceCheckUtils]: 68: Hoare triple {35081#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {35082#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:38,912 INFO L273 TraceCheckUtils]: 69: Hoare triple {35082#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35082#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:38,912 INFO L273 TraceCheckUtils]: 70: Hoare triple {35082#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35082#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:38,913 INFO L273 TraceCheckUtils]: 71: Hoare triple {35082#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {35083#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:38,914 INFO L273 TraceCheckUtils]: 72: Hoare triple {35083#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35083#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:38,914 INFO L273 TraceCheckUtils]: 73: Hoare triple {35083#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35083#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:38,915 INFO L273 TraceCheckUtils]: 74: Hoare triple {35083#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {35084#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:38,915 INFO L273 TraceCheckUtils]: 75: Hoare triple {35084#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35084#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:38,916 INFO L273 TraceCheckUtils]: 76: Hoare triple {35084#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35084#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:38,917 INFO L273 TraceCheckUtils]: 77: Hoare triple {35084#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {35085#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:38,917 INFO L273 TraceCheckUtils]: 78: Hoare triple {35085#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35085#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:38,918 INFO L273 TraceCheckUtils]: 79: Hoare triple {35085#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35085#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:38,918 INFO L273 TraceCheckUtils]: 80: Hoare triple {35085#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {35086#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:38,919 INFO L273 TraceCheckUtils]: 81: Hoare triple {35086#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35086#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:38,919 INFO L273 TraceCheckUtils]: 82: Hoare triple {35086#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35086#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:38,920 INFO L273 TraceCheckUtils]: 83: Hoare triple {35086#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {35087#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:38,921 INFO L273 TraceCheckUtils]: 84: Hoare triple {35087#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35087#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:38,921 INFO L273 TraceCheckUtils]: 85: Hoare triple {35087#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35087#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:38,922 INFO L273 TraceCheckUtils]: 86: Hoare triple {35087#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {35088#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:38,922 INFO L273 TraceCheckUtils]: 87: Hoare triple {35088#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35088#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:38,923 INFO L273 TraceCheckUtils]: 88: Hoare triple {35088#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35088#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:38,924 INFO L273 TraceCheckUtils]: 89: Hoare triple {35088#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {35089#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:38,924 INFO L273 TraceCheckUtils]: 90: Hoare triple {35089#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35089#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:38,925 INFO L273 TraceCheckUtils]: 91: Hoare triple {35089#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35089#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:38,925 INFO L273 TraceCheckUtils]: 92: Hoare triple {35089#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {35090#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:38,926 INFO L273 TraceCheckUtils]: 93: Hoare triple {35090#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35090#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:38,926 INFO L273 TraceCheckUtils]: 94: Hoare triple {35090#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35090#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:38,927 INFO L273 TraceCheckUtils]: 95: Hoare triple {35090#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {35091#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:38,927 INFO L273 TraceCheckUtils]: 96: Hoare triple {35091#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35091#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:38,928 INFO L273 TraceCheckUtils]: 97: Hoare triple {35091#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35091#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:38,929 INFO L273 TraceCheckUtils]: 98: Hoare triple {35091#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {35092#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:38,929 INFO L273 TraceCheckUtils]: 99: Hoare triple {35092#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35092#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:38,930 INFO L273 TraceCheckUtils]: 100: Hoare triple {35092#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35092#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:38,930 INFO L273 TraceCheckUtils]: 101: Hoare triple {35092#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {35093#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:38,931 INFO L273 TraceCheckUtils]: 102: Hoare triple {35093#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35093#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:38,931 INFO L273 TraceCheckUtils]: 103: Hoare triple {35093#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35093#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:38,932 INFO L273 TraceCheckUtils]: 104: Hoare triple {35093#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {35094#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:38,932 INFO L273 TraceCheckUtils]: 105: Hoare triple {35094#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35094#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:38,933 INFO L273 TraceCheckUtils]: 106: Hoare triple {35094#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35094#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:38,934 INFO L273 TraceCheckUtils]: 107: Hoare triple {35094#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {35095#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:38,934 INFO L273 TraceCheckUtils]: 108: Hoare triple {35095#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35095#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:38,935 INFO L273 TraceCheckUtils]: 109: Hoare triple {35095#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35095#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:38,935 INFO L273 TraceCheckUtils]: 110: Hoare triple {35095#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {35096#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:38,936 INFO L273 TraceCheckUtils]: 111: Hoare triple {35096#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35096#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:38,936 INFO L273 TraceCheckUtils]: 112: Hoare triple {35096#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35096#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:38,937 INFO L273 TraceCheckUtils]: 113: Hoare triple {35096#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {35097#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:38,937 INFO L273 TraceCheckUtils]: 114: Hoare triple {35097#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35097#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:38,938 INFO L273 TraceCheckUtils]: 115: Hoare triple {35097#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35097#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:38,938 INFO L273 TraceCheckUtils]: 116: Hoare triple {35097#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {35098#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:38,939 INFO L273 TraceCheckUtils]: 117: Hoare triple {35098#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35098#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:38,939 INFO L273 TraceCheckUtils]: 118: Hoare triple {35098#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35098#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:38,940 INFO L273 TraceCheckUtils]: 119: Hoare triple {35098#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {35099#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:38,941 INFO L273 TraceCheckUtils]: 120: Hoare triple {35099#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35099#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:38,941 INFO L273 TraceCheckUtils]: 121: Hoare triple {35099#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35099#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:38,942 INFO L273 TraceCheckUtils]: 122: Hoare triple {35099#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {35100#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:38,942 INFO L273 TraceCheckUtils]: 123: Hoare triple {35100#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35100#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:38,943 INFO L273 TraceCheckUtils]: 124: Hoare triple {35100#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35100#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:38,943 INFO L273 TraceCheckUtils]: 125: Hoare triple {35100#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {35101#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:38,944 INFO L273 TraceCheckUtils]: 126: Hoare triple {35101#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35101#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:38,944 INFO L273 TraceCheckUtils]: 127: Hoare triple {35101#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35101#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:38,945 INFO L273 TraceCheckUtils]: 128: Hoare triple {35101#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {35102#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:38,946 INFO L273 TraceCheckUtils]: 129: Hoare triple {35102#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35102#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:38,946 INFO L273 TraceCheckUtils]: 130: Hoare triple {35102#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35102#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:38,947 INFO L273 TraceCheckUtils]: 131: Hoare triple {35102#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {35103#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:38,947 INFO L273 TraceCheckUtils]: 132: Hoare triple {35103#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35103#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:38,948 INFO L273 TraceCheckUtils]: 133: Hoare triple {35103#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35103#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:38,948 INFO L273 TraceCheckUtils]: 134: Hoare triple {35103#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {35104#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:38,949 INFO L273 TraceCheckUtils]: 135: Hoare triple {35104#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35104#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:38,949 INFO L273 TraceCheckUtils]: 136: Hoare triple {35104#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35104#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:38,950 INFO L273 TraceCheckUtils]: 137: Hoare triple {35104#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {35105#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:38,951 INFO L273 TraceCheckUtils]: 138: Hoare triple {35105#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35105#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:38,951 INFO L273 TraceCheckUtils]: 139: Hoare triple {35105#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35105#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:38,952 INFO L273 TraceCheckUtils]: 140: Hoare triple {35105#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {35106#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:38,952 INFO L273 TraceCheckUtils]: 141: Hoare triple {35106#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35106#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:38,953 INFO L273 TraceCheckUtils]: 142: Hoare triple {35106#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35106#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:38,954 INFO L273 TraceCheckUtils]: 143: Hoare triple {35106#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {35107#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:38,954 INFO L273 TraceCheckUtils]: 144: Hoare triple {35107#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35107#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:38,955 INFO L273 TraceCheckUtils]: 145: Hoare triple {35107#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35107#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:38,955 INFO L273 TraceCheckUtils]: 146: Hoare triple {35107#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {35108#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:38,956 INFO L273 TraceCheckUtils]: 147: Hoare triple {35108#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35108#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:38,956 INFO L273 TraceCheckUtils]: 148: Hoare triple {35108#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {35108#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:38,957 INFO L273 TraceCheckUtils]: 149: Hoare triple {35108#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {35109#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:38,958 INFO L273 TraceCheckUtils]: 150: Hoare triple {35109#(<= main_~i~0 48)} assume !(~i~0 < 100000); {35060#false} is VALID [2018-11-23 12:06:38,958 INFO L273 TraceCheckUtils]: 151: Hoare triple {35060#false} havoc ~x~0;~x~0 := 0; {35060#false} is VALID [2018-11-23 12:06:38,958 INFO L273 TraceCheckUtils]: 152: Hoare triple {35060#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {35060#false} is VALID [2018-11-23 12:06:38,958 INFO L256 TraceCheckUtils]: 153: Hoare triple {35060#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {35060#false} is VALID [2018-11-23 12:06:38,958 INFO L273 TraceCheckUtils]: 154: Hoare triple {35060#false} ~cond := #in~cond; {35060#false} is VALID [2018-11-23 12:06:38,959 INFO L273 TraceCheckUtils]: 155: Hoare triple {35060#false} assume 0 == ~cond; {35060#false} is VALID [2018-11-23 12:06:38,959 INFO L273 TraceCheckUtils]: 156: Hoare triple {35060#false} assume !false; {35060#false} is VALID [2018-11-23 12:06:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:38,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:38,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2018-11-23 12:06:38,993 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 157 [2018-11-23 12:06:38,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:38,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 12:06:39,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:39,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 12:06:39,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 12:06:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:06:39,152 INFO L87 Difference]: Start difference. First operand 162 states and 211 transitions. Second operand 52 states. [2018-11-23 12:06:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:40,073 INFO L93 Difference]: Finished difference Result 178 states and 230 transitions. [2018-11-23 12:06:40,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 12:06:40,073 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 157 [2018-11-23 12:06:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:06:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 230 transitions. [2018-11-23 12:06:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:06:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 230 transitions. [2018-11-23 12:06:40,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 230 transitions. [2018-11-23 12:06:40,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:40,294 INFO L225 Difference]: With dead ends: 178 [2018-11-23 12:06:40,294 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 12:06:40,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:06:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 12:06:40,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-11-23 12:06:40,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:40,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 165 states. [2018-11-23 12:06:40,329 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 165 states. [2018-11-23 12:06:40,330 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 165 states. [2018-11-23 12:06:40,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:40,332 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2018-11-23 12:06:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 218 transitions. [2018-11-23 12:06:40,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:40,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:40,332 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 167 states. [2018-11-23 12:06:40,332 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 167 states. [2018-11-23 12:06:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:40,334 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2018-11-23 12:06:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 218 transitions. [2018-11-23 12:06:40,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:40,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:40,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:40,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 12:06:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 215 transitions. [2018-11-23 12:06:40,337 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 215 transitions. Word has length 157 [2018-11-23 12:06:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:40,337 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 215 transitions. [2018-11-23 12:06:40,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 12:06:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 215 transitions. [2018-11-23 12:06:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 12:06:40,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:40,338 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:40,338 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:40,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:40,339 INFO L82 PathProgramCache]: Analyzing trace with hash 821723875, now seen corresponding path program 49 times [2018-11-23 12:06:40,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:40,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:40,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:41,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {36375#true} call ULTIMATE.init(); {36375#true} is VALID [2018-11-23 12:06:41,742 INFO L273 TraceCheckUtils]: 1: Hoare triple {36375#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36375#true} is VALID [2018-11-23 12:06:41,742 INFO L273 TraceCheckUtils]: 2: Hoare triple {36375#true} assume true; {36375#true} is VALID [2018-11-23 12:06:41,742 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36375#true} {36375#true} #55#return; {36375#true} is VALID [2018-11-23 12:06:41,742 INFO L256 TraceCheckUtils]: 4: Hoare triple {36375#true} call #t~ret4 := main(); {36375#true} is VALID [2018-11-23 12:06:41,743 INFO L273 TraceCheckUtils]: 5: Hoare triple {36375#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {36377#(= main_~i~0 0)} is VALID [2018-11-23 12:06:41,743 INFO L273 TraceCheckUtils]: 6: Hoare triple {36377#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36377#(= main_~i~0 0)} is VALID [2018-11-23 12:06:41,744 INFO L273 TraceCheckUtils]: 7: Hoare triple {36377#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36377#(= main_~i~0 0)} is VALID [2018-11-23 12:06:41,744 INFO L273 TraceCheckUtils]: 8: Hoare triple {36377#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {36378#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:41,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {36378#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36378#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:41,745 INFO L273 TraceCheckUtils]: 10: Hoare triple {36378#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36378#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:41,745 INFO L273 TraceCheckUtils]: 11: Hoare triple {36378#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {36379#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:41,746 INFO L273 TraceCheckUtils]: 12: Hoare triple {36379#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36379#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:41,746 INFO L273 TraceCheckUtils]: 13: Hoare triple {36379#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36379#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:41,747 INFO L273 TraceCheckUtils]: 14: Hoare triple {36379#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {36380#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:41,747 INFO L273 TraceCheckUtils]: 15: Hoare triple {36380#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36380#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:41,748 INFO L273 TraceCheckUtils]: 16: Hoare triple {36380#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36380#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:41,748 INFO L273 TraceCheckUtils]: 17: Hoare triple {36380#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {36381#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:41,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {36381#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36381#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:41,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {36381#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36381#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:41,750 INFO L273 TraceCheckUtils]: 20: Hoare triple {36381#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {36382#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:41,751 INFO L273 TraceCheckUtils]: 21: Hoare triple {36382#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36382#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:41,751 INFO L273 TraceCheckUtils]: 22: Hoare triple {36382#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36382#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:41,752 INFO L273 TraceCheckUtils]: 23: Hoare triple {36382#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {36383#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:41,752 INFO L273 TraceCheckUtils]: 24: Hoare triple {36383#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36383#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:41,753 INFO L273 TraceCheckUtils]: 25: Hoare triple {36383#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36383#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:41,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {36383#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {36384#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:41,754 INFO L273 TraceCheckUtils]: 27: Hoare triple {36384#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36384#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:41,754 INFO L273 TraceCheckUtils]: 28: Hoare triple {36384#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36384#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:41,755 INFO L273 TraceCheckUtils]: 29: Hoare triple {36384#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {36385#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:41,756 INFO L273 TraceCheckUtils]: 30: Hoare triple {36385#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36385#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:41,756 INFO L273 TraceCheckUtils]: 31: Hoare triple {36385#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36385#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:41,757 INFO L273 TraceCheckUtils]: 32: Hoare triple {36385#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {36386#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:41,757 INFO L273 TraceCheckUtils]: 33: Hoare triple {36386#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36386#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:41,758 INFO L273 TraceCheckUtils]: 34: Hoare triple {36386#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36386#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:41,759 INFO L273 TraceCheckUtils]: 35: Hoare triple {36386#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {36387#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:41,759 INFO L273 TraceCheckUtils]: 36: Hoare triple {36387#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36387#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:41,760 INFO L273 TraceCheckUtils]: 37: Hoare triple {36387#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36387#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:41,760 INFO L273 TraceCheckUtils]: 38: Hoare triple {36387#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {36388#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:41,761 INFO L273 TraceCheckUtils]: 39: Hoare triple {36388#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36388#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:41,761 INFO L273 TraceCheckUtils]: 40: Hoare triple {36388#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36388#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:41,762 INFO L273 TraceCheckUtils]: 41: Hoare triple {36388#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {36389#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:41,762 INFO L273 TraceCheckUtils]: 42: Hoare triple {36389#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36389#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:41,763 INFO L273 TraceCheckUtils]: 43: Hoare triple {36389#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36389#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:41,764 INFO L273 TraceCheckUtils]: 44: Hoare triple {36389#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {36390#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:41,764 INFO L273 TraceCheckUtils]: 45: Hoare triple {36390#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36390#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:41,765 INFO L273 TraceCheckUtils]: 46: Hoare triple {36390#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36390#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:41,765 INFO L273 TraceCheckUtils]: 47: Hoare triple {36390#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {36391#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:41,766 INFO L273 TraceCheckUtils]: 48: Hoare triple {36391#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36391#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:41,766 INFO L273 TraceCheckUtils]: 49: Hoare triple {36391#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36391#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:41,767 INFO L273 TraceCheckUtils]: 50: Hoare triple {36391#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {36392#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:41,768 INFO L273 TraceCheckUtils]: 51: Hoare triple {36392#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36392#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:41,768 INFO L273 TraceCheckUtils]: 52: Hoare triple {36392#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36392#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:41,769 INFO L273 TraceCheckUtils]: 53: Hoare triple {36392#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {36393#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:41,769 INFO L273 TraceCheckUtils]: 54: Hoare triple {36393#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36393#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:41,770 INFO L273 TraceCheckUtils]: 55: Hoare triple {36393#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36393#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:41,771 INFO L273 TraceCheckUtils]: 56: Hoare triple {36393#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {36394#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:41,771 INFO L273 TraceCheckUtils]: 57: Hoare triple {36394#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36394#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:41,772 INFO L273 TraceCheckUtils]: 58: Hoare triple {36394#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36394#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:41,772 INFO L273 TraceCheckUtils]: 59: Hoare triple {36394#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {36395#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:41,773 INFO L273 TraceCheckUtils]: 60: Hoare triple {36395#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36395#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:41,773 INFO L273 TraceCheckUtils]: 61: Hoare triple {36395#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36395#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:41,774 INFO L273 TraceCheckUtils]: 62: Hoare triple {36395#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {36396#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:41,774 INFO L273 TraceCheckUtils]: 63: Hoare triple {36396#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36396#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:41,775 INFO L273 TraceCheckUtils]: 64: Hoare triple {36396#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36396#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:41,776 INFO L273 TraceCheckUtils]: 65: Hoare triple {36396#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {36397#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:41,776 INFO L273 TraceCheckUtils]: 66: Hoare triple {36397#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36397#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:41,777 INFO L273 TraceCheckUtils]: 67: Hoare triple {36397#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36397#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:41,777 INFO L273 TraceCheckUtils]: 68: Hoare triple {36397#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {36398#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:41,778 INFO L273 TraceCheckUtils]: 69: Hoare triple {36398#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36398#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:41,778 INFO L273 TraceCheckUtils]: 70: Hoare triple {36398#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36398#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:41,779 INFO L273 TraceCheckUtils]: 71: Hoare triple {36398#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {36399#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:41,780 INFO L273 TraceCheckUtils]: 72: Hoare triple {36399#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36399#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:41,780 INFO L273 TraceCheckUtils]: 73: Hoare triple {36399#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36399#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:41,781 INFO L273 TraceCheckUtils]: 74: Hoare triple {36399#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {36400#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:41,781 INFO L273 TraceCheckUtils]: 75: Hoare triple {36400#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36400#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:41,782 INFO L273 TraceCheckUtils]: 76: Hoare triple {36400#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36400#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:41,783 INFO L273 TraceCheckUtils]: 77: Hoare triple {36400#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {36401#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:41,783 INFO L273 TraceCheckUtils]: 78: Hoare triple {36401#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36401#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:41,784 INFO L273 TraceCheckUtils]: 79: Hoare triple {36401#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36401#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:41,784 INFO L273 TraceCheckUtils]: 80: Hoare triple {36401#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {36402#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:41,785 INFO L273 TraceCheckUtils]: 81: Hoare triple {36402#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36402#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:41,785 INFO L273 TraceCheckUtils]: 82: Hoare triple {36402#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36402#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:41,786 INFO L273 TraceCheckUtils]: 83: Hoare triple {36402#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {36403#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:41,786 INFO L273 TraceCheckUtils]: 84: Hoare triple {36403#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36403#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:41,787 INFO L273 TraceCheckUtils]: 85: Hoare triple {36403#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36403#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:41,788 INFO L273 TraceCheckUtils]: 86: Hoare triple {36403#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {36404#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:41,788 INFO L273 TraceCheckUtils]: 87: Hoare triple {36404#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36404#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:41,789 INFO L273 TraceCheckUtils]: 88: Hoare triple {36404#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36404#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:41,789 INFO L273 TraceCheckUtils]: 89: Hoare triple {36404#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {36405#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:41,790 INFO L273 TraceCheckUtils]: 90: Hoare triple {36405#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36405#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:41,790 INFO L273 TraceCheckUtils]: 91: Hoare triple {36405#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36405#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:41,791 INFO L273 TraceCheckUtils]: 92: Hoare triple {36405#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {36406#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:41,792 INFO L273 TraceCheckUtils]: 93: Hoare triple {36406#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36406#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:41,792 INFO L273 TraceCheckUtils]: 94: Hoare triple {36406#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36406#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:41,793 INFO L273 TraceCheckUtils]: 95: Hoare triple {36406#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {36407#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:41,793 INFO L273 TraceCheckUtils]: 96: Hoare triple {36407#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36407#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:41,794 INFO L273 TraceCheckUtils]: 97: Hoare triple {36407#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36407#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:41,794 INFO L273 TraceCheckUtils]: 98: Hoare triple {36407#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {36408#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:41,795 INFO L273 TraceCheckUtils]: 99: Hoare triple {36408#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36408#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:41,795 INFO L273 TraceCheckUtils]: 100: Hoare triple {36408#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36408#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:41,796 INFO L273 TraceCheckUtils]: 101: Hoare triple {36408#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {36409#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:41,797 INFO L273 TraceCheckUtils]: 102: Hoare triple {36409#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36409#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:41,797 INFO L273 TraceCheckUtils]: 103: Hoare triple {36409#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36409#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:41,798 INFO L273 TraceCheckUtils]: 104: Hoare triple {36409#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {36410#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:41,798 INFO L273 TraceCheckUtils]: 105: Hoare triple {36410#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36410#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:41,799 INFO L273 TraceCheckUtils]: 106: Hoare triple {36410#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36410#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:41,800 INFO L273 TraceCheckUtils]: 107: Hoare triple {36410#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {36411#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:41,800 INFO L273 TraceCheckUtils]: 108: Hoare triple {36411#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36411#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:41,801 INFO L273 TraceCheckUtils]: 109: Hoare triple {36411#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36411#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:41,801 INFO L273 TraceCheckUtils]: 110: Hoare triple {36411#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {36412#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:41,802 INFO L273 TraceCheckUtils]: 111: Hoare triple {36412#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36412#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:41,802 INFO L273 TraceCheckUtils]: 112: Hoare triple {36412#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36412#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:41,803 INFO L273 TraceCheckUtils]: 113: Hoare triple {36412#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {36413#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:41,804 INFO L273 TraceCheckUtils]: 114: Hoare triple {36413#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36413#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:41,804 INFO L273 TraceCheckUtils]: 115: Hoare triple {36413#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36413#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:41,805 INFO L273 TraceCheckUtils]: 116: Hoare triple {36413#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {36414#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:41,805 INFO L273 TraceCheckUtils]: 117: Hoare triple {36414#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36414#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:41,806 INFO L273 TraceCheckUtils]: 118: Hoare triple {36414#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36414#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:41,806 INFO L273 TraceCheckUtils]: 119: Hoare triple {36414#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {36415#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:41,807 INFO L273 TraceCheckUtils]: 120: Hoare triple {36415#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36415#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:41,807 INFO L273 TraceCheckUtils]: 121: Hoare triple {36415#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36415#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:41,808 INFO L273 TraceCheckUtils]: 122: Hoare triple {36415#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {36416#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:41,809 INFO L273 TraceCheckUtils]: 123: Hoare triple {36416#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36416#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:41,809 INFO L273 TraceCheckUtils]: 124: Hoare triple {36416#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36416#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:41,810 INFO L273 TraceCheckUtils]: 125: Hoare triple {36416#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {36417#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:41,810 INFO L273 TraceCheckUtils]: 126: Hoare triple {36417#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36417#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:41,811 INFO L273 TraceCheckUtils]: 127: Hoare triple {36417#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36417#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:41,812 INFO L273 TraceCheckUtils]: 128: Hoare triple {36417#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {36418#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:41,812 INFO L273 TraceCheckUtils]: 129: Hoare triple {36418#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36418#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:41,813 INFO L273 TraceCheckUtils]: 130: Hoare triple {36418#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36418#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:41,813 INFO L273 TraceCheckUtils]: 131: Hoare triple {36418#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {36419#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:41,814 INFO L273 TraceCheckUtils]: 132: Hoare triple {36419#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36419#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:41,814 INFO L273 TraceCheckUtils]: 133: Hoare triple {36419#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36419#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:41,815 INFO L273 TraceCheckUtils]: 134: Hoare triple {36419#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {36420#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:41,816 INFO L273 TraceCheckUtils]: 135: Hoare triple {36420#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36420#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:41,816 INFO L273 TraceCheckUtils]: 136: Hoare triple {36420#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36420#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:41,817 INFO L273 TraceCheckUtils]: 137: Hoare triple {36420#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {36421#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:41,817 INFO L273 TraceCheckUtils]: 138: Hoare triple {36421#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36421#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:41,818 INFO L273 TraceCheckUtils]: 139: Hoare triple {36421#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36421#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:41,818 INFO L273 TraceCheckUtils]: 140: Hoare triple {36421#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {36422#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:41,819 INFO L273 TraceCheckUtils]: 141: Hoare triple {36422#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36422#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:41,819 INFO L273 TraceCheckUtils]: 142: Hoare triple {36422#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36422#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:41,820 INFO L273 TraceCheckUtils]: 143: Hoare triple {36422#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {36423#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:41,821 INFO L273 TraceCheckUtils]: 144: Hoare triple {36423#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36423#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:41,821 INFO L273 TraceCheckUtils]: 145: Hoare triple {36423#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36423#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:41,822 INFO L273 TraceCheckUtils]: 146: Hoare triple {36423#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {36424#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:41,822 INFO L273 TraceCheckUtils]: 147: Hoare triple {36424#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36424#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:41,823 INFO L273 TraceCheckUtils]: 148: Hoare triple {36424#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36424#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:41,824 INFO L273 TraceCheckUtils]: 149: Hoare triple {36424#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {36425#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:41,824 INFO L273 TraceCheckUtils]: 150: Hoare triple {36425#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36425#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:41,825 INFO L273 TraceCheckUtils]: 151: Hoare triple {36425#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36425#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:41,825 INFO L273 TraceCheckUtils]: 152: Hoare triple {36425#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {36426#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:41,826 INFO L273 TraceCheckUtils]: 153: Hoare triple {36426#(<= main_~i~0 49)} assume !(~i~0 < 100000); {36376#false} is VALID [2018-11-23 12:06:41,826 INFO L273 TraceCheckUtils]: 154: Hoare triple {36376#false} havoc ~x~0;~x~0 := 0; {36376#false} is VALID [2018-11-23 12:06:41,826 INFO L273 TraceCheckUtils]: 155: Hoare triple {36376#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {36376#false} is VALID [2018-11-23 12:06:41,826 INFO L256 TraceCheckUtils]: 156: Hoare triple {36376#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {36376#false} is VALID [2018-11-23 12:06:41,827 INFO L273 TraceCheckUtils]: 157: Hoare triple {36376#false} ~cond := #in~cond; {36376#false} is VALID [2018-11-23 12:06:41,827 INFO L273 TraceCheckUtils]: 158: Hoare triple {36376#false} assume 0 == ~cond; {36376#false} is VALID [2018-11-23 12:06:41,827 INFO L273 TraceCheckUtils]: 159: Hoare triple {36376#false} assume !false; {36376#false} is VALID [2018-11-23 12:06:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:41,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:41,843 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:41,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:41,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:42,286 INFO L256 TraceCheckUtils]: 0: Hoare triple {36375#true} call ULTIMATE.init(); {36375#true} is VALID [2018-11-23 12:06:42,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {36375#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36375#true} is VALID [2018-11-23 12:06:42,287 INFO L273 TraceCheckUtils]: 2: Hoare triple {36375#true} assume true; {36375#true} is VALID [2018-11-23 12:06:42,287 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36375#true} {36375#true} #55#return; {36375#true} is VALID [2018-11-23 12:06:42,287 INFO L256 TraceCheckUtils]: 4: Hoare triple {36375#true} call #t~ret4 := main(); {36375#true} is VALID [2018-11-23 12:06:42,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {36375#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {36445#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:42,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {36445#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36445#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:42,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {36445#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36445#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:42,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {36445#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {36378#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:42,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {36378#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36378#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:42,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {36378#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36378#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:42,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {36378#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {36379#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:42,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {36379#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36379#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:42,290 INFO L273 TraceCheckUtils]: 13: Hoare triple {36379#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36379#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:42,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {36379#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {36380#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:42,291 INFO L273 TraceCheckUtils]: 15: Hoare triple {36380#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36380#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:42,292 INFO L273 TraceCheckUtils]: 16: Hoare triple {36380#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36380#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:42,293 INFO L273 TraceCheckUtils]: 17: Hoare triple {36380#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {36381#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:42,293 INFO L273 TraceCheckUtils]: 18: Hoare triple {36381#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36381#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:42,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {36381#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36381#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:42,294 INFO L273 TraceCheckUtils]: 20: Hoare triple {36381#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {36382#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:42,295 INFO L273 TraceCheckUtils]: 21: Hoare triple {36382#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36382#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:42,295 INFO L273 TraceCheckUtils]: 22: Hoare triple {36382#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36382#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:42,296 INFO L273 TraceCheckUtils]: 23: Hoare triple {36382#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {36383#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:42,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {36383#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36383#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:42,297 INFO L273 TraceCheckUtils]: 25: Hoare triple {36383#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36383#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:42,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {36383#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {36384#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:42,298 INFO L273 TraceCheckUtils]: 27: Hoare triple {36384#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36384#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:42,299 INFO L273 TraceCheckUtils]: 28: Hoare triple {36384#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36384#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:42,299 INFO L273 TraceCheckUtils]: 29: Hoare triple {36384#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {36385#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:42,300 INFO L273 TraceCheckUtils]: 30: Hoare triple {36385#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36385#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:42,300 INFO L273 TraceCheckUtils]: 31: Hoare triple {36385#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36385#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:42,301 INFO L273 TraceCheckUtils]: 32: Hoare triple {36385#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {36386#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:42,302 INFO L273 TraceCheckUtils]: 33: Hoare triple {36386#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36386#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:42,302 INFO L273 TraceCheckUtils]: 34: Hoare triple {36386#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36386#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:42,303 INFO L273 TraceCheckUtils]: 35: Hoare triple {36386#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {36387#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:42,303 INFO L273 TraceCheckUtils]: 36: Hoare triple {36387#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36387#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:42,304 INFO L273 TraceCheckUtils]: 37: Hoare triple {36387#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36387#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:42,305 INFO L273 TraceCheckUtils]: 38: Hoare triple {36387#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {36388#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:42,305 INFO L273 TraceCheckUtils]: 39: Hoare triple {36388#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36388#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:42,306 INFO L273 TraceCheckUtils]: 40: Hoare triple {36388#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36388#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:42,306 INFO L273 TraceCheckUtils]: 41: Hoare triple {36388#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {36389#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:42,307 INFO L273 TraceCheckUtils]: 42: Hoare triple {36389#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36389#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:42,307 INFO L273 TraceCheckUtils]: 43: Hoare triple {36389#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36389#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:42,308 INFO L273 TraceCheckUtils]: 44: Hoare triple {36389#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {36390#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:42,309 INFO L273 TraceCheckUtils]: 45: Hoare triple {36390#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36390#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:42,309 INFO L273 TraceCheckUtils]: 46: Hoare triple {36390#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36390#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:42,310 INFO L273 TraceCheckUtils]: 47: Hoare triple {36390#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {36391#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:42,310 INFO L273 TraceCheckUtils]: 48: Hoare triple {36391#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36391#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:42,311 INFO L273 TraceCheckUtils]: 49: Hoare triple {36391#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36391#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:42,311 INFO L273 TraceCheckUtils]: 50: Hoare triple {36391#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {36392#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:42,312 INFO L273 TraceCheckUtils]: 51: Hoare triple {36392#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36392#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:42,312 INFO L273 TraceCheckUtils]: 52: Hoare triple {36392#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36392#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:42,313 INFO L273 TraceCheckUtils]: 53: Hoare triple {36392#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {36393#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:42,314 INFO L273 TraceCheckUtils]: 54: Hoare triple {36393#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36393#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:42,314 INFO L273 TraceCheckUtils]: 55: Hoare triple {36393#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36393#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:42,315 INFO L273 TraceCheckUtils]: 56: Hoare triple {36393#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {36394#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:42,315 INFO L273 TraceCheckUtils]: 57: Hoare triple {36394#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36394#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:42,316 INFO L273 TraceCheckUtils]: 58: Hoare triple {36394#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36394#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:42,317 INFO L273 TraceCheckUtils]: 59: Hoare triple {36394#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {36395#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:42,317 INFO L273 TraceCheckUtils]: 60: Hoare triple {36395#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36395#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:42,318 INFO L273 TraceCheckUtils]: 61: Hoare triple {36395#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36395#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:42,318 INFO L273 TraceCheckUtils]: 62: Hoare triple {36395#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {36396#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:42,319 INFO L273 TraceCheckUtils]: 63: Hoare triple {36396#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36396#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:42,319 INFO L273 TraceCheckUtils]: 64: Hoare triple {36396#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36396#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:42,320 INFO L273 TraceCheckUtils]: 65: Hoare triple {36396#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {36397#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:42,320 INFO L273 TraceCheckUtils]: 66: Hoare triple {36397#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36397#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:42,321 INFO L273 TraceCheckUtils]: 67: Hoare triple {36397#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36397#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:42,322 INFO L273 TraceCheckUtils]: 68: Hoare triple {36397#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {36398#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:42,322 INFO L273 TraceCheckUtils]: 69: Hoare triple {36398#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36398#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:42,323 INFO L273 TraceCheckUtils]: 70: Hoare triple {36398#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36398#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:42,323 INFO L273 TraceCheckUtils]: 71: Hoare triple {36398#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {36399#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:42,324 INFO L273 TraceCheckUtils]: 72: Hoare triple {36399#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36399#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:42,324 INFO L273 TraceCheckUtils]: 73: Hoare triple {36399#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36399#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:42,325 INFO L273 TraceCheckUtils]: 74: Hoare triple {36399#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {36400#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:42,326 INFO L273 TraceCheckUtils]: 75: Hoare triple {36400#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36400#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:42,326 INFO L273 TraceCheckUtils]: 76: Hoare triple {36400#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36400#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:42,327 INFO L273 TraceCheckUtils]: 77: Hoare triple {36400#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {36401#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:42,327 INFO L273 TraceCheckUtils]: 78: Hoare triple {36401#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36401#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:42,328 INFO L273 TraceCheckUtils]: 79: Hoare triple {36401#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36401#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:42,329 INFO L273 TraceCheckUtils]: 80: Hoare triple {36401#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {36402#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:42,329 INFO L273 TraceCheckUtils]: 81: Hoare triple {36402#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36402#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:42,330 INFO L273 TraceCheckUtils]: 82: Hoare triple {36402#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36402#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:42,330 INFO L273 TraceCheckUtils]: 83: Hoare triple {36402#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {36403#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:42,331 INFO L273 TraceCheckUtils]: 84: Hoare triple {36403#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36403#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:42,331 INFO L273 TraceCheckUtils]: 85: Hoare triple {36403#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36403#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:42,332 INFO L273 TraceCheckUtils]: 86: Hoare triple {36403#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {36404#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:42,332 INFO L273 TraceCheckUtils]: 87: Hoare triple {36404#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36404#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:42,333 INFO L273 TraceCheckUtils]: 88: Hoare triple {36404#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36404#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:42,334 INFO L273 TraceCheckUtils]: 89: Hoare triple {36404#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {36405#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:42,334 INFO L273 TraceCheckUtils]: 90: Hoare triple {36405#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36405#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:42,335 INFO L273 TraceCheckUtils]: 91: Hoare triple {36405#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36405#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:42,335 INFO L273 TraceCheckUtils]: 92: Hoare triple {36405#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {36406#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:42,336 INFO L273 TraceCheckUtils]: 93: Hoare triple {36406#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36406#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:42,336 INFO L273 TraceCheckUtils]: 94: Hoare triple {36406#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36406#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:42,337 INFO L273 TraceCheckUtils]: 95: Hoare triple {36406#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {36407#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:42,338 INFO L273 TraceCheckUtils]: 96: Hoare triple {36407#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36407#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:42,338 INFO L273 TraceCheckUtils]: 97: Hoare triple {36407#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36407#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:42,339 INFO L273 TraceCheckUtils]: 98: Hoare triple {36407#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {36408#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:42,339 INFO L273 TraceCheckUtils]: 99: Hoare triple {36408#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36408#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:42,340 INFO L273 TraceCheckUtils]: 100: Hoare triple {36408#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36408#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:42,341 INFO L273 TraceCheckUtils]: 101: Hoare triple {36408#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {36409#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:42,341 INFO L273 TraceCheckUtils]: 102: Hoare triple {36409#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36409#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:42,342 INFO L273 TraceCheckUtils]: 103: Hoare triple {36409#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36409#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:42,342 INFO L273 TraceCheckUtils]: 104: Hoare triple {36409#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {36410#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:42,343 INFO L273 TraceCheckUtils]: 105: Hoare triple {36410#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36410#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:42,343 INFO L273 TraceCheckUtils]: 106: Hoare triple {36410#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36410#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:42,344 INFO L273 TraceCheckUtils]: 107: Hoare triple {36410#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {36411#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:42,344 INFO L273 TraceCheckUtils]: 108: Hoare triple {36411#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36411#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:42,345 INFO L273 TraceCheckUtils]: 109: Hoare triple {36411#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36411#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:42,346 INFO L273 TraceCheckUtils]: 110: Hoare triple {36411#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {36412#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:42,346 INFO L273 TraceCheckUtils]: 111: Hoare triple {36412#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36412#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:42,347 INFO L273 TraceCheckUtils]: 112: Hoare triple {36412#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36412#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:42,347 INFO L273 TraceCheckUtils]: 113: Hoare triple {36412#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {36413#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:42,348 INFO L273 TraceCheckUtils]: 114: Hoare triple {36413#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36413#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:42,348 INFO L273 TraceCheckUtils]: 115: Hoare triple {36413#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36413#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:42,349 INFO L273 TraceCheckUtils]: 116: Hoare triple {36413#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {36414#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:42,350 INFO L273 TraceCheckUtils]: 117: Hoare triple {36414#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36414#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:42,350 INFO L273 TraceCheckUtils]: 118: Hoare triple {36414#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36414#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:42,351 INFO L273 TraceCheckUtils]: 119: Hoare triple {36414#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {36415#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:42,351 INFO L273 TraceCheckUtils]: 120: Hoare triple {36415#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36415#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:42,352 INFO L273 TraceCheckUtils]: 121: Hoare triple {36415#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36415#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:42,352 INFO L273 TraceCheckUtils]: 122: Hoare triple {36415#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {36416#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:42,353 INFO L273 TraceCheckUtils]: 123: Hoare triple {36416#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36416#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:42,353 INFO L273 TraceCheckUtils]: 124: Hoare triple {36416#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36416#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:42,354 INFO L273 TraceCheckUtils]: 125: Hoare triple {36416#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {36417#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:42,355 INFO L273 TraceCheckUtils]: 126: Hoare triple {36417#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36417#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:42,355 INFO L273 TraceCheckUtils]: 127: Hoare triple {36417#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36417#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:42,356 INFO L273 TraceCheckUtils]: 128: Hoare triple {36417#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {36418#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:42,356 INFO L273 TraceCheckUtils]: 129: Hoare triple {36418#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36418#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:42,357 INFO L273 TraceCheckUtils]: 130: Hoare triple {36418#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36418#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:42,358 INFO L273 TraceCheckUtils]: 131: Hoare triple {36418#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {36419#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:42,358 INFO L273 TraceCheckUtils]: 132: Hoare triple {36419#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36419#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:42,359 INFO L273 TraceCheckUtils]: 133: Hoare triple {36419#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36419#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:42,359 INFO L273 TraceCheckUtils]: 134: Hoare triple {36419#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {36420#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:42,360 INFO L273 TraceCheckUtils]: 135: Hoare triple {36420#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36420#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:42,360 INFO L273 TraceCheckUtils]: 136: Hoare triple {36420#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36420#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:42,361 INFO L273 TraceCheckUtils]: 137: Hoare triple {36420#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {36421#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:42,362 INFO L273 TraceCheckUtils]: 138: Hoare triple {36421#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36421#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:42,362 INFO L273 TraceCheckUtils]: 139: Hoare triple {36421#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36421#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:42,363 INFO L273 TraceCheckUtils]: 140: Hoare triple {36421#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {36422#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:42,363 INFO L273 TraceCheckUtils]: 141: Hoare triple {36422#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36422#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:42,364 INFO L273 TraceCheckUtils]: 142: Hoare triple {36422#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36422#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:42,364 INFO L273 TraceCheckUtils]: 143: Hoare triple {36422#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {36423#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:42,365 INFO L273 TraceCheckUtils]: 144: Hoare triple {36423#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36423#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:42,366 INFO L273 TraceCheckUtils]: 145: Hoare triple {36423#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36423#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:42,366 INFO L273 TraceCheckUtils]: 146: Hoare triple {36423#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {36424#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:42,367 INFO L273 TraceCheckUtils]: 147: Hoare triple {36424#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36424#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:42,367 INFO L273 TraceCheckUtils]: 148: Hoare triple {36424#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36424#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:42,368 INFO L273 TraceCheckUtils]: 149: Hoare triple {36424#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {36425#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:42,368 INFO L273 TraceCheckUtils]: 150: Hoare triple {36425#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36425#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:42,369 INFO L273 TraceCheckUtils]: 151: Hoare triple {36425#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {36425#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:42,370 INFO L273 TraceCheckUtils]: 152: Hoare triple {36425#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {36426#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:42,370 INFO L273 TraceCheckUtils]: 153: Hoare triple {36426#(<= main_~i~0 49)} assume !(~i~0 < 100000); {36376#false} is VALID [2018-11-23 12:06:42,371 INFO L273 TraceCheckUtils]: 154: Hoare triple {36376#false} havoc ~x~0;~x~0 := 0; {36376#false} is VALID [2018-11-23 12:06:42,371 INFO L273 TraceCheckUtils]: 155: Hoare triple {36376#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {36376#false} is VALID [2018-11-23 12:06:42,371 INFO L256 TraceCheckUtils]: 156: Hoare triple {36376#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {36376#false} is VALID [2018-11-23 12:06:42,371 INFO L273 TraceCheckUtils]: 157: Hoare triple {36376#false} ~cond := #in~cond; {36376#false} is VALID [2018-11-23 12:06:42,371 INFO L273 TraceCheckUtils]: 158: Hoare triple {36376#false} assume 0 == ~cond; {36376#false} is VALID [2018-11-23 12:06:42,371 INFO L273 TraceCheckUtils]: 159: Hoare triple {36376#false} assume !false; {36376#false} is VALID [2018-11-23 12:06:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:42,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:42,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2018-11-23 12:06:42,408 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 160 [2018-11-23 12:06:42,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:42,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states. [2018-11-23 12:06:42,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:42,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-23 12:06:42,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-23 12:06:42,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 12:06:42,572 INFO L87 Difference]: Start difference. First operand 165 states and 215 transitions. Second operand 53 states. [2018-11-23 12:06:43,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:43,705 INFO L93 Difference]: Finished difference Result 181 states and 234 transitions. [2018-11-23 12:06:43,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 12:06:43,705 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 160 [2018-11-23 12:06:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:06:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 234 transitions. [2018-11-23 12:06:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:06:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 234 transitions. [2018-11-23 12:06:43,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 234 transitions. [2018-11-23 12:06:43,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:43,968 INFO L225 Difference]: With dead ends: 181 [2018-11-23 12:06:43,968 INFO L226 Difference]: Without dead ends: 170 [2018-11-23 12:06:43,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 12:06:43,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-23 12:06:44,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-11-23 12:06:44,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:44,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 168 states. [2018-11-23 12:06:44,012 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 168 states. [2018-11-23 12:06:44,012 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 168 states. [2018-11-23 12:06:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:44,015 INFO L93 Difference]: Finished difference Result 170 states and 222 transitions. [2018-11-23 12:06:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 222 transitions. [2018-11-23 12:06:44,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:44,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:44,015 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 170 states. [2018-11-23 12:06:44,015 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 170 states. [2018-11-23 12:06:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:44,017 INFO L93 Difference]: Finished difference Result 170 states and 222 transitions. [2018-11-23 12:06:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 222 transitions. [2018-11-23 12:06:44,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:44,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:44,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:44,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 12:06:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 219 transitions. [2018-11-23 12:06:44,020 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 219 transitions. Word has length 160 [2018-11-23 12:06:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:44,020 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 219 transitions. [2018-11-23 12:06:44,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-23 12:06:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 219 transitions. [2018-11-23 12:06:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-23 12:06:44,021 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:44,022 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:44,022 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:44,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:44,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2002706041, now seen corresponding path program 50 times [2018-11-23 12:06:44,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:44,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:44,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:45,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {37715#true} call ULTIMATE.init(); {37715#true} is VALID [2018-11-23 12:06:45,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {37715#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37715#true} is VALID [2018-11-23 12:06:45,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {37715#true} assume true; {37715#true} is VALID [2018-11-23 12:06:45,237 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37715#true} {37715#true} #55#return; {37715#true} is VALID [2018-11-23 12:06:45,237 INFO L256 TraceCheckUtils]: 4: Hoare triple {37715#true} call #t~ret4 := main(); {37715#true} is VALID [2018-11-23 12:06:45,238 INFO L273 TraceCheckUtils]: 5: Hoare triple {37715#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {37717#(= main_~i~0 0)} is VALID [2018-11-23 12:06:45,238 INFO L273 TraceCheckUtils]: 6: Hoare triple {37717#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37717#(= main_~i~0 0)} is VALID [2018-11-23 12:06:45,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {37717#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37717#(= main_~i~0 0)} is VALID [2018-11-23 12:06:45,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {37717#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {37718#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:45,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {37718#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37718#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:45,239 INFO L273 TraceCheckUtils]: 10: Hoare triple {37718#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37718#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:45,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {37718#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {37719#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:45,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {37719#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37719#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:45,240 INFO L273 TraceCheckUtils]: 13: Hoare triple {37719#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37719#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:45,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {37719#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {37720#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:45,241 INFO L273 TraceCheckUtils]: 15: Hoare triple {37720#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37720#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:45,242 INFO L273 TraceCheckUtils]: 16: Hoare triple {37720#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37720#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:45,242 INFO L273 TraceCheckUtils]: 17: Hoare triple {37720#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {37721#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:45,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {37721#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37721#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:45,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {37721#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37721#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:45,244 INFO L273 TraceCheckUtils]: 20: Hoare triple {37721#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {37722#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:45,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {37722#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37722#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:45,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {37722#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37722#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:45,246 INFO L273 TraceCheckUtils]: 23: Hoare triple {37722#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {37723#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:45,246 INFO L273 TraceCheckUtils]: 24: Hoare triple {37723#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37723#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:45,246 INFO L273 TraceCheckUtils]: 25: Hoare triple {37723#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37723#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:45,247 INFO L273 TraceCheckUtils]: 26: Hoare triple {37723#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {37724#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:45,248 INFO L273 TraceCheckUtils]: 27: Hoare triple {37724#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37724#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:45,248 INFO L273 TraceCheckUtils]: 28: Hoare triple {37724#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37724#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:45,249 INFO L273 TraceCheckUtils]: 29: Hoare triple {37724#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {37725#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:45,249 INFO L273 TraceCheckUtils]: 30: Hoare triple {37725#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37725#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:45,250 INFO L273 TraceCheckUtils]: 31: Hoare triple {37725#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37725#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:45,251 INFO L273 TraceCheckUtils]: 32: Hoare triple {37725#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {37726#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:45,251 INFO L273 TraceCheckUtils]: 33: Hoare triple {37726#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37726#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:45,252 INFO L273 TraceCheckUtils]: 34: Hoare triple {37726#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37726#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:45,252 INFO L273 TraceCheckUtils]: 35: Hoare triple {37726#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {37727#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:45,253 INFO L273 TraceCheckUtils]: 36: Hoare triple {37727#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37727#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:45,253 INFO L273 TraceCheckUtils]: 37: Hoare triple {37727#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37727#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:45,254 INFO L273 TraceCheckUtils]: 38: Hoare triple {37727#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {37728#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:45,255 INFO L273 TraceCheckUtils]: 39: Hoare triple {37728#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37728#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:45,255 INFO L273 TraceCheckUtils]: 40: Hoare triple {37728#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37728#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:45,256 INFO L273 TraceCheckUtils]: 41: Hoare triple {37728#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {37729#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:45,256 INFO L273 TraceCheckUtils]: 42: Hoare triple {37729#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37729#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:45,257 INFO L273 TraceCheckUtils]: 43: Hoare triple {37729#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37729#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:45,257 INFO L273 TraceCheckUtils]: 44: Hoare triple {37729#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {37730#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:45,258 INFO L273 TraceCheckUtils]: 45: Hoare triple {37730#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37730#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:45,258 INFO L273 TraceCheckUtils]: 46: Hoare triple {37730#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37730#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:45,259 INFO L273 TraceCheckUtils]: 47: Hoare triple {37730#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {37731#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:45,260 INFO L273 TraceCheckUtils]: 48: Hoare triple {37731#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37731#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:45,260 INFO L273 TraceCheckUtils]: 49: Hoare triple {37731#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37731#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:45,261 INFO L273 TraceCheckUtils]: 50: Hoare triple {37731#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {37732#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:45,261 INFO L273 TraceCheckUtils]: 51: Hoare triple {37732#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37732#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:45,262 INFO L273 TraceCheckUtils]: 52: Hoare triple {37732#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37732#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:45,263 INFO L273 TraceCheckUtils]: 53: Hoare triple {37732#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {37733#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:45,263 INFO L273 TraceCheckUtils]: 54: Hoare triple {37733#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37733#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:45,264 INFO L273 TraceCheckUtils]: 55: Hoare triple {37733#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37733#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:45,264 INFO L273 TraceCheckUtils]: 56: Hoare triple {37733#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {37734#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:45,265 INFO L273 TraceCheckUtils]: 57: Hoare triple {37734#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37734#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:45,265 INFO L273 TraceCheckUtils]: 58: Hoare triple {37734#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37734#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:45,266 INFO L273 TraceCheckUtils]: 59: Hoare triple {37734#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {37735#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:45,267 INFO L273 TraceCheckUtils]: 60: Hoare triple {37735#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37735#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:45,267 INFO L273 TraceCheckUtils]: 61: Hoare triple {37735#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37735#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:45,268 INFO L273 TraceCheckUtils]: 62: Hoare triple {37735#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {37736#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:45,268 INFO L273 TraceCheckUtils]: 63: Hoare triple {37736#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37736#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:45,269 INFO L273 TraceCheckUtils]: 64: Hoare triple {37736#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37736#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:45,269 INFO L273 TraceCheckUtils]: 65: Hoare triple {37736#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {37737#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:45,270 INFO L273 TraceCheckUtils]: 66: Hoare triple {37737#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37737#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:45,270 INFO L273 TraceCheckUtils]: 67: Hoare triple {37737#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37737#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:45,271 INFO L273 TraceCheckUtils]: 68: Hoare triple {37737#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {37738#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:45,272 INFO L273 TraceCheckUtils]: 69: Hoare triple {37738#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37738#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:45,272 INFO L273 TraceCheckUtils]: 70: Hoare triple {37738#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37738#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:45,273 INFO L273 TraceCheckUtils]: 71: Hoare triple {37738#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {37739#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:45,288 INFO L273 TraceCheckUtils]: 72: Hoare triple {37739#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37739#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:45,290 INFO L273 TraceCheckUtils]: 73: Hoare triple {37739#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37739#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:45,290 INFO L273 TraceCheckUtils]: 74: Hoare triple {37739#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {37740#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:45,291 INFO L273 TraceCheckUtils]: 75: Hoare triple {37740#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37740#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:45,291 INFO L273 TraceCheckUtils]: 76: Hoare triple {37740#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37740#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:45,292 INFO L273 TraceCheckUtils]: 77: Hoare triple {37740#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {37741#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:45,292 INFO L273 TraceCheckUtils]: 78: Hoare triple {37741#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37741#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:45,292 INFO L273 TraceCheckUtils]: 79: Hoare triple {37741#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37741#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:45,293 INFO L273 TraceCheckUtils]: 80: Hoare triple {37741#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {37742#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:45,293 INFO L273 TraceCheckUtils]: 81: Hoare triple {37742#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37742#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:45,293 INFO L273 TraceCheckUtils]: 82: Hoare triple {37742#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37742#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:45,294 INFO L273 TraceCheckUtils]: 83: Hoare triple {37742#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {37743#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:45,294 INFO L273 TraceCheckUtils]: 84: Hoare triple {37743#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37743#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:45,294 INFO L273 TraceCheckUtils]: 85: Hoare triple {37743#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37743#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:45,295 INFO L273 TraceCheckUtils]: 86: Hoare triple {37743#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {37744#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:45,295 INFO L273 TraceCheckUtils]: 87: Hoare triple {37744#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37744#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:45,296 INFO L273 TraceCheckUtils]: 88: Hoare triple {37744#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37744#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:45,296 INFO L273 TraceCheckUtils]: 89: Hoare triple {37744#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {37745#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:45,297 INFO L273 TraceCheckUtils]: 90: Hoare triple {37745#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37745#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:45,297 INFO L273 TraceCheckUtils]: 91: Hoare triple {37745#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37745#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:45,298 INFO L273 TraceCheckUtils]: 92: Hoare triple {37745#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {37746#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:45,299 INFO L273 TraceCheckUtils]: 93: Hoare triple {37746#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37746#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:45,299 INFO L273 TraceCheckUtils]: 94: Hoare triple {37746#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37746#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:45,300 INFO L273 TraceCheckUtils]: 95: Hoare triple {37746#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {37747#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:45,300 INFO L273 TraceCheckUtils]: 96: Hoare triple {37747#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37747#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:45,301 INFO L273 TraceCheckUtils]: 97: Hoare triple {37747#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37747#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:45,302 INFO L273 TraceCheckUtils]: 98: Hoare triple {37747#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {37748#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:45,302 INFO L273 TraceCheckUtils]: 99: Hoare triple {37748#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37748#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:45,303 INFO L273 TraceCheckUtils]: 100: Hoare triple {37748#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37748#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:45,303 INFO L273 TraceCheckUtils]: 101: Hoare triple {37748#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {37749#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:45,304 INFO L273 TraceCheckUtils]: 102: Hoare triple {37749#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37749#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:45,304 INFO L273 TraceCheckUtils]: 103: Hoare triple {37749#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37749#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:45,305 INFO L273 TraceCheckUtils]: 104: Hoare triple {37749#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {37750#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:45,306 INFO L273 TraceCheckUtils]: 105: Hoare triple {37750#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37750#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:45,306 INFO L273 TraceCheckUtils]: 106: Hoare triple {37750#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37750#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:45,307 INFO L273 TraceCheckUtils]: 107: Hoare triple {37750#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {37751#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:45,307 INFO L273 TraceCheckUtils]: 108: Hoare triple {37751#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37751#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:45,308 INFO L273 TraceCheckUtils]: 109: Hoare triple {37751#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37751#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:45,308 INFO L273 TraceCheckUtils]: 110: Hoare triple {37751#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {37752#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:45,309 INFO L273 TraceCheckUtils]: 111: Hoare triple {37752#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37752#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:45,309 INFO L273 TraceCheckUtils]: 112: Hoare triple {37752#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37752#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:45,310 INFO L273 TraceCheckUtils]: 113: Hoare triple {37752#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {37753#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:45,311 INFO L273 TraceCheckUtils]: 114: Hoare triple {37753#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37753#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:45,311 INFO L273 TraceCheckUtils]: 115: Hoare triple {37753#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37753#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:45,312 INFO L273 TraceCheckUtils]: 116: Hoare triple {37753#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {37754#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:45,312 INFO L273 TraceCheckUtils]: 117: Hoare triple {37754#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37754#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:45,313 INFO L273 TraceCheckUtils]: 118: Hoare triple {37754#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37754#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:45,314 INFO L273 TraceCheckUtils]: 119: Hoare triple {37754#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {37755#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:45,314 INFO L273 TraceCheckUtils]: 120: Hoare triple {37755#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37755#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:45,315 INFO L273 TraceCheckUtils]: 121: Hoare triple {37755#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37755#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:45,315 INFO L273 TraceCheckUtils]: 122: Hoare triple {37755#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {37756#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:45,316 INFO L273 TraceCheckUtils]: 123: Hoare triple {37756#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37756#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:45,316 INFO L273 TraceCheckUtils]: 124: Hoare triple {37756#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37756#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:45,317 INFO L273 TraceCheckUtils]: 125: Hoare triple {37756#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {37757#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:45,318 INFO L273 TraceCheckUtils]: 126: Hoare triple {37757#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37757#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:45,318 INFO L273 TraceCheckUtils]: 127: Hoare triple {37757#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37757#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:45,319 INFO L273 TraceCheckUtils]: 128: Hoare triple {37757#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {37758#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:45,319 INFO L273 TraceCheckUtils]: 129: Hoare triple {37758#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37758#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:45,320 INFO L273 TraceCheckUtils]: 130: Hoare triple {37758#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37758#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:45,320 INFO L273 TraceCheckUtils]: 131: Hoare triple {37758#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {37759#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:45,321 INFO L273 TraceCheckUtils]: 132: Hoare triple {37759#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37759#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:45,321 INFO L273 TraceCheckUtils]: 133: Hoare triple {37759#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37759#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:45,322 INFO L273 TraceCheckUtils]: 134: Hoare triple {37759#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {37760#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:45,323 INFO L273 TraceCheckUtils]: 135: Hoare triple {37760#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37760#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:45,323 INFO L273 TraceCheckUtils]: 136: Hoare triple {37760#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37760#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:45,324 INFO L273 TraceCheckUtils]: 137: Hoare triple {37760#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {37761#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:45,324 INFO L273 TraceCheckUtils]: 138: Hoare triple {37761#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37761#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:45,325 INFO L273 TraceCheckUtils]: 139: Hoare triple {37761#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37761#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:45,326 INFO L273 TraceCheckUtils]: 140: Hoare triple {37761#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {37762#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:45,326 INFO L273 TraceCheckUtils]: 141: Hoare triple {37762#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37762#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:45,327 INFO L273 TraceCheckUtils]: 142: Hoare triple {37762#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37762#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:45,327 INFO L273 TraceCheckUtils]: 143: Hoare triple {37762#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {37763#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:45,328 INFO L273 TraceCheckUtils]: 144: Hoare triple {37763#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37763#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:45,328 INFO L273 TraceCheckUtils]: 145: Hoare triple {37763#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37763#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:45,329 INFO L273 TraceCheckUtils]: 146: Hoare triple {37763#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {37764#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:45,330 INFO L273 TraceCheckUtils]: 147: Hoare triple {37764#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37764#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:45,330 INFO L273 TraceCheckUtils]: 148: Hoare triple {37764#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37764#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:45,331 INFO L273 TraceCheckUtils]: 149: Hoare triple {37764#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {37765#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:45,331 INFO L273 TraceCheckUtils]: 150: Hoare triple {37765#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37765#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:45,332 INFO L273 TraceCheckUtils]: 151: Hoare triple {37765#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37765#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:45,332 INFO L273 TraceCheckUtils]: 152: Hoare triple {37765#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {37766#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:45,333 INFO L273 TraceCheckUtils]: 153: Hoare triple {37766#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37766#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:45,333 INFO L273 TraceCheckUtils]: 154: Hoare triple {37766#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37766#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:45,334 INFO L273 TraceCheckUtils]: 155: Hoare triple {37766#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {37767#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:45,335 INFO L273 TraceCheckUtils]: 156: Hoare triple {37767#(<= main_~i~0 50)} assume !(~i~0 < 100000); {37716#false} is VALID [2018-11-23 12:06:45,335 INFO L273 TraceCheckUtils]: 157: Hoare triple {37716#false} havoc ~x~0;~x~0 := 0; {37716#false} is VALID [2018-11-23 12:06:45,335 INFO L273 TraceCheckUtils]: 158: Hoare triple {37716#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {37716#false} is VALID [2018-11-23 12:06:45,335 INFO L256 TraceCheckUtils]: 159: Hoare triple {37716#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {37716#false} is VALID [2018-11-23 12:06:45,336 INFO L273 TraceCheckUtils]: 160: Hoare triple {37716#false} ~cond := #in~cond; {37716#false} is VALID [2018-11-23 12:06:45,336 INFO L273 TraceCheckUtils]: 161: Hoare triple {37716#false} assume 0 == ~cond; {37716#false} is VALID [2018-11-23 12:06:45,336 INFO L273 TraceCheckUtils]: 162: Hoare triple {37716#false} assume !false; {37716#false} is VALID [2018-11-23 12:06:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:45,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:45,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:45,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:45,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:45,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:45,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:45,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {37715#true} call ULTIMATE.init(); {37715#true} is VALID [2018-11-23 12:06:45,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {37715#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37715#true} is VALID [2018-11-23 12:06:45,927 INFO L273 TraceCheckUtils]: 2: Hoare triple {37715#true} assume true; {37715#true} is VALID [2018-11-23 12:06:45,927 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37715#true} {37715#true} #55#return; {37715#true} is VALID [2018-11-23 12:06:45,927 INFO L256 TraceCheckUtils]: 4: Hoare triple {37715#true} call #t~ret4 := main(); {37715#true} is VALID [2018-11-23 12:06:45,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {37715#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {37786#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:45,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {37786#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37786#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:45,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {37786#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37786#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:45,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {37786#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {37718#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:45,930 INFO L273 TraceCheckUtils]: 9: Hoare triple {37718#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37718#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:45,930 INFO L273 TraceCheckUtils]: 10: Hoare triple {37718#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37718#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:45,930 INFO L273 TraceCheckUtils]: 11: Hoare triple {37718#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {37719#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:45,931 INFO L273 TraceCheckUtils]: 12: Hoare triple {37719#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37719#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:45,931 INFO L273 TraceCheckUtils]: 13: Hoare triple {37719#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37719#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:45,932 INFO L273 TraceCheckUtils]: 14: Hoare triple {37719#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {37720#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:45,933 INFO L273 TraceCheckUtils]: 15: Hoare triple {37720#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37720#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:45,933 INFO L273 TraceCheckUtils]: 16: Hoare triple {37720#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37720#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:45,934 INFO L273 TraceCheckUtils]: 17: Hoare triple {37720#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {37721#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:45,934 INFO L273 TraceCheckUtils]: 18: Hoare triple {37721#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37721#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:45,935 INFO L273 TraceCheckUtils]: 19: Hoare triple {37721#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37721#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:45,935 INFO L273 TraceCheckUtils]: 20: Hoare triple {37721#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {37722#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:45,936 INFO L273 TraceCheckUtils]: 21: Hoare triple {37722#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37722#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:45,936 INFO L273 TraceCheckUtils]: 22: Hoare triple {37722#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37722#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:45,937 INFO L273 TraceCheckUtils]: 23: Hoare triple {37722#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {37723#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:45,938 INFO L273 TraceCheckUtils]: 24: Hoare triple {37723#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37723#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:45,938 INFO L273 TraceCheckUtils]: 25: Hoare triple {37723#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37723#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:45,939 INFO L273 TraceCheckUtils]: 26: Hoare triple {37723#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {37724#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:45,939 INFO L273 TraceCheckUtils]: 27: Hoare triple {37724#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37724#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:45,940 INFO L273 TraceCheckUtils]: 28: Hoare triple {37724#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37724#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:45,941 INFO L273 TraceCheckUtils]: 29: Hoare triple {37724#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {37725#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:45,941 INFO L273 TraceCheckUtils]: 30: Hoare triple {37725#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37725#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:45,942 INFO L273 TraceCheckUtils]: 31: Hoare triple {37725#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37725#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:45,942 INFO L273 TraceCheckUtils]: 32: Hoare triple {37725#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {37726#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:45,943 INFO L273 TraceCheckUtils]: 33: Hoare triple {37726#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37726#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:45,943 INFO L273 TraceCheckUtils]: 34: Hoare triple {37726#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37726#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:45,944 INFO L273 TraceCheckUtils]: 35: Hoare triple {37726#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {37727#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:45,944 INFO L273 TraceCheckUtils]: 36: Hoare triple {37727#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37727#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:45,945 INFO L273 TraceCheckUtils]: 37: Hoare triple {37727#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37727#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:45,946 INFO L273 TraceCheckUtils]: 38: Hoare triple {37727#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {37728#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:45,946 INFO L273 TraceCheckUtils]: 39: Hoare triple {37728#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37728#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:45,947 INFO L273 TraceCheckUtils]: 40: Hoare triple {37728#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37728#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:45,947 INFO L273 TraceCheckUtils]: 41: Hoare triple {37728#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {37729#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:45,948 INFO L273 TraceCheckUtils]: 42: Hoare triple {37729#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37729#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:45,948 INFO L273 TraceCheckUtils]: 43: Hoare triple {37729#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37729#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:45,949 INFO L273 TraceCheckUtils]: 44: Hoare triple {37729#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {37730#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:45,950 INFO L273 TraceCheckUtils]: 45: Hoare triple {37730#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37730#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:45,950 INFO L273 TraceCheckUtils]: 46: Hoare triple {37730#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37730#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:45,951 INFO L273 TraceCheckUtils]: 47: Hoare triple {37730#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {37731#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:45,951 INFO L273 TraceCheckUtils]: 48: Hoare triple {37731#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37731#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:45,952 INFO L273 TraceCheckUtils]: 49: Hoare triple {37731#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37731#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:45,952 INFO L273 TraceCheckUtils]: 50: Hoare triple {37731#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {37732#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:45,953 INFO L273 TraceCheckUtils]: 51: Hoare triple {37732#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37732#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:45,953 INFO L273 TraceCheckUtils]: 52: Hoare triple {37732#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37732#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:45,954 INFO L273 TraceCheckUtils]: 53: Hoare triple {37732#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {37733#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:45,955 INFO L273 TraceCheckUtils]: 54: Hoare triple {37733#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37733#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:45,955 INFO L273 TraceCheckUtils]: 55: Hoare triple {37733#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37733#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:45,956 INFO L273 TraceCheckUtils]: 56: Hoare triple {37733#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {37734#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:45,956 INFO L273 TraceCheckUtils]: 57: Hoare triple {37734#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37734#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:45,957 INFO L273 TraceCheckUtils]: 58: Hoare triple {37734#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37734#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:45,958 INFO L273 TraceCheckUtils]: 59: Hoare triple {37734#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {37735#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:45,958 INFO L273 TraceCheckUtils]: 60: Hoare triple {37735#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37735#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:45,959 INFO L273 TraceCheckUtils]: 61: Hoare triple {37735#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37735#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:45,959 INFO L273 TraceCheckUtils]: 62: Hoare triple {37735#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {37736#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:45,960 INFO L273 TraceCheckUtils]: 63: Hoare triple {37736#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37736#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:45,960 INFO L273 TraceCheckUtils]: 64: Hoare triple {37736#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37736#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:45,961 INFO L273 TraceCheckUtils]: 65: Hoare triple {37736#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {37737#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:45,961 INFO L273 TraceCheckUtils]: 66: Hoare triple {37737#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37737#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:45,962 INFO L273 TraceCheckUtils]: 67: Hoare triple {37737#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37737#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:45,963 INFO L273 TraceCheckUtils]: 68: Hoare triple {37737#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {37738#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:45,963 INFO L273 TraceCheckUtils]: 69: Hoare triple {37738#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37738#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:45,964 INFO L273 TraceCheckUtils]: 70: Hoare triple {37738#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37738#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:45,964 INFO L273 TraceCheckUtils]: 71: Hoare triple {37738#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {37739#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:45,965 INFO L273 TraceCheckUtils]: 72: Hoare triple {37739#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37739#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:45,965 INFO L273 TraceCheckUtils]: 73: Hoare triple {37739#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37739#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:45,966 INFO L273 TraceCheckUtils]: 74: Hoare triple {37739#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {37740#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:45,967 INFO L273 TraceCheckUtils]: 75: Hoare triple {37740#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37740#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:45,967 INFO L273 TraceCheckUtils]: 76: Hoare triple {37740#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37740#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:45,968 INFO L273 TraceCheckUtils]: 77: Hoare triple {37740#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {37741#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:45,968 INFO L273 TraceCheckUtils]: 78: Hoare triple {37741#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37741#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:45,969 INFO L273 TraceCheckUtils]: 79: Hoare triple {37741#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37741#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:45,969 INFO L273 TraceCheckUtils]: 80: Hoare triple {37741#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {37742#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:45,970 INFO L273 TraceCheckUtils]: 81: Hoare triple {37742#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37742#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:45,970 INFO L273 TraceCheckUtils]: 82: Hoare triple {37742#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37742#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:45,971 INFO L273 TraceCheckUtils]: 83: Hoare triple {37742#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {37743#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:45,972 INFO L273 TraceCheckUtils]: 84: Hoare triple {37743#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37743#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:45,972 INFO L273 TraceCheckUtils]: 85: Hoare triple {37743#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37743#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:45,973 INFO L273 TraceCheckUtils]: 86: Hoare triple {37743#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {37744#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:45,973 INFO L273 TraceCheckUtils]: 87: Hoare triple {37744#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37744#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:45,974 INFO L273 TraceCheckUtils]: 88: Hoare triple {37744#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37744#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:45,975 INFO L273 TraceCheckUtils]: 89: Hoare triple {37744#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {37745#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:45,975 INFO L273 TraceCheckUtils]: 90: Hoare triple {37745#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37745#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:45,976 INFO L273 TraceCheckUtils]: 91: Hoare triple {37745#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37745#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:45,976 INFO L273 TraceCheckUtils]: 92: Hoare triple {37745#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {37746#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:45,977 INFO L273 TraceCheckUtils]: 93: Hoare triple {37746#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37746#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:45,977 INFO L273 TraceCheckUtils]: 94: Hoare triple {37746#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37746#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:45,978 INFO L273 TraceCheckUtils]: 95: Hoare triple {37746#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {37747#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:45,978 INFO L273 TraceCheckUtils]: 96: Hoare triple {37747#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37747#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:45,979 INFO L273 TraceCheckUtils]: 97: Hoare triple {37747#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37747#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:45,980 INFO L273 TraceCheckUtils]: 98: Hoare triple {37747#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {37748#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:45,980 INFO L273 TraceCheckUtils]: 99: Hoare triple {37748#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37748#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:45,981 INFO L273 TraceCheckUtils]: 100: Hoare triple {37748#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37748#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:45,981 INFO L273 TraceCheckUtils]: 101: Hoare triple {37748#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {37749#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:45,982 INFO L273 TraceCheckUtils]: 102: Hoare triple {37749#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37749#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:45,982 INFO L273 TraceCheckUtils]: 103: Hoare triple {37749#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37749#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:45,983 INFO L273 TraceCheckUtils]: 104: Hoare triple {37749#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {37750#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:45,984 INFO L273 TraceCheckUtils]: 105: Hoare triple {37750#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37750#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:45,984 INFO L273 TraceCheckUtils]: 106: Hoare triple {37750#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37750#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:45,985 INFO L273 TraceCheckUtils]: 107: Hoare triple {37750#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {37751#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:45,985 INFO L273 TraceCheckUtils]: 108: Hoare triple {37751#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37751#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:45,986 INFO L273 TraceCheckUtils]: 109: Hoare triple {37751#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37751#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:45,986 INFO L273 TraceCheckUtils]: 110: Hoare triple {37751#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {37752#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:45,987 INFO L273 TraceCheckUtils]: 111: Hoare triple {37752#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37752#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:45,987 INFO L273 TraceCheckUtils]: 112: Hoare triple {37752#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37752#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:45,988 INFO L273 TraceCheckUtils]: 113: Hoare triple {37752#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {37753#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:45,989 INFO L273 TraceCheckUtils]: 114: Hoare triple {37753#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37753#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:45,989 INFO L273 TraceCheckUtils]: 115: Hoare triple {37753#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37753#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:45,990 INFO L273 TraceCheckUtils]: 116: Hoare triple {37753#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {37754#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:45,990 INFO L273 TraceCheckUtils]: 117: Hoare triple {37754#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37754#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:45,991 INFO L273 TraceCheckUtils]: 118: Hoare triple {37754#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37754#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:45,992 INFO L273 TraceCheckUtils]: 119: Hoare triple {37754#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {37755#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:45,992 INFO L273 TraceCheckUtils]: 120: Hoare triple {37755#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37755#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:45,993 INFO L273 TraceCheckUtils]: 121: Hoare triple {37755#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37755#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:45,993 INFO L273 TraceCheckUtils]: 122: Hoare triple {37755#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {37756#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:45,994 INFO L273 TraceCheckUtils]: 123: Hoare triple {37756#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37756#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:45,994 INFO L273 TraceCheckUtils]: 124: Hoare triple {37756#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37756#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:45,995 INFO L273 TraceCheckUtils]: 125: Hoare triple {37756#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {37757#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:45,996 INFO L273 TraceCheckUtils]: 126: Hoare triple {37757#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37757#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:45,996 INFO L273 TraceCheckUtils]: 127: Hoare triple {37757#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37757#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:45,997 INFO L273 TraceCheckUtils]: 128: Hoare triple {37757#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {37758#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:45,997 INFO L273 TraceCheckUtils]: 129: Hoare triple {37758#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37758#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:45,998 INFO L273 TraceCheckUtils]: 130: Hoare triple {37758#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37758#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:45,998 INFO L273 TraceCheckUtils]: 131: Hoare triple {37758#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {37759#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:45,999 INFO L273 TraceCheckUtils]: 132: Hoare triple {37759#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37759#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:45,999 INFO L273 TraceCheckUtils]: 133: Hoare triple {37759#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37759#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:46,000 INFO L273 TraceCheckUtils]: 134: Hoare triple {37759#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {37760#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:46,001 INFO L273 TraceCheckUtils]: 135: Hoare triple {37760#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37760#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:46,001 INFO L273 TraceCheckUtils]: 136: Hoare triple {37760#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37760#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:46,002 INFO L273 TraceCheckUtils]: 137: Hoare triple {37760#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {37761#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:46,002 INFO L273 TraceCheckUtils]: 138: Hoare triple {37761#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37761#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:46,003 INFO L273 TraceCheckUtils]: 139: Hoare triple {37761#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37761#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:46,004 INFO L273 TraceCheckUtils]: 140: Hoare triple {37761#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {37762#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:46,004 INFO L273 TraceCheckUtils]: 141: Hoare triple {37762#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37762#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:46,005 INFO L273 TraceCheckUtils]: 142: Hoare triple {37762#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37762#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:46,005 INFO L273 TraceCheckUtils]: 143: Hoare triple {37762#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {37763#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:46,006 INFO L273 TraceCheckUtils]: 144: Hoare triple {37763#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37763#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:46,006 INFO L273 TraceCheckUtils]: 145: Hoare triple {37763#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37763#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:46,007 INFO L273 TraceCheckUtils]: 146: Hoare triple {37763#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {37764#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:46,008 INFO L273 TraceCheckUtils]: 147: Hoare triple {37764#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37764#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:46,008 INFO L273 TraceCheckUtils]: 148: Hoare triple {37764#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37764#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:46,009 INFO L273 TraceCheckUtils]: 149: Hoare triple {37764#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {37765#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:46,009 INFO L273 TraceCheckUtils]: 150: Hoare triple {37765#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37765#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:46,010 INFO L273 TraceCheckUtils]: 151: Hoare triple {37765#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37765#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:46,010 INFO L273 TraceCheckUtils]: 152: Hoare triple {37765#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {37766#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:46,011 INFO L273 TraceCheckUtils]: 153: Hoare triple {37766#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37766#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:46,011 INFO L273 TraceCheckUtils]: 154: Hoare triple {37766#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {37766#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:46,012 INFO L273 TraceCheckUtils]: 155: Hoare triple {37766#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {37767#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:46,013 INFO L273 TraceCheckUtils]: 156: Hoare triple {37767#(<= main_~i~0 50)} assume !(~i~0 < 100000); {37716#false} is VALID [2018-11-23 12:06:46,013 INFO L273 TraceCheckUtils]: 157: Hoare triple {37716#false} havoc ~x~0;~x~0 := 0; {37716#false} is VALID [2018-11-23 12:06:46,013 INFO L273 TraceCheckUtils]: 158: Hoare triple {37716#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {37716#false} is VALID [2018-11-23 12:06:46,013 INFO L256 TraceCheckUtils]: 159: Hoare triple {37716#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {37716#false} is VALID [2018-11-23 12:06:46,014 INFO L273 TraceCheckUtils]: 160: Hoare triple {37716#false} ~cond := #in~cond; {37716#false} is VALID [2018-11-23 12:06:46,014 INFO L273 TraceCheckUtils]: 161: Hoare triple {37716#false} assume 0 == ~cond; {37716#false} is VALID [2018-11-23 12:06:46,014 INFO L273 TraceCheckUtils]: 162: Hoare triple {37716#false} assume !false; {37716#false} is VALID [2018-11-23 12:06:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:46,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:46,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2018-11-23 12:06:46,049 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 163 [2018-11-23 12:06:46,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:46,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 12:06:46,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:46,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 12:06:46,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 12:06:46,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:06:46,213 INFO L87 Difference]: Start difference. First operand 168 states and 219 transitions. Second operand 54 states. [2018-11-23 12:06:46,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:46,886 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2018-11-23 12:06:46,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-23 12:06:46,886 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 163 [2018-11-23 12:06:46,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:06:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 238 transitions. [2018-11-23 12:06:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:06:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 238 transitions. [2018-11-23 12:06:46,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 238 transitions. [2018-11-23 12:06:47,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:47,115 INFO L225 Difference]: With dead ends: 184 [2018-11-23 12:06:47,116 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 12:06:47,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:06:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 12:06:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-11-23 12:06:47,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:47,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 171 states. [2018-11-23 12:06:47,167 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 171 states. [2018-11-23 12:06:47,167 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 171 states. [2018-11-23 12:06:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:47,171 INFO L93 Difference]: Finished difference Result 173 states and 226 transitions. [2018-11-23 12:06:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 226 transitions. [2018-11-23 12:06:47,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:47,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:47,171 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 173 states. [2018-11-23 12:06:47,171 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 173 states. [2018-11-23 12:06:47,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:47,174 INFO L93 Difference]: Finished difference Result 173 states and 226 transitions. [2018-11-23 12:06:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 226 transitions. [2018-11-23 12:06:47,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:47,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:47,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:47,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-23 12:06:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2018-11-23 12:06:47,176 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 163 [2018-11-23 12:06:47,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:47,177 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2018-11-23 12:06:47,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-23 12:06:47,177 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2018-11-23 12:06:47,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-23 12:06:47,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:47,177 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:47,178 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:47,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:47,178 INFO L82 PathProgramCache]: Analyzing trace with hash 270324515, now seen corresponding path program 51 times [2018-11-23 12:06:47,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:47,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:47,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:47,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:47,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:48,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {39079#true} call ULTIMATE.init(); {39079#true} is VALID [2018-11-23 12:06:48,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {39079#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39079#true} is VALID [2018-11-23 12:06:48,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {39079#true} assume true; {39079#true} is VALID [2018-11-23 12:06:48,439 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39079#true} {39079#true} #55#return; {39079#true} is VALID [2018-11-23 12:06:48,439 INFO L256 TraceCheckUtils]: 4: Hoare triple {39079#true} call #t~ret4 := main(); {39079#true} is VALID [2018-11-23 12:06:48,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {39079#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {39081#(= main_~i~0 0)} is VALID [2018-11-23 12:06:48,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {39081#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39081#(= main_~i~0 0)} is VALID [2018-11-23 12:06:48,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {39081#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39081#(= main_~i~0 0)} is VALID [2018-11-23 12:06:48,441 INFO L273 TraceCheckUtils]: 8: Hoare triple {39081#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {39082#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:48,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {39082#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39082#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:48,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {39082#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39082#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:48,442 INFO L273 TraceCheckUtils]: 11: Hoare triple {39082#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {39083#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:48,442 INFO L273 TraceCheckUtils]: 12: Hoare triple {39083#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39083#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:48,443 INFO L273 TraceCheckUtils]: 13: Hoare triple {39083#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39083#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:48,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {39083#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {39084#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:48,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {39084#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39084#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:48,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {39084#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39084#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:48,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {39084#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {39085#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:48,445 INFO L273 TraceCheckUtils]: 18: Hoare triple {39085#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39085#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:48,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {39085#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39085#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:48,446 INFO L273 TraceCheckUtils]: 20: Hoare triple {39085#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {39086#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:48,447 INFO L273 TraceCheckUtils]: 21: Hoare triple {39086#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39086#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:48,447 INFO L273 TraceCheckUtils]: 22: Hoare triple {39086#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39086#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:48,448 INFO L273 TraceCheckUtils]: 23: Hoare triple {39086#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {39087#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:48,448 INFO L273 TraceCheckUtils]: 24: Hoare triple {39087#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39087#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:48,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {39087#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39087#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:48,450 INFO L273 TraceCheckUtils]: 26: Hoare triple {39087#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {39088#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:48,450 INFO L273 TraceCheckUtils]: 27: Hoare triple {39088#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39088#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:48,451 INFO L273 TraceCheckUtils]: 28: Hoare triple {39088#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39088#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:48,451 INFO L273 TraceCheckUtils]: 29: Hoare triple {39088#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {39089#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:48,452 INFO L273 TraceCheckUtils]: 30: Hoare triple {39089#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39089#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:48,452 INFO L273 TraceCheckUtils]: 31: Hoare triple {39089#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39089#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:48,453 INFO L273 TraceCheckUtils]: 32: Hoare triple {39089#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {39090#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:48,454 INFO L273 TraceCheckUtils]: 33: Hoare triple {39090#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39090#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:48,454 INFO L273 TraceCheckUtils]: 34: Hoare triple {39090#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39090#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:48,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {39090#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {39091#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:48,455 INFO L273 TraceCheckUtils]: 36: Hoare triple {39091#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39091#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:48,456 INFO L273 TraceCheckUtils]: 37: Hoare triple {39091#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39091#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:48,456 INFO L273 TraceCheckUtils]: 38: Hoare triple {39091#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {39092#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:48,457 INFO L273 TraceCheckUtils]: 39: Hoare triple {39092#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39092#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:48,457 INFO L273 TraceCheckUtils]: 40: Hoare triple {39092#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39092#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:48,458 INFO L273 TraceCheckUtils]: 41: Hoare triple {39092#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {39093#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:48,459 INFO L273 TraceCheckUtils]: 42: Hoare triple {39093#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39093#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:48,459 INFO L273 TraceCheckUtils]: 43: Hoare triple {39093#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39093#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:48,460 INFO L273 TraceCheckUtils]: 44: Hoare triple {39093#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {39094#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:48,460 INFO L273 TraceCheckUtils]: 45: Hoare triple {39094#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39094#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:48,461 INFO L273 TraceCheckUtils]: 46: Hoare triple {39094#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39094#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:48,462 INFO L273 TraceCheckUtils]: 47: Hoare triple {39094#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {39095#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:48,462 INFO L273 TraceCheckUtils]: 48: Hoare triple {39095#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39095#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:48,463 INFO L273 TraceCheckUtils]: 49: Hoare triple {39095#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39095#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:48,463 INFO L273 TraceCheckUtils]: 50: Hoare triple {39095#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {39096#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:48,464 INFO L273 TraceCheckUtils]: 51: Hoare triple {39096#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39096#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:48,464 INFO L273 TraceCheckUtils]: 52: Hoare triple {39096#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39096#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:48,465 INFO L273 TraceCheckUtils]: 53: Hoare triple {39096#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {39097#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:48,466 INFO L273 TraceCheckUtils]: 54: Hoare triple {39097#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39097#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:48,466 INFO L273 TraceCheckUtils]: 55: Hoare triple {39097#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39097#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:48,467 INFO L273 TraceCheckUtils]: 56: Hoare triple {39097#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {39098#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:48,467 INFO L273 TraceCheckUtils]: 57: Hoare triple {39098#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39098#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:48,468 INFO L273 TraceCheckUtils]: 58: Hoare triple {39098#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39098#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:48,468 INFO L273 TraceCheckUtils]: 59: Hoare triple {39098#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {39099#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:48,469 INFO L273 TraceCheckUtils]: 60: Hoare triple {39099#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39099#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:48,469 INFO L273 TraceCheckUtils]: 61: Hoare triple {39099#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39099#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:48,470 INFO L273 TraceCheckUtils]: 62: Hoare triple {39099#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {39100#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:48,471 INFO L273 TraceCheckUtils]: 63: Hoare triple {39100#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39100#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:48,471 INFO L273 TraceCheckUtils]: 64: Hoare triple {39100#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39100#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:48,472 INFO L273 TraceCheckUtils]: 65: Hoare triple {39100#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {39101#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:48,472 INFO L273 TraceCheckUtils]: 66: Hoare triple {39101#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39101#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:48,473 INFO L273 TraceCheckUtils]: 67: Hoare triple {39101#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39101#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:48,474 INFO L273 TraceCheckUtils]: 68: Hoare triple {39101#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {39102#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:48,474 INFO L273 TraceCheckUtils]: 69: Hoare triple {39102#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39102#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:48,475 INFO L273 TraceCheckUtils]: 70: Hoare triple {39102#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39102#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:48,475 INFO L273 TraceCheckUtils]: 71: Hoare triple {39102#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {39103#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:48,476 INFO L273 TraceCheckUtils]: 72: Hoare triple {39103#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39103#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:48,476 INFO L273 TraceCheckUtils]: 73: Hoare triple {39103#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39103#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:48,477 INFO L273 TraceCheckUtils]: 74: Hoare triple {39103#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {39104#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:48,477 INFO L273 TraceCheckUtils]: 75: Hoare triple {39104#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39104#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:48,478 INFO L273 TraceCheckUtils]: 76: Hoare triple {39104#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39104#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:48,479 INFO L273 TraceCheckUtils]: 77: Hoare triple {39104#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {39105#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:48,479 INFO L273 TraceCheckUtils]: 78: Hoare triple {39105#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39105#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:48,480 INFO L273 TraceCheckUtils]: 79: Hoare triple {39105#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39105#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:48,480 INFO L273 TraceCheckUtils]: 80: Hoare triple {39105#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {39106#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:48,481 INFO L273 TraceCheckUtils]: 81: Hoare triple {39106#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39106#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:48,481 INFO L273 TraceCheckUtils]: 82: Hoare triple {39106#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39106#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:48,482 INFO L273 TraceCheckUtils]: 83: Hoare triple {39106#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {39107#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:48,483 INFO L273 TraceCheckUtils]: 84: Hoare triple {39107#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39107#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:48,483 INFO L273 TraceCheckUtils]: 85: Hoare triple {39107#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39107#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:48,484 INFO L273 TraceCheckUtils]: 86: Hoare triple {39107#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {39108#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:48,484 INFO L273 TraceCheckUtils]: 87: Hoare triple {39108#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39108#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:48,485 INFO L273 TraceCheckUtils]: 88: Hoare triple {39108#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39108#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:48,485 INFO L273 TraceCheckUtils]: 89: Hoare triple {39108#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {39109#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:48,486 INFO L273 TraceCheckUtils]: 90: Hoare triple {39109#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39109#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:48,486 INFO L273 TraceCheckUtils]: 91: Hoare triple {39109#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39109#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:48,487 INFO L273 TraceCheckUtils]: 92: Hoare triple {39109#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {39110#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:48,488 INFO L273 TraceCheckUtils]: 93: Hoare triple {39110#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39110#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:48,488 INFO L273 TraceCheckUtils]: 94: Hoare triple {39110#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39110#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:48,489 INFO L273 TraceCheckUtils]: 95: Hoare triple {39110#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {39111#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:48,489 INFO L273 TraceCheckUtils]: 96: Hoare triple {39111#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39111#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:48,490 INFO L273 TraceCheckUtils]: 97: Hoare triple {39111#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39111#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:48,491 INFO L273 TraceCheckUtils]: 98: Hoare triple {39111#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {39112#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:48,491 INFO L273 TraceCheckUtils]: 99: Hoare triple {39112#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39112#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:48,492 INFO L273 TraceCheckUtils]: 100: Hoare triple {39112#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39112#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:48,492 INFO L273 TraceCheckUtils]: 101: Hoare triple {39112#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {39113#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:48,493 INFO L273 TraceCheckUtils]: 102: Hoare triple {39113#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39113#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:48,493 INFO L273 TraceCheckUtils]: 103: Hoare triple {39113#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39113#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:48,494 INFO L273 TraceCheckUtils]: 104: Hoare triple {39113#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {39114#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:48,495 INFO L273 TraceCheckUtils]: 105: Hoare triple {39114#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39114#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:48,495 INFO L273 TraceCheckUtils]: 106: Hoare triple {39114#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39114#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:48,496 INFO L273 TraceCheckUtils]: 107: Hoare triple {39114#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {39115#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:48,496 INFO L273 TraceCheckUtils]: 108: Hoare triple {39115#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39115#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:48,497 INFO L273 TraceCheckUtils]: 109: Hoare triple {39115#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39115#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:48,497 INFO L273 TraceCheckUtils]: 110: Hoare triple {39115#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {39116#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:48,498 INFO L273 TraceCheckUtils]: 111: Hoare triple {39116#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39116#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:48,498 INFO L273 TraceCheckUtils]: 112: Hoare triple {39116#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39116#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:48,499 INFO L273 TraceCheckUtils]: 113: Hoare triple {39116#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {39117#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:48,500 INFO L273 TraceCheckUtils]: 114: Hoare triple {39117#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39117#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:48,500 INFO L273 TraceCheckUtils]: 115: Hoare triple {39117#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39117#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:48,501 INFO L273 TraceCheckUtils]: 116: Hoare triple {39117#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {39118#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:48,501 INFO L273 TraceCheckUtils]: 117: Hoare triple {39118#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39118#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:48,502 INFO L273 TraceCheckUtils]: 118: Hoare triple {39118#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39118#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:48,503 INFO L273 TraceCheckUtils]: 119: Hoare triple {39118#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {39119#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:48,503 INFO L273 TraceCheckUtils]: 120: Hoare triple {39119#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39119#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:48,504 INFO L273 TraceCheckUtils]: 121: Hoare triple {39119#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39119#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:48,504 INFO L273 TraceCheckUtils]: 122: Hoare triple {39119#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {39120#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:48,505 INFO L273 TraceCheckUtils]: 123: Hoare triple {39120#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39120#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:48,505 INFO L273 TraceCheckUtils]: 124: Hoare triple {39120#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39120#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:48,506 INFO L273 TraceCheckUtils]: 125: Hoare triple {39120#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {39121#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:48,507 INFO L273 TraceCheckUtils]: 126: Hoare triple {39121#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39121#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:48,507 INFO L273 TraceCheckUtils]: 127: Hoare triple {39121#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39121#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:48,508 INFO L273 TraceCheckUtils]: 128: Hoare triple {39121#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {39122#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:48,508 INFO L273 TraceCheckUtils]: 129: Hoare triple {39122#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39122#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:48,509 INFO L273 TraceCheckUtils]: 130: Hoare triple {39122#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39122#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:48,509 INFO L273 TraceCheckUtils]: 131: Hoare triple {39122#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {39123#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:48,510 INFO L273 TraceCheckUtils]: 132: Hoare triple {39123#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39123#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:48,510 INFO L273 TraceCheckUtils]: 133: Hoare triple {39123#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39123#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:48,511 INFO L273 TraceCheckUtils]: 134: Hoare triple {39123#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {39124#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:48,512 INFO L273 TraceCheckUtils]: 135: Hoare triple {39124#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39124#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:48,512 INFO L273 TraceCheckUtils]: 136: Hoare triple {39124#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39124#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:48,513 INFO L273 TraceCheckUtils]: 137: Hoare triple {39124#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {39125#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:48,513 INFO L273 TraceCheckUtils]: 138: Hoare triple {39125#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39125#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:48,514 INFO L273 TraceCheckUtils]: 139: Hoare triple {39125#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39125#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:48,515 INFO L273 TraceCheckUtils]: 140: Hoare triple {39125#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {39126#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:48,515 INFO L273 TraceCheckUtils]: 141: Hoare triple {39126#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39126#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:48,516 INFO L273 TraceCheckUtils]: 142: Hoare triple {39126#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39126#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:48,516 INFO L273 TraceCheckUtils]: 143: Hoare triple {39126#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {39127#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:48,517 INFO L273 TraceCheckUtils]: 144: Hoare triple {39127#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39127#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:48,517 INFO L273 TraceCheckUtils]: 145: Hoare triple {39127#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39127#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:48,518 INFO L273 TraceCheckUtils]: 146: Hoare triple {39127#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {39128#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:48,518 INFO L273 TraceCheckUtils]: 147: Hoare triple {39128#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39128#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:48,519 INFO L273 TraceCheckUtils]: 148: Hoare triple {39128#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39128#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:48,520 INFO L273 TraceCheckUtils]: 149: Hoare triple {39128#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {39129#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:48,520 INFO L273 TraceCheckUtils]: 150: Hoare triple {39129#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39129#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:48,521 INFO L273 TraceCheckUtils]: 151: Hoare triple {39129#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39129#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:48,521 INFO L273 TraceCheckUtils]: 152: Hoare triple {39129#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {39130#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:48,522 INFO L273 TraceCheckUtils]: 153: Hoare triple {39130#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39130#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:48,522 INFO L273 TraceCheckUtils]: 154: Hoare triple {39130#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39130#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:48,523 INFO L273 TraceCheckUtils]: 155: Hoare triple {39130#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {39131#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:48,524 INFO L273 TraceCheckUtils]: 156: Hoare triple {39131#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39131#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:48,524 INFO L273 TraceCheckUtils]: 157: Hoare triple {39131#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39131#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:48,525 INFO L273 TraceCheckUtils]: 158: Hoare triple {39131#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {39132#(<= main_~i~0 51)} is VALID [2018-11-23 12:06:48,525 INFO L273 TraceCheckUtils]: 159: Hoare triple {39132#(<= main_~i~0 51)} assume !(~i~0 < 100000); {39080#false} is VALID [2018-11-23 12:06:48,526 INFO L273 TraceCheckUtils]: 160: Hoare triple {39080#false} havoc ~x~0;~x~0 := 0; {39080#false} is VALID [2018-11-23 12:06:48,526 INFO L273 TraceCheckUtils]: 161: Hoare triple {39080#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {39080#false} is VALID [2018-11-23 12:06:48,526 INFO L256 TraceCheckUtils]: 162: Hoare triple {39080#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {39080#false} is VALID [2018-11-23 12:06:48,526 INFO L273 TraceCheckUtils]: 163: Hoare triple {39080#false} ~cond := #in~cond; {39080#false} is VALID [2018-11-23 12:06:48,526 INFO L273 TraceCheckUtils]: 164: Hoare triple {39080#false} assume 0 == ~cond; {39080#false} is VALID [2018-11-23 12:06:48,527 INFO L273 TraceCheckUtils]: 165: Hoare triple {39080#false} assume !false; {39080#false} is VALID [2018-11-23 12:06:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:48,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:48,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:48,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:48,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-11-23 12:06:48,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:48,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:50,536 INFO L256 TraceCheckUtils]: 0: Hoare triple {39079#true} call ULTIMATE.init(); {39079#true} is VALID [2018-11-23 12:06:50,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {39079#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39079#true} is VALID [2018-11-23 12:06:50,537 INFO L273 TraceCheckUtils]: 2: Hoare triple {39079#true} assume true; {39079#true} is VALID [2018-11-23 12:06:50,537 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39079#true} {39079#true} #55#return; {39079#true} is VALID [2018-11-23 12:06:50,537 INFO L256 TraceCheckUtils]: 4: Hoare triple {39079#true} call #t~ret4 := main(); {39079#true} is VALID [2018-11-23 12:06:50,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {39079#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {39151#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:50,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {39151#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39151#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:50,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {39151#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39151#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:50,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {39151#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {39082#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:50,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {39082#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39082#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:50,539 INFO L273 TraceCheckUtils]: 10: Hoare triple {39082#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39082#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:50,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {39082#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {39083#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:50,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {39083#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39083#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:50,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {39083#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39083#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:50,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {39083#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {39084#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:50,542 INFO L273 TraceCheckUtils]: 15: Hoare triple {39084#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39084#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:50,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {39084#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39084#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:50,543 INFO L273 TraceCheckUtils]: 17: Hoare triple {39084#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {39085#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:50,544 INFO L273 TraceCheckUtils]: 18: Hoare triple {39085#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39085#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:50,544 INFO L273 TraceCheckUtils]: 19: Hoare triple {39085#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39085#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:50,545 INFO L273 TraceCheckUtils]: 20: Hoare triple {39085#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {39086#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:50,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {39086#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39086#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:50,546 INFO L273 TraceCheckUtils]: 22: Hoare triple {39086#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39086#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:50,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {39086#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {39087#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:50,547 INFO L273 TraceCheckUtils]: 24: Hoare triple {39087#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39087#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:50,548 INFO L273 TraceCheckUtils]: 25: Hoare triple {39087#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39087#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:50,548 INFO L273 TraceCheckUtils]: 26: Hoare triple {39087#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {39088#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:50,549 INFO L273 TraceCheckUtils]: 27: Hoare triple {39088#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39088#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:50,549 INFO L273 TraceCheckUtils]: 28: Hoare triple {39088#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39088#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:50,550 INFO L273 TraceCheckUtils]: 29: Hoare triple {39088#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {39089#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:50,551 INFO L273 TraceCheckUtils]: 30: Hoare triple {39089#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39089#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:50,551 INFO L273 TraceCheckUtils]: 31: Hoare triple {39089#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39089#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:50,552 INFO L273 TraceCheckUtils]: 32: Hoare triple {39089#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {39090#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:50,552 INFO L273 TraceCheckUtils]: 33: Hoare triple {39090#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39090#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:50,553 INFO L273 TraceCheckUtils]: 34: Hoare triple {39090#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39090#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:50,554 INFO L273 TraceCheckUtils]: 35: Hoare triple {39090#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {39091#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:50,554 INFO L273 TraceCheckUtils]: 36: Hoare triple {39091#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39091#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:50,555 INFO L273 TraceCheckUtils]: 37: Hoare triple {39091#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39091#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:50,555 INFO L273 TraceCheckUtils]: 38: Hoare triple {39091#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {39092#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:50,556 INFO L273 TraceCheckUtils]: 39: Hoare triple {39092#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39092#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:50,556 INFO L273 TraceCheckUtils]: 40: Hoare triple {39092#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39092#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:50,557 INFO L273 TraceCheckUtils]: 41: Hoare triple {39092#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {39093#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:50,557 INFO L273 TraceCheckUtils]: 42: Hoare triple {39093#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39093#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:50,558 INFO L273 TraceCheckUtils]: 43: Hoare triple {39093#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39093#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:50,559 INFO L273 TraceCheckUtils]: 44: Hoare triple {39093#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {39094#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:50,559 INFO L273 TraceCheckUtils]: 45: Hoare triple {39094#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39094#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:50,560 INFO L273 TraceCheckUtils]: 46: Hoare triple {39094#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39094#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:50,560 INFO L273 TraceCheckUtils]: 47: Hoare triple {39094#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {39095#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:50,561 INFO L273 TraceCheckUtils]: 48: Hoare triple {39095#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39095#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:50,561 INFO L273 TraceCheckUtils]: 49: Hoare triple {39095#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39095#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:50,562 INFO L273 TraceCheckUtils]: 50: Hoare triple {39095#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {39096#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:50,563 INFO L273 TraceCheckUtils]: 51: Hoare triple {39096#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39096#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:50,563 INFO L273 TraceCheckUtils]: 52: Hoare triple {39096#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39096#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:50,564 INFO L273 TraceCheckUtils]: 53: Hoare triple {39096#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {39097#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:50,564 INFO L273 TraceCheckUtils]: 54: Hoare triple {39097#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39097#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:50,565 INFO L273 TraceCheckUtils]: 55: Hoare triple {39097#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39097#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:50,566 INFO L273 TraceCheckUtils]: 56: Hoare triple {39097#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {39098#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:50,566 INFO L273 TraceCheckUtils]: 57: Hoare triple {39098#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39098#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:50,567 INFO L273 TraceCheckUtils]: 58: Hoare triple {39098#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39098#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:50,567 INFO L273 TraceCheckUtils]: 59: Hoare triple {39098#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {39099#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:50,568 INFO L273 TraceCheckUtils]: 60: Hoare triple {39099#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39099#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:50,568 INFO L273 TraceCheckUtils]: 61: Hoare triple {39099#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39099#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:50,569 INFO L273 TraceCheckUtils]: 62: Hoare triple {39099#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {39100#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:50,569 INFO L273 TraceCheckUtils]: 63: Hoare triple {39100#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39100#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:50,570 INFO L273 TraceCheckUtils]: 64: Hoare triple {39100#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39100#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:50,571 INFO L273 TraceCheckUtils]: 65: Hoare triple {39100#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {39101#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:50,571 INFO L273 TraceCheckUtils]: 66: Hoare triple {39101#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39101#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:50,572 INFO L273 TraceCheckUtils]: 67: Hoare triple {39101#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39101#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:50,572 INFO L273 TraceCheckUtils]: 68: Hoare triple {39101#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {39102#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:50,573 INFO L273 TraceCheckUtils]: 69: Hoare triple {39102#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39102#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:50,573 INFO L273 TraceCheckUtils]: 70: Hoare triple {39102#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39102#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:50,574 INFO L273 TraceCheckUtils]: 71: Hoare triple {39102#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {39103#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:50,575 INFO L273 TraceCheckUtils]: 72: Hoare triple {39103#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39103#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:50,577 INFO L273 TraceCheckUtils]: 73: Hoare triple {39103#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39103#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:50,577 INFO L273 TraceCheckUtils]: 74: Hoare triple {39103#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {39104#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:50,578 INFO L273 TraceCheckUtils]: 75: Hoare triple {39104#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39104#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:50,578 INFO L273 TraceCheckUtils]: 76: Hoare triple {39104#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39104#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:50,579 INFO L273 TraceCheckUtils]: 77: Hoare triple {39104#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {39105#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:50,580 INFO L273 TraceCheckUtils]: 78: Hoare triple {39105#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39105#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:50,580 INFO L273 TraceCheckUtils]: 79: Hoare triple {39105#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39105#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:50,581 INFO L273 TraceCheckUtils]: 80: Hoare triple {39105#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {39106#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:50,581 INFO L273 TraceCheckUtils]: 81: Hoare triple {39106#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39106#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:50,582 INFO L273 TraceCheckUtils]: 82: Hoare triple {39106#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39106#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:50,583 INFO L273 TraceCheckUtils]: 83: Hoare triple {39106#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {39107#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:50,583 INFO L273 TraceCheckUtils]: 84: Hoare triple {39107#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39107#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:50,584 INFO L273 TraceCheckUtils]: 85: Hoare triple {39107#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39107#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:50,584 INFO L273 TraceCheckUtils]: 86: Hoare triple {39107#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {39108#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:50,585 INFO L273 TraceCheckUtils]: 87: Hoare triple {39108#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39108#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:50,585 INFO L273 TraceCheckUtils]: 88: Hoare triple {39108#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39108#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:50,586 INFO L273 TraceCheckUtils]: 89: Hoare triple {39108#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {39109#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:50,587 INFO L273 TraceCheckUtils]: 90: Hoare triple {39109#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39109#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:50,587 INFO L273 TraceCheckUtils]: 91: Hoare triple {39109#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39109#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:50,588 INFO L273 TraceCheckUtils]: 92: Hoare triple {39109#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {39110#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:50,588 INFO L273 TraceCheckUtils]: 93: Hoare triple {39110#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39110#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:50,589 INFO L273 TraceCheckUtils]: 94: Hoare triple {39110#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39110#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:50,589 INFO L273 TraceCheckUtils]: 95: Hoare triple {39110#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {39111#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:50,590 INFO L273 TraceCheckUtils]: 96: Hoare triple {39111#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39111#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:50,590 INFO L273 TraceCheckUtils]: 97: Hoare triple {39111#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39111#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:50,591 INFO L273 TraceCheckUtils]: 98: Hoare triple {39111#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {39112#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:50,592 INFO L273 TraceCheckUtils]: 99: Hoare triple {39112#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39112#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:50,592 INFO L273 TraceCheckUtils]: 100: Hoare triple {39112#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39112#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:50,593 INFO L273 TraceCheckUtils]: 101: Hoare triple {39112#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {39113#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:50,593 INFO L273 TraceCheckUtils]: 102: Hoare triple {39113#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39113#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:50,594 INFO L273 TraceCheckUtils]: 103: Hoare triple {39113#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39113#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:50,595 INFO L273 TraceCheckUtils]: 104: Hoare triple {39113#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {39114#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:50,595 INFO L273 TraceCheckUtils]: 105: Hoare triple {39114#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39114#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:50,596 INFO L273 TraceCheckUtils]: 106: Hoare triple {39114#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39114#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:50,596 INFO L273 TraceCheckUtils]: 107: Hoare triple {39114#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {39115#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:50,597 INFO L273 TraceCheckUtils]: 108: Hoare triple {39115#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39115#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:50,597 INFO L273 TraceCheckUtils]: 109: Hoare triple {39115#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39115#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:50,598 INFO L273 TraceCheckUtils]: 110: Hoare triple {39115#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {39116#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:50,598 INFO L273 TraceCheckUtils]: 111: Hoare triple {39116#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39116#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:50,599 INFO L273 TraceCheckUtils]: 112: Hoare triple {39116#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39116#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:50,600 INFO L273 TraceCheckUtils]: 113: Hoare triple {39116#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {39117#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:50,600 INFO L273 TraceCheckUtils]: 114: Hoare triple {39117#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39117#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:50,601 INFO L273 TraceCheckUtils]: 115: Hoare triple {39117#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39117#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:50,601 INFO L273 TraceCheckUtils]: 116: Hoare triple {39117#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {39118#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:50,602 INFO L273 TraceCheckUtils]: 117: Hoare triple {39118#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39118#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:50,602 INFO L273 TraceCheckUtils]: 118: Hoare triple {39118#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39118#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:50,603 INFO L273 TraceCheckUtils]: 119: Hoare triple {39118#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {39119#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:50,604 INFO L273 TraceCheckUtils]: 120: Hoare triple {39119#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39119#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:50,604 INFO L273 TraceCheckUtils]: 121: Hoare triple {39119#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39119#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:50,605 INFO L273 TraceCheckUtils]: 122: Hoare triple {39119#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {39120#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:50,605 INFO L273 TraceCheckUtils]: 123: Hoare triple {39120#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39120#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:50,606 INFO L273 TraceCheckUtils]: 124: Hoare triple {39120#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39120#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:50,606 INFO L273 TraceCheckUtils]: 125: Hoare triple {39120#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {39121#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:50,607 INFO L273 TraceCheckUtils]: 126: Hoare triple {39121#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39121#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:50,607 INFO L273 TraceCheckUtils]: 127: Hoare triple {39121#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39121#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:50,608 INFO L273 TraceCheckUtils]: 128: Hoare triple {39121#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {39122#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:50,609 INFO L273 TraceCheckUtils]: 129: Hoare triple {39122#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39122#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:50,609 INFO L273 TraceCheckUtils]: 130: Hoare triple {39122#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39122#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:50,610 INFO L273 TraceCheckUtils]: 131: Hoare triple {39122#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {39123#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:50,610 INFO L273 TraceCheckUtils]: 132: Hoare triple {39123#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39123#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:50,611 INFO L273 TraceCheckUtils]: 133: Hoare triple {39123#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39123#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:50,612 INFO L273 TraceCheckUtils]: 134: Hoare triple {39123#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {39124#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:50,612 INFO L273 TraceCheckUtils]: 135: Hoare triple {39124#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39124#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:50,613 INFO L273 TraceCheckUtils]: 136: Hoare triple {39124#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39124#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:50,613 INFO L273 TraceCheckUtils]: 137: Hoare triple {39124#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {39125#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:50,614 INFO L273 TraceCheckUtils]: 138: Hoare triple {39125#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39125#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:50,614 INFO L273 TraceCheckUtils]: 139: Hoare triple {39125#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39125#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:50,615 INFO L273 TraceCheckUtils]: 140: Hoare triple {39125#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {39126#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:50,615 INFO L273 TraceCheckUtils]: 141: Hoare triple {39126#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39126#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:50,616 INFO L273 TraceCheckUtils]: 142: Hoare triple {39126#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39126#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:50,617 INFO L273 TraceCheckUtils]: 143: Hoare triple {39126#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {39127#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:50,617 INFO L273 TraceCheckUtils]: 144: Hoare triple {39127#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39127#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:50,618 INFO L273 TraceCheckUtils]: 145: Hoare triple {39127#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39127#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:50,618 INFO L273 TraceCheckUtils]: 146: Hoare triple {39127#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {39128#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:50,619 INFO L273 TraceCheckUtils]: 147: Hoare triple {39128#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39128#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:50,619 INFO L273 TraceCheckUtils]: 148: Hoare triple {39128#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39128#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:50,620 INFO L273 TraceCheckUtils]: 149: Hoare triple {39128#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {39129#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:50,621 INFO L273 TraceCheckUtils]: 150: Hoare triple {39129#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39129#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:50,621 INFO L273 TraceCheckUtils]: 151: Hoare triple {39129#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39129#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:50,622 INFO L273 TraceCheckUtils]: 152: Hoare triple {39129#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {39130#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:50,622 INFO L273 TraceCheckUtils]: 153: Hoare triple {39130#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39130#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:50,623 INFO L273 TraceCheckUtils]: 154: Hoare triple {39130#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39130#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:50,623 INFO L273 TraceCheckUtils]: 155: Hoare triple {39130#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {39131#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:50,624 INFO L273 TraceCheckUtils]: 156: Hoare triple {39131#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39131#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:50,624 INFO L273 TraceCheckUtils]: 157: Hoare triple {39131#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {39131#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:50,625 INFO L273 TraceCheckUtils]: 158: Hoare triple {39131#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {39132#(<= main_~i~0 51)} is VALID [2018-11-23 12:06:50,626 INFO L273 TraceCheckUtils]: 159: Hoare triple {39132#(<= main_~i~0 51)} assume !(~i~0 < 100000); {39080#false} is VALID [2018-11-23 12:06:50,626 INFO L273 TraceCheckUtils]: 160: Hoare triple {39080#false} havoc ~x~0;~x~0 := 0; {39080#false} is VALID [2018-11-23 12:06:50,626 INFO L273 TraceCheckUtils]: 161: Hoare triple {39080#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {39080#false} is VALID [2018-11-23 12:06:50,626 INFO L256 TraceCheckUtils]: 162: Hoare triple {39080#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {39080#false} is VALID [2018-11-23 12:06:50,627 INFO L273 TraceCheckUtils]: 163: Hoare triple {39080#false} ~cond := #in~cond; {39080#false} is VALID [2018-11-23 12:06:50,627 INFO L273 TraceCheckUtils]: 164: Hoare triple {39080#false} assume 0 == ~cond; {39080#false} is VALID [2018-11-23 12:06:50,627 INFO L273 TraceCheckUtils]: 165: Hoare triple {39080#false} assume !false; {39080#false} is VALID [2018-11-23 12:06:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:50,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:50,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2018-11-23 12:06:50,662 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 166 [2018-11-23 12:06:50,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:50,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 12:06:50,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:50,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 12:06:50,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 12:06:50,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:06:50,830 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 55 states. [2018-11-23 12:06:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:51,921 INFO L93 Difference]: Finished difference Result 187 states and 242 transitions. [2018-11-23 12:06:51,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 12:06:51,921 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 166 [2018-11-23 12:06:51,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:06:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 242 transitions. [2018-11-23 12:06:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:06:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 242 transitions. [2018-11-23 12:06:51,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 242 transitions. [2018-11-23 12:06:52,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:52,159 INFO L225 Difference]: With dead ends: 187 [2018-11-23 12:06:52,159 INFO L226 Difference]: Without dead ends: 176 [2018-11-23 12:06:52,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:06:52,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-23 12:06:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-11-23 12:06:52,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:52,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand 174 states. [2018-11-23 12:06:52,217 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 174 states. [2018-11-23 12:06:52,217 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 174 states. [2018-11-23 12:06:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:52,220 INFO L93 Difference]: Finished difference Result 176 states and 230 transitions. [2018-11-23 12:06:52,220 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 230 transitions. [2018-11-23 12:06:52,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:52,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:52,220 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 176 states. [2018-11-23 12:06:52,221 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 176 states. [2018-11-23 12:06:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:52,223 INFO L93 Difference]: Finished difference Result 176 states and 230 transitions. [2018-11-23 12:06:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 230 transitions. [2018-11-23 12:06:52,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:52,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:52,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:52,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-23 12:06:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 227 transitions. [2018-11-23 12:06:52,225 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 227 transitions. Word has length 166 [2018-11-23 12:06:52,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:52,226 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 227 transitions. [2018-11-23 12:06:52,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-23 12:06:52,226 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 227 transitions. [2018-11-23 12:06:52,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-23 12:06:52,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:52,227 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:52,227 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:52,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:52,227 INFO L82 PathProgramCache]: Analyzing trace with hash -780687815, now seen corresponding path program 52 times [2018-11-23 12:06:52,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:52,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:52,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:52,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:52,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:53,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {40467#true} call ULTIMATE.init(); {40467#true} is VALID [2018-11-23 12:06:53,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {40467#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40467#true} is VALID [2018-11-23 12:06:53,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {40467#true} assume true; {40467#true} is VALID [2018-11-23 12:06:53,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40467#true} {40467#true} #55#return; {40467#true} is VALID [2018-11-23 12:06:53,579 INFO L256 TraceCheckUtils]: 4: Hoare triple {40467#true} call #t~ret4 := main(); {40467#true} is VALID [2018-11-23 12:06:53,579 INFO L273 TraceCheckUtils]: 5: Hoare triple {40467#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {40469#(= main_~i~0 0)} is VALID [2018-11-23 12:06:53,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {40469#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40469#(= main_~i~0 0)} is VALID [2018-11-23 12:06:53,580 INFO L273 TraceCheckUtils]: 7: Hoare triple {40469#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40469#(= main_~i~0 0)} is VALID [2018-11-23 12:06:53,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {40469#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {40470#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:53,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {40470#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40470#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:53,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {40470#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40470#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:53,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {40470#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {40471#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:53,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {40471#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40471#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:53,583 INFO L273 TraceCheckUtils]: 13: Hoare triple {40471#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40471#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:53,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {40471#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {40472#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:53,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {40472#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40472#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:53,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {40472#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40472#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:53,585 INFO L273 TraceCheckUtils]: 17: Hoare triple {40472#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {40473#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:53,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {40473#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40473#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:53,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {40473#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40473#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:53,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {40473#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {40474#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:53,587 INFO L273 TraceCheckUtils]: 21: Hoare triple {40474#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40474#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:53,587 INFO L273 TraceCheckUtils]: 22: Hoare triple {40474#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40474#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:53,588 INFO L273 TraceCheckUtils]: 23: Hoare triple {40474#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {40475#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:53,589 INFO L273 TraceCheckUtils]: 24: Hoare triple {40475#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40475#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:53,589 INFO L273 TraceCheckUtils]: 25: Hoare triple {40475#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40475#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:53,590 INFO L273 TraceCheckUtils]: 26: Hoare triple {40475#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {40476#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:53,590 INFO L273 TraceCheckUtils]: 27: Hoare triple {40476#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40476#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:53,591 INFO L273 TraceCheckUtils]: 28: Hoare triple {40476#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40476#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:53,591 INFO L273 TraceCheckUtils]: 29: Hoare triple {40476#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {40477#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:53,592 INFO L273 TraceCheckUtils]: 30: Hoare triple {40477#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40477#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:53,592 INFO L273 TraceCheckUtils]: 31: Hoare triple {40477#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40477#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:53,593 INFO L273 TraceCheckUtils]: 32: Hoare triple {40477#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {40478#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:53,593 INFO L273 TraceCheckUtils]: 33: Hoare triple {40478#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40478#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:53,594 INFO L273 TraceCheckUtils]: 34: Hoare triple {40478#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40478#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:53,595 INFO L273 TraceCheckUtils]: 35: Hoare triple {40478#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {40479#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:53,595 INFO L273 TraceCheckUtils]: 36: Hoare triple {40479#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40479#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:53,596 INFO L273 TraceCheckUtils]: 37: Hoare triple {40479#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40479#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:53,596 INFO L273 TraceCheckUtils]: 38: Hoare triple {40479#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {40480#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:53,597 INFO L273 TraceCheckUtils]: 39: Hoare triple {40480#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40480#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:53,597 INFO L273 TraceCheckUtils]: 40: Hoare triple {40480#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40480#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:53,598 INFO L273 TraceCheckUtils]: 41: Hoare triple {40480#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {40481#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:53,598 INFO L273 TraceCheckUtils]: 42: Hoare triple {40481#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40481#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:53,599 INFO L273 TraceCheckUtils]: 43: Hoare triple {40481#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40481#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:53,600 INFO L273 TraceCheckUtils]: 44: Hoare triple {40481#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {40482#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:53,600 INFO L273 TraceCheckUtils]: 45: Hoare triple {40482#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40482#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:53,600 INFO L273 TraceCheckUtils]: 46: Hoare triple {40482#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40482#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:53,601 INFO L273 TraceCheckUtils]: 47: Hoare triple {40482#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {40483#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:53,602 INFO L273 TraceCheckUtils]: 48: Hoare triple {40483#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40483#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:53,602 INFO L273 TraceCheckUtils]: 49: Hoare triple {40483#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40483#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:53,603 INFO L273 TraceCheckUtils]: 50: Hoare triple {40483#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {40484#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:53,603 INFO L273 TraceCheckUtils]: 51: Hoare triple {40484#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40484#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:53,604 INFO L273 TraceCheckUtils]: 52: Hoare triple {40484#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40484#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:53,604 INFO L273 TraceCheckUtils]: 53: Hoare triple {40484#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {40485#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:53,605 INFO L273 TraceCheckUtils]: 54: Hoare triple {40485#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40485#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:53,605 INFO L273 TraceCheckUtils]: 55: Hoare triple {40485#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40485#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:53,606 INFO L273 TraceCheckUtils]: 56: Hoare triple {40485#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {40486#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:53,606 INFO L273 TraceCheckUtils]: 57: Hoare triple {40486#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40486#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:53,607 INFO L273 TraceCheckUtils]: 58: Hoare triple {40486#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40486#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:53,608 INFO L273 TraceCheckUtils]: 59: Hoare triple {40486#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {40487#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:53,608 INFO L273 TraceCheckUtils]: 60: Hoare triple {40487#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40487#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:53,609 INFO L273 TraceCheckUtils]: 61: Hoare triple {40487#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40487#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:53,609 INFO L273 TraceCheckUtils]: 62: Hoare triple {40487#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {40488#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:53,610 INFO L273 TraceCheckUtils]: 63: Hoare triple {40488#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40488#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:53,610 INFO L273 TraceCheckUtils]: 64: Hoare triple {40488#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40488#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:53,611 INFO L273 TraceCheckUtils]: 65: Hoare triple {40488#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {40489#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:53,612 INFO L273 TraceCheckUtils]: 66: Hoare triple {40489#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40489#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:53,612 INFO L273 TraceCheckUtils]: 67: Hoare triple {40489#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40489#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:53,613 INFO L273 TraceCheckUtils]: 68: Hoare triple {40489#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {40490#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:53,613 INFO L273 TraceCheckUtils]: 69: Hoare triple {40490#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40490#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:53,614 INFO L273 TraceCheckUtils]: 70: Hoare triple {40490#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40490#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:53,614 INFO L273 TraceCheckUtils]: 71: Hoare triple {40490#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {40491#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:53,615 INFO L273 TraceCheckUtils]: 72: Hoare triple {40491#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40491#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:53,615 INFO L273 TraceCheckUtils]: 73: Hoare triple {40491#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40491#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:53,616 INFO L273 TraceCheckUtils]: 74: Hoare triple {40491#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {40492#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:53,617 INFO L273 TraceCheckUtils]: 75: Hoare triple {40492#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40492#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:53,617 INFO L273 TraceCheckUtils]: 76: Hoare triple {40492#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40492#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:53,618 INFO L273 TraceCheckUtils]: 77: Hoare triple {40492#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {40493#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:53,618 INFO L273 TraceCheckUtils]: 78: Hoare triple {40493#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40493#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:53,619 INFO L273 TraceCheckUtils]: 79: Hoare triple {40493#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40493#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:53,620 INFO L273 TraceCheckUtils]: 80: Hoare triple {40493#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {40494#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:53,620 INFO L273 TraceCheckUtils]: 81: Hoare triple {40494#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40494#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:53,621 INFO L273 TraceCheckUtils]: 82: Hoare triple {40494#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40494#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:53,621 INFO L273 TraceCheckUtils]: 83: Hoare triple {40494#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {40495#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:53,622 INFO L273 TraceCheckUtils]: 84: Hoare triple {40495#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40495#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:53,622 INFO L273 TraceCheckUtils]: 85: Hoare triple {40495#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40495#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:53,623 INFO L273 TraceCheckUtils]: 86: Hoare triple {40495#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {40496#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:53,623 INFO L273 TraceCheckUtils]: 87: Hoare triple {40496#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40496#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:53,624 INFO L273 TraceCheckUtils]: 88: Hoare triple {40496#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40496#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:53,625 INFO L273 TraceCheckUtils]: 89: Hoare triple {40496#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {40497#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:53,625 INFO L273 TraceCheckUtils]: 90: Hoare triple {40497#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40497#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:53,626 INFO L273 TraceCheckUtils]: 91: Hoare triple {40497#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40497#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:53,626 INFO L273 TraceCheckUtils]: 92: Hoare triple {40497#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {40498#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:53,627 INFO L273 TraceCheckUtils]: 93: Hoare triple {40498#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40498#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:53,627 INFO L273 TraceCheckUtils]: 94: Hoare triple {40498#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40498#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:53,628 INFO L273 TraceCheckUtils]: 95: Hoare triple {40498#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {40499#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:53,629 INFO L273 TraceCheckUtils]: 96: Hoare triple {40499#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40499#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:53,629 INFO L273 TraceCheckUtils]: 97: Hoare triple {40499#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40499#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:53,630 INFO L273 TraceCheckUtils]: 98: Hoare triple {40499#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {40500#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:53,630 INFO L273 TraceCheckUtils]: 99: Hoare triple {40500#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40500#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:53,631 INFO L273 TraceCheckUtils]: 100: Hoare triple {40500#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40500#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:53,631 INFO L273 TraceCheckUtils]: 101: Hoare triple {40500#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {40501#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:53,632 INFO L273 TraceCheckUtils]: 102: Hoare triple {40501#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40501#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:53,632 INFO L273 TraceCheckUtils]: 103: Hoare triple {40501#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40501#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:53,633 INFO L273 TraceCheckUtils]: 104: Hoare triple {40501#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {40502#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:53,634 INFO L273 TraceCheckUtils]: 105: Hoare triple {40502#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40502#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:53,634 INFO L273 TraceCheckUtils]: 106: Hoare triple {40502#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40502#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:53,635 INFO L273 TraceCheckUtils]: 107: Hoare triple {40502#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {40503#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:53,635 INFO L273 TraceCheckUtils]: 108: Hoare triple {40503#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40503#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:53,636 INFO L273 TraceCheckUtils]: 109: Hoare triple {40503#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40503#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:53,637 INFO L273 TraceCheckUtils]: 110: Hoare triple {40503#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {40504#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:53,637 INFO L273 TraceCheckUtils]: 111: Hoare triple {40504#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40504#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:53,638 INFO L273 TraceCheckUtils]: 112: Hoare triple {40504#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40504#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:53,638 INFO L273 TraceCheckUtils]: 113: Hoare triple {40504#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {40505#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:53,639 INFO L273 TraceCheckUtils]: 114: Hoare triple {40505#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40505#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:53,639 INFO L273 TraceCheckUtils]: 115: Hoare triple {40505#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40505#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:53,640 INFO L273 TraceCheckUtils]: 116: Hoare triple {40505#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {40506#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:53,641 INFO L273 TraceCheckUtils]: 117: Hoare triple {40506#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40506#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:53,641 INFO L273 TraceCheckUtils]: 118: Hoare triple {40506#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40506#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:53,642 INFO L273 TraceCheckUtils]: 119: Hoare triple {40506#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {40507#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:53,642 INFO L273 TraceCheckUtils]: 120: Hoare triple {40507#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40507#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:53,643 INFO L273 TraceCheckUtils]: 121: Hoare triple {40507#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40507#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:53,643 INFO L273 TraceCheckUtils]: 122: Hoare triple {40507#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {40508#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:53,644 INFO L273 TraceCheckUtils]: 123: Hoare triple {40508#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40508#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:53,644 INFO L273 TraceCheckUtils]: 124: Hoare triple {40508#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40508#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:53,645 INFO L273 TraceCheckUtils]: 125: Hoare triple {40508#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {40509#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:53,646 INFO L273 TraceCheckUtils]: 126: Hoare triple {40509#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40509#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:53,646 INFO L273 TraceCheckUtils]: 127: Hoare triple {40509#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40509#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:53,647 INFO L273 TraceCheckUtils]: 128: Hoare triple {40509#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {40510#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:53,647 INFO L273 TraceCheckUtils]: 129: Hoare triple {40510#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40510#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:53,648 INFO L273 TraceCheckUtils]: 130: Hoare triple {40510#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40510#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:53,648 INFO L273 TraceCheckUtils]: 131: Hoare triple {40510#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {40511#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:53,649 INFO L273 TraceCheckUtils]: 132: Hoare triple {40511#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40511#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:53,649 INFO L273 TraceCheckUtils]: 133: Hoare triple {40511#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40511#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:53,650 INFO L273 TraceCheckUtils]: 134: Hoare triple {40511#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {40512#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:53,651 INFO L273 TraceCheckUtils]: 135: Hoare triple {40512#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40512#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:53,651 INFO L273 TraceCheckUtils]: 136: Hoare triple {40512#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40512#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:53,652 INFO L273 TraceCheckUtils]: 137: Hoare triple {40512#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {40513#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:53,652 INFO L273 TraceCheckUtils]: 138: Hoare triple {40513#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40513#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:53,653 INFO L273 TraceCheckUtils]: 139: Hoare triple {40513#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40513#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:53,654 INFO L273 TraceCheckUtils]: 140: Hoare triple {40513#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {40514#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:53,654 INFO L273 TraceCheckUtils]: 141: Hoare triple {40514#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40514#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:53,655 INFO L273 TraceCheckUtils]: 142: Hoare triple {40514#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40514#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:53,655 INFO L273 TraceCheckUtils]: 143: Hoare triple {40514#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {40515#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:53,656 INFO L273 TraceCheckUtils]: 144: Hoare triple {40515#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40515#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:53,656 INFO L273 TraceCheckUtils]: 145: Hoare triple {40515#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40515#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:53,657 INFO L273 TraceCheckUtils]: 146: Hoare triple {40515#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {40516#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:53,657 INFO L273 TraceCheckUtils]: 147: Hoare triple {40516#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40516#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:53,658 INFO L273 TraceCheckUtils]: 148: Hoare triple {40516#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40516#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:53,659 INFO L273 TraceCheckUtils]: 149: Hoare triple {40516#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {40517#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:53,659 INFO L273 TraceCheckUtils]: 150: Hoare triple {40517#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40517#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:53,660 INFO L273 TraceCheckUtils]: 151: Hoare triple {40517#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40517#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:53,660 INFO L273 TraceCheckUtils]: 152: Hoare triple {40517#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {40518#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:53,661 INFO L273 TraceCheckUtils]: 153: Hoare triple {40518#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40518#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:53,661 INFO L273 TraceCheckUtils]: 154: Hoare triple {40518#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40518#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:53,662 INFO L273 TraceCheckUtils]: 155: Hoare triple {40518#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {40519#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:53,663 INFO L273 TraceCheckUtils]: 156: Hoare triple {40519#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40519#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:53,663 INFO L273 TraceCheckUtils]: 157: Hoare triple {40519#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40519#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:53,664 INFO L273 TraceCheckUtils]: 158: Hoare triple {40519#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {40520#(<= main_~i~0 51)} is VALID [2018-11-23 12:06:53,664 INFO L273 TraceCheckUtils]: 159: Hoare triple {40520#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40520#(<= main_~i~0 51)} is VALID [2018-11-23 12:06:53,665 INFO L273 TraceCheckUtils]: 160: Hoare triple {40520#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40520#(<= main_~i~0 51)} is VALID [2018-11-23 12:06:53,666 INFO L273 TraceCheckUtils]: 161: Hoare triple {40520#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {40521#(<= main_~i~0 52)} is VALID [2018-11-23 12:06:53,666 INFO L273 TraceCheckUtils]: 162: Hoare triple {40521#(<= main_~i~0 52)} assume !(~i~0 < 100000); {40468#false} is VALID [2018-11-23 12:06:53,666 INFO L273 TraceCheckUtils]: 163: Hoare triple {40468#false} havoc ~x~0;~x~0 := 0; {40468#false} is VALID [2018-11-23 12:06:53,667 INFO L273 TraceCheckUtils]: 164: Hoare triple {40468#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {40468#false} is VALID [2018-11-23 12:06:53,667 INFO L256 TraceCheckUtils]: 165: Hoare triple {40468#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {40468#false} is VALID [2018-11-23 12:06:53,667 INFO L273 TraceCheckUtils]: 166: Hoare triple {40468#false} ~cond := #in~cond; {40468#false} is VALID [2018-11-23 12:06:53,667 INFO L273 TraceCheckUtils]: 167: Hoare triple {40468#false} assume 0 == ~cond; {40468#false} is VALID [2018-11-23 12:06:53,667 INFO L273 TraceCheckUtils]: 168: Hoare triple {40468#false} assume !false; {40468#false} is VALID [2018-11-23 12:06:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:53,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:53,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:53,695 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:53,774 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:53,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:53,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:54,409 INFO L256 TraceCheckUtils]: 0: Hoare triple {40467#true} call ULTIMATE.init(); {40467#true} is VALID [2018-11-23 12:06:54,409 INFO L273 TraceCheckUtils]: 1: Hoare triple {40467#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40467#true} is VALID [2018-11-23 12:06:54,409 INFO L273 TraceCheckUtils]: 2: Hoare triple {40467#true} assume true; {40467#true} is VALID [2018-11-23 12:06:54,410 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40467#true} {40467#true} #55#return; {40467#true} is VALID [2018-11-23 12:06:54,410 INFO L256 TraceCheckUtils]: 4: Hoare triple {40467#true} call #t~ret4 := main(); {40467#true} is VALID [2018-11-23 12:06:54,410 INFO L273 TraceCheckUtils]: 5: Hoare triple {40467#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {40540#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:54,411 INFO L273 TraceCheckUtils]: 6: Hoare triple {40540#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40540#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:54,411 INFO L273 TraceCheckUtils]: 7: Hoare triple {40540#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40540#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:54,412 INFO L273 TraceCheckUtils]: 8: Hoare triple {40540#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {40470#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:54,412 INFO L273 TraceCheckUtils]: 9: Hoare triple {40470#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40470#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:54,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {40470#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40470#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:54,413 INFO L273 TraceCheckUtils]: 11: Hoare triple {40470#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {40471#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:54,413 INFO L273 TraceCheckUtils]: 12: Hoare triple {40471#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40471#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:54,413 INFO L273 TraceCheckUtils]: 13: Hoare triple {40471#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40471#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:54,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {40471#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {40472#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:54,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {40472#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40472#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:54,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {40472#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40472#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:54,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {40472#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {40473#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:54,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {40473#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40473#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:54,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {40473#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40473#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:54,417 INFO L273 TraceCheckUtils]: 20: Hoare triple {40473#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {40474#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:54,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {40474#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40474#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:54,418 INFO L273 TraceCheckUtils]: 22: Hoare triple {40474#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40474#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:54,419 INFO L273 TraceCheckUtils]: 23: Hoare triple {40474#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {40475#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:54,419 INFO L273 TraceCheckUtils]: 24: Hoare triple {40475#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40475#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:54,420 INFO L273 TraceCheckUtils]: 25: Hoare triple {40475#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40475#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:54,420 INFO L273 TraceCheckUtils]: 26: Hoare triple {40475#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {40476#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:54,421 INFO L273 TraceCheckUtils]: 27: Hoare triple {40476#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40476#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:54,421 INFO L273 TraceCheckUtils]: 28: Hoare triple {40476#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40476#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:54,422 INFO L273 TraceCheckUtils]: 29: Hoare triple {40476#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {40477#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:54,423 INFO L273 TraceCheckUtils]: 30: Hoare triple {40477#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40477#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:54,423 INFO L273 TraceCheckUtils]: 31: Hoare triple {40477#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40477#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:54,424 INFO L273 TraceCheckUtils]: 32: Hoare triple {40477#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {40478#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:54,424 INFO L273 TraceCheckUtils]: 33: Hoare triple {40478#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40478#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:54,425 INFO L273 TraceCheckUtils]: 34: Hoare triple {40478#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40478#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:54,425 INFO L273 TraceCheckUtils]: 35: Hoare triple {40478#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {40479#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:54,426 INFO L273 TraceCheckUtils]: 36: Hoare triple {40479#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40479#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:54,426 INFO L273 TraceCheckUtils]: 37: Hoare triple {40479#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40479#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:54,427 INFO L273 TraceCheckUtils]: 38: Hoare triple {40479#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {40480#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:54,428 INFO L273 TraceCheckUtils]: 39: Hoare triple {40480#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40480#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:54,428 INFO L273 TraceCheckUtils]: 40: Hoare triple {40480#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40480#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:54,429 INFO L273 TraceCheckUtils]: 41: Hoare triple {40480#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {40481#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:54,429 INFO L273 TraceCheckUtils]: 42: Hoare triple {40481#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40481#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:54,430 INFO L273 TraceCheckUtils]: 43: Hoare triple {40481#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40481#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:54,430 INFO L273 TraceCheckUtils]: 44: Hoare triple {40481#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {40482#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:54,431 INFO L273 TraceCheckUtils]: 45: Hoare triple {40482#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40482#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:54,431 INFO L273 TraceCheckUtils]: 46: Hoare triple {40482#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40482#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:54,432 INFO L273 TraceCheckUtils]: 47: Hoare triple {40482#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {40483#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:54,433 INFO L273 TraceCheckUtils]: 48: Hoare triple {40483#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40483#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:54,433 INFO L273 TraceCheckUtils]: 49: Hoare triple {40483#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40483#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:54,434 INFO L273 TraceCheckUtils]: 50: Hoare triple {40483#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {40484#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:54,434 INFO L273 TraceCheckUtils]: 51: Hoare triple {40484#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40484#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:54,435 INFO L273 TraceCheckUtils]: 52: Hoare triple {40484#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40484#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:54,436 INFO L273 TraceCheckUtils]: 53: Hoare triple {40484#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {40485#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:54,436 INFO L273 TraceCheckUtils]: 54: Hoare triple {40485#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40485#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:54,437 INFO L273 TraceCheckUtils]: 55: Hoare triple {40485#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40485#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:54,437 INFO L273 TraceCheckUtils]: 56: Hoare triple {40485#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {40486#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:54,438 INFO L273 TraceCheckUtils]: 57: Hoare triple {40486#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40486#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:54,438 INFO L273 TraceCheckUtils]: 58: Hoare triple {40486#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40486#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:54,439 INFO L273 TraceCheckUtils]: 59: Hoare triple {40486#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {40487#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:54,439 INFO L273 TraceCheckUtils]: 60: Hoare triple {40487#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40487#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:54,440 INFO L273 TraceCheckUtils]: 61: Hoare triple {40487#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40487#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:54,441 INFO L273 TraceCheckUtils]: 62: Hoare triple {40487#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {40488#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:54,441 INFO L273 TraceCheckUtils]: 63: Hoare triple {40488#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40488#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:54,442 INFO L273 TraceCheckUtils]: 64: Hoare triple {40488#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40488#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:54,442 INFO L273 TraceCheckUtils]: 65: Hoare triple {40488#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {40489#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:54,443 INFO L273 TraceCheckUtils]: 66: Hoare triple {40489#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40489#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:54,443 INFO L273 TraceCheckUtils]: 67: Hoare triple {40489#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40489#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:54,444 INFO L273 TraceCheckUtils]: 68: Hoare triple {40489#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {40490#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:54,445 INFO L273 TraceCheckUtils]: 69: Hoare triple {40490#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40490#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:54,445 INFO L273 TraceCheckUtils]: 70: Hoare triple {40490#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40490#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:54,446 INFO L273 TraceCheckUtils]: 71: Hoare triple {40490#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {40491#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:54,446 INFO L273 TraceCheckUtils]: 72: Hoare triple {40491#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40491#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:54,447 INFO L273 TraceCheckUtils]: 73: Hoare triple {40491#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40491#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:54,448 INFO L273 TraceCheckUtils]: 74: Hoare triple {40491#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {40492#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:54,448 INFO L273 TraceCheckUtils]: 75: Hoare triple {40492#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40492#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:54,449 INFO L273 TraceCheckUtils]: 76: Hoare triple {40492#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40492#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:54,449 INFO L273 TraceCheckUtils]: 77: Hoare triple {40492#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {40493#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:54,450 INFO L273 TraceCheckUtils]: 78: Hoare triple {40493#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40493#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:54,450 INFO L273 TraceCheckUtils]: 79: Hoare triple {40493#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40493#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:54,451 INFO L273 TraceCheckUtils]: 80: Hoare triple {40493#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {40494#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:54,451 INFO L273 TraceCheckUtils]: 81: Hoare triple {40494#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40494#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:54,452 INFO L273 TraceCheckUtils]: 82: Hoare triple {40494#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40494#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:54,453 INFO L273 TraceCheckUtils]: 83: Hoare triple {40494#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {40495#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:54,453 INFO L273 TraceCheckUtils]: 84: Hoare triple {40495#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40495#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:54,454 INFO L273 TraceCheckUtils]: 85: Hoare triple {40495#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40495#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:54,454 INFO L273 TraceCheckUtils]: 86: Hoare triple {40495#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {40496#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:54,455 INFO L273 TraceCheckUtils]: 87: Hoare triple {40496#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40496#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:54,455 INFO L273 TraceCheckUtils]: 88: Hoare triple {40496#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40496#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:54,456 INFO L273 TraceCheckUtils]: 89: Hoare triple {40496#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {40497#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:54,457 INFO L273 TraceCheckUtils]: 90: Hoare triple {40497#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40497#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:54,457 INFO L273 TraceCheckUtils]: 91: Hoare triple {40497#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40497#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:54,458 INFO L273 TraceCheckUtils]: 92: Hoare triple {40497#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {40498#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:54,458 INFO L273 TraceCheckUtils]: 93: Hoare triple {40498#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40498#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:54,459 INFO L273 TraceCheckUtils]: 94: Hoare triple {40498#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40498#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:54,459 INFO L273 TraceCheckUtils]: 95: Hoare triple {40498#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {40499#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:54,460 INFO L273 TraceCheckUtils]: 96: Hoare triple {40499#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40499#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:54,460 INFO L273 TraceCheckUtils]: 97: Hoare triple {40499#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40499#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:54,461 INFO L273 TraceCheckUtils]: 98: Hoare triple {40499#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {40500#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:54,462 INFO L273 TraceCheckUtils]: 99: Hoare triple {40500#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40500#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:54,462 INFO L273 TraceCheckUtils]: 100: Hoare triple {40500#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40500#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:54,463 INFO L273 TraceCheckUtils]: 101: Hoare triple {40500#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {40501#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:54,463 INFO L273 TraceCheckUtils]: 102: Hoare triple {40501#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40501#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:54,464 INFO L273 TraceCheckUtils]: 103: Hoare triple {40501#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40501#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:54,465 INFO L273 TraceCheckUtils]: 104: Hoare triple {40501#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {40502#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:54,465 INFO L273 TraceCheckUtils]: 105: Hoare triple {40502#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40502#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:54,466 INFO L273 TraceCheckUtils]: 106: Hoare triple {40502#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40502#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:54,466 INFO L273 TraceCheckUtils]: 107: Hoare triple {40502#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {40503#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:54,467 INFO L273 TraceCheckUtils]: 108: Hoare triple {40503#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40503#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:54,467 INFO L273 TraceCheckUtils]: 109: Hoare triple {40503#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40503#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:54,468 INFO L273 TraceCheckUtils]: 110: Hoare triple {40503#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {40504#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:54,469 INFO L273 TraceCheckUtils]: 111: Hoare triple {40504#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40504#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:54,469 INFO L273 TraceCheckUtils]: 112: Hoare triple {40504#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40504#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:54,470 INFO L273 TraceCheckUtils]: 113: Hoare triple {40504#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {40505#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:54,470 INFO L273 TraceCheckUtils]: 114: Hoare triple {40505#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40505#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:54,471 INFO L273 TraceCheckUtils]: 115: Hoare triple {40505#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40505#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:54,471 INFO L273 TraceCheckUtils]: 116: Hoare triple {40505#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {40506#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:54,472 INFO L273 TraceCheckUtils]: 117: Hoare triple {40506#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40506#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:54,472 INFO L273 TraceCheckUtils]: 118: Hoare triple {40506#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40506#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:54,473 INFO L273 TraceCheckUtils]: 119: Hoare triple {40506#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {40507#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:54,474 INFO L273 TraceCheckUtils]: 120: Hoare triple {40507#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40507#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:54,474 INFO L273 TraceCheckUtils]: 121: Hoare triple {40507#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40507#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:54,475 INFO L273 TraceCheckUtils]: 122: Hoare triple {40507#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {40508#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:54,475 INFO L273 TraceCheckUtils]: 123: Hoare triple {40508#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40508#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:54,476 INFO L273 TraceCheckUtils]: 124: Hoare triple {40508#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40508#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:54,477 INFO L273 TraceCheckUtils]: 125: Hoare triple {40508#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {40509#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:54,477 INFO L273 TraceCheckUtils]: 126: Hoare triple {40509#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40509#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:54,478 INFO L273 TraceCheckUtils]: 127: Hoare triple {40509#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40509#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:54,478 INFO L273 TraceCheckUtils]: 128: Hoare triple {40509#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {40510#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:54,479 INFO L273 TraceCheckUtils]: 129: Hoare triple {40510#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40510#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:54,479 INFO L273 TraceCheckUtils]: 130: Hoare triple {40510#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40510#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:54,480 INFO L273 TraceCheckUtils]: 131: Hoare triple {40510#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {40511#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:54,480 INFO L273 TraceCheckUtils]: 132: Hoare triple {40511#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40511#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:54,481 INFO L273 TraceCheckUtils]: 133: Hoare triple {40511#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40511#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:54,482 INFO L273 TraceCheckUtils]: 134: Hoare triple {40511#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {40512#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:54,482 INFO L273 TraceCheckUtils]: 135: Hoare triple {40512#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40512#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:54,483 INFO L273 TraceCheckUtils]: 136: Hoare triple {40512#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40512#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:54,483 INFO L273 TraceCheckUtils]: 137: Hoare triple {40512#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {40513#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:54,484 INFO L273 TraceCheckUtils]: 138: Hoare triple {40513#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40513#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:54,484 INFO L273 TraceCheckUtils]: 139: Hoare triple {40513#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40513#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:54,485 INFO L273 TraceCheckUtils]: 140: Hoare triple {40513#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {40514#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:54,486 INFO L273 TraceCheckUtils]: 141: Hoare triple {40514#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40514#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:54,486 INFO L273 TraceCheckUtils]: 142: Hoare triple {40514#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40514#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:54,487 INFO L273 TraceCheckUtils]: 143: Hoare triple {40514#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {40515#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:54,487 INFO L273 TraceCheckUtils]: 144: Hoare triple {40515#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40515#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:54,488 INFO L273 TraceCheckUtils]: 145: Hoare triple {40515#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40515#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:54,488 INFO L273 TraceCheckUtils]: 146: Hoare triple {40515#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {40516#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:54,489 INFO L273 TraceCheckUtils]: 147: Hoare triple {40516#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40516#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:54,489 INFO L273 TraceCheckUtils]: 148: Hoare triple {40516#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40516#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:54,490 INFO L273 TraceCheckUtils]: 149: Hoare triple {40516#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {40517#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:54,491 INFO L273 TraceCheckUtils]: 150: Hoare triple {40517#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40517#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:54,491 INFO L273 TraceCheckUtils]: 151: Hoare triple {40517#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40517#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:54,492 INFO L273 TraceCheckUtils]: 152: Hoare triple {40517#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {40518#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:54,492 INFO L273 TraceCheckUtils]: 153: Hoare triple {40518#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40518#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:54,493 INFO L273 TraceCheckUtils]: 154: Hoare triple {40518#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40518#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:54,494 INFO L273 TraceCheckUtils]: 155: Hoare triple {40518#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {40519#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:54,494 INFO L273 TraceCheckUtils]: 156: Hoare triple {40519#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40519#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:54,495 INFO L273 TraceCheckUtils]: 157: Hoare triple {40519#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40519#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:54,495 INFO L273 TraceCheckUtils]: 158: Hoare triple {40519#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {40520#(<= main_~i~0 51)} is VALID [2018-11-23 12:06:54,496 INFO L273 TraceCheckUtils]: 159: Hoare triple {40520#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40520#(<= main_~i~0 51)} is VALID [2018-11-23 12:06:54,496 INFO L273 TraceCheckUtils]: 160: Hoare triple {40520#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {40520#(<= main_~i~0 51)} is VALID [2018-11-23 12:06:54,497 INFO L273 TraceCheckUtils]: 161: Hoare triple {40520#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {40521#(<= main_~i~0 52)} is VALID [2018-11-23 12:06:54,498 INFO L273 TraceCheckUtils]: 162: Hoare triple {40521#(<= main_~i~0 52)} assume !(~i~0 < 100000); {40468#false} is VALID [2018-11-23 12:06:54,498 INFO L273 TraceCheckUtils]: 163: Hoare triple {40468#false} havoc ~x~0;~x~0 := 0; {40468#false} is VALID [2018-11-23 12:06:54,498 INFO L273 TraceCheckUtils]: 164: Hoare triple {40468#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {40468#false} is VALID [2018-11-23 12:06:54,498 INFO L256 TraceCheckUtils]: 165: Hoare triple {40468#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {40468#false} is VALID [2018-11-23 12:06:54,498 INFO L273 TraceCheckUtils]: 166: Hoare triple {40468#false} ~cond := #in~cond; {40468#false} is VALID [2018-11-23 12:06:54,499 INFO L273 TraceCheckUtils]: 167: Hoare triple {40468#false} assume 0 == ~cond; {40468#false} is VALID [2018-11-23 12:06:54,499 INFO L273 TraceCheckUtils]: 168: Hoare triple {40468#false} assume !false; {40468#false} is VALID [2018-11-23 12:06:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:54,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:54,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2018-11-23 12:06:54,537 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 169 [2018-11-23 12:06:54,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:54,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states. [2018-11-23 12:06:54,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:54,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-23 12:06:54,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-23 12:06:54,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 12:06:54,706 INFO L87 Difference]: Start difference. First operand 174 states and 227 transitions. Second operand 56 states. [2018-11-23 12:06:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:55,856 INFO L93 Difference]: Finished difference Result 190 states and 246 transitions. [2018-11-23 12:06:55,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 12:06:55,856 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 169 [2018-11-23 12:06:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:06:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 246 transitions. [2018-11-23 12:06:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:06:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 246 transitions. [2018-11-23 12:06:55,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 246 transitions. [2018-11-23 12:06:56,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:56,091 INFO L225 Difference]: With dead ends: 190 [2018-11-23 12:06:56,091 INFO L226 Difference]: Without dead ends: 179 [2018-11-23 12:06:56,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 12:06:56,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-23 12:06:56,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-11-23 12:06:56,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:56,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 177 states. [2018-11-23 12:06:56,149 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 177 states. [2018-11-23 12:06:56,149 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 177 states. [2018-11-23 12:06:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:56,152 INFO L93 Difference]: Finished difference Result 179 states and 234 transitions. [2018-11-23 12:06:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2018-11-23 12:06:56,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:56,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:56,153 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 179 states. [2018-11-23 12:06:56,153 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 179 states. [2018-11-23 12:06:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:56,155 INFO L93 Difference]: Finished difference Result 179 states and 234 transitions. [2018-11-23 12:06:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2018-11-23 12:06:56,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:56,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:56,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:56,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-23 12:06:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 231 transitions. [2018-11-23 12:06:56,158 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 231 transitions. Word has length 169 [2018-11-23 12:06:56,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:56,158 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 231 transitions. [2018-11-23 12:06:56,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-23 12:06:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 231 transitions. [2018-11-23 12:06:56,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 12:06:56,159 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:56,159 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:56,159 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:56,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:56,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1177423005, now seen corresponding path program 53 times [2018-11-23 12:06:56,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:56,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:56,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:56,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:56,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:57,622 INFO L256 TraceCheckUtils]: 0: Hoare triple {41879#true} call ULTIMATE.init(); {41879#true} is VALID [2018-11-23 12:06:57,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {41879#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41879#true} is VALID [2018-11-23 12:06:57,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {41879#true} assume true; {41879#true} is VALID [2018-11-23 12:06:57,622 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41879#true} {41879#true} #55#return; {41879#true} is VALID [2018-11-23 12:06:57,622 INFO L256 TraceCheckUtils]: 4: Hoare triple {41879#true} call #t~ret4 := main(); {41879#true} is VALID [2018-11-23 12:06:57,623 INFO L273 TraceCheckUtils]: 5: Hoare triple {41879#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {41881#(= main_~i~0 0)} is VALID [2018-11-23 12:06:57,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {41881#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41881#(= main_~i~0 0)} is VALID [2018-11-23 12:06:57,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {41881#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41881#(= main_~i~0 0)} is VALID [2018-11-23 12:06:57,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {41881#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {41882#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:57,624 INFO L273 TraceCheckUtils]: 9: Hoare triple {41882#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41882#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:57,624 INFO L273 TraceCheckUtils]: 10: Hoare triple {41882#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41882#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:57,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {41882#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {41883#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:57,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {41883#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41883#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:57,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {41883#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41883#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:57,627 INFO L273 TraceCheckUtils]: 14: Hoare triple {41883#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {41884#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:57,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {41884#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41884#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:57,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {41884#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41884#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:57,629 INFO L273 TraceCheckUtils]: 17: Hoare triple {41884#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {41885#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:57,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {41885#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41885#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:57,630 INFO L273 TraceCheckUtils]: 19: Hoare triple {41885#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41885#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:57,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {41885#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {41886#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:57,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {41886#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41886#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:57,631 INFO L273 TraceCheckUtils]: 22: Hoare triple {41886#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41886#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:57,632 INFO L273 TraceCheckUtils]: 23: Hoare triple {41886#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {41887#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:57,633 INFO L273 TraceCheckUtils]: 24: Hoare triple {41887#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41887#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:57,633 INFO L273 TraceCheckUtils]: 25: Hoare triple {41887#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41887#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:57,634 INFO L273 TraceCheckUtils]: 26: Hoare triple {41887#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {41888#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:57,634 INFO L273 TraceCheckUtils]: 27: Hoare triple {41888#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41888#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:57,635 INFO L273 TraceCheckUtils]: 28: Hoare triple {41888#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41888#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:57,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {41888#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {41889#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:57,636 INFO L273 TraceCheckUtils]: 30: Hoare triple {41889#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41889#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:57,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {41889#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41889#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:57,637 INFO L273 TraceCheckUtils]: 32: Hoare triple {41889#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {41890#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:57,638 INFO L273 TraceCheckUtils]: 33: Hoare triple {41890#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41890#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:57,638 INFO L273 TraceCheckUtils]: 34: Hoare triple {41890#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41890#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:57,639 INFO L273 TraceCheckUtils]: 35: Hoare triple {41890#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {41891#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:57,639 INFO L273 TraceCheckUtils]: 36: Hoare triple {41891#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41891#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:57,640 INFO L273 TraceCheckUtils]: 37: Hoare triple {41891#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41891#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:57,641 INFO L273 TraceCheckUtils]: 38: Hoare triple {41891#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {41892#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:57,641 INFO L273 TraceCheckUtils]: 39: Hoare triple {41892#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41892#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:57,642 INFO L273 TraceCheckUtils]: 40: Hoare triple {41892#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41892#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:57,642 INFO L273 TraceCheckUtils]: 41: Hoare triple {41892#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {41893#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:57,643 INFO L273 TraceCheckUtils]: 42: Hoare triple {41893#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41893#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:57,643 INFO L273 TraceCheckUtils]: 43: Hoare triple {41893#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41893#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:57,644 INFO L273 TraceCheckUtils]: 44: Hoare triple {41893#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {41894#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:57,644 INFO L273 TraceCheckUtils]: 45: Hoare triple {41894#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41894#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:57,645 INFO L273 TraceCheckUtils]: 46: Hoare triple {41894#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41894#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:57,646 INFO L273 TraceCheckUtils]: 47: Hoare triple {41894#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {41895#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:57,646 INFO L273 TraceCheckUtils]: 48: Hoare triple {41895#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41895#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:57,647 INFO L273 TraceCheckUtils]: 49: Hoare triple {41895#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41895#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:57,647 INFO L273 TraceCheckUtils]: 50: Hoare triple {41895#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {41896#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:57,648 INFO L273 TraceCheckUtils]: 51: Hoare triple {41896#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41896#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:57,648 INFO L273 TraceCheckUtils]: 52: Hoare triple {41896#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41896#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:57,649 INFO L273 TraceCheckUtils]: 53: Hoare triple {41896#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {41897#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:57,650 INFO L273 TraceCheckUtils]: 54: Hoare triple {41897#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41897#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:57,650 INFO L273 TraceCheckUtils]: 55: Hoare triple {41897#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41897#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:57,651 INFO L273 TraceCheckUtils]: 56: Hoare triple {41897#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {41898#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:57,651 INFO L273 TraceCheckUtils]: 57: Hoare triple {41898#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41898#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:57,652 INFO L273 TraceCheckUtils]: 58: Hoare triple {41898#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41898#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:57,652 INFO L273 TraceCheckUtils]: 59: Hoare triple {41898#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {41899#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:57,653 INFO L273 TraceCheckUtils]: 60: Hoare triple {41899#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41899#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:57,653 INFO L273 TraceCheckUtils]: 61: Hoare triple {41899#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41899#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:57,654 INFO L273 TraceCheckUtils]: 62: Hoare triple {41899#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {41900#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:57,655 INFO L273 TraceCheckUtils]: 63: Hoare triple {41900#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41900#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:57,655 INFO L273 TraceCheckUtils]: 64: Hoare triple {41900#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41900#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:57,656 INFO L273 TraceCheckUtils]: 65: Hoare triple {41900#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {41901#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:57,656 INFO L273 TraceCheckUtils]: 66: Hoare triple {41901#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41901#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:57,657 INFO L273 TraceCheckUtils]: 67: Hoare triple {41901#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41901#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:57,658 INFO L273 TraceCheckUtils]: 68: Hoare triple {41901#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {41902#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:57,658 INFO L273 TraceCheckUtils]: 69: Hoare triple {41902#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41902#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:57,659 INFO L273 TraceCheckUtils]: 70: Hoare triple {41902#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41902#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:57,659 INFO L273 TraceCheckUtils]: 71: Hoare triple {41902#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {41903#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:57,660 INFO L273 TraceCheckUtils]: 72: Hoare triple {41903#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41903#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:57,660 INFO L273 TraceCheckUtils]: 73: Hoare triple {41903#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41903#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:57,661 INFO L273 TraceCheckUtils]: 74: Hoare triple {41903#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {41904#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:57,662 INFO L273 TraceCheckUtils]: 75: Hoare triple {41904#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41904#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:57,662 INFO L273 TraceCheckUtils]: 76: Hoare triple {41904#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41904#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:57,663 INFO L273 TraceCheckUtils]: 77: Hoare triple {41904#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {41905#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:57,663 INFO L273 TraceCheckUtils]: 78: Hoare triple {41905#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41905#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:57,664 INFO L273 TraceCheckUtils]: 79: Hoare triple {41905#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41905#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:57,664 INFO L273 TraceCheckUtils]: 80: Hoare triple {41905#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {41906#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:57,665 INFO L273 TraceCheckUtils]: 81: Hoare triple {41906#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41906#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:57,665 INFO L273 TraceCheckUtils]: 82: Hoare triple {41906#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41906#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:57,666 INFO L273 TraceCheckUtils]: 83: Hoare triple {41906#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {41907#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:57,667 INFO L273 TraceCheckUtils]: 84: Hoare triple {41907#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41907#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:57,667 INFO L273 TraceCheckUtils]: 85: Hoare triple {41907#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41907#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:57,668 INFO L273 TraceCheckUtils]: 86: Hoare triple {41907#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {41908#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:57,668 INFO L273 TraceCheckUtils]: 87: Hoare triple {41908#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41908#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:57,669 INFO L273 TraceCheckUtils]: 88: Hoare triple {41908#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41908#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:57,670 INFO L273 TraceCheckUtils]: 89: Hoare triple {41908#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {41909#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:57,670 INFO L273 TraceCheckUtils]: 90: Hoare triple {41909#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41909#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:57,671 INFO L273 TraceCheckUtils]: 91: Hoare triple {41909#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41909#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:57,671 INFO L273 TraceCheckUtils]: 92: Hoare triple {41909#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {41910#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:57,672 INFO L273 TraceCheckUtils]: 93: Hoare triple {41910#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41910#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:57,672 INFO L273 TraceCheckUtils]: 94: Hoare triple {41910#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41910#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:57,673 INFO L273 TraceCheckUtils]: 95: Hoare triple {41910#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {41911#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:57,673 INFO L273 TraceCheckUtils]: 96: Hoare triple {41911#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41911#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:57,674 INFO L273 TraceCheckUtils]: 97: Hoare triple {41911#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41911#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:57,675 INFO L273 TraceCheckUtils]: 98: Hoare triple {41911#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {41912#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:57,675 INFO L273 TraceCheckUtils]: 99: Hoare triple {41912#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41912#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:57,676 INFO L273 TraceCheckUtils]: 100: Hoare triple {41912#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41912#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:57,676 INFO L273 TraceCheckUtils]: 101: Hoare triple {41912#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {41913#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:57,677 INFO L273 TraceCheckUtils]: 102: Hoare triple {41913#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41913#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:57,677 INFO L273 TraceCheckUtils]: 103: Hoare triple {41913#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41913#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:57,678 INFO L273 TraceCheckUtils]: 104: Hoare triple {41913#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {41914#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:57,679 INFO L273 TraceCheckUtils]: 105: Hoare triple {41914#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41914#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:57,679 INFO L273 TraceCheckUtils]: 106: Hoare triple {41914#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41914#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:57,680 INFO L273 TraceCheckUtils]: 107: Hoare triple {41914#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {41915#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:57,680 INFO L273 TraceCheckUtils]: 108: Hoare triple {41915#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41915#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:57,681 INFO L273 TraceCheckUtils]: 109: Hoare triple {41915#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41915#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:57,681 INFO L273 TraceCheckUtils]: 110: Hoare triple {41915#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {41916#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:57,682 INFO L273 TraceCheckUtils]: 111: Hoare triple {41916#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41916#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:57,682 INFO L273 TraceCheckUtils]: 112: Hoare triple {41916#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41916#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:57,683 INFO L273 TraceCheckUtils]: 113: Hoare triple {41916#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {41917#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:57,684 INFO L273 TraceCheckUtils]: 114: Hoare triple {41917#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41917#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:57,684 INFO L273 TraceCheckUtils]: 115: Hoare triple {41917#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41917#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:57,685 INFO L273 TraceCheckUtils]: 116: Hoare triple {41917#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {41918#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:57,685 INFO L273 TraceCheckUtils]: 117: Hoare triple {41918#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41918#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:57,686 INFO L273 TraceCheckUtils]: 118: Hoare triple {41918#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41918#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:57,687 INFO L273 TraceCheckUtils]: 119: Hoare triple {41918#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {41919#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:57,687 INFO L273 TraceCheckUtils]: 120: Hoare triple {41919#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41919#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:57,688 INFO L273 TraceCheckUtils]: 121: Hoare triple {41919#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41919#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:57,688 INFO L273 TraceCheckUtils]: 122: Hoare triple {41919#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {41920#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:57,689 INFO L273 TraceCheckUtils]: 123: Hoare triple {41920#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41920#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:57,689 INFO L273 TraceCheckUtils]: 124: Hoare triple {41920#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41920#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:57,690 INFO L273 TraceCheckUtils]: 125: Hoare triple {41920#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {41921#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:57,690 INFO L273 TraceCheckUtils]: 126: Hoare triple {41921#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41921#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:57,691 INFO L273 TraceCheckUtils]: 127: Hoare triple {41921#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41921#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:57,692 INFO L273 TraceCheckUtils]: 128: Hoare triple {41921#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {41922#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:57,692 INFO L273 TraceCheckUtils]: 129: Hoare triple {41922#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41922#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:57,693 INFO L273 TraceCheckUtils]: 130: Hoare triple {41922#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41922#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:57,693 INFO L273 TraceCheckUtils]: 131: Hoare triple {41922#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {41923#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:57,694 INFO L273 TraceCheckUtils]: 132: Hoare triple {41923#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41923#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:57,694 INFO L273 TraceCheckUtils]: 133: Hoare triple {41923#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41923#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:57,695 INFO L273 TraceCheckUtils]: 134: Hoare triple {41923#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {41924#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:57,696 INFO L273 TraceCheckUtils]: 135: Hoare triple {41924#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41924#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:57,696 INFO L273 TraceCheckUtils]: 136: Hoare triple {41924#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41924#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:57,697 INFO L273 TraceCheckUtils]: 137: Hoare triple {41924#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {41925#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:57,697 INFO L273 TraceCheckUtils]: 138: Hoare triple {41925#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41925#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:57,698 INFO L273 TraceCheckUtils]: 139: Hoare triple {41925#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41925#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:57,698 INFO L273 TraceCheckUtils]: 140: Hoare triple {41925#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {41926#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:57,699 INFO L273 TraceCheckUtils]: 141: Hoare triple {41926#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41926#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:57,699 INFO L273 TraceCheckUtils]: 142: Hoare triple {41926#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41926#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:57,700 INFO L273 TraceCheckUtils]: 143: Hoare triple {41926#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {41927#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:57,701 INFO L273 TraceCheckUtils]: 144: Hoare triple {41927#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41927#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:57,701 INFO L273 TraceCheckUtils]: 145: Hoare triple {41927#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41927#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:57,702 INFO L273 TraceCheckUtils]: 146: Hoare triple {41927#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {41928#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:57,702 INFO L273 TraceCheckUtils]: 147: Hoare triple {41928#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41928#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:57,703 INFO L273 TraceCheckUtils]: 148: Hoare triple {41928#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41928#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:57,704 INFO L273 TraceCheckUtils]: 149: Hoare triple {41928#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {41929#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:57,704 INFO L273 TraceCheckUtils]: 150: Hoare triple {41929#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41929#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:57,705 INFO L273 TraceCheckUtils]: 151: Hoare triple {41929#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41929#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:57,705 INFO L273 TraceCheckUtils]: 152: Hoare triple {41929#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {41930#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:57,706 INFO L273 TraceCheckUtils]: 153: Hoare triple {41930#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41930#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:57,706 INFO L273 TraceCheckUtils]: 154: Hoare triple {41930#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41930#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:57,707 INFO L273 TraceCheckUtils]: 155: Hoare triple {41930#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {41931#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:57,707 INFO L273 TraceCheckUtils]: 156: Hoare triple {41931#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41931#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:57,708 INFO L273 TraceCheckUtils]: 157: Hoare triple {41931#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41931#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:57,709 INFO L273 TraceCheckUtils]: 158: Hoare triple {41931#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {41932#(<= main_~i~0 51)} is VALID [2018-11-23 12:06:57,709 INFO L273 TraceCheckUtils]: 159: Hoare triple {41932#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41932#(<= main_~i~0 51)} is VALID [2018-11-23 12:06:57,710 INFO L273 TraceCheckUtils]: 160: Hoare triple {41932#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41932#(<= main_~i~0 51)} is VALID [2018-11-23 12:06:57,710 INFO L273 TraceCheckUtils]: 161: Hoare triple {41932#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {41933#(<= main_~i~0 52)} is VALID [2018-11-23 12:06:57,711 INFO L273 TraceCheckUtils]: 162: Hoare triple {41933#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41933#(<= main_~i~0 52)} is VALID [2018-11-23 12:06:57,711 INFO L273 TraceCheckUtils]: 163: Hoare triple {41933#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41933#(<= main_~i~0 52)} is VALID [2018-11-23 12:06:57,712 INFO L273 TraceCheckUtils]: 164: Hoare triple {41933#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {41934#(<= main_~i~0 53)} is VALID [2018-11-23 12:06:57,713 INFO L273 TraceCheckUtils]: 165: Hoare triple {41934#(<= main_~i~0 53)} assume !(~i~0 < 100000); {41880#false} is VALID [2018-11-23 12:06:57,713 INFO L273 TraceCheckUtils]: 166: Hoare triple {41880#false} havoc ~x~0;~x~0 := 0; {41880#false} is VALID [2018-11-23 12:06:57,713 INFO L273 TraceCheckUtils]: 167: Hoare triple {41880#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {41880#false} is VALID [2018-11-23 12:06:57,713 INFO L256 TraceCheckUtils]: 168: Hoare triple {41880#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {41880#false} is VALID [2018-11-23 12:06:57,713 INFO L273 TraceCheckUtils]: 169: Hoare triple {41880#false} ~cond := #in~cond; {41880#false} is VALID [2018-11-23 12:06:57,714 INFO L273 TraceCheckUtils]: 170: Hoare triple {41880#false} assume 0 == ~cond; {41880#false} is VALID [2018-11-23 12:06:57,714 INFO L273 TraceCheckUtils]: 171: Hoare triple {41880#false} assume !false; {41880#false} is VALID [2018-11-23 12:06:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:57,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:57,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:57,747 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:57,876 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-11-23 12:06:57,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:57,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:58,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {41879#true} call ULTIMATE.init(); {41879#true} is VALID [2018-11-23 12:06:58,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {41879#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41879#true} is VALID [2018-11-23 12:06:58,287 INFO L273 TraceCheckUtils]: 2: Hoare triple {41879#true} assume true; {41879#true} is VALID [2018-11-23 12:06:58,287 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41879#true} {41879#true} #55#return; {41879#true} is VALID [2018-11-23 12:06:58,288 INFO L256 TraceCheckUtils]: 4: Hoare triple {41879#true} call #t~ret4 := main(); {41879#true} is VALID [2018-11-23 12:06:58,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {41879#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {41953#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:58,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {41953#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41953#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:58,289 INFO L273 TraceCheckUtils]: 7: Hoare triple {41953#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41953#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:58,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {41953#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {41882#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:58,290 INFO L273 TraceCheckUtils]: 9: Hoare triple {41882#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41882#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:58,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {41882#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41882#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:58,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {41882#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {41883#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:58,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {41883#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41883#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:58,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {41883#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41883#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:58,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {41883#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {41884#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:58,292 INFO L273 TraceCheckUtils]: 15: Hoare triple {41884#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41884#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:58,292 INFO L273 TraceCheckUtils]: 16: Hoare triple {41884#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41884#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:58,293 INFO L273 TraceCheckUtils]: 17: Hoare triple {41884#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {41885#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:58,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {41885#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41885#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:58,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {41885#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41885#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:58,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {41885#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {41886#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:58,295 INFO L273 TraceCheckUtils]: 21: Hoare triple {41886#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41886#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:58,296 INFO L273 TraceCheckUtils]: 22: Hoare triple {41886#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41886#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:58,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {41886#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {41887#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:58,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {41887#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41887#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:58,297 INFO L273 TraceCheckUtils]: 25: Hoare triple {41887#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41887#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:58,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {41887#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {41888#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:58,299 INFO L273 TraceCheckUtils]: 27: Hoare triple {41888#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41888#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:58,299 INFO L273 TraceCheckUtils]: 28: Hoare triple {41888#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41888#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:58,300 INFO L273 TraceCheckUtils]: 29: Hoare triple {41888#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {41889#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:58,300 INFO L273 TraceCheckUtils]: 30: Hoare triple {41889#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41889#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:58,301 INFO L273 TraceCheckUtils]: 31: Hoare triple {41889#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41889#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:58,302 INFO L273 TraceCheckUtils]: 32: Hoare triple {41889#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {41890#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:58,302 INFO L273 TraceCheckUtils]: 33: Hoare triple {41890#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41890#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:58,303 INFO L273 TraceCheckUtils]: 34: Hoare triple {41890#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41890#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:58,303 INFO L273 TraceCheckUtils]: 35: Hoare triple {41890#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {41891#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:58,304 INFO L273 TraceCheckUtils]: 36: Hoare triple {41891#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41891#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:58,304 INFO L273 TraceCheckUtils]: 37: Hoare triple {41891#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41891#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:58,305 INFO L273 TraceCheckUtils]: 38: Hoare triple {41891#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {41892#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:58,305 INFO L273 TraceCheckUtils]: 39: Hoare triple {41892#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41892#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:58,306 INFO L273 TraceCheckUtils]: 40: Hoare triple {41892#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41892#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:58,307 INFO L273 TraceCheckUtils]: 41: Hoare triple {41892#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {41893#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:58,307 INFO L273 TraceCheckUtils]: 42: Hoare triple {41893#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41893#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:58,308 INFO L273 TraceCheckUtils]: 43: Hoare triple {41893#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41893#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:58,308 INFO L273 TraceCheckUtils]: 44: Hoare triple {41893#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {41894#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:58,309 INFO L273 TraceCheckUtils]: 45: Hoare triple {41894#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41894#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:58,309 INFO L273 TraceCheckUtils]: 46: Hoare triple {41894#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41894#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:58,310 INFO L273 TraceCheckUtils]: 47: Hoare triple {41894#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {41895#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:58,311 INFO L273 TraceCheckUtils]: 48: Hoare triple {41895#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41895#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:58,311 INFO L273 TraceCheckUtils]: 49: Hoare triple {41895#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41895#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:58,312 INFO L273 TraceCheckUtils]: 50: Hoare triple {41895#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {41896#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:58,312 INFO L273 TraceCheckUtils]: 51: Hoare triple {41896#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41896#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:58,313 INFO L273 TraceCheckUtils]: 52: Hoare triple {41896#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41896#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:58,313 INFO L273 TraceCheckUtils]: 53: Hoare triple {41896#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {41897#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:58,314 INFO L273 TraceCheckUtils]: 54: Hoare triple {41897#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41897#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:58,314 INFO L273 TraceCheckUtils]: 55: Hoare triple {41897#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41897#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:58,315 INFO L273 TraceCheckUtils]: 56: Hoare triple {41897#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {41898#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:58,316 INFO L273 TraceCheckUtils]: 57: Hoare triple {41898#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41898#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:58,316 INFO L273 TraceCheckUtils]: 58: Hoare triple {41898#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41898#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:58,317 INFO L273 TraceCheckUtils]: 59: Hoare triple {41898#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {41899#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:58,317 INFO L273 TraceCheckUtils]: 60: Hoare triple {41899#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41899#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:58,318 INFO L273 TraceCheckUtils]: 61: Hoare triple {41899#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41899#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:58,319 INFO L273 TraceCheckUtils]: 62: Hoare triple {41899#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {41900#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:58,319 INFO L273 TraceCheckUtils]: 63: Hoare triple {41900#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41900#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:58,319 INFO L273 TraceCheckUtils]: 64: Hoare triple {41900#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41900#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:58,320 INFO L273 TraceCheckUtils]: 65: Hoare triple {41900#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {41901#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:58,321 INFO L273 TraceCheckUtils]: 66: Hoare triple {41901#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41901#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:58,321 INFO L273 TraceCheckUtils]: 67: Hoare triple {41901#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41901#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:58,322 INFO L273 TraceCheckUtils]: 68: Hoare triple {41901#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {41902#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:58,322 INFO L273 TraceCheckUtils]: 69: Hoare triple {41902#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41902#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:58,323 INFO L273 TraceCheckUtils]: 70: Hoare triple {41902#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41902#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:58,324 INFO L273 TraceCheckUtils]: 71: Hoare triple {41902#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {41903#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:58,324 INFO L273 TraceCheckUtils]: 72: Hoare triple {41903#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41903#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:58,325 INFO L273 TraceCheckUtils]: 73: Hoare triple {41903#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41903#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:58,325 INFO L273 TraceCheckUtils]: 74: Hoare triple {41903#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {41904#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:58,326 INFO L273 TraceCheckUtils]: 75: Hoare triple {41904#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41904#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:58,326 INFO L273 TraceCheckUtils]: 76: Hoare triple {41904#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41904#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:58,327 INFO L273 TraceCheckUtils]: 77: Hoare triple {41904#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {41905#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:58,327 INFO L273 TraceCheckUtils]: 78: Hoare triple {41905#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41905#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:58,328 INFO L273 TraceCheckUtils]: 79: Hoare triple {41905#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41905#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:58,329 INFO L273 TraceCheckUtils]: 80: Hoare triple {41905#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {41906#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:58,329 INFO L273 TraceCheckUtils]: 81: Hoare triple {41906#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41906#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:58,330 INFO L273 TraceCheckUtils]: 82: Hoare triple {41906#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41906#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:58,330 INFO L273 TraceCheckUtils]: 83: Hoare triple {41906#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {41907#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:58,331 INFO L273 TraceCheckUtils]: 84: Hoare triple {41907#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41907#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:58,331 INFO L273 TraceCheckUtils]: 85: Hoare triple {41907#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41907#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:58,332 INFO L273 TraceCheckUtils]: 86: Hoare triple {41907#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {41908#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:58,333 INFO L273 TraceCheckUtils]: 87: Hoare triple {41908#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41908#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:58,333 INFO L273 TraceCheckUtils]: 88: Hoare triple {41908#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41908#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:58,334 INFO L273 TraceCheckUtils]: 89: Hoare triple {41908#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {41909#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:58,334 INFO L273 TraceCheckUtils]: 90: Hoare triple {41909#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41909#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:58,335 INFO L273 TraceCheckUtils]: 91: Hoare triple {41909#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41909#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:58,335 INFO L273 TraceCheckUtils]: 92: Hoare triple {41909#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {41910#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:58,336 INFO L273 TraceCheckUtils]: 93: Hoare triple {41910#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41910#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:58,336 INFO L273 TraceCheckUtils]: 94: Hoare triple {41910#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41910#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:58,337 INFO L273 TraceCheckUtils]: 95: Hoare triple {41910#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {41911#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:58,338 INFO L273 TraceCheckUtils]: 96: Hoare triple {41911#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41911#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:58,338 INFO L273 TraceCheckUtils]: 97: Hoare triple {41911#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41911#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:58,339 INFO L273 TraceCheckUtils]: 98: Hoare triple {41911#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {41912#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:58,339 INFO L273 TraceCheckUtils]: 99: Hoare triple {41912#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41912#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:58,340 INFO L273 TraceCheckUtils]: 100: Hoare triple {41912#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41912#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:58,341 INFO L273 TraceCheckUtils]: 101: Hoare triple {41912#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {41913#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:58,341 INFO L273 TraceCheckUtils]: 102: Hoare triple {41913#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41913#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:58,342 INFO L273 TraceCheckUtils]: 103: Hoare triple {41913#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41913#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:58,342 INFO L273 TraceCheckUtils]: 104: Hoare triple {41913#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {41914#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:58,343 INFO L273 TraceCheckUtils]: 105: Hoare triple {41914#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41914#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:58,343 INFO L273 TraceCheckUtils]: 106: Hoare triple {41914#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41914#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:58,344 INFO L273 TraceCheckUtils]: 107: Hoare triple {41914#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {41915#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:58,344 INFO L273 TraceCheckUtils]: 108: Hoare triple {41915#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41915#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:58,345 INFO L273 TraceCheckUtils]: 109: Hoare triple {41915#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41915#(<= main_~i~0 34)} is VALID [2018-11-23 12:06:58,346 INFO L273 TraceCheckUtils]: 110: Hoare triple {41915#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {41916#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:58,346 INFO L273 TraceCheckUtils]: 111: Hoare triple {41916#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41916#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:58,347 INFO L273 TraceCheckUtils]: 112: Hoare triple {41916#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41916#(<= main_~i~0 35)} is VALID [2018-11-23 12:06:58,347 INFO L273 TraceCheckUtils]: 113: Hoare triple {41916#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {41917#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:58,348 INFO L273 TraceCheckUtils]: 114: Hoare triple {41917#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41917#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:58,348 INFO L273 TraceCheckUtils]: 115: Hoare triple {41917#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41917#(<= main_~i~0 36)} is VALID [2018-11-23 12:06:58,349 INFO L273 TraceCheckUtils]: 116: Hoare triple {41917#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {41918#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:58,350 INFO L273 TraceCheckUtils]: 117: Hoare triple {41918#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41918#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:58,350 INFO L273 TraceCheckUtils]: 118: Hoare triple {41918#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41918#(<= main_~i~0 37)} is VALID [2018-11-23 12:06:58,351 INFO L273 TraceCheckUtils]: 119: Hoare triple {41918#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {41919#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:58,351 INFO L273 TraceCheckUtils]: 120: Hoare triple {41919#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41919#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:58,352 INFO L273 TraceCheckUtils]: 121: Hoare triple {41919#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41919#(<= main_~i~0 38)} is VALID [2018-11-23 12:06:58,352 INFO L273 TraceCheckUtils]: 122: Hoare triple {41919#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {41920#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:58,353 INFO L273 TraceCheckUtils]: 123: Hoare triple {41920#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41920#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:58,353 INFO L273 TraceCheckUtils]: 124: Hoare triple {41920#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41920#(<= main_~i~0 39)} is VALID [2018-11-23 12:06:58,354 INFO L273 TraceCheckUtils]: 125: Hoare triple {41920#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {41921#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:58,355 INFO L273 TraceCheckUtils]: 126: Hoare triple {41921#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41921#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:58,355 INFO L273 TraceCheckUtils]: 127: Hoare triple {41921#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41921#(<= main_~i~0 40)} is VALID [2018-11-23 12:06:58,356 INFO L273 TraceCheckUtils]: 128: Hoare triple {41921#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {41922#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:58,356 INFO L273 TraceCheckUtils]: 129: Hoare triple {41922#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41922#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:58,357 INFO L273 TraceCheckUtils]: 130: Hoare triple {41922#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41922#(<= main_~i~0 41)} is VALID [2018-11-23 12:06:58,357 INFO L273 TraceCheckUtils]: 131: Hoare triple {41922#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {41923#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:58,358 INFO L273 TraceCheckUtils]: 132: Hoare triple {41923#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41923#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:58,358 INFO L273 TraceCheckUtils]: 133: Hoare triple {41923#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41923#(<= main_~i~0 42)} is VALID [2018-11-23 12:06:58,359 INFO L273 TraceCheckUtils]: 134: Hoare triple {41923#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {41924#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:58,360 INFO L273 TraceCheckUtils]: 135: Hoare triple {41924#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41924#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:58,360 INFO L273 TraceCheckUtils]: 136: Hoare triple {41924#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41924#(<= main_~i~0 43)} is VALID [2018-11-23 12:06:58,361 INFO L273 TraceCheckUtils]: 137: Hoare triple {41924#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {41925#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:58,361 INFO L273 TraceCheckUtils]: 138: Hoare triple {41925#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41925#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:58,362 INFO L273 TraceCheckUtils]: 139: Hoare triple {41925#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41925#(<= main_~i~0 44)} is VALID [2018-11-23 12:06:58,363 INFO L273 TraceCheckUtils]: 140: Hoare triple {41925#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {41926#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:58,363 INFO L273 TraceCheckUtils]: 141: Hoare triple {41926#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41926#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:58,364 INFO L273 TraceCheckUtils]: 142: Hoare triple {41926#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41926#(<= main_~i~0 45)} is VALID [2018-11-23 12:06:58,364 INFO L273 TraceCheckUtils]: 143: Hoare triple {41926#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {41927#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:58,365 INFO L273 TraceCheckUtils]: 144: Hoare triple {41927#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41927#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:58,365 INFO L273 TraceCheckUtils]: 145: Hoare triple {41927#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41927#(<= main_~i~0 46)} is VALID [2018-11-23 12:06:58,366 INFO L273 TraceCheckUtils]: 146: Hoare triple {41927#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {41928#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:58,366 INFO L273 TraceCheckUtils]: 147: Hoare triple {41928#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41928#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:58,367 INFO L273 TraceCheckUtils]: 148: Hoare triple {41928#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41928#(<= main_~i~0 47)} is VALID [2018-11-23 12:06:58,368 INFO L273 TraceCheckUtils]: 149: Hoare triple {41928#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {41929#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:58,368 INFO L273 TraceCheckUtils]: 150: Hoare triple {41929#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41929#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:58,369 INFO L273 TraceCheckUtils]: 151: Hoare triple {41929#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41929#(<= main_~i~0 48)} is VALID [2018-11-23 12:06:58,369 INFO L273 TraceCheckUtils]: 152: Hoare triple {41929#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {41930#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:58,370 INFO L273 TraceCheckUtils]: 153: Hoare triple {41930#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41930#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:58,370 INFO L273 TraceCheckUtils]: 154: Hoare triple {41930#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41930#(<= main_~i~0 49)} is VALID [2018-11-23 12:06:58,371 INFO L273 TraceCheckUtils]: 155: Hoare triple {41930#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {41931#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:58,372 INFO L273 TraceCheckUtils]: 156: Hoare triple {41931#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41931#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:58,372 INFO L273 TraceCheckUtils]: 157: Hoare triple {41931#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41931#(<= main_~i~0 50)} is VALID [2018-11-23 12:06:58,373 INFO L273 TraceCheckUtils]: 158: Hoare triple {41931#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {41932#(<= main_~i~0 51)} is VALID [2018-11-23 12:06:58,373 INFO L273 TraceCheckUtils]: 159: Hoare triple {41932#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41932#(<= main_~i~0 51)} is VALID [2018-11-23 12:06:58,374 INFO L273 TraceCheckUtils]: 160: Hoare triple {41932#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41932#(<= main_~i~0 51)} is VALID [2018-11-23 12:06:58,374 INFO L273 TraceCheckUtils]: 161: Hoare triple {41932#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {41933#(<= main_~i~0 52)} is VALID [2018-11-23 12:06:58,375 INFO L273 TraceCheckUtils]: 162: Hoare triple {41933#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41933#(<= main_~i~0 52)} is VALID [2018-11-23 12:06:58,375 INFO L273 TraceCheckUtils]: 163: Hoare triple {41933#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {41933#(<= main_~i~0 52)} is VALID [2018-11-23 12:06:58,376 INFO L273 TraceCheckUtils]: 164: Hoare triple {41933#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {41934#(<= main_~i~0 53)} is VALID [2018-11-23 12:06:58,377 INFO L273 TraceCheckUtils]: 165: Hoare triple {41934#(<= main_~i~0 53)} assume !(~i~0 < 100000); {41880#false} is VALID [2018-11-23 12:06:58,377 INFO L273 TraceCheckUtils]: 166: Hoare triple {41880#false} havoc ~x~0;~x~0 := 0; {41880#false} is VALID [2018-11-23 12:06:58,377 INFO L273 TraceCheckUtils]: 167: Hoare triple {41880#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {41880#false} is VALID [2018-11-23 12:06:58,377 INFO L256 TraceCheckUtils]: 168: Hoare triple {41880#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {41880#false} is VALID [2018-11-23 12:06:58,378 INFO L273 TraceCheckUtils]: 169: Hoare triple {41880#false} ~cond := #in~cond; {41880#false} is VALID [2018-11-23 12:06:58,378 INFO L273 TraceCheckUtils]: 170: Hoare triple {41880#false} assume 0 == ~cond; {41880#false} is VALID [2018-11-23 12:06:58,378 INFO L273 TraceCheckUtils]: 171: Hoare triple {41880#false} assume !false; {41880#false} is VALID [2018-11-23 12:06:58,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:58,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:58,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2018-11-23 12:06:58,415 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 172 [2018-11-23 12:06:58,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:58,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states. [2018-11-23 12:06:58,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:58,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-23 12:06:58,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-23 12:06:58,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 12:06:58,588 INFO L87 Difference]: Start difference. First operand 177 states and 231 transitions. Second operand 57 states. [2018-11-23 12:06:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:59,882 INFO L93 Difference]: Finished difference Result 193 states and 250 transitions. [2018-11-23 12:06:59,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-23 12:06:59,883 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 172 [2018-11-23 12:06:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:06:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 250 transitions. [2018-11-23 12:06:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:06:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 250 transitions. [2018-11-23 12:06:59,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 250 transitions. [2018-11-23 12:07:00,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:00,120 INFO L225 Difference]: With dead ends: 193 [2018-11-23 12:07:00,120 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 12:07:00,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 12:07:00,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 12:07:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-11-23 12:07:00,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:00,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 180 states. [2018-11-23 12:07:00,227 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 180 states. [2018-11-23 12:07:00,227 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 180 states. [2018-11-23 12:07:00,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:00,233 INFO L93 Difference]: Finished difference Result 182 states and 238 transitions. [2018-11-23 12:07:00,233 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2018-11-23 12:07:00,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:00,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:00,233 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 182 states. [2018-11-23 12:07:00,234 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 182 states. [2018-11-23 12:07:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:00,237 INFO L93 Difference]: Finished difference Result 182 states and 238 transitions. [2018-11-23 12:07:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2018-11-23 12:07:00,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:00,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:00,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:00,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:00,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-23 12:07:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2018-11-23 12:07:00,240 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 172 [2018-11-23 12:07:00,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:00,241 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2018-11-23 12:07:00,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-23 12:07:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2018-11-23 12:07:00,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 12:07:00,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:00,242 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:00,242 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:00,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:00,242 INFO L82 PathProgramCache]: Analyzing trace with hash -565469703, now seen corresponding path program 54 times [2018-11-23 12:07:00,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:00,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:00,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:00,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:00,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:01,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {43315#true} call ULTIMATE.init(); {43315#true} is VALID [2018-11-23 12:07:01,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {43315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43315#true} is VALID [2018-11-23 12:07:01,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {43315#true} assume true; {43315#true} is VALID [2018-11-23 12:07:01,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43315#true} {43315#true} #55#return; {43315#true} is VALID [2018-11-23 12:07:01,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {43315#true} call #t~ret4 := main(); {43315#true} is VALID [2018-11-23 12:07:01,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {43315#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {43317#(= main_~i~0 0)} is VALID [2018-11-23 12:07:01,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {43317#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43317#(= main_~i~0 0)} is VALID [2018-11-23 12:07:01,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {43317#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43317#(= main_~i~0 0)} is VALID [2018-11-23 12:07:01,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {43317#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {43318#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:01,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {43318#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43318#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:01,680 INFO L273 TraceCheckUtils]: 10: Hoare triple {43318#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43318#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:01,680 INFO L273 TraceCheckUtils]: 11: Hoare triple {43318#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {43319#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:01,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {43319#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43319#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:01,681 INFO L273 TraceCheckUtils]: 13: Hoare triple {43319#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43319#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:01,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {43319#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {43320#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:01,682 INFO L273 TraceCheckUtils]: 15: Hoare triple {43320#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43320#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:01,682 INFO L273 TraceCheckUtils]: 16: Hoare triple {43320#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43320#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:01,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {43320#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {43321#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:01,683 INFO L273 TraceCheckUtils]: 18: Hoare triple {43321#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43321#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:01,684 INFO L273 TraceCheckUtils]: 19: Hoare triple {43321#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43321#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:01,685 INFO L273 TraceCheckUtils]: 20: Hoare triple {43321#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {43322#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:01,685 INFO L273 TraceCheckUtils]: 21: Hoare triple {43322#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43322#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:01,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {43322#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43322#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:01,686 INFO L273 TraceCheckUtils]: 23: Hoare triple {43322#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {43323#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:01,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {43323#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43323#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:01,687 INFO L273 TraceCheckUtils]: 25: Hoare triple {43323#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43323#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:01,688 INFO L273 TraceCheckUtils]: 26: Hoare triple {43323#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {43324#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:01,688 INFO L273 TraceCheckUtils]: 27: Hoare triple {43324#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43324#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:01,689 INFO L273 TraceCheckUtils]: 28: Hoare triple {43324#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43324#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:01,690 INFO L273 TraceCheckUtils]: 29: Hoare triple {43324#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {43325#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:01,690 INFO L273 TraceCheckUtils]: 30: Hoare triple {43325#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43325#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:01,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {43325#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43325#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:01,691 INFO L273 TraceCheckUtils]: 32: Hoare triple {43325#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {43326#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:01,692 INFO L273 TraceCheckUtils]: 33: Hoare triple {43326#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43326#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:01,692 INFO L273 TraceCheckUtils]: 34: Hoare triple {43326#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43326#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:01,693 INFO L273 TraceCheckUtils]: 35: Hoare triple {43326#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {43327#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:01,693 INFO L273 TraceCheckUtils]: 36: Hoare triple {43327#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43327#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:01,694 INFO L273 TraceCheckUtils]: 37: Hoare triple {43327#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43327#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:01,695 INFO L273 TraceCheckUtils]: 38: Hoare triple {43327#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {43328#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:01,695 INFO L273 TraceCheckUtils]: 39: Hoare triple {43328#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43328#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:01,696 INFO L273 TraceCheckUtils]: 40: Hoare triple {43328#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43328#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:01,696 INFO L273 TraceCheckUtils]: 41: Hoare triple {43328#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {43329#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:01,697 INFO L273 TraceCheckUtils]: 42: Hoare triple {43329#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43329#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:01,697 INFO L273 TraceCheckUtils]: 43: Hoare triple {43329#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43329#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:01,698 INFO L273 TraceCheckUtils]: 44: Hoare triple {43329#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {43330#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:01,699 INFO L273 TraceCheckUtils]: 45: Hoare triple {43330#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43330#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:01,699 INFO L273 TraceCheckUtils]: 46: Hoare triple {43330#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43330#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:01,700 INFO L273 TraceCheckUtils]: 47: Hoare triple {43330#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {43331#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:01,700 INFO L273 TraceCheckUtils]: 48: Hoare triple {43331#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43331#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:01,701 INFO L273 TraceCheckUtils]: 49: Hoare triple {43331#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43331#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:01,701 INFO L273 TraceCheckUtils]: 50: Hoare triple {43331#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {43332#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:01,702 INFO L273 TraceCheckUtils]: 51: Hoare triple {43332#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43332#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:01,702 INFO L273 TraceCheckUtils]: 52: Hoare triple {43332#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43332#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:01,703 INFO L273 TraceCheckUtils]: 53: Hoare triple {43332#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {43333#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:01,704 INFO L273 TraceCheckUtils]: 54: Hoare triple {43333#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43333#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:01,704 INFO L273 TraceCheckUtils]: 55: Hoare triple {43333#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43333#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:01,705 INFO L273 TraceCheckUtils]: 56: Hoare triple {43333#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {43334#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:01,705 INFO L273 TraceCheckUtils]: 57: Hoare triple {43334#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43334#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:01,706 INFO L273 TraceCheckUtils]: 58: Hoare triple {43334#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43334#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:01,707 INFO L273 TraceCheckUtils]: 59: Hoare triple {43334#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {43335#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:01,707 INFO L273 TraceCheckUtils]: 60: Hoare triple {43335#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43335#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:01,708 INFO L273 TraceCheckUtils]: 61: Hoare triple {43335#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43335#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:01,708 INFO L273 TraceCheckUtils]: 62: Hoare triple {43335#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {43336#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:01,709 INFO L273 TraceCheckUtils]: 63: Hoare triple {43336#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43336#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:01,709 INFO L273 TraceCheckUtils]: 64: Hoare triple {43336#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43336#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:01,710 INFO L273 TraceCheckUtils]: 65: Hoare triple {43336#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {43337#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:01,710 INFO L273 TraceCheckUtils]: 66: Hoare triple {43337#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43337#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:01,711 INFO L273 TraceCheckUtils]: 67: Hoare triple {43337#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43337#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:01,712 INFO L273 TraceCheckUtils]: 68: Hoare triple {43337#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {43338#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:01,712 INFO L273 TraceCheckUtils]: 69: Hoare triple {43338#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43338#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:01,713 INFO L273 TraceCheckUtils]: 70: Hoare triple {43338#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43338#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:01,713 INFO L273 TraceCheckUtils]: 71: Hoare triple {43338#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {43339#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:01,714 INFO L273 TraceCheckUtils]: 72: Hoare triple {43339#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43339#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:01,714 INFO L273 TraceCheckUtils]: 73: Hoare triple {43339#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43339#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:01,715 INFO L273 TraceCheckUtils]: 74: Hoare triple {43339#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {43340#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:01,716 INFO L273 TraceCheckUtils]: 75: Hoare triple {43340#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43340#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:01,716 INFO L273 TraceCheckUtils]: 76: Hoare triple {43340#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43340#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:01,717 INFO L273 TraceCheckUtils]: 77: Hoare triple {43340#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {43341#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:01,717 INFO L273 TraceCheckUtils]: 78: Hoare triple {43341#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43341#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:01,718 INFO L273 TraceCheckUtils]: 79: Hoare triple {43341#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43341#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:01,718 INFO L273 TraceCheckUtils]: 80: Hoare triple {43341#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {43342#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:01,719 INFO L273 TraceCheckUtils]: 81: Hoare triple {43342#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43342#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:01,719 INFO L273 TraceCheckUtils]: 82: Hoare triple {43342#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43342#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:01,720 INFO L273 TraceCheckUtils]: 83: Hoare triple {43342#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {43343#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:01,721 INFO L273 TraceCheckUtils]: 84: Hoare triple {43343#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43343#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:01,721 INFO L273 TraceCheckUtils]: 85: Hoare triple {43343#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43343#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:01,722 INFO L273 TraceCheckUtils]: 86: Hoare triple {43343#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {43344#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:01,722 INFO L273 TraceCheckUtils]: 87: Hoare triple {43344#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43344#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:01,723 INFO L273 TraceCheckUtils]: 88: Hoare triple {43344#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43344#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:01,724 INFO L273 TraceCheckUtils]: 89: Hoare triple {43344#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {43345#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:01,724 INFO L273 TraceCheckUtils]: 90: Hoare triple {43345#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43345#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:01,725 INFO L273 TraceCheckUtils]: 91: Hoare triple {43345#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43345#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:01,725 INFO L273 TraceCheckUtils]: 92: Hoare triple {43345#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {43346#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:01,726 INFO L273 TraceCheckUtils]: 93: Hoare triple {43346#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43346#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:01,726 INFO L273 TraceCheckUtils]: 94: Hoare triple {43346#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43346#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:01,727 INFO L273 TraceCheckUtils]: 95: Hoare triple {43346#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {43347#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:01,728 INFO L273 TraceCheckUtils]: 96: Hoare triple {43347#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43347#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:01,728 INFO L273 TraceCheckUtils]: 97: Hoare triple {43347#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43347#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:01,729 INFO L273 TraceCheckUtils]: 98: Hoare triple {43347#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {43348#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:01,729 INFO L273 TraceCheckUtils]: 99: Hoare triple {43348#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43348#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:01,730 INFO L273 TraceCheckUtils]: 100: Hoare triple {43348#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43348#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:01,730 INFO L273 TraceCheckUtils]: 101: Hoare triple {43348#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {43349#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:01,731 INFO L273 TraceCheckUtils]: 102: Hoare triple {43349#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43349#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:01,731 INFO L273 TraceCheckUtils]: 103: Hoare triple {43349#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43349#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:01,732 INFO L273 TraceCheckUtils]: 104: Hoare triple {43349#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {43350#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:01,733 INFO L273 TraceCheckUtils]: 105: Hoare triple {43350#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43350#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:01,733 INFO L273 TraceCheckUtils]: 106: Hoare triple {43350#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43350#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:01,734 INFO L273 TraceCheckUtils]: 107: Hoare triple {43350#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {43351#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:01,734 INFO L273 TraceCheckUtils]: 108: Hoare triple {43351#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43351#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:01,735 INFO L273 TraceCheckUtils]: 109: Hoare triple {43351#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43351#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:01,735 INFO L273 TraceCheckUtils]: 110: Hoare triple {43351#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {43352#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:01,736 INFO L273 TraceCheckUtils]: 111: Hoare triple {43352#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43352#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:01,736 INFO L273 TraceCheckUtils]: 112: Hoare triple {43352#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43352#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:01,737 INFO L273 TraceCheckUtils]: 113: Hoare triple {43352#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {43353#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:01,738 INFO L273 TraceCheckUtils]: 114: Hoare triple {43353#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43353#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:01,738 INFO L273 TraceCheckUtils]: 115: Hoare triple {43353#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43353#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:01,739 INFO L273 TraceCheckUtils]: 116: Hoare triple {43353#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {43354#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:01,739 INFO L273 TraceCheckUtils]: 117: Hoare triple {43354#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43354#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:01,740 INFO L273 TraceCheckUtils]: 118: Hoare triple {43354#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43354#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:01,741 INFO L273 TraceCheckUtils]: 119: Hoare triple {43354#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {43355#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:01,741 INFO L273 TraceCheckUtils]: 120: Hoare triple {43355#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43355#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:01,742 INFO L273 TraceCheckUtils]: 121: Hoare triple {43355#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43355#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:01,742 INFO L273 TraceCheckUtils]: 122: Hoare triple {43355#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {43356#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:01,743 INFO L273 TraceCheckUtils]: 123: Hoare triple {43356#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43356#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:01,743 INFO L273 TraceCheckUtils]: 124: Hoare triple {43356#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43356#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:01,744 INFO L273 TraceCheckUtils]: 125: Hoare triple {43356#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {43357#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:01,744 INFO L273 TraceCheckUtils]: 126: Hoare triple {43357#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43357#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:01,745 INFO L273 TraceCheckUtils]: 127: Hoare triple {43357#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43357#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:01,746 INFO L273 TraceCheckUtils]: 128: Hoare triple {43357#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {43358#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:01,746 INFO L273 TraceCheckUtils]: 129: Hoare triple {43358#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43358#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:01,747 INFO L273 TraceCheckUtils]: 130: Hoare triple {43358#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43358#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:01,747 INFO L273 TraceCheckUtils]: 131: Hoare triple {43358#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {43359#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:01,748 INFO L273 TraceCheckUtils]: 132: Hoare triple {43359#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43359#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:01,748 INFO L273 TraceCheckUtils]: 133: Hoare triple {43359#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43359#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:01,749 INFO L273 TraceCheckUtils]: 134: Hoare triple {43359#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {43360#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:01,750 INFO L273 TraceCheckUtils]: 135: Hoare triple {43360#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43360#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:01,750 INFO L273 TraceCheckUtils]: 136: Hoare triple {43360#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43360#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:01,751 INFO L273 TraceCheckUtils]: 137: Hoare triple {43360#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {43361#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:01,751 INFO L273 TraceCheckUtils]: 138: Hoare triple {43361#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43361#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:01,752 INFO L273 TraceCheckUtils]: 139: Hoare triple {43361#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43361#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:01,753 INFO L273 TraceCheckUtils]: 140: Hoare triple {43361#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {43362#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:01,753 INFO L273 TraceCheckUtils]: 141: Hoare triple {43362#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43362#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:01,754 INFO L273 TraceCheckUtils]: 142: Hoare triple {43362#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43362#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:01,754 INFO L273 TraceCheckUtils]: 143: Hoare triple {43362#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {43363#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:01,755 INFO L273 TraceCheckUtils]: 144: Hoare triple {43363#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43363#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:01,755 INFO L273 TraceCheckUtils]: 145: Hoare triple {43363#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43363#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:01,756 INFO L273 TraceCheckUtils]: 146: Hoare triple {43363#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {43364#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:01,756 INFO L273 TraceCheckUtils]: 147: Hoare triple {43364#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43364#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:01,757 INFO L273 TraceCheckUtils]: 148: Hoare triple {43364#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43364#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:01,758 INFO L273 TraceCheckUtils]: 149: Hoare triple {43364#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {43365#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:01,758 INFO L273 TraceCheckUtils]: 150: Hoare triple {43365#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43365#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:01,759 INFO L273 TraceCheckUtils]: 151: Hoare triple {43365#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43365#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:01,759 INFO L273 TraceCheckUtils]: 152: Hoare triple {43365#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {43366#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:01,760 INFO L273 TraceCheckUtils]: 153: Hoare triple {43366#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43366#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:01,760 INFO L273 TraceCheckUtils]: 154: Hoare triple {43366#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43366#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:01,761 INFO L273 TraceCheckUtils]: 155: Hoare triple {43366#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {43367#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:01,762 INFO L273 TraceCheckUtils]: 156: Hoare triple {43367#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43367#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:01,762 INFO L273 TraceCheckUtils]: 157: Hoare triple {43367#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43367#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:01,763 INFO L273 TraceCheckUtils]: 158: Hoare triple {43367#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {43368#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:01,763 INFO L273 TraceCheckUtils]: 159: Hoare triple {43368#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43368#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:01,764 INFO L273 TraceCheckUtils]: 160: Hoare triple {43368#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43368#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:01,764 INFO L273 TraceCheckUtils]: 161: Hoare triple {43368#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {43369#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:01,765 INFO L273 TraceCheckUtils]: 162: Hoare triple {43369#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43369#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:01,765 INFO L273 TraceCheckUtils]: 163: Hoare triple {43369#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43369#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:01,766 INFO L273 TraceCheckUtils]: 164: Hoare triple {43369#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {43370#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:01,767 INFO L273 TraceCheckUtils]: 165: Hoare triple {43370#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43370#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:01,767 INFO L273 TraceCheckUtils]: 166: Hoare triple {43370#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43370#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:01,768 INFO L273 TraceCheckUtils]: 167: Hoare triple {43370#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {43371#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:01,769 INFO L273 TraceCheckUtils]: 168: Hoare triple {43371#(<= main_~i~0 54)} assume !(~i~0 < 100000); {43316#false} is VALID [2018-11-23 12:07:01,769 INFO L273 TraceCheckUtils]: 169: Hoare triple {43316#false} havoc ~x~0;~x~0 := 0; {43316#false} is VALID [2018-11-23 12:07:01,769 INFO L273 TraceCheckUtils]: 170: Hoare triple {43316#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {43316#false} is VALID [2018-11-23 12:07:01,769 INFO L256 TraceCheckUtils]: 171: Hoare triple {43316#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {43316#false} is VALID [2018-11-23 12:07:01,769 INFO L273 TraceCheckUtils]: 172: Hoare triple {43316#false} ~cond := #in~cond; {43316#false} is VALID [2018-11-23 12:07:01,769 INFO L273 TraceCheckUtils]: 173: Hoare triple {43316#false} assume 0 == ~cond; {43316#false} is VALID [2018-11-23 12:07:01,770 INFO L273 TraceCheckUtils]: 174: Hoare triple {43316#false} assume !false; {43316#false} is VALID [2018-11-23 12:07:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:01,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:01,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:01,798 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:07:01,940 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-11-23 12:07:01,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:01,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:02,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {43315#true} call ULTIMATE.init(); {43315#true} is VALID [2018-11-23 12:07:02,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {43315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43315#true} is VALID [2018-11-23 12:07:02,357 INFO L273 TraceCheckUtils]: 2: Hoare triple {43315#true} assume true; {43315#true} is VALID [2018-11-23 12:07:02,358 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43315#true} {43315#true} #55#return; {43315#true} is VALID [2018-11-23 12:07:02,358 INFO L256 TraceCheckUtils]: 4: Hoare triple {43315#true} call #t~ret4 := main(); {43315#true} is VALID [2018-11-23 12:07:02,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {43315#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {43390#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:02,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {43390#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43390#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:02,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {43390#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43390#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:02,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {43390#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {43318#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:02,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {43318#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43318#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:02,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {43318#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43318#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:02,361 INFO L273 TraceCheckUtils]: 11: Hoare triple {43318#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {43319#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:02,361 INFO L273 TraceCheckUtils]: 12: Hoare triple {43319#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43319#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:02,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {43319#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43319#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:02,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {43319#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {43320#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:02,363 INFO L273 TraceCheckUtils]: 15: Hoare triple {43320#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43320#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:02,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {43320#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43320#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:02,364 INFO L273 TraceCheckUtils]: 17: Hoare triple {43320#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {43321#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:02,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {43321#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43321#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:02,365 INFO L273 TraceCheckUtils]: 19: Hoare triple {43321#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43321#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:02,366 INFO L273 TraceCheckUtils]: 20: Hoare triple {43321#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {43322#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:02,366 INFO L273 TraceCheckUtils]: 21: Hoare triple {43322#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43322#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:02,367 INFO L273 TraceCheckUtils]: 22: Hoare triple {43322#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43322#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:02,367 INFO L273 TraceCheckUtils]: 23: Hoare triple {43322#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {43323#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:02,368 INFO L273 TraceCheckUtils]: 24: Hoare triple {43323#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43323#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:02,368 INFO L273 TraceCheckUtils]: 25: Hoare triple {43323#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43323#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:02,369 INFO L273 TraceCheckUtils]: 26: Hoare triple {43323#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {43324#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:02,370 INFO L273 TraceCheckUtils]: 27: Hoare triple {43324#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43324#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:02,370 INFO L273 TraceCheckUtils]: 28: Hoare triple {43324#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43324#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:02,371 INFO L273 TraceCheckUtils]: 29: Hoare triple {43324#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {43325#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:02,371 INFO L273 TraceCheckUtils]: 30: Hoare triple {43325#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43325#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:02,372 INFO L273 TraceCheckUtils]: 31: Hoare triple {43325#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43325#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:02,372 INFO L273 TraceCheckUtils]: 32: Hoare triple {43325#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {43326#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:02,373 INFO L273 TraceCheckUtils]: 33: Hoare triple {43326#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43326#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:02,373 INFO L273 TraceCheckUtils]: 34: Hoare triple {43326#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43326#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:02,374 INFO L273 TraceCheckUtils]: 35: Hoare triple {43326#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {43327#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:02,375 INFO L273 TraceCheckUtils]: 36: Hoare triple {43327#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43327#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:02,375 INFO L273 TraceCheckUtils]: 37: Hoare triple {43327#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43327#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:02,376 INFO L273 TraceCheckUtils]: 38: Hoare triple {43327#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {43328#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:02,376 INFO L273 TraceCheckUtils]: 39: Hoare triple {43328#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43328#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:02,377 INFO L273 TraceCheckUtils]: 40: Hoare triple {43328#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43328#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:02,378 INFO L273 TraceCheckUtils]: 41: Hoare triple {43328#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {43329#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:02,378 INFO L273 TraceCheckUtils]: 42: Hoare triple {43329#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43329#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:02,379 INFO L273 TraceCheckUtils]: 43: Hoare triple {43329#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43329#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:02,379 INFO L273 TraceCheckUtils]: 44: Hoare triple {43329#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {43330#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:02,380 INFO L273 TraceCheckUtils]: 45: Hoare triple {43330#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43330#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:02,380 INFO L273 TraceCheckUtils]: 46: Hoare triple {43330#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43330#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:02,381 INFO L273 TraceCheckUtils]: 47: Hoare triple {43330#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {43331#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:02,381 INFO L273 TraceCheckUtils]: 48: Hoare triple {43331#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43331#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:02,382 INFO L273 TraceCheckUtils]: 49: Hoare triple {43331#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43331#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:02,383 INFO L273 TraceCheckUtils]: 50: Hoare triple {43331#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {43332#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:02,383 INFO L273 TraceCheckUtils]: 51: Hoare triple {43332#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43332#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:02,384 INFO L273 TraceCheckUtils]: 52: Hoare triple {43332#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43332#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:02,384 INFO L273 TraceCheckUtils]: 53: Hoare triple {43332#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {43333#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:02,385 INFO L273 TraceCheckUtils]: 54: Hoare triple {43333#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43333#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:02,385 INFO L273 TraceCheckUtils]: 55: Hoare triple {43333#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43333#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:02,386 INFO L273 TraceCheckUtils]: 56: Hoare triple {43333#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {43334#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:02,387 INFO L273 TraceCheckUtils]: 57: Hoare triple {43334#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43334#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:02,387 INFO L273 TraceCheckUtils]: 58: Hoare triple {43334#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43334#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:02,388 INFO L273 TraceCheckUtils]: 59: Hoare triple {43334#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {43335#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:02,388 INFO L273 TraceCheckUtils]: 60: Hoare triple {43335#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43335#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:02,389 INFO L273 TraceCheckUtils]: 61: Hoare triple {43335#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43335#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:02,389 INFO L273 TraceCheckUtils]: 62: Hoare triple {43335#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {43336#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:02,390 INFO L273 TraceCheckUtils]: 63: Hoare triple {43336#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43336#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:02,390 INFO L273 TraceCheckUtils]: 64: Hoare triple {43336#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43336#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:02,391 INFO L273 TraceCheckUtils]: 65: Hoare triple {43336#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {43337#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:02,392 INFO L273 TraceCheckUtils]: 66: Hoare triple {43337#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43337#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:02,392 INFO L273 TraceCheckUtils]: 67: Hoare triple {43337#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43337#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:02,393 INFO L273 TraceCheckUtils]: 68: Hoare triple {43337#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {43338#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:02,393 INFO L273 TraceCheckUtils]: 69: Hoare triple {43338#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43338#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:02,394 INFO L273 TraceCheckUtils]: 70: Hoare triple {43338#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43338#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:02,395 INFO L273 TraceCheckUtils]: 71: Hoare triple {43338#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {43339#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:02,395 INFO L273 TraceCheckUtils]: 72: Hoare triple {43339#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43339#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:02,396 INFO L273 TraceCheckUtils]: 73: Hoare triple {43339#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43339#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:02,396 INFO L273 TraceCheckUtils]: 74: Hoare triple {43339#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {43340#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:02,397 INFO L273 TraceCheckUtils]: 75: Hoare triple {43340#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43340#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:02,397 INFO L273 TraceCheckUtils]: 76: Hoare triple {43340#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43340#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:02,398 INFO L273 TraceCheckUtils]: 77: Hoare triple {43340#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {43341#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:02,398 INFO L273 TraceCheckUtils]: 78: Hoare triple {43341#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43341#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:02,399 INFO L273 TraceCheckUtils]: 79: Hoare triple {43341#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43341#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:02,400 INFO L273 TraceCheckUtils]: 80: Hoare triple {43341#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {43342#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:02,400 INFO L273 TraceCheckUtils]: 81: Hoare triple {43342#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43342#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:02,401 INFO L273 TraceCheckUtils]: 82: Hoare triple {43342#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43342#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:02,401 INFO L273 TraceCheckUtils]: 83: Hoare triple {43342#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {43343#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:02,402 INFO L273 TraceCheckUtils]: 84: Hoare triple {43343#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43343#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:02,402 INFO L273 TraceCheckUtils]: 85: Hoare triple {43343#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43343#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:02,403 INFO L273 TraceCheckUtils]: 86: Hoare triple {43343#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {43344#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:02,404 INFO L273 TraceCheckUtils]: 87: Hoare triple {43344#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43344#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:02,404 INFO L273 TraceCheckUtils]: 88: Hoare triple {43344#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43344#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:02,405 INFO L273 TraceCheckUtils]: 89: Hoare triple {43344#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {43345#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:02,405 INFO L273 TraceCheckUtils]: 90: Hoare triple {43345#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43345#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:02,406 INFO L273 TraceCheckUtils]: 91: Hoare triple {43345#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43345#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:02,406 INFO L273 TraceCheckUtils]: 92: Hoare triple {43345#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {43346#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:02,407 INFO L273 TraceCheckUtils]: 93: Hoare triple {43346#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43346#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:02,407 INFO L273 TraceCheckUtils]: 94: Hoare triple {43346#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43346#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:02,408 INFO L273 TraceCheckUtils]: 95: Hoare triple {43346#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {43347#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:02,409 INFO L273 TraceCheckUtils]: 96: Hoare triple {43347#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43347#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:02,409 INFO L273 TraceCheckUtils]: 97: Hoare triple {43347#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43347#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:02,410 INFO L273 TraceCheckUtils]: 98: Hoare triple {43347#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {43348#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:02,410 INFO L273 TraceCheckUtils]: 99: Hoare triple {43348#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43348#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:02,411 INFO L273 TraceCheckUtils]: 100: Hoare triple {43348#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43348#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:02,412 INFO L273 TraceCheckUtils]: 101: Hoare triple {43348#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {43349#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:02,412 INFO L273 TraceCheckUtils]: 102: Hoare triple {43349#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43349#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:02,413 INFO L273 TraceCheckUtils]: 103: Hoare triple {43349#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43349#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:02,413 INFO L273 TraceCheckUtils]: 104: Hoare triple {43349#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {43350#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:02,414 INFO L273 TraceCheckUtils]: 105: Hoare triple {43350#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43350#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:02,414 INFO L273 TraceCheckUtils]: 106: Hoare triple {43350#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43350#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:02,415 INFO L273 TraceCheckUtils]: 107: Hoare triple {43350#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {43351#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:02,416 INFO L273 TraceCheckUtils]: 108: Hoare triple {43351#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43351#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:02,416 INFO L273 TraceCheckUtils]: 109: Hoare triple {43351#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43351#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:02,417 INFO L273 TraceCheckUtils]: 110: Hoare triple {43351#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {43352#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:02,417 INFO L273 TraceCheckUtils]: 111: Hoare triple {43352#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43352#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:02,418 INFO L273 TraceCheckUtils]: 112: Hoare triple {43352#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43352#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:02,418 INFO L273 TraceCheckUtils]: 113: Hoare triple {43352#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {43353#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:02,419 INFO L273 TraceCheckUtils]: 114: Hoare triple {43353#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43353#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:02,419 INFO L273 TraceCheckUtils]: 115: Hoare triple {43353#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43353#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:02,420 INFO L273 TraceCheckUtils]: 116: Hoare triple {43353#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {43354#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:02,421 INFO L273 TraceCheckUtils]: 117: Hoare triple {43354#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43354#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:02,421 INFO L273 TraceCheckUtils]: 118: Hoare triple {43354#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43354#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:02,422 INFO L273 TraceCheckUtils]: 119: Hoare triple {43354#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {43355#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:02,422 INFO L273 TraceCheckUtils]: 120: Hoare triple {43355#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43355#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:02,423 INFO L273 TraceCheckUtils]: 121: Hoare triple {43355#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43355#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:02,423 INFO L273 TraceCheckUtils]: 122: Hoare triple {43355#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {43356#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:02,424 INFO L273 TraceCheckUtils]: 123: Hoare triple {43356#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43356#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:02,424 INFO L273 TraceCheckUtils]: 124: Hoare triple {43356#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43356#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:02,425 INFO L273 TraceCheckUtils]: 125: Hoare triple {43356#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {43357#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:02,426 INFO L273 TraceCheckUtils]: 126: Hoare triple {43357#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43357#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:02,426 INFO L273 TraceCheckUtils]: 127: Hoare triple {43357#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43357#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:02,427 INFO L273 TraceCheckUtils]: 128: Hoare triple {43357#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {43358#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:02,427 INFO L273 TraceCheckUtils]: 129: Hoare triple {43358#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43358#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:02,428 INFO L273 TraceCheckUtils]: 130: Hoare triple {43358#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43358#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:02,429 INFO L273 TraceCheckUtils]: 131: Hoare triple {43358#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {43359#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:02,429 INFO L273 TraceCheckUtils]: 132: Hoare triple {43359#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43359#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:02,430 INFO L273 TraceCheckUtils]: 133: Hoare triple {43359#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43359#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:02,430 INFO L273 TraceCheckUtils]: 134: Hoare triple {43359#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {43360#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:02,431 INFO L273 TraceCheckUtils]: 135: Hoare triple {43360#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43360#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:02,431 INFO L273 TraceCheckUtils]: 136: Hoare triple {43360#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43360#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:02,432 INFO L273 TraceCheckUtils]: 137: Hoare triple {43360#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {43361#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:02,432 INFO L273 TraceCheckUtils]: 138: Hoare triple {43361#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43361#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:02,433 INFO L273 TraceCheckUtils]: 139: Hoare triple {43361#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43361#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:02,434 INFO L273 TraceCheckUtils]: 140: Hoare triple {43361#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {43362#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:02,434 INFO L273 TraceCheckUtils]: 141: Hoare triple {43362#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43362#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:02,435 INFO L273 TraceCheckUtils]: 142: Hoare triple {43362#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43362#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:02,435 INFO L273 TraceCheckUtils]: 143: Hoare triple {43362#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {43363#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:02,436 INFO L273 TraceCheckUtils]: 144: Hoare triple {43363#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43363#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:02,436 INFO L273 TraceCheckUtils]: 145: Hoare triple {43363#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43363#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:02,437 INFO L273 TraceCheckUtils]: 146: Hoare triple {43363#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {43364#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:02,438 INFO L273 TraceCheckUtils]: 147: Hoare triple {43364#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43364#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:02,438 INFO L273 TraceCheckUtils]: 148: Hoare triple {43364#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43364#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:02,439 INFO L273 TraceCheckUtils]: 149: Hoare triple {43364#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {43365#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:02,439 INFO L273 TraceCheckUtils]: 150: Hoare triple {43365#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43365#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:02,440 INFO L273 TraceCheckUtils]: 151: Hoare triple {43365#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43365#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:02,440 INFO L273 TraceCheckUtils]: 152: Hoare triple {43365#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {43366#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:02,441 INFO L273 TraceCheckUtils]: 153: Hoare triple {43366#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43366#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:02,441 INFO L273 TraceCheckUtils]: 154: Hoare triple {43366#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43366#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:02,442 INFO L273 TraceCheckUtils]: 155: Hoare triple {43366#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {43367#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:02,443 INFO L273 TraceCheckUtils]: 156: Hoare triple {43367#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43367#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:02,443 INFO L273 TraceCheckUtils]: 157: Hoare triple {43367#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43367#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:02,444 INFO L273 TraceCheckUtils]: 158: Hoare triple {43367#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {43368#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:02,444 INFO L273 TraceCheckUtils]: 159: Hoare triple {43368#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43368#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:02,445 INFO L273 TraceCheckUtils]: 160: Hoare triple {43368#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43368#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:02,446 INFO L273 TraceCheckUtils]: 161: Hoare triple {43368#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {43369#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:02,446 INFO L273 TraceCheckUtils]: 162: Hoare triple {43369#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43369#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:02,447 INFO L273 TraceCheckUtils]: 163: Hoare triple {43369#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43369#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:02,447 INFO L273 TraceCheckUtils]: 164: Hoare triple {43369#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {43370#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:02,448 INFO L273 TraceCheckUtils]: 165: Hoare triple {43370#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43370#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:02,448 INFO L273 TraceCheckUtils]: 166: Hoare triple {43370#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {43370#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:02,449 INFO L273 TraceCheckUtils]: 167: Hoare triple {43370#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {43371#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:02,450 INFO L273 TraceCheckUtils]: 168: Hoare triple {43371#(<= main_~i~0 54)} assume !(~i~0 < 100000); {43316#false} is VALID [2018-11-23 12:07:02,450 INFO L273 TraceCheckUtils]: 169: Hoare triple {43316#false} havoc ~x~0;~x~0 := 0; {43316#false} is VALID [2018-11-23 12:07:02,450 INFO L273 TraceCheckUtils]: 170: Hoare triple {43316#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {43316#false} is VALID [2018-11-23 12:07:02,450 INFO L256 TraceCheckUtils]: 171: Hoare triple {43316#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {43316#false} is VALID [2018-11-23 12:07:02,450 INFO L273 TraceCheckUtils]: 172: Hoare triple {43316#false} ~cond := #in~cond; {43316#false} is VALID [2018-11-23 12:07:02,451 INFO L273 TraceCheckUtils]: 173: Hoare triple {43316#false} assume 0 == ~cond; {43316#false} is VALID [2018-11-23 12:07:02,451 INFO L273 TraceCheckUtils]: 174: Hoare triple {43316#false} assume !false; {43316#false} is VALID [2018-11-23 12:07:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:02,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:02,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2018-11-23 12:07:02,489 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 175 [2018-11-23 12:07:02,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:02,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states. [2018-11-23 12:07:02,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:02,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-23 12:07:02,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-23 12:07:02,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 12:07:02,663 INFO L87 Difference]: Start difference. First operand 180 states and 235 transitions. Second operand 58 states. [2018-11-23 12:07:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:03,876 INFO L93 Difference]: Finished difference Result 196 states and 254 transitions. [2018-11-23 12:07:03,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-23 12:07:03,876 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 175 [2018-11-23 12:07:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:07:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 254 transitions. [2018-11-23 12:07:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:07:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 254 transitions. [2018-11-23 12:07:03,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 254 transitions. [2018-11-23 12:07:04,132 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 12:07:04,135 INFO L225 Difference]: With dead ends: 196 [2018-11-23 12:07:04,135 INFO L226 Difference]: Without dead ends: 185 [2018-11-23 12:07:04,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 12:07:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-23 12:07:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-11-23 12:07:04,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:04,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 183 states. [2018-11-23 12:07:04,571 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 183 states. [2018-11-23 12:07:04,571 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 183 states. [2018-11-23 12:07:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:04,573 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2018-11-23 12:07:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2018-11-23 12:07:04,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:04,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:04,574 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 185 states. [2018-11-23 12:07:04,574 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 185 states. [2018-11-23 12:07:04,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:04,576 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2018-11-23 12:07:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2018-11-23 12:07:04,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:04,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:04,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:04,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-23 12:07:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 239 transitions. [2018-11-23 12:07:04,579 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 239 transitions. Word has length 175 [2018-11-23 12:07:04,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:04,579 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 239 transitions. [2018-11-23 12:07:04,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-23 12:07:04,579 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 239 transitions. [2018-11-23 12:07:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-23 12:07:04,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:04,580 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:04,580 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:04,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:04,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2000821341, now seen corresponding path program 55 times [2018-11-23 12:07:04,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:04,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:04,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:04,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:04,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:06,009 INFO L256 TraceCheckUtils]: 0: Hoare triple {44775#true} call ULTIMATE.init(); {44775#true} is VALID [2018-11-23 12:07:06,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {44775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {44775#true} is VALID [2018-11-23 12:07:06,010 INFO L273 TraceCheckUtils]: 2: Hoare triple {44775#true} assume true; {44775#true} is VALID [2018-11-23 12:07:06,010 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44775#true} {44775#true} #55#return; {44775#true} is VALID [2018-11-23 12:07:06,010 INFO L256 TraceCheckUtils]: 4: Hoare triple {44775#true} call #t~ret4 := main(); {44775#true} is VALID [2018-11-23 12:07:06,011 INFO L273 TraceCheckUtils]: 5: Hoare triple {44775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {44777#(= main_~i~0 0)} is VALID [2018-11-23 12:07:06,011 INFO L273 TraceCheckUtils]: 6: Hoare triple {44777#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44777#(= main_~i~0 0)} is VALID [2018-11-23 12:07:06,012 INFO L273 TraceCheckUtils]: 7: Hoare triple {44777#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44777#(= main_~i~0 0)} is VALID [2018-11-23 12:07:06,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {44777#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {44778#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:06,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {44778#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44778#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:06,013 INFO L273 TraceCheckUtils]: 10: Hoare triple {44778#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44778#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:06,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {44778#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {44779#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:06,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {44779#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44779#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:06,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {44779#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44779#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:06,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {44779#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {44780#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:06,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {44780#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44780#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:06,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {44780#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44780#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:06,016 INFO L273 TraceCheckUtils]: 17: Hoare triple {44780#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {44781#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:06,017 INFO L273 TraceCheckUtils]: 18: Hoare triple {44781#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44781#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:06,017 INFO L273 TraceCheckUtils]: 19: Hoare triple {44781#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44781#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:06,018 INFO L273 TraceCheckUtils]: 20: Hoare triple {44781#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {44782#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:06,018 INFO L273 TraceCheckUtils]: 21: Hoare triple {44782#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44782#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:06,019 INFO L273 TraceCheckUtils]: 22: Hoare triple {44782#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44782#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:06,019 INFO L273 TraceCheckUtils]: 23: Hoare triple {44782#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {44783#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:06,020 INFO L273 TraceCheckUtils]: 24: Hoare triple {44783#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44783#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:06,020 INFO L273 TraceCheckUtils]: 25: Hoare triple {44783#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44783#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:06,021 INFO L273 TraceCheckUtils]: 26: Hoare triple {44783#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {44784#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:06,022 INFO L273 TraceCheckUtils]: 27: Hoare triple {44784#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44784#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:06,022 INFO L273 TraceCheckUtils]: 28: Hoare triple {44784#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44784#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:06,023 INFO L273 TraceCheckUtils]: 29: Hoare triple {44784#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {44785#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:06,023 INFO L273 TraceCheckUtils]: 30: Hoare triple {44785#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44785#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:06,024 INFO L273 TraceCheckUtils]: 31: Hoare triple {44785#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44785#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:06,025 INFO L273 TraceCheckUtils]: 32: Hoare triple {44785#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {44786#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:06,025 INFO L273 TraceCheckUtils]: 33: Hoare triple {44786#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44786#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:06,026 INFO L273 TraceCheckUtils]: 34: Hoare triple {44786#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44786#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:06,026 INFO L273 TraceCheckUtils]: 35: Hoare triple {44786#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {44787#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:06,027 INFO L273 TraceCheckUtils]: 36: Hoare triple {44787#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44787#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:06,027 INFO L273 TraceCheckUtils]: 37: Hoare triple {44787#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44787#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:06,028 INFO L273 TraceCheckUtils]: 38: Hoare triple {44787#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {44788#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:06,028 INFO L273 TraceCheckUtils]: 39: Hoare triple {44788#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44788#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:06,029 INFO L273 TraceCheckUtils]: 40: Hoare triple {44788#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44788#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:06,030 INFO L273 TraceCheckUtils]: 41: Hoare triple {44788#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {44789#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:06,030 INFO L273 TraceCheckUtils]: 42: Hoare triple {44789#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44789#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:06,031 INFO L273 TraceCheckUtils]: 43: Hoare triple {44789#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44789#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:06,031 INFO L273 TraceCheckUtils]: 44: Hoare triple {44789#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {44790#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:06,032 INFO L273 TraceCheckUtils]: 45: Hoare triple {44790#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44790#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:06,032 INFO L273 TraceCheckUtils]: 46: Hoare triple {44790#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44790#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:06,033 INFO L273 TraceCheckUtils]: 47: Hoare triple {44790#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {44791#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:06,034 INFO L273 TraceCheckUtils]: 48: Hoare triple {44791#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44791#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:06,034 INFO L273 TraceCheckUtils]: 49: Hoare triple {44791#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44791#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:06,035 INFO L273 TraceCheckUtils]: 50: Hoare triple {44791#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {44792#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:06,035 INFO L273 TraceCheckUtils]: 51: Hoare triple {44792#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44792#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:06,036 INFO L273 TraceCheckUtils]: 52: Hoare triple {44792#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44792#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:06,036 INFO L273 TraceCheckUtils]: 53: Hoare triple {44792#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {44793#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:06,037 INFO L273 TraceCheckUtils]: 54: Hoare triple {44793#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44793#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:06,037 INFO L273 TraceCheckUtils]: 55: Hoare triple {44793#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44793#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:06,038 INFO L273 TraceCheckUtils]: 56: Hoare triple {44793#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {44794#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:06,039 INFO L273 TraceCheckUtils]: 57: Hoare triple {44794#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44794#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:06,039 INFO L273 TraceCheckUtils]: 58: Hoare triple {44794#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44794#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:06,040 INFO L273 TraceCheckUtils]: 59: Hoare triple {44794#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {44795#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:06,040 INFO L273 TraceCheckUtils]: 60: Hoare triple {44795#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44795#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:06,041 INFO L273 TraceCheckUtils]: 61: Hoare triple {44795#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44795#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:06,042 INFO L273 TraceCheckUtils]: 62: Hoare triple {44795#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {44796#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:06,042 INFO L273 TraceCheckUtils]: 63: Hoare triple {44796#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44796#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:06,042 INFO L273 TraceCheckUtils]: 64: Hoare triple {44796#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44796#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:06,043 INFO L273 TraceCheckUtils]: 65: Hoare triple {44796#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {44797#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:06,044 INFO L273 TraceCheckUtils]: 66: Hoare triple {44797#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44797#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:06,044 INFO L273 TraceCheckUtils]: 67: Hoare triple {44797#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44797#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:06,045 INFO L273 TraceCheckUtils]: 68: Hoare triple {44797#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {44798#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:06,045 INFO L273 TraceCheckUtils]: 69: Hoare triple {44798#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44798#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:06,046 INFO L273 TraceCheckUtils]: 70: Hoare triple {44798#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44798#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:06,047 INFO L273 TraceCheckUtils]: 71: Hoare triple {44798#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {44799#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:06,047 INFO L273 TraceCheckUtils]: 72: Hoare triple {44799#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44799#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:06,048 INFO L273 TraceCheckUtils]: 73: Hoare triple {44799#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44799#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:06,048 INFO L273 TraceCheckUtils]: 74: Hoare triple {44799#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {44800#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:06,049 INFO L273 TraceCheckUtils]: 75: Hoare triple {44800#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44800#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:06,049 INFO L273 TraceCheckUtils]: 76: Hoare triple {44800#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44800#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:06,050 INFO L273 TraceCheckUtils]: 77: Hoare triple {44800#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {44801#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:06,051 INFO L273 TraceCheckUtils]: 78: Hoare triple {44801#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44801#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:06,051 INFO L273 TraceCheckUtils]: 79: Hoare triple {44801#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44801#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:06,052 INFO L273 TraceCheckUtils]: 80: Hoare triple {44801#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {44802#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:06,052 INFO L273 TraceCheckUtils]: 81: Hoare triple {44802#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44802#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:06,053 INFO L273 TraceCheckUtils]: 82: Hoare triple {44802#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44802#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:06,053 INFO L273 TraceCheckUtils]: 83: Hoare triple {44802#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {44803#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:06,054 INFO L273 TraceCheckUtils]: 84: Hoare triple {44803#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44803#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:06,054 INFO L273 TraceCheckUtils]: 85: Hoare triple {44803#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44803#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:06,055 INFO L273 TraceCheckUtils]: 86: Hoare triple {44803#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {44804#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:06,056 INFO L273 TraceCheckUtils]: 87: Hoare triple {44804#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44804#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:06,056 INFO L273 TraceCheckUtils]: 88: Hoare triple {44804#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44804#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:06,057 INFO L273 TraceCheckUtils]: 89: Hoare triple {44804#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {44805#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:06,057 INFO L273 TraceCheckUtils]: 90: Hoare triple {44805#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44805#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:06,058 INFO L273 TraceCheckUtils]: 91: Hoare triple {44805#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44805#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:06,058 INFO L273 TraceCheckUtils]: 92: Hoare triple {44805#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {44806#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:06,059 INFO L273 TraceCheckUtils]: 93: Hoare triple {44806#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44806#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:06,059 INFO L273 TraceCheckUtils]: 94: Hoare triple {44806#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44806#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:06,060 INFO L273 TraceCheckUtils]: 95: Hoare triple {44806#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {44807#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:06,061 INFO L273 TraceCheckUtils]: 96: Hoare triple {44807#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44807#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:06,061 INFO L273 TraceCheckUtils]: 97: Hoare triple {44807#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44807#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:06,062 INFO L273 TraceCheckUtils]: 98: Hoare triple {44807#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {44808#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:06,062 INFO L273 TraceCheckUtils]: 99: Hoare triple {44808#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44808#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:06,063 INFO L273 TraceCheckUtils]: 100: Hoare triple {44808#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44808#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:06,064 INFO L273 TraceCheckUtils]: 101: Hoare triple {44808#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {44809#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:06,064 INFO L273 TraceCheckUtils]: 102: Hoare triple {44809#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44809#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:06,065 INFO L273 TraceCheckUtils]: 103: Hoare triple {44809#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44809#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:06,065 INFO L273 TraceCheckUtils]: 104: Hoare triple {44809#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {44810#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:06,066 INFO L273 TraceCheckUtils]: 105: Hoare triple {44810#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44810#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:06,066 INFO L273 TraceCheckUtils]: 106: Hoare triple {44810#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44810#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:06,067 INFO L273 TraceCheckUtils]: 107: Hoare triple {44810#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {44811#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:06,067 INFO L273 TraceCheckUtils]: 108: Hoare triple {44811#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44811#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:06,068 INFO L273 TraceCheckUtils]: 109: Hoare triple {44811#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44811#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:06,069 INFO L273 TraceCheckUtils]: 110: Hoare triple {44811#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {44812#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:06,069 INFO L273 TraceCheckUtils]: 111: Hoare triple {44812#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44812#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:06,070 INFO L273 TraceCheckUtils]: 112: Hoare triple {44812#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44812#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:06,070 INFO L273 TraceCheckUtils]: 113: Hoare triple {44812#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {44813#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:06,071 INFO L273 TraceCheckUtils]: 114: Hoare triple {44813#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44813#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:06,071 INFO L273 TraceCheckUtils]: 115: Hoare triple {44813#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44813#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:06,072 INFO L273 TraceCheckUtils]: 116: Hoare triple {44813#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {44814#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:06,073 INFO L273 TraceCheckUtils]: 117: Hoare triple {44814#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44814#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:06,073 INFO L273 TraceCheckUtils]: 118: Hoare triple {44814#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44814#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:06,074 INFO L273 TraceCheckUtils]: 119: Hoare triple {44814#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {44815#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:06,074 INFO L273 TraceCheckUtils]: 120: Hoare triple {44815#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44815#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:06,075 INFO L273 TraceCheckUtils]: 121: Hoare triple {44815#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44815#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:06,075 INFO L273 TraceCheckUtils]: 122: Hoare triple {44815#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {44816#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:06,076 INFO L273 TraceCheckUtils]: 123: Hoare triple {44816#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44816#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:06,076 INFO L273 TraceCheckUtils]: 124: Hoare triple {44816#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44816#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:06,077 INFO L273 TraceCheckUtils]: 125: Hoare triple {44816#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {44817#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:06,078 INFO L273 TraceCheckUtils]: 126: Hoare triple {44817#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44817#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:06,078 INFO L273 TraceCheckUtils]: 127: Hoare triple {44817#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44817#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:06,079 INFO L273 TraceCheckUtils]: 128: Hoare triple {44817#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {44818#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:06,079 INFO L273 TraceCheckUtils]: 129: Hoare triple {44818#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44818#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:06,080 INFO L273 TraceCheckUtils]: 130: Hoare triple {44818#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44818#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:06,081 INFO L273 TraceCheckUtils]: 131: Hoare triple {44818#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {44819#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:06,081 INFO L273 TraceCheckUtils]: 132: Hoare triple {44819#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44819#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:06,082 INFO L273 TraceCheckUtils]: 133: Hoare triple {44819#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44819#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:06,082 INFO L273 TraceCheckUtils]: 134: Hoare triple {44819#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {44820#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:06,083 INFO L273 TraceCheckUtils]: 135: Hoare triple {44820#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44820#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:06,083 INFO L273 TraceCheckUtils]: 136: Hoare triple {44820#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44820#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:06,084 INFO L273 TraceCheckUtils]: 137: Hoare triple {44820#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {44821#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:06,084 INFO L273 TraceCheckUtils]: 138: Hoare triple {44821#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44821#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:06,085 INFO L273 TraceCheckUtils]: 139: Hoare triple {44821#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44821#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:06,086 INFO L273 TraceCheckUtils]: 140: Hoare triple {44821#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {44822#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:06,086 INFO L273 TraceCheckUtils]: 141: Hoare triple {44822#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44822#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:06,087 INFO L273 TraceCheckUtils]: 142: Hoare triple {44822#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44822#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:06,087 INFO L273 TraceCheckUtils]: 143: Hoare triple {44822#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {44823#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:06,088 INFO L273 TraceCheckUtils]: 144: Hoare triple {44823#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44823#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:06,088 INFO L273 TraceCheckUtils]: 145: Hoare triple {44823#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44823#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:06,089 INFO L273 TraceCheckUtils]: 146: Hoare triple {44823#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {44824#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:06,090 INFO L273 TraceCheckUtils]: 147: Hoare triple {44824#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44824#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:06,090 INFO L273 TraceCheckUtils]: 148: Hoare triple {44824#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44824#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:06,091 INFO L273 TraceCheckUtils]: 149: Hoare triple {44824#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {44825#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:06,091 INFO L273 TraceCheckUtils]: 150: Hoare triple {44825#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44825#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:06,092 INFO L273 TraceCheckUtils]: 151: Hoare triple {44825#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44825#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:06,092 INFO L273 TraceCheckUtils]: 152: Hoare triple {44825#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {44826#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:06,093 INFO L273 TraceCheckUtils]: 153: Hoare triple {44826#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44826#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:06,093 INFO L273 TraceCheckUtils]: 154: Hoare triple {44826#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44826#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:06,094 INFO L273 TraceCheckUtils]: 155: Hoare triple {44826#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {44827#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:06,095 INFO L273 TraceCheckUtils]: 156: Hoare triple {44827#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44827#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:06,095 INFO L273 TraceCheckUtils]: 157: Hoare triple {44827#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44827#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:06,096 INFO L273 TraceCheckUtils]: 158: Hoare triple {44827#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {44828#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:06,096 INFO L273 TraceCheckUtils]: 159: Hoare triple {44828#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44828#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:06,097 INFO L273 TraceCheckUtils]: 160: Hoare triple {44828#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44828#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:06,097 INFO L273 TraceCheckUtils]: 161: Hoare triple {44828#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {44829#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:06,098 INFO L273 TraceCheckUtils]: 162: Hoare triple {44829#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44829#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:06,098 INFO L273 TraceCheckUtils]: 163: Hoare triple {44829#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44829#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:06,099 INFO L273 TraceCheckUtils]: 164: Hoare triple {44829#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {44830#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:06,100 INFO L273 TraceCheckUtils]: 165: Hoare triple {44830#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44830#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:06,100 INFO L273 TraceCheckUtils]: 166: Hoare triple {44830#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44830#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:06,101 INFO L273 TraceCheckUtils]: 167: Hoare triple {44830#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {44831#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:06,101 INFO L273 TraceCheckUtils]: 168: Hoare triple {44831#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44831#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:06,102 INFO L273 TraceCheckUtils]: 169: Hoare triple {44831#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44831#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:06,103 INFO L273 TraceCheckUtils]: 170: Hoare triple {44831#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {44832#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:06,103 INFO L273 TraceCheckUtils]: 171: Hoare triple {44832#(<= main_~i~0 55)} assume !(~i~0 < 100000); {44776#false} is VALID [2018-11-23 12:07:06,103 INFO L273 TraceCheckUtils]: 172: Hoare triple {44776#false} havoc ~x~0;~x~0 := 0; {44776#false} is VALID [2018-11-23 12:07:06,104 INFO L273 TraceCheckUtils]: 173: Hoare triple {44776#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {44776#false} is VALID [2018-11-23 12:07:06,104 INFO L256 TraceCheckUtils]: 174: Hoare triple {44776#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {44776#false} is VALID [2018-11-23 12:07:06,104 INFO L273 TraceCheckUtils]: 175: Hoare triple {44776#false} ~cond := #in~cond; {44776#false} is VALID [2018-11-23 12:07:06,104 INFO L273 TraceCheckUtils]: 176: Hoare triple {44776#false} assume 0 == ~cond; {44776#false} is VALID [2018-11-23 12:07:06,104 INFO L273 TraceCheckUtils]: 177: Hoare triple {44776#false} assume !false; {44776#false} is VALID [2018-11-23 12:07:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:06,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:06,124 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:06,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:06,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:07,669 INFO L256 TraceCheckUtils]: 0: Hoare triple {44775#true} call ULTIMATE.init(); {44775#true} is VALID [2018-11-23 12:07:07,669 INFO L273 TraceCheckUtils]: 1: Hoare triple {44775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {44775#true} is VALID [2018-11-23 12:07:07,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {44775#true} assume true; {44775#true} is VALID [2018-11-23 12:07:07,670 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44775#true} {44775#true} #55#return; {44775#true} is VALID [2018-11-23 12:07:07,670 INFO L256 TraceCheckUtils]: 4: Hoare triple {44775#true} call #t~ret4 := main(); {44775#true} is VALID [2018-11-23 12:07:07,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {44775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {44851#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:07,671 INFO L273 TraceCheckUtils]: 6: Hoare triple {44851#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44851#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:07,671 INFO L273 TraceCheckUtils]: 7: Hoare triple {44851#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44851#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:07,672 INFO L273 TraceCheckUtils]: 8: Hoare triple {44851#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {44778#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:07,672 INFO L273 TraceCheckUtils]: 9: Hoare triple {44778#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44778#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:07,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {44778#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44778#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:07,673 INFO L273 TraceCheckUtils]: 11: Hoare triple {44778#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {44779#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:07,673 INFO L273 TraceCheckUtils]: 12: Hoare triple {44779#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44779#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:07,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {44779#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44779#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:07,674 INFO L273 TraceCheckUtils]: 14: Hoare triple {44779#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {44780#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:07,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {44780#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44780#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:07,675 INFO L273 TraceCheckUtils]: 16: Hoare triple {44780#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44780#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:07,676 INFO L273 TraceCheckUtils]: 17: Hoare triple {44780#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {44781#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:07,677 INFO L273 TraceCheckUtils]: 18: Hoare triple {44781#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44781#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:07,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {44781#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44781#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:07,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {44781#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {44782#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:07,678 INFO L273 TraceCheckUtils]: 21: Hoare triple {44782#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44782#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:07,679 INFO L273 TraceCheckUtils]: 22: Hoare triple {44782#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44782#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:07,680 INFO L273 TraceCheckUtils]: 23: Hoare triple {44782#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {44783#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:07,680 INFO L273 TraceCheckUtils]: 24: Hoare triple {44783#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44783#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:07,681 INFO L273 TraceCheckUtils]: 25: Hoare triple {44783#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44783#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:07,681 INFO L273 TraceCheckUtils]: 26: Hoare triple {44783#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {44784#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:07,682 INFO L273 TraceCheckUtils]: 27: Hoare triple {44784#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44784#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:07,682 INFO L273 TraceCheckUtils]: 28: Hoare triple {44784#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44784#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:07,683 INFO L273 TraceCheckUtils]: 29: Hoare triple {44784#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {44785#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:07,684 INFO L273 TraceCheckUtils]: 30: Hoare triple {44785#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44785#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:07,684 INFO L273 TraceCheckUtils]: 31: Hoare triple {44785#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44785#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:07,685 INFO L273 TraceCheckUtils]: 32: Hoare triple {44785#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {44786#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:07,685 INFO L273 TraceCheckUtils]: 33: Hoare triple {44786#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44786#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:07,686 INFO L273 TraceCheckUtils]: 34: Hoare triple {44786#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44786#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:07,686 INFO L273 TraceCheckUtils]: 35: Hoare triple {44786#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {44787#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:07,687 INFO L273 TraceCheckUtils]: 36: Hoare triple {44787#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44787#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:07,687 INFO L273 TraceCheckUtils]: 37: Hoare triple {44787#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44787#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:07,688 INFO L273 TraceCheckUtils]: 38: Hoare triple {44787#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {44788#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:07,689 INFO L273 TraceCheckUtils]: 39: Hoare triple {44788#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44788#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:07,689 INFO L273 TraceCheckUtils]: 40: Hoare triple {44788#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44788#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:07,690 INFO L273 TraceCheckUtils]: 41: Hoare triple {44788#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {44789#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:07,690 INFO L273 TraceCheckUtils]: 42: Hoare triple {44789#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44789#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:07,691 INFO L273 TraceCheckUtils]: 43: Hoare triple {44789#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44789#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:07,692 INFO L273 TraceCheckUtils]: 44: Hoare triple {44789#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {44790#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:07,692 INFO L273 TraceCheckUtils]: 45: Hoare triple {44790#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44790#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:07,693 INFO L273 TraceCheckUtils]: 46: Hoare triple {44790#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44790#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:07,693 INFO L273 TraceCheckUtils]: 47: Hoare triple {44790#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {44791#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:07,694 INFO L273 TraceCheckUtils]: 48: Hoare triple {44791#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44791#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:07,694 INFO L273 TraceCheckUtils]: 49: Hoare triple {44791#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44791#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:07,695 INFO L273 TraceCheckUtils]: 50: Hoare triple {44791#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {44792#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:07,695 INFO L273 TraceCheckUtils]: 51: Hoare triple {44792#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44792#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:07,696 INFO L273 TraceCheckUtils]: 52: Hoare triple {44792#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44792#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:07,697 INFO L273 TraceCheckUtils]: 53: Hoare triple {44792#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {44793#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:07,697 INFO L273 TraceCheckUtils]: 54: Hoare triple {44793#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44793#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:07,698 INFO L273 TraceCheckUtils]: 55: Hoare triple {44793#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44793#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:07,698 INFO L273 TraceCheckUtils]: 56: Hoare triple {44793#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {44794#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:07,699 INFO L273 TraceCheckUtils]: 57: Hoare triple {44794#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44794#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:07,699 INFO L273 TraceCheckUtils]: 58: Hoare triple {44794#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44794#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:07,700 INFO L273 TraceCheckUtils]: 59: Hoare triple {44794#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {44795#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:07,701 INFO L273 TraceCheckUtils]: 60: Hoare triple {44795#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44795#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:07,701 INFO L273 TraceCheckUtils]: 61: Hoare triple {44795#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44795#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:07,702 INFO L273 TraceCheckUtils]: 62: Hoare triple {44795#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {44796#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:07,702 INFO L273 TraceCheckUtils]: 63: Hoare triple {44796#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44796#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:07,703 INFO L273 TraceCheckUtils]: 64: Hoare triple {44796#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44796#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:07,703 INFO L273 TraceCheckUtils]: 65: Hoare triple {44796#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {44797#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:07,704 INFO L273 TraceCheckUtils]: 66: Hoare triple {44797#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44797#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:07,704 INFO L273 TraceCheckUtils]: 67: Hoare triple {44797#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44797#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:07,705 INFO L273 TraceCheckUtils]: 68: Hoare triple {44797#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {44798#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:07,706 INFO L273 TraceCheckUtils]: 69: Hoare triple {44798#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44798#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:07,706 INFO L273 TraceCheckUtils]: 70: Hoare triple {44798#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44798#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:07,707 INFO L273 TraceCheckUtils]: 71: Hoare triple {44798#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {44799#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:07,707 INFO L273 TraceCheckUtils]: 72: Hoare triple {44799#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44799#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:07,708 INFO L273 TraceCheckUtils]: 73: Hoare triple {44799#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44799#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:07,709 INFO L273 TraceCheckUtils]: 74: Hoare triple {44799#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {44800#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:07,709 INFO L273 TraceCheckUtils]: 75: Hoare triple {44800#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44800#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:07,710 INFO L273 TraceCheckUtils]: 76: Hoare triple {44800#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44800#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:07,710 INFO L273 TraceCheckUtils]: 77: Hoare triple {44800#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {44801#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:07,711 INFO L273 TraceCheckUtils]: 78: Hoare triple {44801#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44801#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:07,711 INFO L273 TraceCheckUtils]: 79: Hoare triple {44801#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44801#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:07,712 INFO L273 TraceCheckUtils]: 80: Hoare triple {44801#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {44802#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:07,713 INFO L273 TraceCheckUtils]: 81: Hoare triple {44802#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44802#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:07,713 INFO L273 TraceCheckUtils]: 82: Hoare triple {44802#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44802#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:07,714 INFO L273 TraceCheckUtils]: 83: Hoare triple {44802#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {44803#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:07,714 INFO L273 TraceCheckUtils]: 84: Hoare triple {44803#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44803#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:07,715 INFO L273 TraceCheckUtils]: 85: Hoare triple {44803#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44803#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:07,715 INFO L273 TraceCheckUtils]: 86: Hoare triple {44803#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {44804#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:07,716 INFO L273 TraceCheckUtils]: 87: Hoare triple {44804#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44804#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:07,716 INFO L273 TraceCheckUtils]: 88: Hoare triple {44804#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44804#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:07,717 INFO L273 TraceCheckUtils]: 89: Hoare triple {44804#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {44805#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:07,718 INFO L273 TraceCheckUtils]: 90: Hoare triple {44805#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44805#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:07,718 INFO L273 TraceCheckUtils]: 91: Hoare triple {44805#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44805#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:07,719 INFO L273 TraceCheckUtils]: 92: Hoare triple {44805#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {44806#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:07,719 INFO L273 TraceCheckUtils]: 93: Hoare triple {44806#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44806#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:07,720 INFO L273 TraceCheckUtils]: 94: Hoare triple {44806#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44806#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:07,721 INFO L273 TraceCheckUtils]: 95: Hoare triple {44806#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {44807#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:07,721 INFO L273 TraceCheckUtils]: 96: Hoare triple {44807#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44807#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:07,722 INFO L273 TraceCheckUtils]: 97: Hoare triple {44807#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44807#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:07,722 INFO L273 TraceCheckUtils]: 98: Hoare triple {44807#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {44808#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:07,723 INFO L273 TraceCheckUtils]: 99: Hoare triple {44808#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44808#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:07,723 INFO L273 TraceCheckUtils]: 100: Hoare triple {44808#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44808#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:07,724 INFO L273 TraceCheckUtils]: 101: Hoare triple {44808#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {44809#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:07,724 INFO L273 TraceCheckUtils]: 102: Hoare triple {44809#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44809#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:07,725 INFO L273 TraceCheckUtils]: 103: Hoare triple {44809#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44809#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:07,726 INFO L273 TraceCheckUtils]: 104: Hoare triple {44809#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {44810#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:07,726 INFO L273 TraceCheckUtils]: 105: Hoare triple {44810#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44810#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:07,727 INFO L273 TraceCheckUtils]: 106: Hoare triple {44810#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44810#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:07,727 INFO L273 TraceCheckUtils]: 107: Hoare triple {44810#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {44811#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:07,728 INFO L273 TraceCheckUtils]: 108: Hoare triple {44811#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44811#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:07,728 INFO L273 TraceCheckUtils]: 109: Hoare triple {44811#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44811#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:07,729 INFO L273 TraceCheckUtils]: 110: Hoare triple {44811#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {44812#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:07,730 INFO L273 TraceCheckUtils]: 111: Hoare triple {44812#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44812#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:07,730 INFO L273 TraceCheckUtils]: 112: Hoare triple {44812#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44812#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:07,731 INFO L273 TraceCheckUtils]: 113: Hoare triple {44812#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {44813#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:07,731 INFO L273 TraceCheckUtils]: 114: Hoare triple {44813#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44813#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:07,732 INFO L273 TraceCheckUtils]: 115: Hoare triple {44813#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44813#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:07,732 INFO L273 TraceCheckUtils]: 116: Hoare triple {44813#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {44814#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:07,733 INFO L273 TraceCheckUtils]: 117: Hoare triple {44814#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44814#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:07,733 INFO L273 TraceCheckUtils]: 118: Hoare triple {44814#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44814#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:07,734 INFO L273 TraceCheckUtils]: 119: Hoare triple {44814#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {44815#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:07,735 INFO L273 TraceCheckUtils]: 120: Hoare triple {44815#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44815#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:07,735 INFO L273 TraceCheckUtils]: 121: Hoare triple {44815#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44815#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:07,736 INFO L273 TraceCheckUtils]: 122: Hoare triple {44815#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {44816#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:07,736 INFO L273 TraceCheckUtils]: 123: Hoare triple {44816#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44816#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:07,737 INFO L273 TraceCheckUtils]: 124: Hoare triple {44816#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44816#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:07,738 INFO L273 TraceCheckUtils]: 125: Hoare triple {44816#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {44817#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:07,738 INFO L273 TraceCheckUtils]: 126: Hoare triple {44817#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44817#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:07,739 INFO L273 TraceCheckUtils]: 127: Hoare triple {44817#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44817#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:07,739 INFO L273 TraceCheckUtils]: 128: Hoare triple {44817#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {44818#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:07,740 INFO L273 TraceCheckUtils]: 129: Hoare triple {44818#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44818#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:07,740 INFO L273 TraceCheckUtils]: 130: Hoare triple {44818#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44818#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:07,741 INFO L273 TraceCheckUtils]: 131: Hoare triple {44818#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {44819#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:07,741 INFO L273 TraceCheckUtils]: 132: Hoare triple {44819#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44819#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:07,742 INFO L273 TraceCheckUtils]: 133: Hoare triple {44819#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44819#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:07,743 INFO L273 TraceCheckUtils]: 134: Hoare triple {44819#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {44820#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:07,743 INFO L273 TraceCheckUtils]: 135: Hoare triple {44820#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44820#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:07,744 INFO L273 TraceCheckUtils]: 136: Hoare triple {44820#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44820#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:07,744 INFO L273 TraceCheckUtils]: 137: Hoare triple {44820#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {44821#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:07,745 INFO L273 TraceCheckUtils]: 138: Hoare triple {44821#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44821#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:07,745 INFO L273 TraceCheckUtils]: 139: Hoare triple {44821#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44821#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:07,746 INFO L273 TraceCheckUtils]: 140: Hoare triple {44821#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {44822#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:07,747 INFO L273 TraceCheckUtils]: 141: Hoare triple {44822#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44822#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:07,747 INFO L273 TraceCheckUtils]: 142: Hoare triple {44822#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44822#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:07,748 INFO L273 TraceCheckUtils]: 143: Hoare triple {44822#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {44823#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:07,748 INFO L273 TraceCheckUtils]: 144: Hoare triple {44823#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44823#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:07,749 INFO L273 TraceCheckUtils]: 145: Hoare triple {44823#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44823#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:07,749 INFO L273 TraceCheckUtils]: 146: Hoare triple {44823#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {44824#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:07,750 INFO L273 TraceCheckUtils]: 147: Hoare triple {44824#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44824#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:07,750 INFO L273 TraceCheckUtils]: 148: Hoare triple {44824#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44824#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:07,751 INFO L273 TraceCheckUtils]: 149: Hoare triple {44824#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {44825#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:07,752 INFO L273 TraceCheckUtils]: 150: Hoare triple {44825#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44825#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:07,752 INFO L273 TraceCheckUtils]: 151: Hoare triple {44825#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44825#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:07,753 INFO L273 TraceCheckUtils]: 152: Hoare triple {44825#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {44826#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:07,753 INFO L273 TraceCheckUtils]: 153: Hoare triple {44826#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44826#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:07,754 INFO L273 TraceCheckUtils]: 154: Hoare triple {44826#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44826#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:07,755 INFO L273 TraceCheckUtils]: 155: Hoare triple {44826#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {44827#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:07,755 INFO L273 TraceCheckUtils]: 156: Hoare triple {44827#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44827#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:07,756 INFO L273 TraceCheckUtils]: 157: Hoare triple {44827#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44827#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:07,756 INFO L273 TraceCheckUtils]: 158: Hoare triple {44827#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {44828#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:07,757 INFO L273 TraceCheckUtils]: 159: Hoare triple {44828#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44828#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:07,757 INFO L273 TraceCheckUtils]: 160: Hoare triple {44828#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44828#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:07,758 INFO L273 TraceCheckUtils]: 161: Hoare triple {44828#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {44829#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:07,758 INFO L273 TraceCheckUtils]: 162: Hoare triple {44829#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44829#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:07,759 INFO L273 TraceCheckUtils]: 163: Hoare triple {44829#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44829#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:07,760 INFO L273 TraceCheckUtils]: 164: Hoare triple {44829#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {44830#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:07,760 INFO L273 TraceCheckUtils]: 165: Hoare triple {44830#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44830#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:07,761 INFO L273 TraceCheckUtils]: 166: Hoare triple {44830#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44830#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:07,761 INFO L273 TraceCheckUtils]: 167: Hoare triple {44830#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {44831#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:07,762 INFO L273 TraceCheckUtils]: 168: Hoare triple {44831#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44831#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:07,762 INFO L273 TraceCheckUtils]: 169: Hoare triple {44831#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {44831#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:07,763 INFO L273 TraceCheckUtils]: 170: Hoare triple {44831#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {44832#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:07,764 INFO L273 TraceCheckUtils]: 171: Hoare triple {44832#(<= main_~i~0 55)} assume !(~i~0 < 100000); {44776#false} is VALID [2018-11-23 12:07:07,764 INFO L273 TraceCheckUtils]: 172: Hoare triple {44776#false} havoc ~x~0;~x~0 := 0; {44776#false} is VALID [2018-11-23 12:07:07,764 INFO L273 TraceCheckUtils]: 173: Hoare triple {44776#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {44776#false} is VALID [2018-11-23 12:07:07,764 INFO L256 TraceCheckUtils]: 174: Hoare triple {44776#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {44776#false} is VALID [2018-11-23 12:07:07,764 INFO L273 TraceCheckUtils]: 175: Hoare triple {44776#false} ~cond := #in~cond; {44776#false} is VALID [2018-11-23 12:07:07,765 INFO L273 TraceCheckUtils]: 176: Hoare triple {44776#false} assume 0 == ~cond; {44776#false} is VALID [2018-11-23 12:07:07,765 INFO L273 TraceCheckUtils]: 177: Hoare triple {44776#false} assume !false; {44776#false} is VALID [2018-11-23 12:07:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:07,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:07,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2018-11-23 12:07:07,805 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 178 [2018-11-23 12:07:07,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:07,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states. [2018-11-23 12:07:07,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:07,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-23 12:07:07,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-23 12:07:07,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 12:07:07,983 INFO L87 Difference]: Start difference. First operand 183 states and 239 transitions. Second operand 59 states. [2018-11-23 12:07:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:08,937 INFO L93 Difference]: Finished difference Result 199 states and 258 transitions. [2018-11-23 12:07:08,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-23 12:07:08,937 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 178 [2018-11-23 12:07:08,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:07:08,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 258 transitions. [2018-11-23 12:07:08,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:07:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 258 transitions. [2018-11-23 12:07:08,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 258 transitions. [2018-11-23 12:07:09,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:09,194 INFO L225 Difference]: With dead ends: 199 [2018-11-23 12:07:09,195 INFO L226 Difference]: Without dead ends: 188 [2018-11-23 12:07:09,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 12:07:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-23 12:07:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-11-23 12:07:09,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:09,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 186 states. [2018-11-23 12:07:09,368 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 186 states. [2018-11-23 12:07:09,368 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 186 states. [2018-11-23 12:07:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:09,371 INFO L93 Difference]: Finished difference Result 188 states and 246 transitions. [2018-11-23 12:07:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2018-11-23 12:07:09,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:09,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:09,371 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 188 states. [2018-11-23 12:07:09,371 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 188 states. [2018-11-23 12:07:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:09,374 INFO L93 Difference]: Finished difference Result 188 states and 246 transitions. [2018-11-23 12:07:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2018-11-23 12:07:09,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:09,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:09,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:09,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-23 12:07:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 243 transitions. [2018-11-23 12:07:09,376 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 243 transitions. Word has length 178 [2018-11-23 12:07:09,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:09,377 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 243 transitions. [2018-11-23 12:07:09,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-23 12:07:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 243 transitions. [2018-11-23 12:07:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-23 12:07:09,377 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:09,378 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:09,378 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:09,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1867070023, now seen corresponding path program 56 times [2018-11-23 12:07:09,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:09,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:09,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:09,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:09,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:11,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {46259#true} call ULTIMATE.init(); {46259#true} is VALID [2018-11-23 12:07:11,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {46259#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {46259#true} is VALID [2018-11-23 12:07:11,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {46259#true} assume true; {46259#true} is VALID [2018-11-23 12:07:11,344 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46259#true} {46259#true} #55#return; {46259#true} is VALID [2018-11-23 12:07:11,344 INFO L256 TraceCheckUtils]: 4: Hoare triple {46259#true} call #t~ret4 := main(); {46259#true} is VALID [2018-11-23 12:07:11,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {46259#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {46261#(= main_~i~0 0)} is VALID [2018-11-23 12:07:11,345 INFO L273 TraceCheckUtils]: 6: Hoare triple {46261#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46261#(= main_~i~0 0)} is VALID [2018-11-23 12:07:11,346 INFO L273 TraceCheckUtils]: 7: Hoare triple {46261#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46261#(= main_~i~0 0)} is VALID [2018-11-23 12:07:11,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {46261#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {46262#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:11,347 INFO L273 TraceCheckUtils]: 9: Hoare triple {46262#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46262#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:11,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {46262#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46262#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:11,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {46262#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {46263#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:11,348 INFO L273 TraceCheckUtils]: 12: Hoare triple {46263#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46263#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:11,349 INFO L273 TraceCheckUtils]: 13: Hoare triple {46263#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46263#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:11,350 INFO L273 TraceCheckUtils]: 14: Hoare triple {46263#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {46264#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:11,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {46264#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46264#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:11,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {46264#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46264#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:11,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {46264#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {46265#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:11,352 INFO L273 TraceCheckUtils]: 18: Hoare triple {46265#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46265#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:11,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {46265#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46265#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:11,353 INFO L273 TraceCheckUtils]: 20: Hoare triple {46265#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {46266#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:11,353 INFO L273 TraceCheckUtils]: 21: Hoare triple {46266#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46266#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:11,354 INFO L273 TraceCheckUtils]: 22: Hoare triple {46266#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46266#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:11,354 INFO L273 TraceCheckUtils]: 23: Hoare triple {46266#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {46267#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:11,355 INFO L273 TraceCheckUtils]: 24: Hoare triple {46267#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46267#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:11,355 INFO L273 TraceCheckUtils]: 25: Hoare triple {46267#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46267#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:11,356 INFO L273 TraceCheckUtils]: 26: Hoare triple {46267#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {46268#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:11,357 INFO L273 TraceCheckUtils]: 27: Hoare triple {46268#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46268#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:11,357 INFO L273 TraceCheckUtils]: 28: Hoare triple {46268#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46268#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:11,358 INFO L273 TraceCheckUtils]: 29: Hoare triple {46268#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {46269#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:11,358 INFO L273 TraceCheckUtils]: 30: Hoare triple {46269#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46269#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:11,359 INFO L273 TraceCheckUtils]: 31: Hoare triple {46269#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46269#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:11,360 INFO L273 TraceCheckUtils]: 32: Hoare triple {46269#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {46270#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:11,360 INFO L273 TraceCheckUtils]: 33: Hoare triple {46270#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46270#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:11,361 INFO L273 TraceCheckUtils]: 34: Hoare triple {46270#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46270#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:11,361 INFO L273 TraceCheckUtils]: 35: Hoare triple {46270#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {46271#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:11,362 INFO L273 TraceCheckUtils]: 36: Hoare triple {46271#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46271#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:11,362 INFO L273 TraceCheckUtils]: 37: Hoare triple {46271#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46271#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:11,363 INFO L273 TraceCheckUtils]: 38: Hoare triple {46271#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {46272#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:11,363 INFO L273 TraceCheckUtils]: 39: Hoare triple {46272#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46272#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:11,364 INFO L273 TraceCheckUtils]: 40: Hoare triple {46272#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46272#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:11,365 INFO L273 TraceCheckUtils]: 41: Hoare triple {46272#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {46273#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:11,365 INFO L273 TraceCheckUtils]: 42: Hoare triple {46273#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46273#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:11,366 INFO L273 TraceCheckUtils]: 43: Hoare triple {46273#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46273#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:11,366 INFO L273 TraceCheckUtils]: 44: Hoare triple {46273#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {46274#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:11,367 INFO L273 TraceCheckUtils]: 45: Hoare triple {46274#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46274#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:11,367 INFO L273 TraceCheckUtils]: 46: Hoare triple {46274#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46274#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:11,368 INFO L273 TraceCheckUtils]: 47: Hoare triple {46274#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {46275#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:11,369 INFO L273 TraceCheckUtils]: 48: Hoare triple {46275#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46275#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:11,369 INFO L273 TraceCheckUtils]: 49: Hoare triple {46275#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46275#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:11,370 INFO L273 TraceCheckUtils]: 50: Hoare triple {46275#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {46276#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:11,370 INFO L273 TraceCheckUtils]: 51: Hoare triple {46276#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46276#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:11,371 INFO L273 TraceCheckUtils]: 52: Hoare triple {46276#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46276#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:11,371 INFO L273 TraceCheckUtils]: 53: Hoare triple {46276#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {46277#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:11,372 INFO L273 TraceCheckUtils]: 54: Hoare triple {46277#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46277#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:11,372 INFO L273 TraceCheckUtils]: 55: Hoare triple {46277#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46277#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:11,373 INFO L273 TraceCheckUtils]: 56: Hoare triple {46277#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {46278#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:11,374 INFO L273 TraceCheckUtils]: 57: Hoare triple {46278#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46278#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:11,374 INFO L273 TraceCheckUtils]: 58: Hoare triple {46278#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46278#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:11,375 INFO L273 TraceCheckUtils]: 59: Hoare triple {46278#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {46279#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:11,375 INFO L273 TraceCheckUtils]: 60: Hoare triple {46279#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46279#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:11,376 INFO L273 TraceCheckUtils]: 61: Hoare triple {46279#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46279#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:11,377 INFO L273 TraceCheckUtils]: 62: Hoare triple {46279#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {46280#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:11,377 INFO L273 TraceCheckUtils]: 63: Hoare triple {46280#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46280#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:11,378 INFO L273 TraceCheckUtils]: 64: Hoare triple {46280#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46280#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:11,378 INFO L273 TraceCheckUtils]: 65: Hoare triple {46280#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {46281#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:11,379 INFO L273 TraceCheckUtils]: 66: Hoare triple {46281#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46281#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:11,379 INFO L273 TraceCheckUtils]: 67: Hoare triple {46281#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46281#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:11,380 INFO L273 TraceCheckUtils]: 68: Hoare triple {46281#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {46282#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:11,380 INFO L273 TraceCheckUtils]: 69: Hoare triple {46282#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46282#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:11,381 INFO L273 TraceCheckUtils]: 70: Hoare triple {46282#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46282#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:11,382 INFO L273 TraceCheckUtils]: 71: Hoare triple {46282#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {46283#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:11,382 INFO L273 TraceCheckUtils]: 72: Hoare triple {46283#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46283#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:11,383 INFO L273 TraceCheckUtils]: 73: Hoare triple {46283#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46283#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:11,383 INFO L273 TraceCheckUtils]: 74: Hoare triple {46283#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {46284#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:11,384 INFO L273 TraceCheckUtils]: 75: Hoare triple {46284#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46284#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:11,384 INFO L273 TraceCheckUtils]: 76: Hoare triple {46284#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46284#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:11,385 INFO L273 TraceCheckUtils]: 77: Hoare triple {46284#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {46285#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:11,386 INFO L273 TraceCheckUtils]: 78: Hoare triple {46285#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46285#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:11,386 INFO L273 TraceCheckUtils]: 79: Hoare triple {46285#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46285#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:11,387 INFO L273 TraceCheckUtils]: 80: Hoare triple {46285#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {46286#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:11,387 INFO L273 TraceCheckUtils]: 81: Hoare triple {46286#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46286#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:11,388 INFO L273 TraceCheckUtils]: 82: Hoare triple {46286#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46286#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:11,388 INFO L273 TraceCheckUtils]: 83: Hoare triple {46286#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {46287#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:11,389 INFO L273 TraceCheckUtils]: 84: Hoare triple {46287#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46287#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:11,389 INFO L273 TraceCheckUtils]: 85: Hoare triple {46287#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46287#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:11,390 INFO L273 TraceCheckUtils]: 86: Hoare triple {46287#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {46288#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:11,391 INFO L273 TraceCheckUtils]: 87: Hoare triple {46288#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46288#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:11,391 INFO L273 TraceCheckUtils]: 88: Hoare triple {46288#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46288#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:11,392 INFO L273 TraceCheckUtils]: 89: Hoare triple {46288#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {46289#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:11,392 INFO L273 TraceCheckUtils]: 90: Hoare triple {46289#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46289#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:11,393 INFO L273 TraceCheckUtils]: 91: Hoare triple {46289#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46289#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:11,394 INFO L273 TraceCheckUtils]: 92: Hoare triple {46289#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {46290#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:11,394 INFO L273 TraceCheckUtils]: 93: Hoare triple {46290#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46290#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:11,395 INFO L273 TraceCheckUtils]: 94: Hoare triple {46290#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46290#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:11,395 INFO L273 TraceCheckUtils]: 95: Hoare triple {46290#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {46291#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:11,396 INFO L273 TraceCheckUtils]: 96: Hoare triple {46291#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46291#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:11,396 INFO L273 TraceCheckUtils]: 97: Hoare triple {46291#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46291#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:11,397 INFO L273 TraceCheckUtils]: 98: Hoare triple {46291#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {46292#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:11,398 INFO L273 TraceCheckUtils]: 99: Hoare triple {46292#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46292#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:11,398 INFO L273 TraceCheckUtils]: 100: Hoare triple {46292#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46292#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:11,399 INFO L273 TraceCheckUtils]: 101: Hoare triple {46292#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {46293#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:11,399 INFO L273 TraceCheckUtils]: 102: Hoare triple {46293#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46293#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:11,400 INFO L273 TraceCheckUtils]: 103: Hoare triple {46293#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46293#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:11,400 INFO L273 TraceCheckUtils]: 104: Hoare triple {46293#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {46294#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:11,401 INFO L273 TraceCheckUtils]: 105: Hoare triple {46294#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46294#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:11,401 INFO L273 TraceCheckUtils]: 106: Hoare triple {46294#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46294#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:11,402 INFO L273 TraceCheckUtils]: 107: Hoare triple {46294#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {46295#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:11,403 INFO L273 TraceCheckUtils]: 108: Hoare triple {46295#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46295#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:11,403 INFO L273 TraceCheckUtils]: 109: Hoare triple {46295#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46295#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:11,404 INFO L273 TraceCheckUtils]: 110: Hoare triple {46295#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {46296#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:11,404 INFO L273 TraceCheckUtils]: 111: Hoare triple {46296#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46296#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:11,405 INFO L273 TraceCheckUtils]: 112: Hoare triple {46296#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46296#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:11,405 INFO L273 TraceCheckUtils]: 113: Hoare triple {46296#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {46297#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:11,406 INFO L273 TraceCheckUtils]: 114: Hoare triple {46297#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46297#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:11,406 INFO L273 TraceCheckUtils]: 115: Hoare triple {46297#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46297#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:11,407 INFO L273 TraceCheckUtils]: 116: Hoare triple {46297#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {46298#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:11,407 INFO L273 TraceCheckUtils]: 117: Hoare triple {46298#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46298#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:11,408 INFO L273 TraceCheckUtils]: 118: Hoare triple {46298#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46298#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:11,409 INFO L273 TraceCheckUtils]: 119: Hoare triple {46298#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {46299#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:11,409 INFO L273 TraceCheckUtils]: 120: Hoare triple {46299#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46299#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:11,410 INFO L273 TraceCheckUtils]: 121: Hoare triple {46299#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46299#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:11,410 INFO L273 TraceCheckUtils]: 122: Hoare triple {46299#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {46300#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:11,411 INFO L273 TraceCheckUtils]: 123: Hoare triple {46300#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46300#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:11,411 INFO L273 TraceCheckUtils]: 124: Hoare triple {46300#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46300#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:11,412 INFO L273 TraceCheckUtils]: 125: Hoare triple {46300#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {46301#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:11,412 INFO L273 TraceCheckUtils]: 126: Hoare triple {46301#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46301#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:11,413 INFO L273 TraceCheckUtils]: 127: Hoare triple {46301#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46301#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:11,413 INFO L273 TraceCheckUtils]: 128: Hoare triple {46301#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {46302#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:11,414 INFO L273 TraceCheckUtils]: 129: Hoare triple {46302#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46302#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:11,414 INFO L273 TraceCheckUtils]: 130: Hoare triple {46302#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46302#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:11,415 INFO L273 TraceCheckUtils]: 131: Hoare triple {46302#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {46303#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:11,416 INFO L273 TraceCheckUtils]: 132: Hoare triple {46303#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46303#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:11,416 INFO L273 TraceCheckUtils]: 133: Hoare triple {46303#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46303#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:11,417 INFO L273 TraceCheckUtils]: 134: Hoare triple {46303#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {46304#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:11,417 INFO L273 TraceCheckUtils]: 135: Hoare triple {46304#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46304#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:11,418 INFO L273 TraceCheckUtils]: 136: Hoare triple {46304#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46304#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:11,418 INFO L273 TraceCheckUtils]: 137: Hoare triple {46304#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {46305#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:11,419 INFO L273 TraceCheckUtils]: 138: Hoare triple {46305#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46305#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:11,419 INFO L273 TraceCheckUtils]: 139: Hoare triple {46305#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46305#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:11,420 INFO L273 TraceCheckUtils]: 140: Hoare triple {46305#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {46306#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:11,420 INFO L273 TraceCheckUtils]: 141: Hoare triple {46306#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46306#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:11,421 INFO L273 TraceCheckUtils]: 142: Hoare triple {46306#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46306#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:11,421 INFO L273 TraceCheckUtils]: 143: Hoare triple {46306#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {46307#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:11,422 INFO L273 TraceCheckUtils]: 144: Hoare triple {46307#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46307#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:11,422 INFO L273 TraceCheckUtils]: 145: Hoare triple {46307#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46307#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:11,423 INFO L273 TraceCheckUtils]: 146: Hoare triple {46307#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {46308#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:11,424 INFO L273 TraceCheckUtils]: 147: Hoare triple {46308#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46308#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:11,424 INFO L273 TraceCheckUtils]: 148: Hoare triple {46308#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46308#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:11,425 INFO L273 TraceCheckUtils]: 149: Hoare triple {46308#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {46309#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:11,425 INFO L273 TraceCheckUtils]: 150: Hoare triple {46309#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46309#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:11,426 INFO L273 TraceCheckUtils]: 151: Hoare triple {46309#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46309#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:11,426 INFO L273 TraceCheckUtils]: 152: Hoare triple {46309#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {46310#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:11,427 INFO L273 TraceCheckUtils]: 153: Hoare triple {46310#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46310#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:11,427 INFO L273 TraceCheckUtils]: 154: Hoare triple {46310#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46310#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:11,428 INFO L273 TraceCheckUtils]: 155: Hoare triple {46310#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {46311#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:11,429 INFO L273 TraceCheckUtils]: 156: Hoare triple {46311#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46311#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:11,429 INFO L273 TraceCheckUtils]: 157: Hoare triple {46311#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46311#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:11,430 INFO L273 TraceCheckUtils]: 158: Hoare triple {46311#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {46312#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:11,430 INFO L273 TraceCheckUtils]: 159: Hoare triple {46312#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46312#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:11,431 INFO L273 TraceCheckUtils]: 160: Hoare triple {46312#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46312#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:11,431 INFO L273 TraceCheckUtils]: 161: Hoare triple {46312#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {46313#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:11,432 INFO L273 TraceCheckUtils]: 162: Hoare triple {46313#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46313#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:11,432 INFO L273 TraceCheckUtils]: 163: Hoare triple {46313#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46313#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:11,433 INFO L273 TraceCheckUtils]: 164: Hoare triple {46313#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {46314#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:11,433 INFO L273 TraceCheckUtils]: 165: Hoare triple {46314#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46314#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:11,434 INFO L273 TraceCheckUtils]: 166: Hoare triple {46314#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46314#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:11,435 INFO L273 TraceCheckUtils]: 167: Hoare triple {46314#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {46315#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:11,435 INFO L273 TraceCheckUtils]: 168: Hoare triple {46315#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46315#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:11,436 INFO L273 TraceCheckUtils]: 169: Hoare triple {46315#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46315#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:11,436 INFO L273 TraceCheckUtils]: 170: Hoare triple {46315#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {46316#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:11,437 INFO L273 TraceCheckUtils]: 171: Hoare triple {46316#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46316#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:11,437 INFO L273 TraceCheckUtils]: 172: Hoare triple {46316#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46316#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:11,438 INFO L273 TraceCheckUtils]: 173: Hoare triple {46316#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {46317#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:11,439 INFO L273 TraceCheckUtils]: 174: Hoare triple {46317#(<= main_~i~0 56)} assume !(~i~0 < 100000); {46260#false} is VALID [2018-11-23 12:07:11,439 INFO L273 TraceCheckUtils]: 175: Hoare triple {46260#false} havoc ~x~0;~x~0 := 0; {46260#false} is VALID [2018-11-23 12:07:11,439 INFO L273 TraceCheckUtils]: 176: Hoare triple {46260#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {46260#false} is VALID [2018-11-23 12:07:11,439 INFO L256 TraceCheckUtils]: 177: Hoare triple {46260#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {46260#false} is VALID [2018-11-23 12:07:11,439 INFO L273 TraceCheckUtils]: 178: Hoare triple {46260#false} ~cond := #in~cond; {46260#false} is VALID [2018-11-23 12:07:11,440 INFO L273 TraceCheckUtils]: 179: Hoare triple {46260#false} assume 0 == ~cond; {46260#false} is VALID [2018-11-23 12:07:11,440 INFO L273 TraceCheckUtils]: 180: Hoare triple {46260#false} assume !false; {46260#false} is VALID [2018-11-23 12:07:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:11,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:11,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:11,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:07:11,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:07:11,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:11,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:12,126 INFO L256 TraceCheckUtils]: 0: Hoare triple {46259#true} call ULTIMATE.init(); {46259#true} is VALID [2018-11-23 12:07:12,127 INFO L273 TraceCheckUtils]: 1: Hoare triple {46259#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {46259#true} is VALID [2018-11-23 12:07:12,127 INFO L273 TraceCheckUtils]: 2: Hoare triple {46259#true} assume true; {46259#true} is VALID [2018-11-23 12:07:12,127 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46259#true} {46259#true} #55#return; {46259#true} is VALID [2018-11-23 12:07:12,127 INFO L256 TraceCheckUtils]: 4: Hoare triple {46259#true} call #t~ret4 := main(); {46259#true} is VALID [2018-11-23 12:07:12,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {46259#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {46336#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:12,128 INFO L273 TraceCheckUtils]: 6: Hoare triple {46336#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46336#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:12,129 INFO L273 TraceCheckUtils]: 7: Hoare triple {46336#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46336#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:12,130 INFO L273 TraceCheckUtils]: 8: Hoare triple {46336#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {46262#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:12,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {46262#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46262#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:12,131 INFO L273 TraceCheckUtils]: 10: Hoare triple {46262#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46262#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:12,131 INFO L273 TraceCheckUtils]: 11: Hoare triple {46262#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {46263#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:12,132 INFO L273 TraceCheckUtils]: 12: Hoare triple {46263#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46263#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:12,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {46263#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46263#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:12,133 INFO L273 TraceCheckUtils]: 14: Hoare triple {46263#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {46264#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:12,134 INFO L273 TraceCheckUtils]: 15: Hoare triple {46264#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46264#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:12,134 INFO L273 TraceCheckUtils]: 16: Hoare triple {46264#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46264#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:12,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {46264#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {46265#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:12,135 INFO L273 TraceCheckUtils]: 18: Hoare triple {46265#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46265#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:12,136 INFO L273 TraceCheckUtils]: 19: Hoare triple {46265#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46265#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:12,136 INFO L273 TraceCheckUtils]: 20: Hoare triple {46265#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {46266#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:12,137 INFO L273 TraceCheckUtils]: 21: Hoare triple {46266#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46266#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:12,137 INFO L273 TraceCheckUtils]: 22: Hoare triple {46266#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46266#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:12,138 INFO L273 TraceCheckUtils]: 23: Hoare triple {46266#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {46267#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:12,139 INFO L273 TraceCheckUtils]: 24: Hoare triple {46267#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46267#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:12,139 INFO L273 TraceCheckUtils]: 25: Hoare triple {46267#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46267#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:12,140 INFO L273 TraceCheckUtils]: 26: Hoare triple {46267#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {46268#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:12,140 INFO L273 TraceCheckUtils]: 27: Hoare triple {46268#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46268#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:12,141 INFO L273 TraceCheckUtils]: 28: Hoare triple {46268#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46268#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:12,142 INFO L273 TraceCheckUtils]: 29: Hoare triple {46268#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {46269#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:12,142 INFO L273 TraceCheckUtils]: 30: Hoare triple {46269#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46269#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:12,143 INFO L273 TraceCheckUtils]: 31: Hoare triple {46269#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46269#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:12,143 INFO L273 TraceCheckUtils]: 32: Hoare triple {46269#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {46270#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:12,144 INFO L273 TraceCheckUtils]: 33: Hoare triple {46270#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46270#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:12,144 INFO L273 TraceCheckUtils]: 34: Hoare triple {46270#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46270#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:12,145 INFO L273 TraceCheckUtils]: 35: Hoare triple {46270#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {46271#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:12,145 INFO L273 TraceCheckUtils]: 36: Hoare triple {46271#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46271#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:12,146 INFO L273 TraceCheckUtils]: 37: Hoare triple {46271#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46271#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:12,147 INFO L273 TraceCheckUtils]: 38: Hoare triple {46271#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {46272#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:12,147 INFO L273 TraceCheckUtils]: 39: Hoare triple {46272#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46272#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:12,148 INFO L273 TraceCheckUtils]: 40: Hoare triple {46272#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46272#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:12,148 INFO L273 TraceCheckUtils]: 41: Hoare triple {46272#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {46273#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:12,149 INFO L273 TraceCheckUtils]: 42: Hoare triple {46273#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46273#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:12,149 INFO L273 TraceCheckUtils]: 43: Hoare triple {46273#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46273#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:12,150 INFO L273 TraceCheckUtils]: 44: Hoare triple {46273#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {46274#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:12,151 INFO L273 TraceCheckUtils]: 45: Hoare triple {46274#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46274#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:12,151 INFO L273 TraceCheckUtils]: 46: Hoare triple {46274#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46274#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:12,152 INFO L273 TraceCheckUtils]: 47: Hoare triple {46274#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {46275#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:12,152 INFO L273 TraceCheckUtils]: 48: Hoare triple {46275#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46275#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:12,153 INFO L273 TraceCheckUtils]: 49: Hoare triple {46275#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46275#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:12,153 INFO L273 TraceCheckUtils]: 50: Hoare triple {46275#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {46276#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:12,154 INFO L273 TraceCheckUtils]: 51: Hoare triple {46276#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46276#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:12,154 INFO L273 TraceCheckUtils]: 52: Hoare triple {46276#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46276#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:12,155 INFO L273 TraceCheckUtils]: 53: Hoare triple {46276#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {46277#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:12,156 INFO L273 TraceCheckUtils]: 54: Hoare triple {46277#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46277#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:12,156 INFO L273 TraceCheckUtils]: 55: Hoare triple {46277#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46277#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:12,157 INFO L273 TraceCheckUtils]: 56: Hoare triple {46277#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {46278#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:12,157 INFO L273 TraceCheckUtils]: 57: Hoare triple {46278#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46278#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:12,158 INFO L273 TraceCheckUtils]: 58: Hoare triple {46278#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46278#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:12,159 INFO L273 TraceCheckUtils]: 59: Hoare triple {46278#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {46279#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:12,159 INFO L273 TraceCheckUtils]: 60: Hoare triple {46279#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46279#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:12,160 INFO L273 TraceCheckUtils]: 61: Hoare triple {46279#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46279#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:12,160 INFO L273 TraceCheckUtils]: 62: Hoare triple {46279#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {46280#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:12,161 INFO L273 TraceCheckUtils]: 63: Hoare triple {46280#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46280#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:12,161 INFO L273 TraceCheckUtils]: 64: Hoare triple {46280#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46280#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:12,162 INFO L273 TraceCheckUtils]: 65: Hoare triple {46280#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {46281#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:12,162 INFO L273 TraceCheckUtils]: 66: Hoare triple {46281#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46281#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:12,163 INFO L273 TraceCheckUtils]: 67: Hoare triple {46281#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46281#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:12,164 INFO L273 TraceCheckUtils]: 68: Hoare triple {46281#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {46282#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:12,164 INFO L273 TraceCheckUtils]: 69: Hoare triple {46282#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46282#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:12,165 INFO L273 TraceCheckUtils]: 70: Hoare triple {46282#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46282#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:12,165 INFO L273 TraceCheckUtils]: 71: Hoare triple {46282#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {46283#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:12,166 INFO L273 TraceCheckUtils]: 72: Hoare triple {46283#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46283#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:12,166 INFO L273 TraceCheckUtils]: 73: Hoare triple {46283#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46283#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:12,167 INFO L273 TraceCheckUtils]: 74: Hoare triple {46283#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {46284#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:12,168 INFO L273 TraceCheckUtils]: 75: Hoare triple {46284#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46284#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:12,168 INFO L273 TraceCheckUtils]: 76: Hoare triple {46284#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46284#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:12,169 INFO L273 TraceCheckUtils]: 77: Hoare triple {46284#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {46285#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:12,169 INFO L273 TraceCheckUtils]: 78: Hoare triple {46285#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46285#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:12,170 INFO L273 TraceCheckUtils]: 79: Hoare triple {46285#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46285#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:12,170 INFO L273 TraceCheckUtils]: 80: Hoare triple {46285#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {46286#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:12,171 INFO L273 TraceCheckUtils]: 81: Hoare triple {46286#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46286#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:12,171 INFO L273 TraceCheckUtils]: 82: Hoare triple {46286#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46286#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:12,172 INFO L273 TraceCheckUtils]: 83: Hoare triple {46286#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {46287#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:12,173 INFO L273 TraceCheckUtils]: 84: Hoare triple {46287#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46287#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:12,173 INFO L273 TraceCheckUtils]: 85: Hoare triple {46287#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46287#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:12,174 INFO L273 TraceCheckUtils]: 86: Hoare triple {46287#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {46288#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:12,174 INFO L273 TraceCheckUtils]: 87: Hoare triple {46288#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46288#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:12,175 INFO L273 TraceCheckUtils]: 88: Hoare triple {46288#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46288#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:12,176 INFO L273 TraceCheckUtils]: 89: Hoare triple {46288#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {46289#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:12,176 INFO L273 TraceCheckUtils]: 90: Hoare triple {46289#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46289#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:12,177 INFO L273 TraceCheckUtils]: 91: Hoare triple {46289#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46289#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:12,177 INFO L273 TraceCheckUtils]: 92: Hoare triple {46289#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {46290#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:12,178 INFO L273 TraceCheckUtils]: 93: Hoare triple {46290#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46290#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:12,178 INFO L273 TraceCheckUtils]: 94: Hoare triple {46290#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46290#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:12,179 INFO L273 TraceCheckUtils]: 95: Hoare triple {46290#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {46291#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:12,179 INFO L273 TraceCheckUtils]: 96: Hoare triple {46291#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46291#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:12,180 INFO L273 TraceCheckUtils]: 97: Hoare triple {46291#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46291#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:12,181 INFO L273 TraceCheckUtils]: 98: Hoare triple {46291#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {46292#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:12,181 INFO L273 TraceCheckUtils]: 99: Hoare triple {46292#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46292#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:12,182 INFO L273 TraceCheckUtils]: 100: Hoare triple {46292#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46292#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:12,182 INFO L273 TraceCheckUtils]: 101: Hoare triple {46292#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {46293#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:12,183 INFO L273 TraceCheckUtils]: 102: Hoare triple {46293#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46293#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:12,183 INFO L273 TraceCheckUtils]: 103: Hoare triple {46293#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46293#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:12,184 INFO L273 TraceCheckUtils]: 104: Hoare triple {46293#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {46294#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:12,184 INFO L273 TraceCheckUtils]: 105: Hoare triple {46294#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46294#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:12,185 INFO L273 TraceCheckUtils]: 106: Hoare triple {46294#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46294#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:12,186 INFO L273 TraceCheckUtils]: 107: Hoare triple {46294#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {46295#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:12,186 INFO L273 TraceCheckUtils]: 108: Hoare triple {46295#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46295#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:12,187 INFO L273 TraceCheckUtils]: 109: Hoare triple {46295#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46295#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:12,187 INFO L273 TraceCheckUtils]: 110: Hoare triple {46295#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {46296#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:12,188 INFO L273 TraceCheckUtils]: 111: Hoare triple {46296#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46296#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:12,188 INFO L273 TraceCheckUtils]: 112: Hoare triple {46296#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46296#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:12,189 INFO L273 TraceCheckUtils]: 113: Hoare triple {46296#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {46297#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:12,190 INFO L273 TraceCheckUtils]: 114: Hoare triple {46297#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46297#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:12,190 INFO L273 TraceCheckUtils]: 115: Hoare triple {46297#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46297#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:12,191 INFO L273 TraceCheckUtils]: 116: Hoare triple {46297#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {46298#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:12,191 INFO L273 TraceCheckUtils]: 117: Hoare triple {46298#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46298#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:12,192 INFO L273 TraceCheckUtils]: 118: Hoare triple {46298#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46298#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:12,192 INFO L273 TraceCheckUtils]: 119: Hoare triple {46298#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {46299#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:12,193 INFO L273 TraceCheckUtils]: 120: Hoare triple {46299#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46299#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:12,193 INFO L273 TraceCheckUtils]: 121: Hoare triple {46299#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46299#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:12,194 INFO L273 TraceCheckUtils]: 122: Hoare triple {46299#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {46300#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:12,195 INFO L273 TraceCheckUtils]: 123: Hoare triple {46300#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46300#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:12,195 INFO L273 TraceCheckUtils]: 124: Hoare triple {46300#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46300#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:12,196 INFO L273 TraceCheckUtils]: 125: Hoare triple {46300#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {46301#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:12,196 INFO L273 TraceCheckUtils]: 126: Hoare triple {46301#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46301#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:12,197 INFO L273 TraceCheckUtils]: 127: Hoare triple {46301#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46301#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:12,198 INFO L273 TraceCheckUtils]: 128: Hoare triple {46301#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {46302#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:12,198 INFO L273 TraceCheckUtils]: 129: Hoare triple {46302#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46302#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:12,199 INFO L273 TraceCheckUtils]: 130: Hoare triple {46302#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46302#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:12,199 INFO L273 TraceCheckUtils]: 131: Hoare triple {46302#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {46303#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:12,200 INFO L273 TraceCheckUtils]: 132: Hoare triple {46303#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46303#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:12,200 INFO L273 TraceCheckUtils]: 133: Hoare triple {46303#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46303#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:12,201 INFO L273 TraceCheckUtils]: 134: Hoare triple {46303#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {46304#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:12,201 INFO L273 TraceCheckUtils]: 135: Hoare triple {46304#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46304#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:12,202 INFO L273 TraceCheckUtils]: 136: Hoare triple {46304#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46304#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:12,203 INFO L273 TraceCheckUtils]: 137: Hoare triple {46304#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {46305#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:12,203 INFO L273 TraceCheckUtils]: 138: Hoare triple {46305#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46305#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:12,204 INFO L273 TraceCheckUtils]: 139: Hoare triple {46305#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46305#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:12,204 INFO L273 TraceCheckUtils]: 140: Hoare triple {46305#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {46306#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:12,205 INFO L273 TraceCheckUtils]: 141: Hoare triple {46306#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46306#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:12,205 INFO L273 TraceCheckUtils]: 142: Hoare triple {46306#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46306#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:12,206 INFO L273 TraceCheckUtils]: 143: Hoare triple {46306#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {46307#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:12,207 INFO L273 TraceCheckUtils]: 144: Hoare triple {46307#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46307#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:12,207 INFO L273 TraceCheckUtils]: 145: Hoare triple {46307#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46307#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:12,208 INFO L273 TraceCheckUtils]: 146: Hoare triple {46307#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {46308#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:12,208 INFO L273 TraceCheckUtils]: 147: Hoare triple {46308#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46308#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:12,209 INFO L273 TraceCheckUtils]: 148: Hoare triple {46308#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46308#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:12,209 INFO L273 TraceCheckUtils]: 149: Hoare triple {46308#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {46309#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:12,210 INFO L273 TraceCheckUtils]: 150: Hoare triple {46309#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46309#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:12,210 INFO L273 TraceCheckUtils]: 151: Hoare triple {46309#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46309#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:12,211 INFO L273 TraceCheckUtils]: 152: Hoare triple {46309#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {46310#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:12,212 INFO L273 TraceCheckUtils]: 153: Hoare triple {46310#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46310#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:12,212 INFO L273 TraceCheckUtils]: 154: Hoare triple {46310#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46310#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:12,213 INFO L273 TraceCheckUtils]: 155: Hoare triple {46310#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {46311#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:12,213 INFO L273 TraceCheckUtils]: 156: Hoare triple {46311#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46311#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:12,214 INFO L273 TraceCheckUtils]: 157: Hoare triple {46311#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46311#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:12,215 INFO L273 TraceCheckUtils]: 158: Hoare triple {46311#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {46312#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:12,215 INFO L273 TraceCheckUtils]: 159: Hoare triple {46312#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46312#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:12,216 INFO L273 TraceCheckUtils]: 160: Hoare triple {46312#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46312#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:12,216 INFO L273 TraceCheckUtils]: 161: Hoare triple {46312#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {46313#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:12,217 INFO L273 TraceCheckUtils]: 162: Hoare triple {46313#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46313#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:12,217 INFO L273 TraceCheckUtils]: 163: Hoare triple {46313#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46313#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:12,218 INFO L273 TraceCheckUtils]: 164: Hoare triple {46313#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {46314#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:12,218 INFO L273 TraceCheckUtils]: 165: Hoare triple {46314#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46314#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:12,219 INFO L273 TraceCheckUtils]: 166: Hoare triple {46314#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46314#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:12,220 INFO L273 TraceCheckUtils]: 167: Hoare triple {46314#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {46315#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:12,220 INFO L273 TraceCheckUtils]: 168: Hoare triple {46315#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46315#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:12,221 INFO L273 TraceCheckUtils]: 169: Hoare triple {46315#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46315#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:12,221 INFO L273 TraceCheckUtils]: 170: Hoare triple {46315#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {46316#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:12,222 INFO L273 TraceCheckUtils]: 171: Hoare triple {46316#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46316#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:12,222 INFO L273 TraceCheckUtils]: 172: Hoare triple {46316#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {46316#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:12,223 INFO L273 TraceCheckUtils]: 173: Hoare triple {46316#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {46317#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:12,224 INFO L273 TraceCheckUtils]: 174: Hoare triple {46317#(<= main_~i~0 56)} assume !(~i~0 < 100000); {46260#false} is VALID [2018-11-23 12:07:12,224 INFO L273 TraceCheckUtils]: 175: Hoare triple {46260#false} havoc ~x~0;~x~0 := 0; {46260#false} is VALID [2018-11-23 12:07:12,224 INFO L273 TraceCheckUtils]: 176: Hoare triple {46260#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {46260#false} is VALID [2018-11-23 12:07:12,224 INFO L256 TraceCheckUtils]: 177: Hoare triple {46260#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {46260#false} is VALID [2018-11-23 12:07:12,224 INFO L273 TraceCheckUtils]: 178: Hoare triple {46260#false} ~cond := #in~cond; {46260#false} is VALID [2018-11-23 12:07:12,225 INFO L273 TraceCheckUtils]: 179: Hoare triple {46260#false} assume 0 == ~cond; {46260#false} is VALID [2018-11-23 12:07:12,225 INFO L273 TraceCheckUtils]: 180: Hoare triple {46260#false} assume !false; {46260#false} is VALID [2018-11-23 12:07:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:12,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:12,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2018-11-23 12:07:12,263 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 181 [2018-11-23 12:07:12,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:12,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states. [2018-11-23 12:07:12,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:12,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-23 12:07:12,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-23 12:07:12,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 12:07:12,446 INFO L87 Difference]: Start difference. First operand 186 states and 243 transitions. Second operand 60 states. [2018-11-23 12:07:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:13,683 INFO L93 Difference]: Finished difference Result 202 states and 262 transitions. [2018-11-23 12:07:13,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-23 12:07:13,683 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 181 [2018-11-23 12:07:13,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:07:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 262 transitions. [2018-11-23 12:07:13,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:07:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 262 transitions. [2018-11-23 12:07:13,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 262 transitions. [2018-11-23 12:07:13,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:13,936 INFO L225 Difference]: With dead ends: 202 [2018-11-23 12:07:13,936 INFO L226 Difference]: Without dead ends: 191 [2018-11-23 12:07:13,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 12:07:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-23 12:07:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-11-23 12:07:13,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:13,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand 189 states. [2018-11-23 12:07:13,989 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand 189 states. [2018-11-23 12:07:13,989 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 189 states. [2018-11-23 12:07:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:13,992 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2018-11-23 12:07:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2018-11-23 12:07:13,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:13,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:13,993 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 191 states. [2018-11-23 12:07:13,993 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 191 states. [2018-11-23 12:07:13,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:13,995 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2018-11-23 12:07:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2018-11-23 12:07:13,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:13,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:13,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:13,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-23 12:07:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 247 transitions. [2018-11-23 12:07:13,998 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 247 transitions. Word has length 181 [2018-11-23 12:07:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:13,998 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 247 transitions. [2018-11-23 12:07:13,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-23 12:07:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 247 transitions. [2018-11-23 12:07:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 12:07:13,999 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:13,999 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:13,999 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:13,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:14,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1283761123, now seen corresponding path program 57 times [2018-11-23 12:07:14,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:14,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:14,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:14,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:14,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:15,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {47767#true} call ULTIMATE.init(); {47767#true} is VALID [2018-11-23 12:07:15,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {47767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47767#true} is VALID [2018-11-23 12:07:15,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {47767#true} assume true; {47767#true} is VALID [2018-11-23 12:07:15,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47767#true} {47767#true} #55#return; {47767#true} is VALID [2018-11-23 12:07:15,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {47767#true} call #t~ret4 := main(); {47767#true} is VALID [2018-11-23 12:07:15,932 INFO L273 TraceCheckUtils]: 5: Hoare triple {47767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {47769#(= main_~i~0 0)} is VALID [2018-11-23 12:07:15,933 INFO L273 TraceCheckUtils]: 6: Hoare triple {47769#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47769#(= main_~i~0 0)} is VALID [2018-11-23 12:07:15,933 INFO L273 TraceCheckUtils]: 7: Hoare triple {47769#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47769#(= main_~i~0 0)} is VALID [2018-11-23 12:07:15,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {47769#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {47770#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:15,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {47770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47770#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:15,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {47770#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47770#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:15,936 INFO L273 TraceCheckUtils]: 11: Hoare triple {47770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {47771#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:15,936 INFO L273 TraceCheckUtils]: 12: Hoare triple {47771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47771#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:15,937 INFO L273 TraceCheckUtils]: 13: Hoare triple {47771#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47771#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:15,937 INFO L273 TraceCheckUtils]: 14: Hoare triple {47771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {47772#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:15,938 INFO L273 TraceCheckUtils]: 15: Hoare triple {47772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47772#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:15,938 INFO L273 TraceCheckUtils]: 16: Hoare triple {47772#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47772#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:15,939 INFO L273 TraceCheckUtils]: 17: Hoare triple {47772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {47773#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:15,940 INFO L273 TraceCheckUtils]: 18: Hoare triple {47773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47773#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:15,940 INFO L273 TraceCheckUtils]: 19: Hoare triple {47773#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47773#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:15,941 INFO L273 TraceCheckUtils]: 20: Hoare triple {47773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {47774#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:15,941 INFO L273 TraceCheckUtils]: 21: Hoare triple {47774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47774#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:15,942 INFO L273 TraceCheckUtils]: 22: Hoare triple {47774#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47774#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:15,942 INFO L273 TraceCheckUtils]: 23: Hoare triple {47774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {47775#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:15,943 INFO L273 TraceCheckUtils]: 24: Hoare triple {47775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47775#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:15,943 INFO L273 TraceCheckUtils]: 25: Hoare triple {47775#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47775#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:15,944 INFO L273 TraceCheckUtils]: 26: Hoare triple {47775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {47776#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:15,945 INFO L273 TraceCheckUtils]: 27: Hoare triple {47776#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47776#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:15,945 INFO L273 TraceCheckUtils]: 28: Hoare triple {47776#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47776#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:15,946 INFO L273 TraceCheckUtils]: 29: Hoare triple {47776#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {47777#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:15,946 INFO L273 TraceCheckUtils]: 30: Hoare triple {47777#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47777#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:15,947 INFO L273 TraceCheckUtils]: 31: Hoare triple {47777#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47777#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:15,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {47777#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {47778#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:15,948 INFO L273 TraceCheckUtils]: 33: Hoare triple {47778#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47778#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:15,949 INFO L273 TraceCheckUtils]: 34: Hoare triple {47778#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47778#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:15,949 INFO L273 TraceCheckUtils]: 35: Hoare triple {47778#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {47779#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:15,950 INFO L273 TraceCheckUtils]: 36: Hoare triple {47779#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47779#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:15,950 INFO L273 TraceCheckUtils]: 37: Hoare triple {47779#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47779#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:15,951 INFO L273 TraceCheckUtils]: 38: Hoare triple {47779#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {47780#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:15,951 INFO L273 TraceCheckUtils]: 39: Hoare triple {47780#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47780#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:15,952 INFO L273 TraceCheckUtils]: 40: Hoare triple {47780#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47780#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:15,953 INFO L273 TraceCheckUtils]: 41: Hoare triple {47780#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {47781#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:15,953 INFO L273 TraceCheckUtils]: 42: Hoare triple {47781#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47781#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:15,954 INFO L273 TraceCheckUtils]: 43: Hoare triple {47781#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47781#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:15,954 INFO L273 TraceCheckUtils]: 44: Hoare triple {47781#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {47782#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:15,955 INFO L273 TraceCheckUtils]: 45: Hoare triple {47782#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47782#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:15,955 INFO L273 TraceCheckUtils]: 46: Hoare triple {47782#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47782#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:15,956 INFO L273 TraceCheckUtils]: 47: Hoare triple {47782#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {47783#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:15,957 INFO L273 TraceCheckUtils]: 48: Hoare triple {47783#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47783#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:15,957 INFO L273 TraceCheckUtils]: 49: Hoare triple {47783#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47783#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:15,958 INFO L273 TraceCheckUtils]: 50: Hoare triple {47783#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {47784#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:15,958 INFO L273 TraceCheckUtils]: 51: Hoare triple {47784#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47784#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:15,959 INFO L273 TraceCheckUtils]: 52: Hoare triple {47784#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47784#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:15,959 INFO L273 TraceCheckUtils]: 53: Hoare triple {47784#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {47785#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:15,960 INFO L273 TraceCheckUtils]: 54: Hoare triple {47785#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47785#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:15,960 INFO L273 TraceCheckUtils]: 55: Hoare triple {47785#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47785#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:15,961 INFO L273 TraceCheckUtils]: 56: Hoare triple {47785#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {47786#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:15,962 INFO L273 TraceCheckUtils]: 57: Hoare triple {47786#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47786#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:15,962 INFO L273 TraceCheckUtils]: 58: Hoare triple {47786#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47786#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:15,963 INFO L273 TraceCheckUtils]: 59: Hoare triple {47786#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {47787#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:15,963 INFO L273 TraceCheckUtils]: 60: Hoare triple {47787#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47787#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:15,964 INFO L273 TraceCheckUtils]: 61: Hoare triple {47787#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47787#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:15,964 INFO L273 TraceCheckUtils]: 62: Hoare triple {47787#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {47788#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:15,965 INFO L273 TraceCheckUtils]: 63: Hoare triple {47788#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47788#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:15,965 INFO L273 TraceCheckUtils]: 64: Hoare triple {47788#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47788#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:15,966 INFO L273 TraceCheckUtils]: 65: Hoare triple {47788#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {47789#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:15,967 INFO L273 TraceCheckUtils]: 66: Hoare triple {47789#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47789#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:15,967 INFO L273 TraceCheckUtils]: 67: Hoare triple {47789#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47789#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:15,968 INFO L273 TraceCheckUtils]: 68: Hoare triple {47789#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {47790#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:15,968 INFO L273 TraceCheckUtils]: 69: Hoare triple {47790#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47790#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:15,969 INFO L273 TraceCheckUtils]: 70: Hoare triple {47790#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47790#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:15,970 INFO L273 TraceCheckUtils]: 71: Hoare triple {47790#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {47791#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:15,970 INFO L273 TraceCheckUtils]: 72: Hoare triple {47791#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47791#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:15,971 INFO L273 TraceCheckUtils]: 73: Hoare triple {47791#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47791#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:15,971 INFO L273 TraceCheckUtils]: 74: Hoare triple {47791#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {47792#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:15,972 INFO L273 TraceCheckUtils]: 75: Hoare triple {47792#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47792#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:15,972 INFO L273 TraceCheckUtils]: 76: Hoare triple {47792#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47792#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:15,973 INFO L273 TraceCheckUtils]: 77: Hoare triple {47792#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {47793#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:15,974 INFO L273 TraceCheckUtils]: 78: Hoare triple {47793#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47793#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:15,974 INFO L273 TraceCheckUtils]: 79: Hoare triple {47793#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47793#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:15,975 INFO L273 TraceCheckUtils]: 80: Hoare triple {47793#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {47794#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:15,975 INFO L273 TraceCheckUtils]: 81: Hoare triple {47794#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47794#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:15,976 INFO L273 TraceCheckUtils]: 82: Hoare triple {47794#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47794#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:15,976 INFO L273 TraceCheckUtils]: 83: Hoare triple {47794#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {47795#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:15,977 INFO L273 TraceCheckUtils]: 84: Hoare triple {47795#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47795#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:15,977 INFO L273 TraceCheckUtils]: 85: Hoare triple {47795#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47795#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:15,978 INFO L273 TraceCheckUtils]: 86: Hoare triple {47795#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {47796#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:15,979 INFO L273 TraceCheckUtils]: 87: Hoare triple {47796#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47796#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:15,979 INFO L273 TraceCheckUtils]: 88: Hoare triple {47796#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47796#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:15,980 INFO L273 TraceCheckUtils]: 89: Hoare triple {47796#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {47797#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:15,980 INFO L273 TraceCheckUtils]: 90: Hoare triple {47797#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47797#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:15,981 INFO L273 TraceCheckUtils]: 91: Hoare triple {47797#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47797#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:15,981 INFO L273 TraceCheckUtils]: 92: Hoare triple {47797#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {47798#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:15,982 INFO L273 TraceCheckUtils]: 93: Hoare triple {47798#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47798#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:15,982 INFO L273 TraceCheckUtils]: 94: Hoare triple {47798#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47798#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:15,983 INFO L273 TraceCheckUtils]: 95: Hoare triple {47798#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {47799#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:15,984 INFO L273 TraceCheckUtils]: 96: Hoare triple {47799#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47799#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:15,984 INFO L273 TraceCheckUtils]: 97: Hoare triple {47799#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47799#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:15,985 INFO L273 TraceCheckUtils]: 98: Hoare triple {47799#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {47800#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:15,985 INFO L273 TraceCheckUtils]: 99: Hoare triple {47800#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47800#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:15,986 INFO L273 TraceCheckUtils]: 100: Hoare triple {47800#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47800#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:15,987 INFO L273 TraceCheckUtils]: 101: Hoare triple {47800#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {47801#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:15,987 INFO L273 TraceCheckUtils]: 102: Hoare triple {47801#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47801#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:15,988 INFO L273 TraceCheckUtils]: 103: Hoare triple {47801#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47801#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:15,988 INFO L273 TraceCheckUtils]: 104: Hoare triple {47801#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {47802#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:15,989 INFO L273 TraceCheckUtils]: 105: Hoare triple {47802#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47802#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:15,989 INFO L273 TraceCheckUtils]: 106: Hoare triple {47802#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47802#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:15,990 INFO L273 TraceCheckUtils]: 107: Hoare triple {47802#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {47803#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:15,990 INFO L273 TraceCheckUtils]: 108: Hoare triple {47803#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47803#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:15,991 INFO L273 TraceCheckUtils]: 109: Hoare triple {47803#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47803#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:15,992 INFO L273 TraceCheckUtils]: 110: Hoare triple {47803#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {47804#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:15,992 INFO L273 TraceCheckUtils]: 111: Hoare triple {47804#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47804#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:15,993 INFO L273 TraceCheckUtils]: 112: Hoare triple {47804#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47804#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:15,993 INFO L273 TraceCheckUtils]: 113: Hoare triple {47804#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {47805#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:15,994 INFO L273 TraceCheckUtils]: 114: Hoare triple {47805#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47805#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:15,994 INFO L273 TraceCheckUtils]: 115: Hoare triple {47805#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47805#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:15,995 INFO L273 TraceCheckUtils]: 116: Hoare triple {47805#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {47806#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:15,996 INFO L273 TraceCheckUtils]: 117: Hoare triple {47806#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47806#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:15,996 INFO L273 TraceCheckUtils]: 118: Hoare triple {47806#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47806#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:15,997 INFO L273 TraceCheckUtils]: 119: Hoare triple {47806#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {47807#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:15,997 INFO L273 TraceCheckUtils]: 120: Hoare triple {47807#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47807#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:15,998 INFO L273 TraceCheckUtils]: 121: Hoare triple {47807#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47807#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:15,998 INFO L273 TraceCheckUtils]: 122: Hoare triple {47807#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {47808#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:15,999 INFO L273 TraceCheckUtils]: 123: Hoare triple {47808#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47808#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:15,999 INFO L273 TraceCheckUtils]: 124: Hoare triple {47808#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47808#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:16,000 INFO L273 TraceCheckUtils]: 125: Hoare triple {47808#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {47809#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:16,001 INFO L273 TraceCheckUtils]: 126: Hoare triple {47809#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47809#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:16,001 INFO L273 TraceCheckUtils]: 127: Hoare triple {47809#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47809#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:16,002 INFO L273 TraceCheckUtils]: 128: Hoare triple {47809#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {47810#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:16,002 INFO L273 TraceCheckUtils]: 129: Hoare triple {47810#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47810#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:16,003 INFO L273 TraceCheckUtils]: 130: Hoare triple {47810#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47810#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:16,004 INFO L273 TraceCheckUtils]: 131: Hoare triple {47810#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {47811#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:16,004 INFO L273 TraceCheckUtils]: 132: Hoare triple {47811#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47811#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:16,005 INFO L273 TraceCheckUtils]: 133: Hoare triple {47811#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47811#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:16,005 INFO L273 TraceCheckUtils]: 134: Hoare triple {47811#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {47812#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:16,006 INFO L273 TraceCheckUtils]: 135: Hoare triple {47812#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47812#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:16,006 INFO L273 TraceCheckUtils]: 136: Hoare triple {47812#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47812#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:16,007 INFO L273 TraceCheckUtils]: 137: Hoare triple {47812#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {47813#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:16,007 INFO L273 TraceCheckUtils]: 138: Hoare triple {47813#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47813#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:16,008 INFO L273 TraceCheckUtils]: 139: Hoare triple {47813#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47813#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:16,009 INFO L273 TraceCheckUtils]: 140: Hoare triple {47813#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {47814#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:16,009 INFO L273 TraceCheckUtils]: 141: Hoare triple {47814#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47814#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:16,010 INFO L273 TraceCheckUtils]: 142: Hoare triple {47814#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47814#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:16,010 INFO L273 TraceCheckUtils]: 143: Hoare triple {47814#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {47815#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:16,011 INFO L273 TraceCheckUtils]: 144: Hoare triple {47815#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47815#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:16,011 INFO L273 TraceCheckUtils]: 145: Hoare triple {47815#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47815#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:16,012 INFO L273 TraceCheckUtils]: 146: Hoare triple {47815#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {47816#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:16,013 INFO L273 TraceCheckUtils]: 147: Hoare triple {47816#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47816#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:16,013 INFO L273 TraceCheckUtils]: 148: Hoare triple {47816#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47816#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:16,014 INFO L273 TraceCheckUtils]: 149: Hoare triple {47816#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {47817#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:16,014 INFO L273 TraceCheckUtils]: 150: Hoare triple {47817#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47817#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:16,015 INFO L273 TraceCheckUtils]: 151: Hoare triple {47817#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47817#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:16,015 INFO L273 TraceCheckUtils]: 152: Hoare triple {47817#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {47818#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:16,016 INFO L273 TraceCheckUtils]: 153: Hoare triple {47818#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47818#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:16,016 INFO L273 TraceCheckUtils]: 154: Hoare triple {47818#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47818#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:16,017 INFO L273 TraceCheckUtils]: 155: Hoare triple {47818#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {47819#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:16,018 INFO L273 TraceCheckUtils]: 156: Hoare triple {47819#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47819#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:16,018 INFO L273 TraceCheckUtils]: 157: Hoare triple {47819#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47819#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:16,019 INFO L273 TraceCheckUtils]: 158: Hoare triple {47819#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {47820#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:16,019 INFO L273 TraceCheckUtils]: 159: Hoare triple {47820#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47820#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:16,020 INFO L273 TraceCheckUtils]: 160: Hoare triple {47820#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47820#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:16,021 INFO L273 TraceCheckUtils]: 161: Hoare triple {47820#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {47821#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:16,021 INFO L273 TraceCheckUtils]: 162: Hoare triple {47821#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47821#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:16,022 INFO L273 TraceCheckUtils]: 163: Hoare triple {47821#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47821#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:16,022 INFO L273 TraceCheckUtils]: 164: Hoare triple {47821#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {47822#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:16,023 INFO L273 TraceCheckUtils]: 165: Hoare triple {47822#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47822#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:16,023 INFO L273 TraceCheckUtils]: 166: Hoare triple {47822#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47822#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:16,024 INFO L273 TraceCheckUtils]: 167: Hoare triple {47822#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {47823#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:16,024 INFO L273 TraceCheckUtils]: 168: Hoare triple {47823#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47823#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:16,025 INFO L273 TraceCheckUtils]: 169: Hoare triple {47823#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47823#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:16,026 INFO L273 TraceCheckUtils]: 170: Hoare triple {47823#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {47824#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:16,026 INFO L273 TraceCheckUtils]: 171: Hoare triple {47824#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47824#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:16,027 INFO L273 TraceCheckUtils]: 172: Hoare triple {47824#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47824#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:16,027 INFO L273 TraceCheckUtils]: 173: Hoare triple {47824#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {47825#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:16,028 INFO L273 TraceCheckUtils]: 174: Hoare triple {47825#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47825#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:16,028 INFO L273 TraceCheckUtils]: 175: Hoare triple {47825#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47825#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:16,029 INFO L273 TraceCheckUtils]: 176: Hoare triple {47825#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {47826#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:16,030 INFO L273 TraceCheckUtils]: 177: Hoare triple {47826#(<= main_~i~0 57)} assume !(~i~0 < 100000); {47768#false} is VALID [2018-11-23 12:07:16,030 INFO L273 TraceCheckUtils]: 178: Hoare triple {47768#false} havoc ~x~0;~x~0 := 0; {47768#false} is VALID [2018-11-23 12:07:16,030 INFO L273 TraceCheckUtils]: 179: Hoare triple {47768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {47768#false} is VALID [2018-11-23 12:07:16,030 INFO L256 TraceCheckUtils]: 180: Hoare triple {47768#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {47768#false} is VALID [2018-11-23 12:07:16,031 INFO L273 TraceCheckUtils]: 181: Hoare triple {47768#false} ~cond := #in~cond; {47768#false} is VALID [2018-11-23 12:07:16,031 INFO L273 TraceCheckUtils]: 182: Hoare triple {47768#false} assume 0 == ~cond; {47768#false} is VALID [2018-11-23 12:07:16,031 INFO L273 TraceCheckUtils]: 183: Hoare triple {47768#false} assume !false; {47768#false} is VALID [2018-11-23 12:07:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:16,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:16,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:16,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:07:16,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-11-23 12:07:16,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:16,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:16,679 INFO L256 TraceCheckUtils]: 0: Hoare triple {47767#true} call ULTIMATE.init(); {47767#true} is VALID [2018-11-23 12:07:16,680 INFO L273 TraceCheckUtils]: 1: Hoare triple {47767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47767#true} is VALID [2018-11-23 12:07:16,680 INFO L273 TraceCheckUtils]: 2: Hoare triple {47767#true} assume true; {47767#true} is VALID [2018-11-23 12:07:16,680 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47767#true} {47767#true} #55#return; {47767#true} is VALID [2018-11-23 12:07:16,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {47767#true} call #t~ret4 := main(); {47767#true} is VALID [2018-11-23 12:07:16,681 INFO L273 TraceCheckUtils]: 5: Hoare triple {47767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {47845#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:16,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {47845#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47845#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:16,682 INFO L273 TraceCheckUtils]: 7: Hoare triple {47845#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47845#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:16,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {47845#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {47770#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:16,683 INFO L273 TraceCheckUtils]: 9: Hoare triple {47770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47770#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:16,683 INFO L273 TraceCheckUtils]: 10: Hoare triple {47770#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47770#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:16,683 INFO L273 TraceCheckUtils]: 11: Hoare triple {47770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {47771#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:16,684 INFO L273 TraceCheckUtils]: 12: Hoare triple {47771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47771#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:16,684 INFO L273 TraceCheckUtils]: 13: Hoare triple {47771#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47771#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:16,685 INFO L273 TraceCheckUtils]: 14: Hoare triple {47771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {47772#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:16,685 INFO L273 TraceCheckUtils]: 15: Hoare triple {47772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47772#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:16,686 INFO L273 TraceCheckUtils]: 16: Hoare triple {47772#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47772#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:16,686 INFO L273 TraceCheckUtils]: 17: Hoare triple {47772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {47773#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:16,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {47773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47773#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:16,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {47773#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47773#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:16,688 INFO L273 TraceCheckUtils]: 20: Hoare triple {47773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {47774#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:16,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {47774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47774#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:16,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {47774#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47774#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:16,690 INFO L273 TraceCheckUtils]: 23: Hoare triple {47774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {47775#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:16,690 INFO L273 TraceCheckUtils]: 24: Hoare triple {47775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47775#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:16,691 INFO L273 TraceCheckUtils]: 25: Hoare triple {47775#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47775#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:16,691 INFO L273 TraceCheckUtils]: 26: Hoare triple {47775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {47776#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:16,692 INFO L273 TraceCheckUtils]: 27: Hoare triple {47776#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47776#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:16,692 INFO L273 TraceCheckUtils]: 28: Hoare triple {47776#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47776#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:16,693 INFO L273 TraceCheckUtils]: 29: Hoare triple {47776#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {47777#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:16,694 INFO L273 TraceCheckUtils]: 30: Hoare triple {47777#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47777#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:16,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {47777#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47777#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:16,695 INFO L273 TraceCheckUtils]: 32: Hoare triple {47777#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {47778#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:16,695 INFO L273 TraceCheckUtils]: 33: Hoare triple {47778#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47778#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:16,696 INFO L273 TraceCheckUtils]: 34: Hoare triple {47778#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47778#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:16,697 INFO L273 TraceCheckUtils]: 35: Hoare triple {47778#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {47779#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:16,697 INFO L273 TraceCheckUtils]: 36: Hoare triple {47779#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47779#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:16,698 INFO L273 TraceCheckUtils]: 37: Hoare triple {47779#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47779#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:16,698 INFO L273 TraceCheckUtils]: 38: Hoare triple {47779#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {47780#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:16,699 INFO L273 TraceCheckUtils]: 39: Hoare triple {47780#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47780#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:16,699 INFO L273 TraceCheckUtils]: 40: Hoare triple {47780#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47780#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:16,700 INFO L273 TraceCheckUtils]: 41: Hoare triple {47780#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {47781#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:16,700 INFO L273 TraceCheckUtils]: 42: Hoare triple {47781#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47781#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:16,701 INFO L273 TraceCheckUtils]: 43: Hoare triple {47781#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47781#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:16,702 INFO L273 TraceCheckUtils]: 44: Hoare triple {47781#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {47782#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:16,702 INFO L273 TraceCheckUtils]: 45: Hoare triple {47782#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47782#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:16,703 INFO L273 TraceCheckUtils]: 46: Hoare triple {47782#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47782#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:16,703 INFO L273 TraceCheckUtils]: 47: Hoare triple {47782#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {47783#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:16,704 INFO L273 TraceCheckUtils]: 48: Hoare triple {47783#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47783#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:16,704 INFO L273 TraceCheckUtils]: 49: Hoare triple {47783#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47783#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:16,705 INFO L273 TraceCheckUtils]: 50: Hoare triple {47783#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {47784#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:16,705 INFO L273 TraceCheckUtils]: 51: Hoare triple {47784#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47784#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:16,706 INFO L273 TraceCheckUtils]: 52: Hoare triple {47784#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47784#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:16,707 INFO L273 TraceCheckUtils]: 53: Hoare triple {47784#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {47785#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:16,707 INFO L273 TraceCheckUtils]: 54: Hoare triple {47785#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47785#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:16,708 INFO L273 TraceCheckUtils]: 55: Hoare triple {47785#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47785#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:16,708 INFO L273 TraceCheckUtils]: 56: Hoare triple {47785#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {47786#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:16,709 INFO L273 TraceCheckUtils]: 57: Hoare triple {47786#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47786#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:16,709 INFO L273 TraceCheckUtils]: 58: Hoare triple {47786#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47786#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:16,710 INFO L273 TraceCheckUtils]: 59: Hoare triple {47786#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {47787#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:16,711 INFO L273 TraceCheckUtils]: 60: Hoare triple {47787#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47787#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:16,711 INFO L273 TraceCheckUtils]: 61: Hoare triple {47787#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47787#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:16,712 INFO L273 TraceCheckUtils]: 62: Hoare triple {47787#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {47788#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:16,712 INFO L273 TraceCheckUtils]: 63: Hoare triple {47788#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47788#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:16,713 INFO L273 TraceCheckUtils]: 64: Hoare triple {47788#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47788#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:16,713 INFO L273 TraceCheckUtils]: 65: Hoare triple {47788#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {47789#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:16,714 INFO L273 TraceCheckUtils]: 66: Hoare triple {47789#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47789#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:16,714 INFO L273 TraceCheckUtils]: 67: Hoare triple {47789#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47789#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:16,715 INFO L273 TraceCheckUtils]: 68: Hoare triple {47789#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {47790#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:16,716 INFO L273 TraceCheckUtils]: 69: Hoare triple {47790#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47790#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:16,716 INFO L273 TraceCheckUtils]: 70: Hoare triple {47790#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47790#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:16,717 INFO L273 TraceCheckUtils]: 71: Hoare triple {47790#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {47791#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:16,717 INFO L273 TraceCheckUtils]: 72: Hoare triple {47791#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47791#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:16,718 INFO L273 TraceCheckUtils]: 73: Hoare triple {47791#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47791#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:16,719 INFO L273 TraceCheckUtils]: 74: Hoare triple {47791#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {47792#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:16,719 INFO L273 TraceCheckUtils]: 75: Hoare triple {47792#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47792#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:16,720 INFO L273 TraceCheckUtils]: 76: Hoare triple {47792#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47792#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:16,720 INFO L273 TraceCheckUtils]: 77: Hoare triple {47792#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {47793#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:16,721 INFO L273 TraceCheckUtils]: 78: Hoare triple {47793#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47793#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:16,721 INFO L273 TraceCheckUtils]: 79: Hoare triple {47793#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47793#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:16,722 INFO L273 TraceCheckUtils]: 80: Hoare triple {47793#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {47794#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:16,722 INFO L273 TraceCheckUtils]: 81: Hoare triple {47794#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47794#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:16,723 INFO L273 TraceCheckUtils]: 82: Hoare triple {47794#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47794#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:16,724 INFO L273 TraceCheckUtils]: 83: Hoare triple {47794#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {47795#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:16,724 INFO L273 TraceCheckUtils]: 84: Hoare triple {47795#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47795#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:16,725 INFO L273 TraceCheckUtils]: 85: Hoare triple {47795#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47795#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:16,725 INFO L273 TraceCheckUtils]: 86: Hoare triple {47795#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {47796#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:16,726 INFO L273 TraceCheckUtils]: 87: Hoare triple {47796#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47796#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:16,726 INFO L273 TraceCheckUtils]: 88: Hoare triple {47796#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47796#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:16,727 INFO L273 TraceCheckUtils]: 89: Hoare triple {47796#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {47797#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:16,728 INFO L273 TraceCheckUtils]: 90: Hoare triple {47797#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47797#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:16,728 INFO L273 TraceCheckUtils]: 91: Hoare triple {47797#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47797#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:16,729 INFO L273 TraceCheckUtils]: 92: Hoare triple {47797#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {47798#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:16,729 INFO L273 TraceCheckUtils]: 93: Hoare triple {47798#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47798#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:16,730 INFO L273 TraceCheckUtils]: 94: Hoare triple {47798#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47798#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:16,730 INFO L273 TraceCheckUtils]: 95: Hoare triple {47798#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {47799#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:16,731 INFO L273 TraceCheckUtils]: 96: Hoare triple {47799#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47799#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:16,731 INFO L273 TraceCheckUtils]: 97: Hoare triple {47799#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47799#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:16,732 INFO L273 TraceCheckUtils]: 98: Hoare triple {47799#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {47800#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:16,733 INFO L273 TraceCheckUtils]: 99: Hoare triple {47800#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47800#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:16,733 INFO L273 TraceCheckUtils]: 100: Hoare triple {47800#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47800#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:16,734 INFO L273 TraceCheckUtils]: 101: Hoare triple {47800#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {47801#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:16,734 INFO L273 TraceCheckUtils]: 102: Hoare triple {47801#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47801#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:16,735 INFO L273 TraceCheckUtils]: 103: Hoare triple {47801#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47801#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:16,736 INFO L273 TraceCheckUtils]: 104: Hoare triple {47801#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {47802#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:16,736 INFO L273 TraceCheckUtils]: 105: Hoare triple {47802#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47802#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:16,737 INFO L273 TraceCheckUtils]: 106: Hoare triple {47802#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47802#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:16,737 INFO L273 TraceCheckUtils]: 107: Hoare triple {47802#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {47803#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:16,738 INFO L273 TraceCheckUtils]: 108: Hoare triple {47803#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47803#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:16,738 INFO L273 TraceCheckUtils]: 109: Hoare triple {47803#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47803#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:16,739 INFO L273 TraceCheckUtils]: 110: Hoare triple {47803#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {47804#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:16,739 INFO L273 TraceCheckUtils]: 111: Hoare triple {47804#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47804#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:16,740 INFO L273 TraceCheckUtils]: 112: Hoare triple {47804#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47804#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:16,741 INFO L273 TraceCheckUtils]: 113: Hoare triple {47804#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {47805#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:16,741 INFO L273 TraceCheckUtils]: 114: Hoare triple {47805#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47805#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:16,742 INFO L273 TraceCheckUtils]: 115: Hoare triple {47805#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47805#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:16,742 INFO L273 TraceCheckUtils]: 116: Hoare triple {47805#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {47806#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:16,743 INFO L273 TraceCheckUtils]: 117: Hoare triple {47806#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47806#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:16,743 INFO L273 TraceCheckUtils]: 118: Hoare triple {47806#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47806#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:16,744 INFO L273 TraceCheckUtils]: 119: Hoare triple {47806#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {47807#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:16,745 INFO L273 TraceCheckUtils]: 120: Hoare triple {47807#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47807#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:16,745 INFO L273 TraceCheckUtils]: 121: Hoare triple {47807#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47807#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:16,746 INFO L273 TraceCheckUtils]: 122: Hoare triple {47807#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {47808#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:16,746 INFO L273 TraceCheckUtils]: 123: Hoare triple {47808#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47808#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:16,747 INFO L273 TraceCheckUtils]: 124: Hoare triple {47808#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47808#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:16,747 INFO L273 TraceCheckUtils]: 125: Hoare triple {47808#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {47809#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:16,748 INFO L273 TraceCheckUtils]: 126: Hoare triple {47809#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47809#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:16,748 INFO L273 TraceCheckUtils]: 127: Hoare triple {47809#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47809#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:16,749 INFO L273 TraceCheckUtils]: 128: Hoare triple {47809#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {47810#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:16,750 INFO L273 TraceCheckUtils]: 129: Hoare triple {47810#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47810#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:16,750 INFO L273 TraceCheckUtils]: 130: Hoare triple {47810#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47810#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:16,751 INFO L273 TraceCheckUtils]: 131: Hoare triple {47810#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {47811#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:16,751 INFO L273 TraceCheckUtils]: 132: Hoare triple {47811#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47811#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:16,752 INFO L273 TraceCheckUtils]: 133: Hoare triple {47811#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47811#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:16,753 INFO L273 TraceCheckUtils]: 134: Hoare triple {47811#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {47812#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:16,753 INFO L273 TraceCheckUtils]: 135: Hoare triple {47812#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47812#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:16,754 INFO L273 TraceCheckUtils]: 136: Hoare triple {47812#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47812#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:16,754 INFO L273 TraceCheckUtils]: 137: Hoare triple {47812#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {47813#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:16,755 INFO L273 TraceCheckUtils]: 138: Hoare triple {47813#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47813#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:16,755 INFO L273 TraceCheckUtils]: 139: Hoare triple {47813#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47813#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:16,756 INFO L273 TraceCheckUtils]: 140: Hoare triple {47813#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {47814#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:16,756 INFO L273 TraceCheckUtils]: 141: Hoare triple {47814#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47814#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:16,757 INFO L273 TraceCheckUtils]: 142: Hoare triple {47814#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47814#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:16,758 INFO L273 TraceCheckUtils]: 143: Hoare triple {47814#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {47815#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:16,758 INFO L273 TraceCheckUtils]: 144: Hoare triple {47815#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47815#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:16,759 INFO L273 TraceCheckUtils]: 145: Hoare triple {47815#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47815#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:16,759 INFO L273 TraceCheckUtils]: 146: Hoare triple {47815#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {47816#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:16,760 INFO L273 TraceCheckUtils]: 147: Hoare triple {47816#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47816#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:16,760 INFO L273 TraceCheckUtils]: 148: Hoare triple {47816#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47816#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:16,761 INFO L273 TraceCheckUtils]: 149: Hoare triple {47816#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {47817#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:16,762 INFO L273 TraceCheckUtils]: 150: Hoare triple {47817#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47817#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:16,762 INFO L273 TraceCheckUtils]: 151: Hoare triple {47817#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47817#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:16,763 INFO L273 TraceCheckUtils]: 152: Hoare triple {47817#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {47818#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:16,763 INFO L273 TraceCheckUtils]: 153: Hoare triple {47818#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47818#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:16,764 INFO L273 TraceCheckUtils]: 154: Hoare triple {47818#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47818#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:16,764 INFO L273 TraceCheckUtils]: 155: Hoare triple {47818#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {47819#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:16,765 INFO L273 TraceCheckUtils]: 156: Hoare triple {47819#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47819#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:16,765 INFO L273 TraceCheckUtils]: 157: Hoare triple {47819#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47819#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:16,766 INFO L273 TraceCheckUtils]: 158: Hoare triple {47819#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {47820#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:16,767 INFO L273 TraceCheckUtils]: 159: Hoare triple {47820#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47820#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:16,767 INFO L273 TraceCheckUtils]: 160: Hoare triple {47820#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47820#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:16,768 INFO L273 TraceCheckUtils]: 161: Hoare triple {47820#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {47821#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:16,768 INFO L273 TraceCheckUtils]: 162: Hoare triple {47821#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47821#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:16,769 INFO L273 TraceCheckUtils]: 163: Hoare triple {47821#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47821#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:16,770 INFO L273 TraceCheckUtils]: 164: Hoare triple {47821#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {47822#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:16,770 INFO L273 TraceCheckUtils]: 165: Hoare triple {47822#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47822#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:16,771 INFO L273 TraceCheckUtils]: 166: Hoare triple {47822#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47822#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:16,771 INFO L273 TraceCheckUtils]: 167: Hoare triple {47822#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {47823#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:16,772 INFO L273 TraceCheckUtils]: 168: Hoare triple {47823#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47823#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:16,772 INFO L273 TraceCheckUtils]: 169: Hoare triple {47823#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47823#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:16,773 INFO L273 TraceCheckUtils]: 170: Hoare triple {47823#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {47824#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:16,773 INFO L273 TraceCheckUtils]: 171: Hoare triple {47824#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47824#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:16,774 INFO L273 TraceCheckUtils]: 172: Hoare triple {47824#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47824#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:16,775 INFO L273 TraceCheckUtils]: 173: Hoare triple {47824#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {47825#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:16,775 INFO L273 TraceCheckUtils]: 174: Hoare triple {47825#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47825#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:16,776 INFO L273 TraceCheckUtils]: 175: Hoare triple {47825#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {47825#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:16,776 INFO L273 TraceCheckUtils]: 176: Hoare triple {47825#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {47826#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:16,777 INFO L273 TraceCheckUtils]: 177: Hoare triple {47826#(<= main_~i~0 57)} assume !(~i~0 < 100000); {47768#false} is VALID [2018-11-23 12:07:16,777 INFO L273 TraceCheckUtils]: 178: Hoare triple {47768#false} havoc ~x~0;~x~0 := 0; {47768#false} is VALID [2018-11-23 12:07:16,777 INFO L273 TraceCheckUtils]: 179: Hoare triple {47768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {47768#false} is VALID [2018-11-23 12:07:16,778 INFO L256 TraceCheckUtils]: 180: Hoare triple {47768#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {47768#false} is VALID [2018-11-23 12:07:16,778 INFO L273 TraceCheckUtils]: 181: Hoare triple {47768#false} ~cond := #in~cond; {47768#false} is VALID [2018-11-23 12:07:16,778 INFO L273 TraceCheckUtils]: 182: Hoare triple {47768#false} assume 0 == ~cond; {47768#false} is VALID [2018-11-23 12:07:16,778 INFO L273 TraceCheckUtils]: 183: Hoare triple {47768#false} assume !false; {47768#false} is VALID [2018-11-23 12:07:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:16,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:16,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2018-11-23 12:07:16,819 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 184 [2018-11-23 12:07:16,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:16,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states. [2018-11-23 12:07:17,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:17,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-23 12:07:17,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-23 12:07:17,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 12:07:17,004 INFO L87 Difference]: Start difference. First operand 189 states and 247 transitions. Second operand 61 states. [2018-11-23 12:07:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:18,293 INFO L93 Difference]: Finished difference Result 205 states and 266 transitions. [2018-11-23 12:07:18,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-23 12:07:18,293 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 184 [2018-11-23 12:07:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:07:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 266 transitions. [2018-11-23 12:07:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:07:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 266 transitions. [2018-11-23 12:07:18,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 266 transitions. [2018-11-23 12:07:18,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:18,585 INFO L225 Difference]: With dead ends: 205 [2018-11-23 12:07:18,585 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 12:07:18,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 12:07:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 12:07:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-11-23 12:07:18,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:18,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 192 states. [2018-11-23 12:07:18,636 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 192 states. [2018-11-23 12:07:18,636 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 192 states. [2018-11-23 12:07:18,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:18,639 INFO L93 Difference]: Finished difference Result 194 states and 254 transitions. [2018-11-23 12:07:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2018-11-23 12:07:18,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:18,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:18,639 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 194 states. [2018-11-23 12:07:18,639 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 194 states. [2018-11-23 12:07:18,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:18,642 INFO L93 Difference]: Finished difference Result 194 states and 254 transitions. [2018-11-23 12:07:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2018-11-23 12:07:18,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:18,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:18,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:18,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-23 12:07:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 251 transitions. [2018-11-23 12:07:18,645 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 251 transitions. Word has length 184 [2018-11-23 12:07:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:18,645 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 251 transitions. [2018-11-23 12:07:18,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-23 12:07:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 251 transitions. [2018-11-23 12:07:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-23 12:07:18,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:18,646 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:18,646 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:18,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:18,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1184177529, now seen corresponding path program 58 times [2018-11-23 12:07:18,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:18,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:18,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:18,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:18,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:20,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {49299#true} call ULTIMATE.init(); {49299#true} is VALID [2018-11-23 12:07:20,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {49299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {49299#true} is VALID [2018-11-23 12:07:20,571 INFO L273 TraceCheckUtils]: 2: Hoare triple {49299#true} assume true; {49299#true} is VALID [2018-11-23 12:07:20,571 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49299#true} {49299#true} #55#return; {49299#true} is VALID [2018-11-23 12:07:20,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {49299#true} call #t~ret4 := main(); {49299#true} is VALID [2018-11-23 12:07:20,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {49299#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {49301#(= main_~i~0 0)} is VALID [2018-11-23 12:07:20,572 INFO L273 TraceCheckUtils]: 6: Hoare triple {49301#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49301#(= main_~i~0 0)} is VALID [2018-11-23 12:07:20,573 INFO L273 TraceCheckUtils]: 7: Hoare triple {49301#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49301#(= main_~i~0 0)} is VALID [2018-11-23 12:07:20,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {49301#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {49302#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:20,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {49302#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49302#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:20,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {49302#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49302#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:20,574 INFO L273 TraceCheckUtils]: 11: Hoare triple {49302#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {49303#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:20,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {49303#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49303#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:20,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {49303#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49303#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:20,575 INFO L273 TraceCheckUtils]: 14: Hoare triple {49303#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {49304#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:20,576 INFO L273 TraceCheckUtils]: 15: Hoare triple {49304#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49304#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:20,576 INFO L273 TraceCheckUtils]: 16: Hoare triple {49304#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49304#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:20,576 INFO L273 TraceCheckUtils]: 17: Hoare triple {49304#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {49305#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:20,577 INFO L273 TraceCheckUtils]: 18: Hoare triple {49305#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49305#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:20,577 INFO L273 TraceCheckUtils]: 19: Hoare triple {49305#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49305#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:20,578 INFO L273 TraceCheckUtils]: 20: Hoare triple {49305#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {49306#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:20,579 INFO L273 TraceCheckUtils]: 21: Hoare triple {49306#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49306#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:20,579 INFO L273 TraceCheckUtils]: 22: Hoare triple {49306#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49306#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:20,580 INFO L273 TraceCheckUtils]: 23: Hoare triple {49306#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {49307#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:20,580 INFO L273 TraceCheckUtils]: 24: Hoare triple {49307#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49307#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:20,581 INFO L273 TraceCheckUtils]: 25: Hoare triple {49307#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49307#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:20,581 INFO L273 TraceCheckUtils]: 26: Hoare triple {49307#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {49308#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:20,582 INFO L273 TraceCheckUtils]: 27: Hoare triple {49308#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49308#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:20,582 INFO L273 TraceCheckUtils]: 28: Hoare triple {49308#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49308#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:20,583 INFO L273 TraceCheckUtils]: 29: Hoare triple {49308#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {49309#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:20,584 INFO L273 TraceCheckUtils]: 30: Hoare triple {49309#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49309#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:20,584 INFO L273 TraceCheckUtils]: 31: Hoare triple {49309#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49309#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:20,585 INFO L273 TraceCheckUtils]: 32: Hoare triple {49309#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {49310#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:20,585 INFO L273 TraceCheckUtils]: 33: Hoare triple {49310#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49310#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:20,586 INFO L273 TraceCheckUtils]: 34: Hoare triple {49310#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49310#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:20,587 INFO L273 TraceCheckUtils]: 35: Hoare triple {49310#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {49311#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:20,587 INFO L273 TraceCheckUtils]: 36: Hoare triple {49311#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49311#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:20,588 INFO L273 TraceCheckUtils]: 37: Hoare triple {49311#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49311#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:20,588 INFO L273 TraceCheckUtils]: 38: Hoare triple {49311#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {49312#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:20,589 INFO L273 TraceCheckUtils]: 39: Hoare triple {49312#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49312#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:20,589 INFO L273 TraceCheckUtils]: 40: Hoare triple {49312#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49312#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:20,590 INFO L273 TraceCheckUtils]: 41: Hoare triple {49312#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {49313#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:20,590 INFO L273 TraceCheckUtils]: 42: Hoare triple {49313#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49313#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:20,591 INFO L273 TraceCheckUtils]: 43: Hoare triple {49313#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49313#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:20,592 INFO L273 TraceCheckUtils]: 44: Hoare triple {49313#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {49314#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:20,592 INFO L273 TraceCheckUtils]: 45: Hoare triple {49314#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49314#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:20,593 INFO L273 TraceCheckUtils]: 46: Hoare triple {49314#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49314#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:20,593 INFO L273 TraceCheckUtils]: 47: Hoare triple {49314#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {49315#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:20,594 INFO L273 TraceCheckUtils]: 48: Hoare triple {49315#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49315#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:20,594 INFO L273 TraceCheckUtils]: 49: Hoare triple {49315#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49315#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:20,595 INFO L273 TraceCheckUtils]: 50: Hoare triple {49315#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {49316#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:20,596 INFO L273 TraceCheckUtils]: 51: Hoare triple {49316#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49316#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:20,596 INFO L273 TraceCheckUtils]: 52: Hoare triple {49316#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49316#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:20,597 INFO L273 TraceCheckUtils]: 53: Hoare triple {49316#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {49317#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:20,597 INFO L273 TraceCheckUtils]: 54: Hoare triple {49317#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49317#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:20,598 INFO L273 TraceCheckUtils]: 55: Hoare triple {49317#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49317#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:20,598 INFO L273 TraceCheckUtils]: 56: Hoare triple {49317#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {49318#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:20,599 INFO L273 TraceCheckUtils]: 57: Hoare triple {49318#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49318#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:20,599 INFO L273 TraceCheckUtils]: 58: Hoare triple {49318#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49318#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:20,600 INFO L273 TraceCheckUtils]: 59: Hoare triple {49318#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {49319#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:20,601 INFO L273 TraceCheckUtils]: 60: Hoare triple {49319#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49319#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:20,601 INFO L273 TraceCheckUtils]: 61: Hoare triple {49319#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49319#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:20,602 INFO L273 TraceCheckUtils]: 62: Hoare triple {49319#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {49320#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:20,602 INFO L273 TraceCheckUtils]: 63: Hoare triple {49320#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49320#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:20,603 INFO L273 TraceCheckUtils]: 64: Hoare triple {49320#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49320#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:20,604 INFO L273 TraceCheckUtils]: 65: Hoare triple {49320#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {49321#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:20,604 INFO L273 TraceCheckUtils]: 66: Hoare triple {49321#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49321#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:20,605 INFO L273 TraceCheckUtils]: 67: Hoare triple {49321#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49321#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:20,605 INFO L273 TraceCheckUtils]: 68: Hoare triple {49321#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {49322#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:20,606 INFO L273 TraceCheckUtils]: 69: Hoare triple {49322#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49322#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:20,606 INFO L273 TraceCheckUtils]: 70: Hoare triple {49322#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49322#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:20,607 INFO L273 TraceCheckUtils]: 71: Hoare triple {49322#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {49323#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:20,607 INFO L273 TraceCheckUtils]: 72: Hoare triple {49323#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49323#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:20,608 INFO L273 TraceCheckUtils]: 73: Hoare triple {49323#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49323#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:20,609 INFO L273 TraceCheckUtils]: 74: Hoare triple {49323#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {49324#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:20,609 INFO L273 TraceCheckUtils]: 75: Hoare triple {49324#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49324#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:20,610 INFO L273 TraceCheckUtils]: 76: Hoare triple {49324#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49324#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:20,610 INFO L273 TraceCheckUtils]: 77: Hoare triple {49324#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {49325#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:20,611 INFO L273 TraceCheckUtils]: 78: Hoare triple {49325#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49325#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:20,611 INFO L273 TraceCheckUtils]: 79: Hoare triple {49325#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49325#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:20,612 INFO L273 TraceCheckUtils]: 80: Hoare triple {49325#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {49326#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:20,613 INFO L273 TraceCheckUtils]: 81: Hoare triple {49326#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49326#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:20,613 INFO L273 TraceCheckUtils]: 82: Hoare triple {49326#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49326#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:20,614 INFO L273 TraceCheckUtils]: 83: Hoare triple {49326#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {49327#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:20,614 INFO L273 TraceCheckUtils]: 84: Hoare triple {49327#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49327#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:20,615 INFO L273 TraceCheckUtils]: 85: Hoare triple {49327#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49327#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:20,615 INFO L273 TraceCheckUtils]: 86: Hoare triple {49327#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {49328#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:20,616 INFO L273 TraceCheckUtils]: 87: Hoare triple {49328#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49328#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:20,616 INFO L273 TraceCheckUtils]: 88: Hoare triple {49328#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49328#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:20,617 INFO L273 TraceCheckUtils]: 89: Hoare triple {49328#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {49329#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:20,618 INFO L273 TraceCheckUtils]: 90: Hoare triple {49329#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49329#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:20,618 INFO L273 TraceCheckUtils]: 91: Hoare triple {49329#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49329#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:20,619 INFO L273 TraceCheckUtils]: 92: Hoare triple {49329#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {49330#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:20,619 INFO L273 TraceCheckUtils]: 93: Hoare triple {49330#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49330#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:20,620 INFO L273 TraceCheckUtils]: 94: Hoare triple {49330#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49330#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:20,621 INFO L273 TraceCheckUtils]: 95: Hoare triple {49330#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {49331#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:20,621 INFO L273 TraceCheckUtils]: 96: Hoare triple {49331#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49331#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:20,622 INFO L273 TraceCheckUtils]: 97: Hoare triple {49331#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49331#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:20,622 INFO L273 TraceCheckUtils]: 98: Hoare triple {49331#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {49332#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:20,623 INFO L273 TraceCheckUtils]: 99: Hoare triple {49332#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49332#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:20,623 INFO L273 TraceCheckUtils]: 100: Hoare triple {49332#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49332#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:20,624 INFO L273 TraceCheckUtils]: 101: Hoare triple {49332#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {49333#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:20,624 INFO L273 TraceCheckUtils]: 102: Hoare triple {49333#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49333#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:20,625 INFO L273 TraceCheckUtils]: 103: Hoare triple {49333#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49333#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:20,626 INFO L273 TraceCheckUtils]: 104: Hoare triple {49333#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {49334#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:20,626 INFO L273 TraceCheckUtils]: 105: Hoare triple {49334#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49334#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:20,627 INFO L273 TraceCheckUtils]: 106: Hoare triple {49334#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49334#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:20,627 INFO L273 TraceCheckUtils]: 107: Hoare triple {49334#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {49335#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:20,628 INFO L273 TraceCheckUtils]: 108: Hoare triple {49335#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49335#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:20,628 INFO L273 TraceCheckUtils]: 109: Hoare triple {49335#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49335#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:20,629 INFO L273 TraceCheckUtils]: 110: Hoare triple {49335#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {49336#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:20,630 INFO L273 TraceCheckUtils]: 111: Hoare triple {49336#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49336#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:20,630 INFO L273 TraceCheckUtils]: 112: Hoare triple {49336#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49336#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:20,631 INFO L273 TraceCheckUtils]: 113: Hoare triple {49336#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {49337#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:20,631 INFO L273 TraceCheckUtils]: 114: Hoare triple {49337#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49337#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:20,632 INFO L273 TraceCheckUtils]: 115: Hoare triple {49337#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49337#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:20,632 INFO L273 TraceCheckUtils]: 116: Hoare triple {49337#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {49338#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:20,633 INFO L273 TraceCheckUtils]: 117: Hoare triple {49338#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49338#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:20,633 INFO L273 TraceCheckUtils]: 118: Hoare triple {49338#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49338#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:20,634 INFO L273 TraceCheckUtils]: 119: Hoare triple {49338#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {49339#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:20,635 INFO L273 TraceCheckUtils]: 120: Hoare triple {49339#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49339#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:20,635 INFO L273 TraceCheckUtils]: 121: Hoare triple {49339#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49339#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:20,636 INFO L273 TraceCheckUtils]: 122: Hoare triple {49339#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {49340#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:20,636 INFO L273 TraceCheckUtils]: 123: Hoare triple {49340#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49340#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:20,637 INFO L273 TraceCheckUtils]: 124: Hoare triple {49340#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49340#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:20,638 INFO L273 TraceCheckUtils]: 125: Hoare triple {49340#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {49341#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:20,638 INFO L273 TraceCheckUtils]: 126: Hoare triple {49341#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49341#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:20,639 INFO L273 TraceCheckUtils]: 127: Hoare triple {49341#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49341#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:20,639 INFO L273 TraceCheckUtils]: 128: Hoare triple {49341#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {49342#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:20,640 INFO L273 TraceCheckUtils]: 129: Hoare triple {49342#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49342#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:20,640 INFO L273 TraceCheckUtils]: 130: Hoare triple {49342#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49342#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:20,641 INFO L273 TraceCheckUtils]: 131: Hoare triple {49342#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {49343#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:20,641 INFO L273 TraceCheckUtils]: 132: Hoare triple {49343#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49343#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:20,642 INFO L273 TraceCheckUtils]: 133: Hoare triple {49343#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49343#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:20,643 INFO L273 TraceCheckUtils]: 134: Hoare triple {49343#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {49344#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:20,643 INFO L273 TraceCheckUtils]: 135: Hoare triple {49344#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49344#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:20,644 INFO L273 TraceCheckUtils]: 136: Hoare triple {49344#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49344#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:20,644 INFO L273 TraceCheckUtils]: 137: Hoare triple {49344#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {49345#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:20,645 INFO L273 TraceCheckUtils]: 138: Hoare triple {49345#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49345#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:20,645 INFO L273 TraceCheckUtils]: 139: Hoare triple {49345#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49345#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:20,646 INFO L273 TraceCheckUtils]: 140: Hoare triple {49345#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {49346#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:20,647 INFO L273 TraceCheckUtils]: 141: Hoare triple {49346#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49346#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:20,647 INFO L273 TraceCheckUtils]: 142: Hoare triple {49346#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49346#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:20,648 INFO L273 TraceCheckUtils]: 143: Hoare triple {49346#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {49347#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:20,648 INFO L273 TraceCheckUtils]: 144: Hoare triple {49347#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49347#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:20,649 INFO L273 TraceCheckUtils]: 145: Hoare triple {49347#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49347#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:20,649 INFO L273 TraceCheckUtils]: 146: Hoare triple {49347#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {49348#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:20,650 INFO L273 TraceCheckUtils]: 147: Hoare triple {49348#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49348#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:20,650 INFO L273 TraceCheckUtils]: 148: Hoare triple {49348#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49348#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:20,651 INFO L273 TraceCheckUtils]: 149: Hoare triple {49348#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {49349#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:20,652 INFO L273 TraceCheckUtils]: 150: Hoare triple {49349#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49349#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:20,652 INFO L273 TraceCheckUtils]: 151: Hoare triple {49349#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49349#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:20,653 INFO L273 TraceCheckUtils]: 152: Hoare triple {49349#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {49350#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:20,653 INFO L273 TraceCheckUtils]: 153: Hoare triple {49350#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49350#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:20,654 INFO L273 TraceCheckUtils]: 154: Hoare triple {49350#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49350#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:20,655 INFO L273 TraceCheckUtils]: 155: Hoare triple {49350#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {49351#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:20,655 INFO L273 TraceCheckUtils]: 156: Hoare triple {49351#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49351#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:20,656 INFO L273 TraceCheckUtils]: 157: Hoare triple {49351#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49351#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:20,656 INFO L273 TraceCheckUtils]: 158: Hoare triple {49351#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {49352#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:20,657 INFO L273 TraceCheckUtils]: 159: Hoare triple {49352#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49352#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:20,657 INFO L273 TraceCheckUtils]: 160: Hoare triple {49352#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49352#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:20,658 INFO L273 TraceCheckUtils]: 161: Hoare triple {49352#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {49353#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:20,658 INFO L273 TraceCheckUtils]: 162: Hoare triple {49353#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49353#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:20,659 INFO L273 TraceCheckUtils]: 163: Hoare triple {49353#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49353#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:20,660 INFO L273 TraceCheckUtils]: 164: Hoare triple {49353#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {49354#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:20,660 INFO L273 TraceCheckUtils]: 165: Hoare triple {49354#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49354#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:20,661 INFO L273 TraceCheckUtils]: 166: Hoare triple {49354#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49354#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:20,661 INFO L273 TraceCheckUtils]: 167: Hoare triple {49354#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {49355#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:20,662 INFO L273 TraceCheckUtils]: 168: Hoare triple {49355#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49355#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:20,662 INFO L273 TraceCheckUtils]: 169: Hoare triple {49355#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49355#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:20,663 INFO L273 TraceCheckUtils]: 170: Hoare triple {49355#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {49356#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:20,664 INFO L273 TraceCheckUtils]: 171: Hoare triple {49356#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49356#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:20,664 INFO L273 TraceCheckUtils]: 172: Hoare triple {49356#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49356#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:20,665 INFO L273 TraceCheckUtils]: 173: Hoare triple {49356#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {49357#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:20,665 INFO L273 TraceCheckUtils]: 174: Hoare triple {49357#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49357#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:20,666 INFO L273 TraceCheckUtils]: 175: Hoare triple {49357#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49357#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:20,666 INFO L273 TraceCheckUtils]: 176: Hoare triple {49357#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {49358#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:20,667 INFO L273 TraceCheckUtils]: 177: Hoare triple {49358#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49358#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:20,667 INFO L273 TraceCheckUtils]: 178: Hoare triple {49358#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49358#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:20,668 INFO L273 TraceCheckUtils]: 179: Hoare triple {49358#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {49359#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:20,669 INFO L273 TraceCheckUtils]: 180: Hoare triple {49359#(<= main_~i~0 58)} assume !(~i~0 < 100000); {49300#false} is VALID [2018-11-23 12:07:20,669 INFO L273 TraceCheckUtils]: 181: Hoare triple {49300#false} havoc ~x~0;~x~0 := 0; {49300#false} is VALID [2018-11-23 12:07:20,669 INFO L273 TraceCheckUtils]: 182: Hoare triple {49300#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {49300#false} is VALID [2018-11-23 12:07:20,669 INFO L256 TraceCheckUtils]: 183: Hoare triple {49300#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {49300#false} is VALID [2018-11-23 12:07:20,670 INFO L273 TraceCheckUtils]: 184: Hoare triple {49300#false} ~cond := #in~cond; {49300#false} is VALID [2018-11-23 12:07:20,670 INFO L273 TraceCheckUtils]: 185: Hoare triple {49300#false} assume 0 == ~cond; {49300#false} is VALID [2018-11-23 12:07:20,670 INFO L273 TraceCheckUtils]: 186: Hoare triple {49300#false} assume !false; {49300#false} is VALID [2018-11-23 12:07:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:20,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:20,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:20,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:07:20,786 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:07:20,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:20,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:21,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {49299#true} call ULTIMATE.init(); {49299#true} is VALID [2018-11-23 12:07:21,214 INFO L273 TraceCheckUtils]: 1: Hoare triple {49299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {49299#true} is VALID [2018-11-23 12:07:21,214 INFO L273 TraceCheckUtils]: 2: Hoare triple {49299#true} assume true; {49299#true} is VALID [2018-11-23 12:07:21,215 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49299#true} {49299#true} #55#return; {49299#true} is VALID [2018-11-23 12:07:21,215 INFO L256 TraceCheckUtils]: 4: Hoare triple {49299#true} call #t~ret4 := main(); {49299#true} is VALID [2018-11-23 12:07:21,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {49299#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {49378#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:21,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {49378#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49378#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:21,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {49378#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49378#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:21,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {49378#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {49302#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:21,217 INFO L273 TraceCheckUtils]: 9: Hoare triple {49302#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49302#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:21,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {49302#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49302#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:21,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {49302#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {49303#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:21,218 INFO L273 TraceCheckUtils]: 12: Hoare triple {49303#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49303#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:21,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {49303#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49303#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:21,219 INFO L273 TraceCheckUtils]: 14: Hoare triple {49303#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {49304#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:21,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {49304#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49304#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:21,220 INFO L273 TraceCheckUtils]: 16: Hoare triple {49304#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49304#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:21,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {49304#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {49305#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:21,222 INFO L273 TraceCheckUtils]: 18: Hoare triple {49305#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49305#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:21,222 INFO L273 TraceCheckUtils]: 19: Hoare triple {49305#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49305#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:21,223 INFO L273 TraceCheckUtils]: 20: Hoare triple {49305#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {49306#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:21,223 INFO L273 TraceCheckUtils]: 21: Hoare triple {49306#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49306#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:21,224 INFO L273 TraceCheckUtils]: 22: Hoare triple {49306#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49306#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:21,225 INFO L273 TraceCheckUtils]: 23: Hoare triple {49306#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {49307#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:21,225 INFO L273 TraceCheckUtils]: 24: Hoare triple {49307#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49307#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:21,226 INFO L273 TraceCheckUtils]: 25: Hoare triple {49307#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49307#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:21,226 INFO L273 TraceCheckUtils]: 26: Hoare triple {49307#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {49308#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:21,227 INFO L273 TraceCheckUtils]: 27: Hoare triple {49308#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49308#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:21,227 INFO L273 TraceCheckUtils]: 28: Hoare triple {49308#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49308#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:21,228 INFO L273 TraceCheckUtils]: 29: Hoare triple {49308#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {49309#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:21,228 INFO L273 TraceCheckUtils]: 30: Hoare triple {49309#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49309#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:21,229 INFO L273 TraceCheckUtils]: 31: Hoare triple {49309#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49309#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:21,230 INFO L273 TraceCheckUtils]: 32: Hoare triple {49309#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {49310#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:21,230 INFO L273 TraceCheckUtils]: 33: Hoare triple {49310#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49310#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:21,231 INFO L273 TraceCheckUtils]: 34: Hoare triple {49310#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49310#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:21,231 INFO L273 TraceCheckUtils]: 35: Hoare triple {49310#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {49311#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:21,232 INFO L273 TraceCheckUtils]: 36: Hoare triple {49311#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49311#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:21,232 INFO L273 TraceCheckUtils]: 37: Hoare triple {49311#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49311#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:21,233 INFO L273 TraceCheckUtils]: 38: Hoare triple {49311#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {49312#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:21,234 INFO L273 TraceCheckUtils]: 39: Hoare triple {49312#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49312#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:21,234 INFO L273 TraceCheckUtils]: 40: Hoare triple {49312#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49312#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:21,235 INFO L273 TraceCheckUtils]: 41: Hoare triple {49312#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {49313#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:21,235 INFO L273 TraceCheckUtils]: 42: Hoare triple {49313#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49313#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:21,236 INFO L273 TraceCheckUtils]: 43: Hoare triple {49313#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49313#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:21,236 INFO L273 TraceCheckUtils]: 44: Hoare triple {49313#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {49314#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:21,237 INFO L273 TraceCheckUtils]: 45: Hoare triple {49314#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49314#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:21,237 INFO L273 TraceCheckUtils]: 46: Hoare triple {49314#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49314#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:21,238 INFO L273 TraceCheckUtils]: 47: Hoare triple {49314#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {49315#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:21,239 INFO L273 TraceCheckUtils]: 48: Hoare triple {49315#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49315#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:21,239 INFO L273 TraceCheckUtils]: 49: Hoare triple {49315#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49315#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:21,240 INFO L273 TraceCheckUtils]: 50: Hoare triple {49315#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {49316#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:21,240 INFO L273 TraceCheckUtils]: 51: Hoare triple {49316#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49316#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:21,241 INFO L273 TraceCheckUtils]: 52: Hoare triple {49316#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49316#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:21,242 INFO L273 TraceCheckUtils]: 53: Hoare triple {49316#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {49317#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:21,242 INFO L273 TraceCheckUtils]: 54: Hoare triple {49317#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49317#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:21,243 INFO L273 TraceCheckUtils]: 55: Hoare triple {49317#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49317#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:21,243 INFO L273 TraceCheckUtils]: 56: Hoare triple {49317#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {49318#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:21,244 INFO L273 TraceCheckUtils]: 57: Hoare triple {49318#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49318#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:21,244 INFO L273 TraceCheckUtils]: 58: Hoare triple {49318#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49318#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:21,245 INFO L273 TraceCheckUtils]: 59: Hoare triple {49318#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {49319#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:21,245 INFO L273 TraceCheckUtils]: 60: Hoare triple {49319#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49319#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:21,246 INFO L273 TraceCheckUtils]: 61: Hoare triple {49319#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49319#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:21,247 INFO L273 TraceCheckUtils]: 62: Hoare triple {49319#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {49320#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:21,247 INFO L273 TraceCheckUtils]: 63: Hoare triple {49320#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49320#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:21,248 INFO L273 TraceCheckUtils]: 64: Hoare triple {49320#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49320#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:21,248 INFO L273 TraceCheckUtils]: 65: Hoare triple {49320#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {49321#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:21,249 INFO L273 TraceCheckUtils]: 66: Hoare triple {49321#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49321#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:21,249 INFO L273 TraceCheckUtils]: 67: Hoare triple {49321#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49321#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:21,250 INFO L273 TraceCheckUtils]: 68: Hoare triple {49321#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {49322#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:21,251 INFO L273 TraceCheckUtils]: 69: Hoare triple {49322#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49322#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:21,251 INFO L273 TraceCheckUtils]: 70: Hoare triple {49322#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49322#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:21,252 INFO L273 TraceCheckUtils]: 71: Hoare triple {49322#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {49323#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:21,252 INFO L273 TraceCheckUtils]: 72: Hoare triple {49323#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49323#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:21,253 INFO L273 TraceCheckUtils]: 73: Hoare triple {49323#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49323#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:21,253 INFO L273 TraceCheckUtils]: 74: Hoare triple {49323#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {49324#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:21,254 INFO L273 TraceCheckUtils]: 75: Hoare triple {49324#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49324#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:21,254 INFO L273 TraceCheckUtils]: 76: Hoare triple {49324#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49324#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:21,255 INFO L273 TraceCheckUtils]: 77: Hoare triple {49324#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {49325#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:21,256 INFO L273 TraceCheckUtils]: 78: Hoare triple {49325#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49325#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:21,256 INFO L273 TraceCheckUtils]: 79: Hoare triple {49325#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49325#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:21,257 INFO L273 TraceCheckUtils]: 80: Hoare triple {49325#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {49326#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:21,257 INFO L273 TraceCheckUtils]: 81: Hoare triple {49326#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49326#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:21,258 INFO L273 TraceCheckUtils]: 82: Hoare triple {49326#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49326#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:21,259 INFO L273 TraceCheckUtils]: 83: Hoare triple {49326#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {49327#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:21,259 INFO L273 TraceCheckUtils]: 84: Hoare triple {49327#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49327#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:21,260 INFO L273 TraceCheckUtils]: 85: Hoare triple {49327#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49327#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:21,260 INFO L273 TraceCheckUtils]: 86: Hoare triple {49327#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {49328#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:21,261 INFO L273 TraceCheckUtils]: 87: Hoare triple {49328#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49328#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:21,261 INFO L273 TraceCheckUtils]: 88: Hoare triple {49328#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49328#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:21,262 INFO L273 TraceCheckUtils]: 89: Hoare triple {49328#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {49329#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:21,262 INFO L273 TraceCheckUtils]: 90: Hoare triple {49329#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49329#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:21,263 INFO L273 TraceCheckUtils]: 91: Hoare triple {49329#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49329#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:21,264 INFO L273 TraceCheckUtils]: 92: Hoare triple {49329#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {49330#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:21,264 INFO L273 TraceCheckUtils]: 93: Hoare triple {49330#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49330#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:21,265 INFO L273 TraceCheckUtils]: 94: Hoare triple {49330#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49330#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:21,265 INFO L273 TraceCheckUtils]: 95: Hoare triple {49330#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {49331#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:21,266 INFO L273 TraceCheckUtils]: 96: Hoare triple {49331#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49331#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:21,266 INFO L273 TraceCheckUtils]: 97: Hoare triple {49331#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49331#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:21,267 INFO L273 TraceCheckUtils]: 98: Hoare triple {49331#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {49332#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:21,268 INFO L273 TraceCheckUtils]: 99: Hoare triple {49332#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49332#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:21,268 INFO L273 TraceCheckUtils]: 100: Hoare triple {49332#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49332#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:21,269 INFO L273 TraceCheckUtils]: 101: Hoare triple {49332#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {49333#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:21,269 INFO L273 TraceCheckUtils]: 102: Hoare triple {49333#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49333#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:21,270 INFO L273 TraceCheckUtils]: 103: Hoare triple {49333#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49333#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:21,270 INFO L273 TraceCheckUtils]: 104: Hoare triple {49333#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {49334#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:21,271 INFO L273 TraceCheckUtils]: 105: Hoare triple {49334#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49334#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:21,271 INFO L273 TraceCheckUtils]: 106: Hoare triple {49334#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49334#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:21,272 INFO L273 TraceCheckUtils]: 107: Hoare triple {49334#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {49335#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:21,273 INFO L273 TraceCheckUtils]: 108: Hoare triple {49335#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49335#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:21,273 INFO L273 TraceCheckUtils]: 109: Hoare triple {49335#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49335#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:21,274 INFO L273 TraceCheckUtils]: 110: Hoare triple {49335#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {49336#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:21,274 INFO L273 TraceCheckUtils]: 111: Hoare triple {49336#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49336#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:21,275 INFO L273 TraceCheckUtils]: 112: Hoare triple {49336#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49336#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:21,275 INFO L273 TraceCheckUtils]: 113: Hoare triple {49336#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {49337#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:21,276 INFO L273 TraceCheckUtils]: 114: Hoare triple {49337#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49337#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:21,276 INFO L273 TraceCheckUtils]: 115: Hoare triple {49337#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49337#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:21,277 INFO L273 TraceCheckUtils]: 116: Hoare triple {49337#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {49338#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:21,278 INFO L273 TraceCheckUtils]: 117: Hoare triple {49338#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49338#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:21,278 INFO L273 TraceCheckUtils]: 118: Hoare triple {49338#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49338#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:21,279 INFO L273 TraceCheckUtils]: 119: Hoare triple {49338#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {49339#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:21,279 INFO L273 TraceCheckUtils]: 120: Hoare triple {49339#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49339#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:21,280 INFO L273 TraceCheckUtils]: 121: Hoare triple {49339#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49339#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:21,281 INFO L273 TraceCheckUtils]: 122: Hoare triple {49339#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {49340#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:21,281 INFO L273 TraceCheckUtils]: 123: Hoare triple {49340#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49340#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:21,282 INFO L273 TraceCheckUtils]: 124: Hoare triple {49340#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49340#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:21,282 INFO L273 TraceCheckUtils]: 125: Hoare triple {49340#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {49341#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:21,283 INFO L273 TraceCheckUtils]: 126: Hoare triple {49341#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49341#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:21,283 INFO L273 TraceCheckUtils]: 127: Hoare triple {49341#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49341#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:21,284 INFO L273 TraceCheckUtils]: 128: Hoare triple {49341#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {49342#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:21,284 INFO L273 TraceCheckUtils]: 129: Hoare triple {49342#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49342#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:21,285 INFO L273 TraceCheckUtils]: 130: Hoare triple {49342#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49342#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:21,286 INFO L273 TraceCheckUtils]: 131: Hoare triple {49342#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {49343#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:21,286 INFO L273 TraceCheckUtils]: 132: Hoare triple {49343#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49343#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:21,287 INFO L273 TraceCheckUtils]: 133: Hoare triple {49343#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49343#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:21,287 INFO L273 TraceCheckUtils]: 134: Hoare triple {49343#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {49344#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:21,288 INFO L273 TraceCheckUtils]: 135: Hoare triple {49344#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49344#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:21,288 INFO L273 TraceCheckUtils]: 136: Hoare triple {49344#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49344#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:21,289 INFO L273 TraceCheckUtils]: 137: Hoare triple {49344#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {49345#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:21,290 INFO L273 TraceCheckUtils]: 138: Hoare triple {49345#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49345#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:21,290 INFO L273 TraceCheckUtils]: 139: Hoare triple {49345#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49345#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:21,291 INFO L273 TraceCheckUtils]: 140: Hoare triple {49345#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {49346#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:21,291 INFO L273 TraceCheckUtils]: 141: Hoare triple {49346#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49346#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:21,292 INFO L273 TraceCheckUtils]: 142: Hoare triple {49346#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49346#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:21,292 INFO L273 TraceCheckUtils]: 143: Hoare triple {49346#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {49347#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:21,293 INFO L273 TraceCheckUtils]: 144: Hoare triple {49347#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49347#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:21,293 INFO L273 TraceCheckUtils]: 145: Hoare triple {49347#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49347#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:21,294 INFO L273 TraceCheckUtils]: 146: Hoare triple {49347#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {49348#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:21,295 INFO L273 TraceCheckUtils]: 147: Hoare triple {49348#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49348#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:21,295 INFO L273 TraceCheckUtils]: 148: Hoare triple {49348#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49348#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:21,296 INFO L273 TraceCheckUtils]: 149: Hoare triple {49348#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {49349#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:21,296 INFO L273 TraceCheckUtils]: 150: Hoare triple {49349#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49349#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:21,297 INFO L273 TraceCheckUtils]: 151: Hoare triple {49349#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49349#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:21,298 INFO L273 TraceCheckUtils]: 152: Hoare triple {49349#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {49350#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:21,298 INFO L273 TraceCheckUtils]: 153: Hoare triple {49350#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49350#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:21,298 INFO L273 TraceCheckUtils]: 154: Hoare triple {49350#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49350#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:21,299 INFO L273 TraceCheckUtils]: 155: Hoare triple {49350#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {49351#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:21,300 INFO L273 TraceCheckUtils]: 156: Hoare triple {49351#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49351#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:21,300 INFO L273 TraceCheckUtils]: 157: Hoare triple {49351#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49351#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:21,301 INFO L273 TraceCheckUtils]: 158: Hoare triple {49351#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {49352#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:21,301 INFO L273 TraceCheckUtils]: 159: Hoare triple {49352#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49352#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:21,302 INFO L273 TraceCheckUtils]: 160: Hoare triple {49352#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49352#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:21,303 INFO L273 TraceCheckUtils]: 161: Hoare triple {49352#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {49353#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:21,303 INFO L273 TraceCheckUtils]: 162: Hoare triple {49353#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49353#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:21,304 INFO L273 TraceCheckUtils]: 163: Hoare triple {49353#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49353#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:21,304 INFO L273 TraceCheckUtils]: 164: Hoare triple {49353#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {49354#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:21,305 INFO L273 TraceCheckUtils]: 165: Hoare triple {49354#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49354#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:21,305 INFO L273 TraceCheckUtils]: 166: Hoare triple {49354#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49354#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:21,306 INFO L273 TraceCheckUtils]: 167: Hoare triple {49354#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {49355#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:21,306 INFO L273 TraceCheckUtils]: 168: Hoare triple {49355#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49355#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:21,307 INFO L273 TraceCheckUtils]: 169: Hoare triple {49355#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49355#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:21,308 INFO L273 TraceCheckUtils]: 170: Hoare triple {49355#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {49356#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:21,308 INFO L273 TraceCheckUtils]: 171: Hoare triple {49356#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49356#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:21,309 INFO L273 TraceCheckUtils]: 172: Hoare triple {49356#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49356#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:21,309 INFO L273 TraceCheckUtils]: 173: Hoare triple {49356#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {49357#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:21,310 INFO L273 TraceCheckUtils]: 174: Hoare triple {49357#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49357#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:21,310 INFO L273 TraceCheckUtils]: 175: Hoare triple {49357#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49357#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:21,311 INFO L273 TraceCheckUtils]: 176: Hoare triple {49357#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {49358#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:21,312 INFO L273 TraceCheckUtils]: 177: Hoare triple {49358#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49358#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:21,312 INFO L273 TraceCheckUtils]: 178: Hoare triple {49358#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {49358#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:21,313 INFO L273 TraceCheckUtils]: 179: Hoare triple {49358#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {49359#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:21,313 INFO L273 TraceCheckUtils]: 180: Hoare triple {49359#(<= main_~i~0 58)} assume !(~i~0 < 100000); {49300#false} is VALID [2018-11-23 12:07:21,314 INFO L273 TraceCheckUtils]: 181: Hoare triple {49300#false} havoc ~x~0;~x~0 := 0; {49300#false} is VALID [2018-11-23 12:07:21,314 INFO L273 TraceCheckUtils]: 182: Hoare triple {49300#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {49300#false} is VALID [2018-11-23 12:07:21,314 INFO L256 TraceCheckUtils]: 183: Hoare triple {49300#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {49300#false} is VALID [2018-11-23 12:07:21,314 INFO L273 TraceCheckUtils]: 184: Hoare triple {49300#false} ~cond := #in~cond; {49300#false} is VALID [2018-11-23 12:07:21,314 INFO L273 TraceCheckUtils]: 185: Hoare triple {49300#false} assume 0 == ~cond; {49300#false} is VALID [2018-11-23 12:07:21,315 INFO L273 TraceCheckUtils]: 186: Hoare triple {49300#false} assume !false; {49300#false} is VALID [2018-11-23 12:07:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:21,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:21,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2018-11-23 12:07:21,355 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 187 [2018-11-23 12:07:21,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:21,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states. [2018-11-23 12:07:21,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:21,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-23 12:07:21,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-23 12:07:21,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 12:07:21,548 INFO L87 Difference]: Start difference. First operand 192 states and 251 transitions. Second operand 62 states. [2018-11-23 12:07:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:22,852 INFO L93 Difference]: Finished difference Result 208 states and 270 transitions. [2018-11-23 12:07:22,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-23 12:07:22,852 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 187 [2018-11-23 12:07:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:07:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 270 transitions. [2018-11-23 12:07:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:07:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 270 transitions. [2018-11-23 12:07:22,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 270 transitions. [2018-11-23 12:07:23,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:23,112 INFO L225 Difference]: With dead ends: 208 [2018-11-23 12:07:23,113 INFO L226 Difference]: Without dead ends: 197 [2018-11-23 12:07:23,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 12:07:23,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-23 12:07:23,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-11-23 12:07:23,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:23,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand 195 states. [2018-11-23 12:07:23,326 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 195 states. [2018-11-23 12:07:23,326 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 195 states. [2018-11-23 12:07:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:23,329 INFO L93 Difference]: Finished difference Result 197 states and 258 transitions. [2018-11-23 12:07:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 258 transitions. [2018-11-23 12:07:23,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:23,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:23,330 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 197 states. [2018-11-23 12:07:23,330 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 197 states. [2018-11-23 12:07:23,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:23,332 INFO L93 Difference]: Finished difference Result 197 states and 258 transitions. [2018-11-23 12:07:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 258 transitions. [2018-11-23 12:07:23,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:23,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:23,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:23,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-23 12:07:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 255 transitions. [2018-11-23 12:07:23,336 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 255 transitions. Word has length 187 [2018-11-23 12:07:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:23,336 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 255 transitions. [2018-11-23 12:07:23,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-23 12:07:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 255 transitions. [2018-11-23 12:07:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-23 12:07:23,336 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:23,337 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:23,337 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:23,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1983237085, now seen corresponding path program 59 times [2018-11-23 12:07:23,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:23,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:23,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:23,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:23,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:25,286 INFO L256 TraceCheckUtils]: 0: Hoare triple {50855#true} call ULTIMATE.init(); {50855#true} is VALID [2018-11-23 12:07:25,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {50855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50855#true} is VALID [2018-11-23 12:07:25,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {50855#true} assume true; {50855#true} is VALID [2018-11-23 12:07:25,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50855#true} {50855#true} #55#return; {50855#true} is VALID [2018-11-23 12:07:25,287 INFO L256 TraceCheckUtils]: 4: Hoare triple {50855#true} call #t~ret4 := main(); {50855#true} is VALID [2018-11-23 12:07:25,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {50855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {50857#(= main_~i~0 0)} is VALID [2018-11-23 12:07:25,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {50857#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50857#(= main_~i~0 0)} is VALID [2018-11-23 12:07:25,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {50857#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50857#(= main_~i~0 0)} is VALID [2018-11-23 12:07:25,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {50857#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {50858#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:25,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {50858#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50858#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:25,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {50858#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50858#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:25,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {50858#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {50859#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:25,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {50859#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50859#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:25,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {50859#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50859#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:25,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {50859#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {50860#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:25,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {50860#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50860#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:25,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {50860#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50860#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:25,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {50860#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {50861#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:25,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {50861#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50861#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:25,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {50861#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50861#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:25,296 INFO L273 TraceCheckUtils]: 20: Hoare triple {50861#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {50862#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:25,296 INFO L273 TraceCheckUtils]: 21: Hoare triple {50862#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50862#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:25,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {50862#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50862#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:25,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {50862#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {50863#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:25,298 INFO L273 TraceCheckUtils]: 24: Hoare triple {50863#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50863#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:25,298 INFO L273 TraceCheckUtils]: 25: Hoare triple {50863#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50863#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:25,299 INFO L273 TraceCheckUtils]: 26: Hoare triple {50863#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {50864#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:25,300 INFO L273 TraceCheckUtils]: 27: Hoare triple {50864#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50864#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:25,300 INFO L273 TraceCheckUtils]: 28: Hoare triple {50864#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50864#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:25,301 INFO L273 TraceCheckUtils]: 29: Hoare triple {50864#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {50865#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:25,301 INFO L273 TraceCheckUtils]: 30: Hoare triple {50865#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50865#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:25,302 INFO L273 TraceCheckUtils]: 31: Hoare triple {50865#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50865#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:25,302 INFO L273 TraceCheckUtils]: 32: Hoare triple {50865#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {50866#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:25,303 INFO L273 TraceCheckUtils]: 33: Hoare triple {50866#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50866#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:25,303 INFO L273 TraceCheckUtils]: 34: Hoare triple {50866#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50866#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:25,304 INFO L273 TraceCheckUtils]: 35: Hoare triple {50866#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {50867#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:25,305 INFO L273 TraceCheckUtils]: 36: Hoare triple {50867#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50867#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:25,305 INFO L273 TraceCheckUtils]: 37: Hoare triple {50867#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50867#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:25,306 INFO L273 TraceCheckUtils]: 38: Hoare triple {50867#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {50868#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:25,306 INFO L273 TraceCheckUtils]: 39: Hoare triple {50868#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50868#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:25,307 INFO L273 TraceCheckUtils]: 40: Hoare triple {50868#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50868#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:25,308 INFO L273 TraceCheckUtils]: 41: Hoare triple {50868#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {50869#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:25,308 INFO L273 TraceCheckUtils]: 42: Hoare triple {50869#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50869#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:25,309 INFO L273 TraceCheckUtils]: 43: Hoare triple {50869#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50869#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:25,309 INFO L273 TraceCheckUtils]: 44: Hoare triple {50869#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {50870#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:25,310 INFO L273 TraceCheckUtils]: 45: Hoare triple {50870#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50870#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:25,310 INFO L273 TraceCheckUtils]: 46: Hoare triple {50870#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50870#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:25,311 INFO L273 TraceCheckUtils]: 47: Hoare triple {50870#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {50871#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:25,311 INFO L273 TraceCheckUtils]: 48: Hoare triple {50871#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50871#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:25,312 INFO L273 TraceCheckUtils]: 49: Hoare triple {50871#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50871#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:25,313 INFO L273 TraceCheckUtils]: 50: Hoare triple {50871#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {50872#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:25,313 INFO L273 TraceCheckUtils]: 51: Hoare triple {50872#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50872#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:25,314 INFO L273 TraceCheckUtils]: 52: Hoare triple {50872#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50872#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:25,314 INFO L273 TraceCheckUtils]: 53: Hoare triple {50872#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {50873#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:25,315 INFO L273 TraceCheckUtils]: 54: Hoare triple {50873#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50873#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:25,315 INFO L273 TraceCheckUtils]: 55: Hoare triple {50873#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50873#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:25,316 INFO L273 TraceCheckUtils]: 56: Hoare triple {50873#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {50874#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:25,317 INFO L273 TraceCheckUtils]: 57: Hoare triple {50874#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50874#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:25,317 INFO L273 TraceCheckUtils]: 58: Hoare triple {50874#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50874#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:25,318 INFO L273 TraceCheckUtils]: 59: Hoare triple {50874#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {50875#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:25,318 INFO L273 TraceCheckUtils]: 60: Hoare triple {50875#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50875#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:25,319 INFO L273 TraceCheckUtils]: 61: Hoare triple {50875#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50875#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:25,320 INFO L273 TraceCheckUtils]: 62: Hoare triple {50875#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {50876#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:25,320 INFO L273 TraceCheckUtils]: 63: Hoare triple {50876#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50876#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:25,321 INFO L273 TraceCheckUtils]: 64: Hoare triple {50876#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50876#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:25,321 INFO L273 TraceCheckUtils]: 65: Hoare triple {50876#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {50877#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:25,322 INFO L273 TraceCheckUtils]: 66: Hoare triple {50877#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50877#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:25,322 INFO L273 TraceCheckUtils]: 67: Hoare triple {50877#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50877#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:25,323 INFO L273 TraceCheckUtils]: 68: Hoare triple {50877#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {50878#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:25,323 INFO L273 TraceCheckUtils]: 69: Hoare triple {50878#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50878#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:25,324 INFO L273 TraceCheckUtils]: 70: Hoare triple {50878#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50878#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:25,325 INFO L273 TraceCheckUtils]: 71: Hoare triple {50878#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {50879#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:25,325 INFO L273 TraceCheckUtils]: 72: Hoare triple {50879#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50879#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:25,326 INFO L273 TraceCheckUtils]: 73: Hoare triple {50879#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50879#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:25,326 INFO L273 TraceCheckUtils]: 74: Hoare triple {50879#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {50880#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:25,327 INFO L273 TraceCheckUtils]: 75: Hoare triple {50880#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50880#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:25,327 INFO L273 TraceCheckUtils]: 76: Hoare triple {50880#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50880#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:25,328 INFO L273 TraceCheckUtils]: 77: Hoare triple {50880#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {50881#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:25,329 INFO L273 TraceCheckUtils]: 78: Hoare triple {50881#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50881#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:25,329 INFO L273 TraceCheckUtils]: 79: Hoare triple {50881#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50881#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:25,330 INFO L273 TraceCheckUtils]: 80: Hoare triple {50881#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {50882#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:25,330 INFO L273 TraceCheckUtils]: 81: Hoare triple {50882#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50882#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:25,331 INFO L273 TraceCheckUtils]: 82: Hoare triple {50882#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50882#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:25,332 INFO L273 TraceCheckUtils]: 83: Hoare triple {50882#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {50883#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:25,332 INFO L273 TraceCheckUtils]: 84: Hoare triple {50883#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50883#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:25,333 INFO L273 TraceCheckUtils]: 85: Hoare triple {50883#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50883#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:25,333 INFO L273 TraceCheckUtils]: 86: Hoare triple {50883#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {50884#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:25,334 INFO L273 TraceCheckUtils]: 87: Hoare triple {50884#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50884#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:25,334 INFO L273 TraceCheckUtils]: 88: Hoare triple {50884#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50884#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:25,335 INFO L273 TraceCheckUtils]: 89: Hoare triple {50884#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {50885#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:25,335 INFO L273 TraceCheckUtils]: 90: Hoare triple {50885#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50885#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:25,336 INFO L273 TraceCheckUtils]: 91: Hoare triple {50885#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50885#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:25,337 INFO L273 TraceCheckUtils]: 92: Hoare triple {50885#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {50886#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:25,337 INFO L273 TraceCheckUtils]: 93: Hoare triple {50886#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50886#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:25,338 INFO L273 TraceCheckUtils]: 94: Hoare triple {50886#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50886#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:25,338 INFO L273 TraceCheckUtils]: 95: Hoare triple {50886#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {50887#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:25,339 INFO L273 TraceCheckUtils]: 96: Hoare triple {50887#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50887#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:25,339 INFO L273 TraceCheckUtils]: 97: Hoare triple {50887#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50887#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:25,340 INFO L273 TraceCheckUtils]: 98: Hoare triple {50887#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {50888#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:25,341 INFO L273 TraceCheckUtils]: 99: Hoare triple {50888#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50888#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:25,341 INFO L273 TraceCheckUtils]: 100: Hoare triple {50888#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50888#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:25,342 INFO L273 TraceCheckUtils]: 101: Hoare triple {50888#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {50889#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:25,342 INFO L273 TraceCheckUtils]: 102: Hoare triple {50889#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50889#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:25,343 INFO L273 TraceCheckUtils]: 103: Hoare triple {50889#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50889#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:25,343 INFO L273 TraceCheckUtils]: 104: Hoare triple {50889#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {50890#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:25,344 INFO L273 TraceCheckUtils]: 105: Hoare triple {50890#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50890#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:25,344 INFO L273 TraceCheckUtils]: 106: Hoare triple {50890#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50890#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:25,345 INFO L273 TraceCheckUtils]: 107: Hoare triple {50890#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {50891#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:25,346 INFO L273 TraceCheckUtils]: 108: Hoare triple {50891#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50891#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:25,346 INFO L273 TraceCheckUtils]: 109: Hoare triple {50891#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50891#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:25,347 INFO L273 TraceCheckUtils]: 110: Hoare triple {50891#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {50892#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:25,347 INFO L273 TraceCheckUtils]: 111: Hoare triple {50892#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50892#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:25,348 INFO L273 TraceCheckUtils]: 112: Hoare triple {50892#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50892#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:25,349 INFO L273 TraceCheckUtils]: 113: Hoare triple {50892#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {50893#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:25,349 INFO L273 TraceCheckUtils]: 114: Hoare triple {50893#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50893#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:25,350 INFO L273 TraceCheckUtils]: 115: Hoare triple {50893#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50893#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:25,350 INFO L273 TraceCheckUtils]: 116: Hoare triple {50893#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {50894#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:25,351 INFO L273 TraceCheckUtils]: 117: Hoare triple {50894#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50894#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:25,351 INFO L273 TraceCheckUtils]: 118: Hoare triple {50894#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50894#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:25,352 INFO L273 TraceCheckUtils]: 119: Hoare triple {50894#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {50895#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:25,352 INFO L273 TraceCheckUtils]: 120: Hoare triple {50895#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50895#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:25,353 INFO L273 TraceCheckUtils]: 121: Hoare triple {50895#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50895#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:25,354 INFO L273 TraceCheckUtils]: 122: Hoare triple {50895#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {50896#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:25,354 INFO L273 TraceCheckUtils]: 123: Hoare triple {50896#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50896#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:25,355 INFO L273 TraceCheckUtils]: 124: Hoare triple {50896#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50896#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:25,355 INFO L273 TraceCheckUtils]: 125: Hoare triple {50896#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {50897#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:25,356 INFO L273 TraceCheckUtils]: 126: Hoare triple {50897#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50897#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:25,356 INFO L273 TraceCheckUtils]: 127: Hoare triple {50897#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50897#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:25,357 INFO L273 TraceCheckUtils]: 128: Hoare triple {50897#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {50898#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:25,358 INFO L273 TraceCheckUtils]: 129: Hoare triple {50898#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50898#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:25,358 INFO L273 TraceCheckUtils]: 130: Hoare triple {50898#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50898#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:25,359 INFO L273 TraceCheckUtils]: 131: Hoare triple {50898#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {50899#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:25,359 INFO L273 TraceCheckUtils]: 132: Hoare triple {50899#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50899#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:25,360 INFO L273 TraceCheckUtils]: 133: Hoare triple {50899#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50899#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:25,360 INFO L273 TraceCheckUtils]: 134: Hoare triple {50899#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {50900#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:25,361 INFO L273 TraceCheckUtils]: 135: Hoare triple {50900#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50900#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:25,361 INFO L273 TraceCheckUtils]: 136: Hoare triple {50900#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50900#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:25,362 INFO L273 TraceCheckUtils]: 137: Hoare triple {50900#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {50901#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:25,363 INFO L273 TraceCheckUtils]: 138: Hoare triple {50901#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50901#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:25,363 INFO L273 TraceCheckUtils]: 139: Hoare triple {50901#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50901#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:25,364 INFO L273 TraceCheckUtils]: 140: Hoare triple {50901#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {50902#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:25,364 INFO L273 TraceCheckUtils]: 141: Hoare triple {50902#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50902#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:25,365 INFO L273 TraceCheckUtils]: 142: Hoare triple {50902#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50902#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:25,366 INFO L273 TraceCheckUtils]: 143: Hoare triple {50902#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {50903#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:25,366 INFO L273 TraceCheckUtils]: 144: Hoare triple {50903#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50903#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:25,367 INFO L273 TraceCheckUtils]: 145: Hoare triple {50903#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50903#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:25,367 INFO L273 TraceCheckUtils]: 146: Hoare triple {50903#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {50904#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:25,368 INFO L273 TraceCheckUtils]: 147: Hoare triple {50904#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50904#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:25,368 INFO L273 TraceCheckUtils]: 148: Hoare triple {50904#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50904#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:25,369 INFO L273 TraceCheckUtils]: 149: Hoare triple {50904#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {50905#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:25,370 INFO L273 TraceCheckUtils]: 150: Hoare triple {50905#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50905#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:25,370 INFO L273 TraceCheckUtils]: 151: Hoare triple {50905#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50905#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:25,371 INFO L273 TraceCheckUtils]: 152: Hoare triple {50905#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {50906#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:25,371 INFO L273 TraceCheckUtils]: 153: Hoare triple {50906#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50906#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:25,372 INFO L273 TraceCheckUtils]: 154: Hoare triple {50906#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50906#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:25,372 INFO L273 TraceCheckUtils]: 155: Hoare triple {50906#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {50907#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:25,373 INFO L273 TraceCheckUtils]: 156: Hoare triple {50907#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50907#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:25,373 INFO L273 TraceCheckUtils]: 157: Hoare triple {50907#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50907#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:25,374 INFO L273 TraceCheckUtils]: 158: Hoare triple {50907#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {50908#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:25,375 INFO L273 TraceCheckUtils]: 159: Hoare triple {50908#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50908#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:25,375 INFO L273 TraceCheckUtils]: 160: Hoare triple {50908#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50908#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:25,376 INFO L273 TraceCheckUtils]: 161: Hoare triple {50908#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {50909#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:25,376 INFO L273 TraceCheckUtils]: 162: Hoare triple {50909#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50909#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:25,377 INFO L273 TraceCheckUtils]: 163: Hoare triple {50909#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50909#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:25,378 INFO L273 TraceCheckUtils]: 164: Hoare triple {50909#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {50910#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:25,378 INFO L273 TraceCheckUtils]: 165: Hoare triple {50910#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50910#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:25,379 INFO L273 TraceCheckUtils]: 166: Hoare triple {50910#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50910#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:25,379 INFO L273 TraceCheckUtils]: 167: Hoare triple {50910#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {50911#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:25,380 INFO L273 TraceCheckUtils]: 168: Hoare triple {50911#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50911#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:25,380 INFO L273 TraceCheckUtils]: 169: Hoare triple {50911#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50911#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:25,381 INFO L273 TraceCheckUtils]: 170: Hoare triple {50911#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {50912#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:25,381 INFO L273 TraceCheckUtils]: 171: Hoare triple {50912#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50912#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:25,382 INFO L273 TraceCheckUtils]: 172: Hoare triple {50912#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50912#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:25,383 INFO L273 TraceCheckUtils]: 173: Hoare triple {50912#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {50913#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:25,383 INFO L273 TraceCheckUtils]: 174: Hoare triple {50913#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50913#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:25,384 INFO L273 TraceCheckUtils]: 175: Hoare triple {50913#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50913#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:25,384 INFO L273 TraceCheckUtils]: 176: Hoare triple {50913#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {50914#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:25,385 INFO L273 TraceCheckUtils]: 177: Hoare triple {50914#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50914#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:25,385 INFO L273 TraceCheckUtils]: 178: Hoare triple {50914#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50914#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:25,386 INFO L273 TraceCheckUtils]: 179: Hoare triple {50914#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {50915#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:25,387 INFO L273 TraceCheckUtils]: 180: Hoare triple {50915#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50915#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:25,387 INFO L273 TraceCheckUtils]: 181: Hoare triple {50915#(<= main_~i~0 58)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50915#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:25,388 INFO L273 TraceCheckUtils]: 182: Hoare triple {50915#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {50916#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:25,388 INFO L273 TraceCheckUtils]: 183: Hoare triple {50916#(<= main_~i~0 59)} assume !(~i~0 < 100000); {50856#false} is VALID [2018-11-23 12:07:25,389 INFO L273 TraceCheckUtils]: 184: Hoare triple {50856#false} havoc ~x~0;~x~0 := 0; {50856#false} is VALID [2018-11-23 12:07:25,389 INFO L273 TraceCheckUtils]: 185: Hoare triple {50856#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {50856#false} is VALID [2018-11-23 12:07:25,389 INFO L256 TraceCheckUtils]: 186: Hoare triple {50856#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {50856#false} is VALID [2018-11-23 12:07:25,389 INFO L273 TraceCheckUtils]: 187: Hoare triple {50856#false} ~cond := #in~cond; {50856#false} is VALID [2018-11-23 12:07:25,389 INFO L273 TraceCheckUtils]: 188: Hoare triple {50856#false} assume 0 == ~cond; {50856#false} is VALID [2018-11-23 12:07:25,390 INFO L273 TraceCheckUtils]: 189: Hoare triple {50856#false} assume !false; {50856#false} is VALID [2018-11-23 12:07:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:25,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:25,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:25,421 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:07:25,573 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-11-23 12:07:25,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:25,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:26,079 INFO L256 TraceCheckUtils]: 0: Hoare triple {50855#true} call ULTIMATE.init(); {50855#true} is VALID [2018-11-23 12:07:26,080 INFO L273 TraceCheckUtils]: 1: Hoare triple {50855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50855#true} is VALID [2018-11-23 12:07:26,080 INFO L273 TraceCheckUtils]: 2: Hoare triple {50855#true} assume true; {50855#true} is VALID [2018-11-23 12:07:26,080 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50855#true} {50855#true} #55#return; {50855#true} is VALID [2018-11-23 12:07:26,080 INFO L256 TraceCheckUtils]: 4: Hoare triple {50855#true} call #t~ret4 := main(); {50855#true} is VALID [2018-11-23 12:07:26,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {50855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {50935#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:26,082 INFO L273 TraceCheckUtils]: 6: Hoare triple {50935#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50935#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:26,082 INFO L273 TraceCheckUtils]: 7: Hoare triple {50935#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50935#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:26,082 INFO L273 TraceCheckUtils]: 8: Hoare triple {50935#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {50858#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:26,083 INFO L273 TraceCheckUtils]: 9: Hoare triple {50858#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50858#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:26,083 INFO L273 TraceCheckUtils]: 10: Hoare triple {50858#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50858#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:26,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {50858#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {50859#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:26,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {50859#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50859#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:26,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {50859#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50859#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:26,084 INFO L273 TraceCheckUtils]: 14: Hoare triple {50859#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {50860#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:26,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {50860#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50860#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:26,085 INFO L273 TraceCheckUtils]: 16: Hoare triple {50860#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50860#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:26,086 INFO L273 TraceCheckUtils]: 17: Hoare triple {50860#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {50861#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:26,086 INFO L273 TraceCheckUtils]: 18: Hoare triple {50861#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50861#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:26,087 INFO L273 TraceCheckUtils]: 19: Hoare triple {50861#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50861#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:26,088 INFO L273 TraceCheckUtils]: 20: Hoare triple {50861#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {50862#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:26,088 INFO L273 TraceCheckUtils]: 21: Hoare triple {50862#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50862#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:26,089 INFO L273 TraceCheckUtils]: 22: Hoare triple {50862#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50862#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:26,089 INFO L273 TraceCheckUtils]: 23: Hoare triple {50862#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {50863#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:26,090 INFO L273 TraceCheckUtils]: 24: Hoare triple {50863#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50863#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:26,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {50863#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50863#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:26,091 INFO L273 TraceCheckUtils]: 26: Hoare triple {50863#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {50864#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:26,092 INFO L273 TraceCheckUtils]: 27: Hoare triple {50864#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50864#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:26,092 INFO L273 TraceCheckUtils]: 28: Hoare triple {50864#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50864#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:26,093 INFO L273 TraceCheckUtils]: 29: Hoare triple {50864#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {50865#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:26,093 INFO L273 TraceCheckUtils]: 30: Hoare triple {50865#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50865#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:26,094 INFO L273 TraceCheckUtils]: 31: Hoare triple {50865#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50865#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:26,094 INFO L273 TraceCheckUtils]: 32: Hoare triple {50865#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {50866#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:26,095 INFO L273 TraceCheckUtils]: 33: Hoare triple {50866#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50866#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:26,095 INFO L273 TraceCheckUtils]: 34: Hoare triple {50866#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50866#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:26,096 INFO L273 TraceCheckUtils]: 35: Hoare triple {50866#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {50867#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:26,097 INFO L273 TraceCheckUtils]: 36: Hoare triple {50867#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50867#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:26,097 INFO L273 TraceCheckUtils]: 37: Hoare triple {50867#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50867#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:26,098 INFO L273 TraceCheckUtils]: 38: Hoare triple {50867#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {50868#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:26,098 INFO L273 TraceCheckUtils]: 39: Hoare triple {50868#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50868#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:26,099 INFO L273 TraceCheckUtils]: 40: Hoare triple {50868#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50868#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:26,099 INFO L273 TraceCheckUtils]: 41: Hoare triple {50868#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {50869#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:26,100 INFO L273 TraceCheckUtils]: 42: Hoare triple {50869#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50869#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:26,100 INFO L273 TraceCheckUtils]: 43: Hoare triple {50869#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50869#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:26,101 INFO L273 TraceCheckUtils]: 44: Hoare triple {50869#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {50870#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:26,101 INFO L273 TraceCheckUtils]: 45: Hoare triple {50870#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50870#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:26,102 INFO L273 TraceCheckUtils]: 46: Hoare triple {50870#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50870#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:26,103 INFO L273 TraceCheckUtils]: 47: Hoare triple {50870#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {50871#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:26,103 INFO L273 TraceCheckUtils]: 48: Hoare triple {50871#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50871#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:26,103 INFO L273 TraceCheckUtils]: 49: Hoare triple {50871#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50871#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:26,104 INFO L273 TraceCheckUtils]: 50: Hoare triple {50871#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {50872#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:26,105 INFO L273 TraceCheckUtils]: 51: Hoare triple {50872#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50872#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:26,105 INFO L273 TraceCheckUtils]: 52: Hoare triple {50872#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50872#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:26,106 INFO L273 TraceCheckUtils]: 53: Hoare triple {50872#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {50873#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:26,106 INFO L273 TraceCheckUtils]: 54: Hoare triple {50873#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50873#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:26,107 INFO L273 TraceCheckUtils]: 55: Hoare triple {50873#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50873#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:26,107 INFO L273 TraceCheckUtils]: 56: Hoare triple {50873#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {50874#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:26,108 INFO L273 TraceCheckUtils]: 57: Hoare triple {50874#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50874#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:26,108 INFO L273 TraceCheckUtils]: 58: Hoare triple {50874#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50874#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:26,109 INFO L273 TraceCheckUtils]: 59: Hoare triple {50874#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {50875#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:26,109 INFO L273 TraceCheckUtils]: 60: Hoare triple {50875#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50875#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:26,110 INFO L273 TraceCheckUtils]: 61: Hoare triple {50875#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50875#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:26,111 INFO L273 TraceCheckUtils]: 62: Hoare triple {50875#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {50876#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:26,111 INFO L273 TraceCheckUtils]: 63: Hoare triple {50876#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50876#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:26,111 INFO L273 TraceCheckUtils]: 64: Hoare triple {50876#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50876#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:26,112 INFO L273 TraceCheckUtils]: 65: Hoare triple {50876#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {50877#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:26,113 INFO L273 TraceCheckUtils]: 66: Hoare triple {50877#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50877#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:26,113 INFO L273 TraceCheckUtils]: 67: Hoare triple {50877#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50877#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:26,114 INFO L273 TraceCheckUtils]: 68: Hoare triple {50877#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {50878#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:26,114 INFO L273 TraceCheckUtils]: 69: Hoare triple {50878#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50878#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:26,115 INFO L273 TraceCheckUtils]: 70: Hoare triple {50878#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50878#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:26,115 INFO L273 TraceCheckUtils]: 71: Hoare triple {50878#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {50879#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:26,116 INFO L273 TraceCheckUtils]: 72: Hoare triple {50879#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50879#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:26,116 INFO L273 TraceCheckUtils]: 73: Hoare triple {50879#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50879#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:26,117 INFO L273 TraceCheckUtils]: 74: Hoare triple {50879#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {50880#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:26,117 INFO L273 TraceCheckUtils]: 75: Hoare triple {50880#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50880#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:26,118 INFO L273 TraceCheckUtils]: 76: Hoare triple {50880#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50880#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:26,119 INFO L273 TraceCheckUtils]: 77: Hoare triple {50880#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {50881#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:26,119 INFO L273 TraceCheckUtils]: 78: Hoare triple {50881#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50881#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:26,119 INFO L273 TraceCheckUtils]: 79: Hoare triple {50881#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50881#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:26,120 INFO L273 TraceCheckUtils]: 80: Hoare triple {50881#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {50882#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:26,121 INFO L273 TraceCheckUtils]: 81: Hoare triple {50882#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50882#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:26,121 INFO L273 TraceCheckUtils]: 82: Hoare triple {50882#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50882#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:26,122 INFO L273 TraceCheckUtils]: 83: Hoare triple {50882#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {50883#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:26,122 INFO L273 TraceCheckUtils]: 84: Hoare triple {50883#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50883#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:26,123 INFO L273 TraceCheckUtils]: 85: Hoare triple {50883#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50883#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:26,123 INFO L273 TraceCheckUtils]: 86: Hoare triple {50883#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {50884#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:26,124 INFO L273 TraceCheckUtils]: 87: Hoare triple {50884#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50884#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:26,124 INFO L273 TraceCheckUtils]: 88: Hoare triple {50884#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50884#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:26,125 INFO L273 TraceCheckUtils]: 89: Hoare triple {50884#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {50885#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:26,125 INFO L273 TraceCheckUtils]: 90: Hoare triple {50885#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50885#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:26,126 INFO L273 TraceCheckUtils]: 91: Hoare triple {50885#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50885#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:26,127 INFO L273 TraceCheckUtils]: 92: Hoare triple {50885#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {50886#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:26,127 INFO L273 TraceCheckUtils]: 93: Hoare triple {50886#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50886#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:26,127 INFO L273 TraceCheckUtils]: 94: Hoare triple {50886#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50886#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:26,128 INFO L273 TraceCheckUtils]: 95: Hoare triple {50886#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {50887#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:26,129 INFO L273 TraceCheckUtils]: 96: Hoare triple {50887#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50887#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:26,129 INFO L273 TraceCheckUtils]: 97: Hoare triple {50887#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50887#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:26,130 INFO L273 TraceCheckUtils]: 98: Hoare triple {50887#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {50888#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:26,130 INFO L273 TraceCheckUtils]: 99: Hoare triple {50888#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50888#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:26,131 INFO L273 TraceCheckUtils]: 100: Hoare triple {50888#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50888#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:26,131 INFO L273 TraceCheckUtils]: 101: Hoare triple {50888#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {50889#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:26,132 INFO L273 TraceCheckUtils]: 102: Hoare triple {50889#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50889#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:26,132 INFO L273 TraceCheckUtils]: 103: Hoare triple {50889#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50889#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:26,133 INFO L273 TraceCheckUtils]: 104: Hoare triple {50889#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {50890#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:26,133 INFO L273 TraceCheckUtils]: 105: Hoare triple {50890#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50890#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:26,134 INFO L273 TraceCheckUtils]: 106: Hoare triple {50890#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50890#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:26,135 INFO L273 TraceCheckUtils]: 107: Hoare triple {50890#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {50891#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:26,135 INFO L273 TraceCheckUtils]: 108: Hoare triple {50891#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50891#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:26,135 INFO L273 TraceCheckUtils]: 109: Hoare triple {50891#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50891#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:26,136 INFO L273 TraceCheckUtils]: 110: Hoare triple {50891#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {50892#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:26,137 INFO L273 TraceCheckUtils]: 111: Hoare triple {50892#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50892#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:26,137 INFO L273 TraceCheckUtils]: 112: Hoare triple {50892#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50892#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:26,138 INFO L273 TraceCheckUtils]: 113: Hoare triple {50892#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {50893#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:26,138 INFO L273 TraceCheckUtils]: 114: Hoare triple {50893#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50893#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:26,139 INFO L273 TraceCheckUtils]: 115: Hoare triple {50893#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50893#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:26,139 INFO L273 TraceCheckUtils]: 116: Hoare triple {50893#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {50894#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:26,140 INFO L273 TraceCheckUtils]: 117: Hoare triple {50894#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50894#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:26,140 INFO L273 TraceCheckUtils]: 118: Hoare triple {50894#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50894#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:26,141 INFO L273 TraceCheckUtils]: 119: Hoare triple {50894#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {50895#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:26,141 INFO L273 TraceCheckUtils]: 120: Hoare triple {50895#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50895#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:26,142 INFO L273 TraceCheckUtils]: 121: Hoare triple {50895#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50895#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:26,143 INFO L273 TraceCheckUtils]: 122: Hoare triple {50895#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {50896#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:26,143 INFO L273 TraceCheckUtils]: 123: Hoare triple {50896#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50896#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:26,143 INFO L273 TraceCheckUtils]: 124: Hoare triple {50896#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50896#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:26,144 INFO L273 TraceCheckUtils]: 125: Hoare triple {50896#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {50897#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:26,145 INFO L273 TraceCheckUtils]: 126: Hoare triple {50897#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50897#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:26,145 INFO L273 TraceCheckUtils]: 127: Hoare triple {50897#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50897#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:26,146 INFO L273 TraceCheckUtils]: 128: Hoare triple {50897#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {50898#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:26,146 INFO L273 TraceCheckUtils]: 129: Hoare triple {50898#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50898#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:26,147 INFO L273 TraceCheckUtils]: 130: Hoare triple {50898#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50898#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:26,147 INFO L273 TraceCheckUtils]: 131: Hoare triple {50898#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {50899#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:26,148 INFO L273 TraceCheckUtils]: 132: Hoare triple {50899#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50899#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:26,148 INFO L273 TraceCheckUtils]: 133: Hoare triple {50899#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50899#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:26,149 INFO L273 TraceCheckUtils]: 134: Hoare triple {50899#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {50900#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:26,149 INFO L273 TraceCheckUtils]: 135: Hoare triple {50900#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50900#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:26,150 INFO L273 TraceCheckUtils]: 136: Hoare triple {50900#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50900#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:26,151 INFO L273 TraceCheckUtils]: 137: Hoare triple {50900#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {50901#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:26,151 INFO L273 TraceCheckUtils]: 138: Hoare triple {50901#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50901#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:26,152 INFO L273 TraceCheckUtils]: 139: Hoare triple {50901#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50901#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:26,152 INFO L273 TraceCheckUtils]: 140: Hoare triple {50901#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {50902#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:26,153 INFO L273 TraceCheckUtils]: 141: Hoare triple {50902#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50902#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:26,153 INFO L273 TraceCheckUtils]: 142: Hoare triple {50902#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50902#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:26,154 INFO L273 TraceCheckUtils]: 143: Hoare triple {50902#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {50903#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:26,154 INFO L273 TraceCheckUtils]: 144: Hoare triple {50903#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50903#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:26,155 INFO L273 TraceCheckUtils]: 145: Hoare triple {50903#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50903#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:26,155 INFO L273 TraceCheckUtils]: 146: Hoare triple {50903#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {50904#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:26,156 INFO L273 TraceCheckUtils]: 147: Hoare triple {50904#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50904#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:26,156 INFO L273 TraceCheckUtils]: 148: Hoare triple {50904#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50904#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:26,157 INFO L273 TraceCheckUtils]: 149: Hoare triple {50904#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {50905#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:26,157 INFO L273 TraceCheckUtils]: 150: Hoare triple {50905#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50905#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:26,158 INFO L273 TraceCheckUtils]: 151: Hoare triple {50905#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50905#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:26,159 INFO L273 TraceCheckUtils]: 152: Hoare triple {50905#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {50906#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:26,159 INFO L273 TraceCheckUtils]: 153: Hoare triple {50906#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50906#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:26,160 INFO L273 TraceCheckUtils]: 154: Hoare triple {50906#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50906#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:26,160 INFO L273 TraceCheckUtils]: 155: Hoare triple {50906#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {50907#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:26,161 INFO L273 TraceCheckUtils]: 156: Hoare triple {50907#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50907#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:26,161 INFO L273 TraceCheckUtils]: 157: Hoare triple {50907#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50907#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:26,162 INFO L273 TraceCheckUtils]: 158: Hoare triple {50907#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {50908#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:26,163 INFO L273 TraceCheckUtils]: 159: Hoare triple {50908#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50908#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:26,163 INFO L273 TraceCheckUtils]: 160: Hoare triple {50908#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50908#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:26,164 INFO L273 TraceCheckUtils]: 161: Hoare triple {50908#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {50909#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:26,164 INFO L273 TraceCheckUtils]: 162: Hoare triple {50909#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50909#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:26,165 INFO L273 TraceCheckUtils]: 163: Hoare triple {50909#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50909#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:26,165 INFO L273 TraceCheckUtils]: 164: Hoare triple {50909#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {50910#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:26,166 INFO L273 TraceCheckUtils]: 165: Hoare triple {50910#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50910#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:26,166 INFO L273 TraceCheckUtils]: 166: Hoare triple {50910#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50910#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:26,167 INFO L273 TraceCheckUtils]: 167: Hoare triple {50910#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {50911#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:26,167 INFO L273 TraceCheckUtils]: 168: Hoare triple {50911#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50911#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:26,168 INFO L273 TraceCheckUtils]: 169: Hoare triple {50911#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50911#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:26,169 INFO L273 TraceCheckUtils]: 170: Hoare triple {50911#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {50912#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:26,169 INFO L273 TraceCheckUtils]: 171: Hoare triple {50912#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50912#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:26,169 INFO L273 TraceCheckUtils]: 172: Hoare triple {50912#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50912#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:26,170 INFO L273 TraceCheckUtils]: 173: Hoare triple {50912#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {50913#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:26,171 INFO L273 TraceCheckUtils]: 174: Hoare triple {50913#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50913#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:26,171 INFO L273 TraceCheckUtils]: 175: Hoare triple {50913#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50913#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:26,172 INFO L273 TraceCheckUtils]: 176: Hoare triple {50913#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {50914#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:26,172 INFO L273 TraceCheckUtils]: 177: Hoare triple {50914#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50914#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:26,173 INFO L273 TraceCheckUtils]: 178: Hoare triple {50914#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50914#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:26,173 INFO L273 TraceCheckUtils]: 179: Hoare triple {50914#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {50915#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:26,174 INFO L273 TraceCheckUtils]: 180: Hoare triple {50915#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50915#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:26,174 INFO L273 TraceCheckUtils]: 181: Hoare triple {50915#(<= main_~i~0 58)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {50915#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:26,175 INFO L273 TraceCheckUtils]: 182: Hoare triple {50915#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {50916#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:26,176 INFO L273 TraceCheckUtils]: 183: Hoare triple {50916#(<= main_~i~0 59)} assume !(~i~0 < 100000); {50856#false} is VALID [2018-11-23 12:07:26,176 INFO L273 TraceCheckUtils]: 184: Hoare triple {50856#false} havoc ~x~0;~x~0 := 0; {50856#false} is VALID [2018-11-23 12:07:26,176 INFO L273 TraceCheckUtils]: 185: Hoare triple {50856#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {50856#false} is VALID [2018-11-23 12:07:26,176 INFO L256 TraceCheckUtils]: 186: Hoare triple {50856#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {50856#false} is VALID [2018-11-23 12:07:26,176 INFO L273 TraceCheckUtils]: 187: Hoare triple {50856#false} ~cond := #in~cond; {50856#false} is VALID [2018-11-23 12:07:26,177 INFO L273 TraceCheckUtils]: 188: Hoare triple {50856#false} assume 0 == ~cond; {50856#false} is VALID [2018-11-23 12:07:26,177 INFO L273 TraceCheckUtils]: 189: Hoare triple {50856#false} assume !false; {50856#false} is VALID [2018-11-23 12:07:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:26,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:26,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2018-11-23 12:07:26,220 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 190 [2018-11-23 12:07:26,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:26,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states. [2018-11-23 12:07:26,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:26,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-23 12:07:26,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-23 12:07:26,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 12:07:26,407 INFO L87 Difference]: Start difference. First operand 195 states and 255 transitions. Second operand 63 states. [2018-11-23 12:07:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:27,739 INFO L93 Difference]: Finished difference Result 211 states and 274 transitions. [2018-11-23 12:07:27,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-23 12:07:27,739 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 190 [2018-11-23 12:07:27,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:07:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 274 transitions. [2018-11-23 12:07:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:07:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 274 transitions. [2018-11-23 12:07:27,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 274 transitions. [2018-11-23 12:07:27,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:28,003 INFO L225 Difference]: With dead ends: 211 [2018-11-23 12:07:28,003 INFO L226 Difference]: Without dead ends: 200 [2018-11-23 12:07:28,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 12:07:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-23 12:07:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2018-11-23 12:07:28,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:28,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand 198 states. [2018-11-23 12:07:28,110 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 198 states. [2018-11-23 12:07:28,110 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 198 states. [2018-11-23 12:07:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:28,113 INFO L93 Difference]: Finished difference Result 200 states and 262 transitions. [2018-11-23 12:07:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2018-11-23 12:07:28,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:28,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:28,114 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 200 states. [2018-11-23 12:07:28,114 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 200 states. [2018-11-23 12:07:28,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:28,117 INFO L93 Difference]: Finished difference Result 200 states and 262 transitions. [2018-11-23 12:07:28,117 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2018-11-23 12:07:28,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:28,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:28,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:28,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:28,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-23 12:07:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 259 transitions. [2018-11-23 12:07:28,120 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 259 transitions. Word has length 190 [2018-11-23 12:07:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:28,120 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 259 transitions. [2018-11-23 12:07:28,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-23 12:07:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 259 transitions. [2018-11-23 12:07:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-23 12:07:28,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:28,121 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:28,121 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:28,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:28,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2000509639, now seen corresponding path program 60 times [2018-11-23 12:07:28,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:28,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:28,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:28,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:28,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:30,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {52435#true} call ULTIMATE.init(); {52435#true} is VALID [2018-11-23 12:07:30,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {52435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {52435#true} is VALID [2018-11-23 12:07:30,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {52435#true} assume true; {52435#true} is VALID [2018-11-23 12:07:30,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52435#true} {52435#true} #55#return; {52435#true} is VALID [2018-11-23 12:07:30,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {52435#true} call #t~ret4 := main(); {52435#true} is VALID [2018-11-23 12:07:30,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {52435#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {52437#(= main_~i~0 0)} is VALID [2018-11-23 12:07:30,214 INFO L273 TraceCheckUtils]: 6: Hoare triple {52437#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52437#(= main_~i~0 0)} is VALID [2018-11-23 12:07:30,215 INFO L273 TraceCheckUtils]: 7: Hoare triple {52437#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52437#(= main_~i~0 0)} is VALID [2018-11-23 12:07:30,215 INFO L273 TraceCheckUtils]: 8: Hoare triple {52437#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {52438#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:30,216 INFO L273 TraceCheckUtils]: 9: Hoare triple {52438#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52438#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:30,216 INFO L273 TraceCheckUtils]: 10: Hoare triple {52438#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52438#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:30,216 INFO L273 TraceCheckUtils]: 11: Hoare triple {52438#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {52439#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:30,217 INFO L273 TraceCheckUtils]: 12: Hoare triple {52439#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52439#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:30,217 INFO L273 TraceCheckUtils]: 13: Hoare triple {52439#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52439#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:30,217 INFO L273 TraceCheckUtils]: 14: Hoare triple {52439#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {52440#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:30,218 INFO L273 TraceCheckUtils]: 15: Hoare triple {52440#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52440#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:30,218 INFO L273 TraceCheckUtils]: 16: Hoare triple {52440#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52440#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:30,219 INFO L273 TraceCheckUtils]: 17: Hoare triple {52440#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {52441#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:30,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {52441#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52441#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:30,220 INFO L273 TraceCheckUtils]: 19: Hoare triple {52441#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52441#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:30,220 INFO L273 TraceCheckUtils]: 20: Hoare triple {52441#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {52442#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:30,221 INFO L273 TraceCheckUtils]: 21: Hoare triple {52442#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52442#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:30,221 INFO L273 TraceCheckUtils]: 22: Hoare triple {52442#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52442#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:30,222 INFO L273 TraceCheckUtils]: 23: Hoare triple {52442#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {52443#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:30,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {52443#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52443#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:30,223 INFO L273 TraceCheckUtils]: 25: Hoare triple {52443#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52443#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:30,224 INFO L273 TraceCheckUtils]: 26: Hoare triple {52443#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {52444#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:30,224 INFO L273 TraceCheckUtils]: 27: Hoare triple {52444#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52444#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:30,225 INFO L273 TraceCheckUtils]: 28: Hoare triple {52444#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52444#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:30,225 INFO L273 TraceCheckUtils]: 29: Hoare triple {52444#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {52445#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:30,226 INFO L273 TraceCheckUtils]: 30: Hoare triple {52445#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52445#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:30,226 INFO L273 TraceCheckUtils]: 31: Hoare triple {52445#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52445#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:30,227 INFO L273 TraceCheckUtils]: 32: Hoare triple {52445#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {52446#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:30,227 INFO L273 TraceCheckUtils]: 33: Hoare triple {52446#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52446#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:30,228 INFO L273 TraceCheckUtils]: 34: Hoare triple {52446#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52446#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:30,229 INFO L273 TraceCheckUtils]: 35: Hoare triple {52446#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {52447#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:30,229 INFO L273 TraceCheckUtils]: 36: Hoare triple {52447#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52447#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:30,230 INFO L273 TraceCheckUtils]: 37: Hoare triple {52447#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52447#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:30,230 INFO L273 TraceCheckUtils]: 38: Hoare triple {52447#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {52448#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:30,231 INFO L273 TraceCheckUtils]: 39: Hoare triple {52448#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52448#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:30,231 INFO L273 TraceCheckUtils]: 40: Hoare triple {52448#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52448#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:30,232 INFO L273 TraceCheckUtils]: 41: Hoare triple {52448#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {52449#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:30,232 INFO L273 TraceCheckUtils]: 42: Hoare triple {52449#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52449#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:30,233 INFO L273 TraceCheckUtils]: 43: Hoare triple {52449#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52449#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:30,234 INFO L273 TraceCheckUtils]: 44: Hoare triple {52449#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {52450#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:30,234 INFO L273 TraceCheckUtils]: 45: Hoare triple {52450#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52450#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:30,234 INFO L273 TraceCheckUtils]: 46: Hoare triple {52450#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52450#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:30,235 INFO L273 TraceCheckUtils]: 47: Hoare triple {52450#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {52451#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:30,236 INFO L273 TraceCheckUtils]: 48: Hoare triple {52451#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52451#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:30,236 INFO L273 TraceCheckUtils]: 49: Hoare triple {52451#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52451#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:30,237 INFO L273 TraceCheckUtils]: 50: Hoare triple {52451#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {52452#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:30,237 INFO L273 TraceCheckUtils]: 51: Hoare triple {52452#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52452#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:30,238 INFO L273 TraceCheckUtils]: 52: Hoare triple {52452#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52452#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:30,238 INFO L273 TraceCheckUtils]: 53: Hoare triple {52452#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {52453#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:30,239 INFO L273 TraceCheckUtils]: 54: Hoare triple {52453#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52453#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:30,239 INFO L273 TraceCheckUtils]: 55: Hoare triple {52453#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52453#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:30,240 INFO L273 TraceCheckUtils]: 56: Hoare triple {52453#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {52454#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:30,240 INFO L273 TraceCheckUtils]: 57: Hoare triple {52454#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52454#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:30,241 INFO L273 TraceCheckUtils]: 58: Hoare triple {52454#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52454#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:30,241 INFO L273 TraceCheckUtils]: 59: Hoare triple {52454#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {52455#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:30,242 INFO L273 TraceCheckUtils]: 60: Hoare triple {52455#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52455#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:30,242 INFO L273 TraceCheckUtils]: 61: Hoare triple {52455#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52455#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:30,243 INFO L273 TraceCheckUtils]: 62: Hoare triple {52455#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {52456#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:30,244 INFO L273 TraceCheckUtils]: 63: Hoare triple {52456#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52456#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:30,244 INFO L273 TraceCheckUtils]: 64: Hoare triple {52456#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52456#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:30,245 INFO L273 TraceCheckUtils]: 65: Hoare triple {52456#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {52457#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:30,245 INFO L273 TraceCheckUtils]: 66: Hoare triple {52457#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52457#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:30,246 INFO L273 TraceCheckUtils]: 67: Hoare triple {52457#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52457#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:30,247 INFO L273 TraceCheckUtils]: 68: Hoare triple {52457#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {52458#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:30,247 INFO L273 TraceCheckUtils]: 69: Hoare triple {52458#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52458#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:30,248 INFO L273 TraceCheckUtils]: 70: Hoare triple {52458#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52458#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:30,248 INFO L273 TraceCheckUtils]: 71: Hoare triple {52458#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {52459#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:30,249 INFO L273 TraceCheckUtils]: 72: Hoare triple {52459#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52459#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:30,249 INFO L273 TraceCheckUtils]: 73: Hoare triple {52459#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52459#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:30,250 INFO L273 TraceCheckUtils]: 74: Hoare triple {52459#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {52460#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:30,250 INFO L273 TraceCheckUtils]: 75: Hoare triple {52460#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52460#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:30,251 INFO L273 TraceCheckUtils]: 76: Hoare triple {52460#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52460#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:30,251 INFO L273 TraceCheckUtils]: 77: Hoare triple {52460#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {52461#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:30,252 INFO L273 TraceCheckUtils]: 78: Hoare triple {52461#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52461#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:30,252 INFO L273 TraceCheckUtils]: 79: Hoare triple {52461#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52461#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:30,253 INFO L273 TraceCheckUtils]: 80: Hoare triple {52461#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {52462#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:30,254 INFO L273 TraceCheckUtils]: 81: Hoare triple {52462#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52462#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:30,254 INFO L273 TraceCheckUtils]: 82: Hoare triple {52462#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52462#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:30,255 INFO L273 TraceCheckUtils]: 83: Hoare triple {52462#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {52463#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:30,255 INFO L273 TraceCheckUtils]: 84: Hoare triple {52463#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52463#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:30,256 INFO L273 TraceCheckUtils]: 85: Hoare triple {52463#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52463#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:30,256 INFO L273 TraceCheckUtils]: 86: Hoare triple {52463#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {52464#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:30,257 INFO L273 TraceCheckUtils]: 87: Hoare triple {52464#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52464#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:30,257 INFO L273 TraceCheckUtils]: 88: Hoare triple {52464#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52464#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:30,258 INFO L273 TraceCheckUtils]: 89: Hoare triple {52464#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {52465#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:30,258 INFO L273 TraceCheckUtils]: 90: Hoare triple {52465#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52465#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:30,259 INFO L273 TraceCheckUtils]: 91: Hoare triple {52465#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52465#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:30,260 INFO L273 TraceCheckUtils]: 92: Hoare triple {52465#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {52466#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:30,260 INFO L273 TraceCheckUtils]: 93: Hoare triple {52466#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52466#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:30,260 INFO L273 TraceCheckUtils]: 94: Hoare triple {52466#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52466#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:30,261 INFO L273 TraceCheckUtils]: 95: Hoare triple {52466#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {52467#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:30,262 INFO L273 TraceCheckUtils]: 96: Hoare triple {52467#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52467#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:30,262 INFO L273 TraceCheckUtils]: 97: Hoare triple {52467#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52467#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:30,263 INFO L273 TraceCheckUtils]: 98: Hoare triple {52467#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {52468#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:30,263 INFO L273 TraceCheckUtils]: 99: Hoare triple {52468#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52468#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:30,264 INFO L273 TraceCheckUtils]: 100: Hoare triple {52468#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52468#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:30,265 INFO L273 TraceCheckUtils]: 101: Hoare triple {52468#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {52469#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:30,265 INFO L273 TraceCheckUtils]: 102: Hoare triple {52469#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52469#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:30,266 INFO L273 TraceCheckUtils]: 103: Hoare triple {52469#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52469#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:30,266 INFO L273 TraceCheckUtils]: 104: Hoare triple {52469#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {52470#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:30,267 INFO L273 TraceCheckUtils]: 105: Hoare triple {52470#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52470#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:30,267 INFO L273 TraceCheckUtils]: 106: Hoare triple {52470#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52470#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:30,268 INFO L273 TraceCheckUtils]: 107: Hoare triple {52470#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {52471#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:30,268 INFO L273 TraceCheckUtils]: 108: Hoare triple {52471#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52471#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:30,269 INFO L273 TraceCheckUtils]: 109: Hoare triple {52471#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52471#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:30,270 INFO L273 TraceCheckUtils]: 110: Hoare triple {52471#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {52472#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:30,270 INFO L273 TraceCheckUtils]: 111: Hoare triple {52472#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52472#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:30,271 INFO L273 TraceCheckUtils]: 112: Hoare triple {52472#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52472#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:30,271 INFO L273 TraceCheckUtils]: 113: Hoare triple {52472#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {52473#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:30,272 INFO L273 TraceCheckUtils]: 114: Hoare triple {52473#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52473#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:30,272 INFO L273 TraceCheckUtils]: 115: Hoare triple {52473#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52473#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:30,273 INFO L273 TraceCheckUtils]: 116: Hoare triple {52473#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {52474#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:30,274 INFO L273 TraceCheckUtils]: 117: Hoare triple {52474#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52474#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:30,274 INFO L273 TraceCheckUtils]: 118: Hoare triple {52474#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52474#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:30,275 INFO L273 TraceCheckUtils]: 119: Hoare triple {52474#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {52475#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:30,275 INFO L273 TraceCheckUtils]: 120: Hoare triple {52475#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52475#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:30,276 INFO L273 TraceCheckUtils]: 121: Hoare triple {52475#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52475#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:30,277 INFO L273 TraceCheckUtils]: 122: Hoare triple {52475#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {52476#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:30,277 INFO L273 TraceCheckUtils]: 123: Hoare triple {52476#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52476#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:30,278 INFO L273 TraceCheckUtils]: 124: Hoare triple {52476#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52476#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:30,278 INFO L273 TraceCheckUtils]: 125: Hoare triple {52476#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {52477#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:30,279 INFO L273 TraceCheckUtils]: 126: Hoare triple {52477#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52477#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:30,279 INFO L273 TraceCheckUtils]: 127: Hoare triple {52477#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52477#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:30,280 INFO L273 TraceCheckUtils]: 128: Hoare triple {52477#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {52478#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:30,280 INFO L273 TraceCheckUtils]: 129: Hoare triple {52478#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52478#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:30,281 INFO L273 TraceCheckUtils]: 130: Hoare triple {52478#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52478#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:30,282 INFO L273 TraceCheckUtils]: 131: Hoare triple {52478#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {52479#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:30,282 INFO L273 TraceCheckUtils]: 132: Hoare triple {52479#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52479#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:30,283 INFO L273 TraceCheckUtils]: 133: Hoare triple {52479#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52479#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:30,283 INFO L273 TraceCheckUtils]: 134: Hoare triple {52479#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {52480#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:30,284 INFO L273 TraceCheckUtils]: 135: Hoare triple {52480#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52480#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:30,284 INFO L273 TraceCheckUtils]: 136: Hoare triple {52480#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52480#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:30,285 INFO L273 TraceCheckUtils]: 137: Hoare triple {52480#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {52481#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:30,286 INFO L273 TraceCheckUtils]: 138: Hoare triple {52481#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52481#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:30,286 INFO L273 TraceCheckUtils]: 139: Hoare triple {52481#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52481#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:30,287 INFO L273 TraceCheckUtils]: 140: Hoare triple {52481#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {52482#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:30,287 INFO L273 TraceCheckUtils]: 141: Hoare triple {52482#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52482#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:30,288 INFO L273 TraceCheckUtils]: 142: Hoare triple {52482#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52482#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:30,288 INFO L273 TraceCheckUtils]: 143: Hoare triple {52482#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {52483#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:30,289 INFO L273 TraceCheckUtils]: 144: Hoare triple {52483#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52483#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:30,289 INFO L273 TraceCheckUtils]: 145: Hoare triple {52483#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52483#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:30,290 INFO L273 TraceCheckUtils]: 146: Hoare triple {52483#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {52484#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:30,290 INFO L273 TraceCheckUtils]: 147: Hoare triple {52484#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52484#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:30,291 INFO L273 TraceCheckUtils]: 148: Hoare triple {52484#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52484#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:30,292 INFO L273 TraceCheckUtils]: 149: Hoare triple {52484#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {52485#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:30,292 INFO L273 TraceCheckUtils]: 150: Hoare triple {52485#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52485#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:30,293 INFO L273 TraceCheckUtils]: 151: Hoare triple {52485#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52485#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:30,293 INFO L273 TraceCheckUtils]: 152: Hoare triple {52485#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {52486#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:30,294 INFO L273 TraceCheckUtils]: 153: Hoare triple {52486#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52486#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:30,294 INFO L273 TraceCheckUtils]: 154: Hoare triple {52486#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52486#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:30,295 INFO L273 TraceCheckUtils]: 155: Hoare triple {52486#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {52487#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:30,295 INFO L273 TraceCheckUtils]: 156: Hoare triple {52487#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52487#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:30,296 INFO L273 TraceCheckUtils]: 157: Hoare triple {52487#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52487#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:30,297 INFO L273 TraceCheckUtils]: 158: Hoare triple {52487#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {52488#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:30,297 INFO L273 TraceCheckUtils]: 159: Hoare triple {52488#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52488#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:30,298 INFO L273 TraceCheckUtils]: 160: Hoare triple {52488#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52488#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:30,298 INFO L273 TraceCheckUtils]: 161: Hoare triple {52488#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {52489#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:30,299 INFO L273 TraceCheckUtils]: 162: Hoare triple {52489#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52489#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:30,299 INFO L273 TraceCheckUtils]: 163: Hoare triple {52489#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52489#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:30,300 INFO L273 TraceCheckUtils]: 164: Hoare triple {52489#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {52490#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:30,300 INFO L273 TraceCheckUtils]: 165: Hoare triple {52490#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52490#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:30,301 INFO L273 TraceCheckUtils]: 166: Hoare triple {52490#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52490#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:30,302 INFO L273 TraceCheckUtils]: 167: Hoare triple {52490#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {52491#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:30,302 INFO L273 TraceCheckUtils]: 168: Hoare triple {52491#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52491#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:30,303 INFO L273 TraceCheckUtils]: 169: Hoare triple {52491#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52491#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:30,303 INFO L273 TraceCheckUtils]: 170: Hoare triple {52491#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {52492#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:30,304 INFO L273 TraceCheckUtils]: 171: Hoare triple {52492#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52492#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:30,304 INFO L273 TraceCheckUtils]: 172: Hoare triple {52492#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52492#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:30,305 INFO L273 TraceCheckUtils]: 173: Hoare triple {52492#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {52493#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:30,306 INFO L273 TraceCheckUtils]: 174: Hoare triple {52493#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52493#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:30,306 INFO L273 TraceCheckUtils]: 175: Hoare triple {52493#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52493#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:30,307 INFO L273 TraceCheckUtils]: 176: Hoare triple {52493#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {52494#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:30,307 INFO L273 TraceCheckUtils]: 177: Hoare triple {52494#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52494#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:30,308 INFO L273 TraceCheckUtils]: 178: Hoare triple {52494#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52494#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:30,308 INFO L273 TraceCheckUtils]: 179: Hoare triple {52494#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {52495#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:30,309 INFO L273 TraceCheckUtils]: 180: Hoare triple {52495#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52495#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:30,309 INFO L273 TraceCheckUtils]: 181: Hoare triple {52495#(<= main_~i~0 58)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52495#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:30,310 INFO L273 TraceCheckUtils]: 182: Hoare triple {52495#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {52496#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:30,311 INFO L273 TraceCheckUtils]: 183: Hoare triple {52496#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52496#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:30,311 INFO L273 TraceCheckUtils]: 184: Hoare triple {52496#(<= main_~i~0 59)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52496#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:30,312 INFO L273 TraceCheckUtils]: 185: Hoare triple {52496#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {52497#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:30,312 INFO L273 TraceCheckUtils]: 186: Hoare triple {52497#(<= main_~i~0 60)} assume !(~i~0 < 100000); {52436#false} is VALID [2018-11-23 12:07:30,313 INFO L273 TraceCheckUtils]: 187: Hoare triple {52436#false} havoc ~x~0;~x~0 := 0; {52436#false} is VALID [2018-11-23 12:07:30,313 INFO L273 TraceCheckUtils]: 188: Hoare triple {52436#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {52436#false} is VALID [2018-11-23 12:07:30,313 INFO L256 TraceCheckUtils]: 189: Hoare triple {52436#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {52436#false} is VALID [2018-11-23 12:07:30,313 INFO L273 TraceCheckUtils]: 190: Hoare triple {52436#false} ~cond := #in~cond; {52436#false} is VALID [2018-11-23 12:07:30,313 INFO L273 TraceCheckUtils]: 191: Hoare triple {52436#false} assume 0 == ~cond; {52436#false} is VALID [2018-11-23 12:07:30,314 INFO L273 TraceCheckUtils]: 192: Hoare triple {52436#false} assume !false; {52436#false} is VALID [2018-11-23 12:07:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:30,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:30,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:30,347 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:07:30,513 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-11-23 12:07:30,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:30,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:31,107 INFO L256 TraceCheckUtils]: 0: Hoare triple {52435#true} call ULTIMATE.init(); {52435#true} is VALID [2018-11-23 12:07:31,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {52435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {52435#true} is VALID [2018-11-23 12:07:31,108 INFO L273 TraceCheckUtils]: 2: Hoare triple {52435#true} assume true; {52435#true} is VALID [2018-11-23 12:07:31,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52435#true} {52435#true} #55#return; {52435#true} is VALID [2018-11-23 12:07:31,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {52435#true} call #t~ret4 := main(); {52435#true} is VALID [2018-11-23 12:07:31,109 INFO L273 TraceCheckUtils]: 5: Hoare triple {52435#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {52516#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:31,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {52516#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52516#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:31,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {52516#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52516#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:31,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {52516#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {52438#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:31,111 INFO L273 TraceCheckUtils]: 9: Hoare triple {52438#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52438#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:31,111 INFO L273 TraceCheckUtils]: 10: Hoare triple {52438#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52438#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:31,112 INFO L273 TraceCheckUtils]: 11: Hoare triple {52438#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {52439#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:31,112 INFO L273 TraceCheckUtils]: 12: Hoare triple {52439#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52439#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:31,113 INFO L273 TraceCheckUtils]: 13: Hoare triple {52439#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52439#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:31,114 INFO L273 TraceCheckUtils]: 14: Hoare triple {52439#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {52440#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:31,114 INFO L273 TraceCheckUtils]: 15: Hoare triple {52440#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52440#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:31,115 INFO L273 TraceCheckUtils]: 16: Hoare triple {52440#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52440#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:31,115 INFO L273 TraceCheckUtils]: 17: Hoare triple {52440#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {52441#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:31,116 INFO L273 TraceCheckUtils]: 18: Hoare triple {52441#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52441#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:31,116 INFO L273 TraceCheckUtils]: 19: Hoare triple {52441#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52441#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:31,117 INFO L273 TraceCheckUtils]: 20: Hoare triple {52441#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {52442#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:31,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {52442#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52442#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:31,118 INFO L273 TraceCheckUtils]: 22: Hoare triple {52442#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52442#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:31,119 INFO L273 TraceCheckUtils]: 23: Hoare triple {52442#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {52443#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:31,119 INFO L273 TraceCheckUtils]: 24: Hoare triple {52443#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52443#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:31,120 INFO L273 TraceCheckUtils]: 25: Hoare triple {52443#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52443#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:31,120 INFO L273 TraceCheckUtils]: 26: Hoare triple {52443#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {52444#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:31,121 INFO L273 TraceCheckUtils]: 27: Hoare triple {52444#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52444#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:31,121 INFO L273 TraceCheckUtils]: 28: Hoare triple {52444#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52444#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:31,122 INFO L273 TraceCheckUtils]: 29: Hoare triple {52444#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {52445#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:31,123 INFO L273 TraceCheckUtils]: 30: Hoare triple {52445#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52445#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:31,123 INFO L273 TraceCheckUtils]: 31: Hoare triple {52445#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52445#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:31,124 INFO L273 TraceCheckUtils]: 32: Hoare triple {52445#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {52446#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:31,124 INFO L273 TraceCheckUtils]: 33: Hoare triple {52446#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52446#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:31,125 INFO L273 TraceCheckUtils]: 34: Hoare triple {52446#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52446#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:31,125 INFO L273 TraceCheckUtils]: 35: Hoare triple {52446#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {52447#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:31,126 INFO L273 TraceCheckUtils]: 36: Hoare triple {52447#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52447#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:31,126 INFO L273 TraceCheckUtils]: 37: Hoare triple {52447#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52447#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:31,127 INFO L273 TraceCheckUtils]: 38: Hoare triple {52447#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {52448#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:31,127 INFO L273 TraceCheckUtils]: 39: Hoare triple {52448#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52448#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:31,128 INFO L273 TraceCheckUtils]: 40: Hoare triple {52448#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52448#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:31,128 INFO L273 TraceCheckUtils]: 41: Hoare triple {52448#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {52449#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:31,129 INFO L273 TraceCheckUtils]: 42: Hoare triple {52449#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52449#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:31,129 INFO L273 TraceCheckUtils]: 43: Hoare triple {52449#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52449#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:31,130 INFO L273 TraceCheckUtils]: 44: Hoare triple {52449#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {52450#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:31,131 INFO L273 TraceCheckUtils]: 45: Hoare triple {52450#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52450#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:31,131 INFO L273 TraceCheckUtils]: 46: Hoare triple {52450#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52450#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:31,132 INFO L273 TraceCheckUtils]: 47: Hoare triple {52450#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {52451#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:31,132 INFO L273 TraceCheckUtils]: 48: Hoare triple {52451#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52451#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:31,133 INFO L273 TraceCheckUtils]: 49: Hoare triple {52451#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52451#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:31,133 INFO L273 TraceCheckUtils]: 50: Hoare triple {52451#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {52452#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:31,134 INFO L273 TraceCheckUtils]: 51: Hoare triple {52452#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52452#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:31,134 INFO L273 TraceCheckUtils]: 52: Hoare triple {52452#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52452#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:31,135 INFO L273 TraceCheckUtils]: 53: Hoare triple {52452#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {52453#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:31,135 INFO L273 TraceCheckUtils]: 54: Hoare triple {52453#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52453#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:31,136 INFO L273 TraceCheckUtils]: 55: Hoare triple {52453#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52453#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:31,137 INFO L273 TraceCheckUtils]: 56: Hoare triple {52453#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {52454#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:31,137 INFO L273 TraceCheckUtils]: 57: Hoare triple {52454#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52454#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:31,137 INFO L273 TraceCheckUtils]: 58: Hoare triple {52454#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52454#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:31,138 INFO L273 TraceCheckUtils]: 59: Hoare triple {52454#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {52455#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:31,139 INFO L273 TraceCheckUtils]: 60: Hoare triple {52455#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52455#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:31,139 INFO L273 TraceCheckUtils]: 61: Hoare triple {52455#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52455#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:31,140 INFO L273 TraceCheckUtils]: 62: Hoare triple {52455#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {52456#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:31,140 INFO L273 TraceCheckUtils]: 63: Hoare triple {52456#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52456#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:31,141 INFO L273 TraceCheckUtils]: 64: Hoare triple {52456#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52456#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:31,141 INFO L273 TraceCheckUtils]: 65: Hoare triple {52456#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {52457#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:31,142 INFO L273 TraceCheckUtils]: 66: Hoare triple {52457#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52457#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:31,142 INFO L273 TraceCheckUtils]: 67: Hoare triple {52457#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52457#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:31,143 INFO L273 TraceCheckUtils]: 68: Hoare triple {52457#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {52458#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:31,143 INFO L273 TraceCheckUtils]: 69: Hoare triple {52458#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52458#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:31,144 INFO L273 TraceCheckUtils]: 70: Hoare triple {52458#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52458#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:31,145 INFO L273 TraceCheckUtils]: 71: Hoare triple {52458#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {52459#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:31,145 INFO L273 TraceCheckUtils]: 72: Hoare triple {52459#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52459#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:31,145 INFO L273 TraceCheckUtils]: 73: Hoare triple {52459#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52459#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:31,146 INFO L273 TraceCheckUtils]: 74: Hoare triple {52459#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {52460#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:31,147 INFO L273 TraceCheckUtils]: 75: Hoare triple {52460#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52460#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:31,147 INFO L273 TraceCheckUtils]: 76: Hoare triple {52460#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52460#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:31,148 INFO L273 TraceCheckUtils]: 77: Hoare triple {52460#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {52461#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:31,148 INFO L273 TraceCheckUtils]: 78: Hoare triple {52461#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52461#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:31,149 INFO L273 TraceCheckUtils]: 79: Hoare triple {52461#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52461#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:31,150 INFO L273 TraceCheckUtils]: 80: Hoare triple {52461#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {52462#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:31,150 INFO L273 TraceCheckUtils]: 81: Hoare triple {52462#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52462#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:31,151 INFO L273 TraceCheckUtils]: 82: Hoare triple {52462#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52462#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:31,151 INFO L273 TraceCheckUtils]: 83: Hoare triple {52462#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {52463#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:31,152 INFO L273 TraceCheckUtils]: 84: Hoare triple {52463#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52463#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:31,152 INFO L273 TraceCheckUtils]: 85: Hoare triple {52463#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52463#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:31,153 INFO L273 TraceCheckUtils]: 86: Hoare triple {52463#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {52464#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:31,153 INFO L273 TraceCheckUtils]: 87: Hoare triple {52464#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52464#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:31,154 INFO L273 TraceCheckUtils]: 88: Hoare triple {52464#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52464#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:31,154 INFO L273 TraceCheckUtils]: 89: Hoare triple {52464#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {52465#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:31,155 INFO L273 TraceCheckUtils]: 90: Hoare triple {52465#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52465#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:31,155 INFO L273 TraceCheckUtils]: 91: Hoare triple {52465#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52465#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:31,156 INFO L273 TraceCheckUtils]: 92: Hoare triple {52465#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {52466#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:31,156 INFO L273 TraceCheckUtils]: 93: Hoare triple {52466#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52466#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:31,157 INFO L273 TraceCheckUtils]: 94: Hoare triple {52466#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52466#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:31,158 INFO L273 TraceCheckUtils]: 95: Hoare triple {52466#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {52467#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:31,158 INFO L273 TraceCheckUtils]: 96: Hoare triple {52467#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52467#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:31,159 INFO L273 TraceCheckUtils]: 97: Hoare triple {52467#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52467#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:31,159 INFO L273 TraceCheckUtils]: 98: Hoare triple {52467#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {52468#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:31,160 INFO L273 TraceCheckUtils]: 99: Hoare triple {52468#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52468#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:31,160 INFO L273 TraceCheckUtils]: 100: Hoare triple {52468#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52468#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:31,161 INFO L273 TraceCheckUtils]: 101: Hoare triple {52468#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {52469#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:31,161 INFO L273 TraceCheckUtils]: 102: Hoare triple {52469#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52469#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:31,162 INFO L273 TraceCheckUtils]: 103: Hoare triple {52469#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52469#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:31,162 INFO L273 TraceCheckUtils]: 104: Hoare triple {52469#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {52470#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:31,163 INFO L273 TraceCheckUtils]: 105: Hoare triple {52470#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52470#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:31,163 INFO L273 TraceCheckUtils]: 106: Hoare triple {52470#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52470#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:31,164 INFO L273 TraceCheckUtils]: 107: Hoare triple {52470#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {52471#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:31,165 INFO L273 TraceCheckUtils]: 108: Hoare triple {52471#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52471#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:31,165 INFO L273 TraceCheckUtils]: 109: Hoare triple {52471#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52471#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:31,166 INFO L273 TraceCheckUtils]: 110: Hoare triple {52471#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {52472#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:31,166 INFO L273 TraceCheckUtils]: 111: Hoare triple {52472#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52472#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:31,167 INFO L273 TraceCheckUtils]: 112: Hoare triple {52472#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52472#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:31,168 INFO L273 TraceCheckUtils]: 113: Hoare triple {52472#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {52473#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:31,168 INFO L273 TraceCheckUtils]: 114: Hoare triple {52473#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52473#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:31,169 INFO L273 TraceCheckUtils]: 115: Hoare triple {52473#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52473#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:31,169 INFO L273 TraceCheckUtils]: 116: Hoare triple {52473#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {52474#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:31,170 INFO L273 TraceCheckUtils]: 117: Hoare triple {52474#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52474#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:31,170 INFO L273 TraceCheckUtils]: 118: Hoare triple {52474#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52474#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:31,171 INFO L273 TraceCheckUtils]: 119: Hoare triple {52474#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {52475#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:31,172 INFO L273 TraceCheckUtils]: 120: Hoare triple {52475#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52475#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:31,172 INFO L273 TraceCheckUtils]: 121: Hoare triple {52475#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52475#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:31,173 INFO L273 TraceCheckUtils]: 122: Hoare triple {52475#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {52476#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:31,173 INFO L273 TraceCheckUtils]: 123: Hoare triple {52476#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52476#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:31,174 INFO L273 TraceCheckUtils]: 124: Hoare triple {52476#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52476#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:31,174 INFO L273 TraceCheckUtils]: 125: Hoare triple {52476#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {52477#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:31,175 INFO L273 TraceCheckUtils]: 126: Hoare triple {52477#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52477#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:31,175 INFO L273 TraceCheckUtils]: 127: Hoare triple {52477#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52477#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:31,176 INFO L273 TraceCheckUtils]: 128: Hoare triple {52477#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {52478#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:31,176 INFO L273 TraceCheckUtils]: 129: Hoare triple {52478#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52478#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:31,177 INFO L273 TraceCheckUtils]: 130: Hoare triple {52478#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52478#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:31,178 INFO L273 TraceCheckUtils]: 131: Hoare triple {52478#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {52479#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:31,178 INFO L273 TraceCheckUtils]: 132: Hoare triple {52479#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52479#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:31,179 INFO L273 TraceCheckUtils]: 133: Hoare triple {52479#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52479#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:31,179 INFO L273 TraceCheckUtils]: 134: Hoare triple {52479#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {52480#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:31,180 INFO L273 TraceCheckUtils]: 135: Hoare triple {52480#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52480#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:31,180 INFO L273 TraceCheckUtils]: 136: Hoare triple {52480#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52480#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:31,181 INFO L273 TraceCheckUtils]: 137: Hoare triple {52480#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {52481#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:31,181 INFO L273 TraceCheckUtils]: 138: Hoare triple {52481#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52481#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:31,182 INFO L273 TraceCheckUtils]: 139: Hoare triple {52481#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52481#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:31,182 INFO L273 TraceCheckUtils]: 140: Hoare triple {52481#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {52482#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:31,183 INFO L273 TraceCheckUtils]: 141: Hoare triple {52482#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52482#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:31,183 INFO L273 TraceCheckUtils]: 142: Hoare triple {52482#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52482#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:31,184 INFO L273 TraceCheckUtils]: 143: Hoare triple {52482#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {52483#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:31,184 INFO L273 TraceCheckUtils]: 144: Hoare triple {52483#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52483#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:31,185 INFO L273 TraceCheckUtils]: 145: Hoare triple {52483#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52483#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:31,186 INFO L273 TraceCheckUtils]: 146: Hoare triple {52483#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {52484#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:31,186 INFO L273 TraceCheckUtils]: 147: Hoare triple {52484#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52484#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:31,187 INFO L273 TraceCheckUtils]: 148: Hoare triple {52484#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52484#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:31,187 INFO L273 TraceCheckUtils]: 149: Hoare triple {52484#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {52485#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:31,188 INFO L273 TraceCheckUtils]: 150: Hoare triple {52485#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52485#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:31,188 INFO L273 TraceCheckUtils]: 151: Hoare triple {52485#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52485#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:31,189 INFO L273 TraceCheckUtils]: 152: Hoare triple {52485#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {52486#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:31,189 INFO L273 TraceCheckUtils]: 153: Hoare triple {52486#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52486#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:31,190 INFO L273 TraceCheckUtils]: 154: Hoare triple {52486#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52486#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:31,190 INFO L273 TraceCheckUtils]: 155: Hoare triple {52486#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {52487#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:31,191 INFO L273 TraceCheckUtils]: 156: Hoare triple {52487#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52487#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:31,191 INFO L273 TraceCheckUtils]: 157: Hoare triple {52487#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52487#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:31,192 INFO L273 TraceCheckUtils]: 158: Hoare triple {52487#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {52488#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:31,192 INFO L273 TraceCheckUtils]: 159: Hoare triple {52488#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52488#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:31,193 INFO L273 TraceCheckUtils]: 160: Hoare triple {52488#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52488#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:31,194 INFO L273 TraceCheckUtils]: 161: Hoare triple {52488#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {52489#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:31,194 INFO L273 TraceCheckUtils]: 162: Hoare triple {52489#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52489#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:31,194 INFO L273 TraceCheckUtils]: 163: Hoare triple {52489#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52489#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:31,195 INFO L273 TraceCheckUtils]: 164: Hoare triple {52489#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {52490#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:31,196 INFO L273 TraceCheckUtils]: 165: Hoare triple {52490#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52490#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:31,196 INFO L273 TraceCheckUtils]: 166: Hoare triple {52490#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52490#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:31,197 INFO L273 TraceCheckUtils]: 167: Hoare triple {52490#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {52491#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:31,197 INFO L273 TraceCheckUtils]: 168: Hoare triple {52491#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52491#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:31,198 INFO L273 TraceCheckUtils]: 169: Hoare triple {52491#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52491#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:31,198 INFO L273 TraceCheckUtils]: 170: Hoare triple {52491#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {52492#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:31,199 INFO L273 TraceCheckUtils]: 171: Hoare triple {52492#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52492#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:31,199 INFO L273 TraceCheckUtils]: 172: Hoare triple {52492#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52492#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:31,200 INFO L273 TraceCheckUtils]: 173: Hoare triple {52492#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {52493#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:31,200 INFO L273 TraceCheckUtils]: 174: Hoare triple {52493#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52493#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:31,201 INFO L273 TraceCheckUtils]: 175: Hoare triple {52493#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52493#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:31,202 INFO L273 TraceCheckUtils]: 176: Hoare triple {52493#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {52494#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:31,202 INFO L273 TraceCheckUtils]: 177: Hoare triple {52494#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52494#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:31,203 INFO L273 TraceCheckUtils]: 178: Hoare triple {52494#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52494#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:31,203 INFO L273 TraceCheckUtils]: 179: Hoare triple {52494#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {52495#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:31,204 INFO L273 TraceCheckUtils]: 180: Hoare triple {52495#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52495#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:31,204 INFO L273 TraceCheckUtils]: 181: Hoare triple {52495#(<= main_~i~0 58)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52495#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:31,205 INFO L273 TraceCheckUtils]: 182: Hoare triple {52495#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {52496#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:31,205 INFO L273 TraceCheckUtils]: 183: Hoare triple {52496#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52496#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:31,206 INFO L273 TraceCheckUtils]: 184: Hoare triple {52496#(<= main_~i~0 59)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {52496#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:31,206 INFO L273 TraceCheckUtils]: 185: Hoare triple {52496#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {52497#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:31,207 INFO L273 TraceCheckUtils]: 186: Hoare triple {52497#(<= main_~i~0 60)} assume !(~i~0 < 100000); {52436#false} is VALID [2018-11-23 12:07:31,207 INFO L273 TraceCheckUtils]: 187: Hoare triple {52436#false} havoc ~x~0;~x~0 := 0; {52436#false} is VALID [2018-11-23 12:07:31,207 INFO L273 TraceCheckUtils]: 188: Hoare triple {52436#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {52436#false} is VALID [2018-11-23 12:07:31,208 INFO L256 TraceCheckUtils]: 189: Hoare triple {52436#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {52436#false} is VALID [2018-11-23 12:07:31,208 INFO L273 TraceCheckUtils]: 190: Hoare triple {52436#false} ~cond := #in~cond; {52436#false} is VALID [2018-11-23 12:07:31,208 INFO L273 TraceCheckUtils]: 191: Hoare triple {52436#false} assume 0 == ~cond; {52436#false} is VALID [2018-11-23 12:07:31,208 INFO L273 TraceCheckUtils]: 192: Hoare triple {52436#false} assume !false; {52436#false} is VALID [2018-11-23 12:07:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:31,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:31,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2018-11-23 12:07:31,265 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 193 [2018-11-23 12:07:31,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:31,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states. [2018-11-23 12:07:31,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:31,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-23 12:07:31,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-23 12:07:31,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 12:07:31,456 INFO L87 Difference]: Start difference. First operand 198 states and 259 transitions. Second operand 64 states. [2018-11-23 12:07:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:32,319 INFO L93 Difference]: Finished difference Result 214 states and 278 transitions. [2018-11-23 12:07:32,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-23 12:07:32,319 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 193 [2018-11-23 12:07:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:07:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 278 transitions. [2018-11-23 12:07:32,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:07:32,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 278 transitions. [2018-11-23 12:07:32,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states and 278 transitions. [2018-11-23 12:07:32,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:32,577 INFO L225 Difference]: With dead ends: 214 [2018-11-23 12:07:32,577 INFO L226 Difference]: Without dead ends: 203 [2018-11-23 12:07:32,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 12:07:32,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-23 12:07:32,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-11-23 12:07:32,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:32,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand 201 states. [2018-11-23 12:07:32,626 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand 201 states. [2018-11-23 12:07:32,626 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 201 states. [2018-11-23 12:07:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:32,629 INFO L93 Difference]: Finished difference Result 203 states and 266 transitions. [2018-11-23 12:07:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 266 transitions. [2018-11-23 12:07:32,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:32,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:32,630 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 203 states. [2018-11-23 12:07:32,630 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 203 states. [2018-11-23 12:07:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:32,632 INFO L93 Difference]: Finished difference Result 203 states and 266 transitions. [2018-11-23 12:07:32,633 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 266 transitions. [2018-11-23 12:07:32,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:32,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:32,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:32,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-23 12:07:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 263 transitions. [2018-11-23 12:07:32,636 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 263 transitions. Word has length 193 [2018-11-23 12:07:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:32,636 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 263 transitions. [2018-11-23 12:07:32,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-23 12:07:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2018-11-23 12:07:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-23 12:07:32,636 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:32,637 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:32,637 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:32,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:32,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1171090333, now seen corresponding path program 61 times [2018-11-23 12:07:32,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:32,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:32,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:32,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:32,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:34,440 INFO L256 TraceCheckUtils]: 0: Hoare triple {54039#true} call ULTIMATE.init(); {54039#true} is VALID [2018-11-23 12:07:34,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {54039#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {54039#true} is VALID [2018-11-23 12:07:34,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {54039#true} assume true; {54039#true} is VALID [2018-11-23 12:07:34,441 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {54039#true} {54039#true} #55#return; {54039#true} is VALID [2018-11-23 12:07:34,441 INFO L256 TraceCheckUtils]: 4: Hoare triple {54039#true} call #t~ret4 := main(); {54039#true} is VALID [2018-11-23 12:07:34,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {54039#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {54041#(= main_~i~0 0)} is VALID [2018-11-23 12:07:34,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {54041#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54041#(= main_~i~0 0)} is VALID [2018-11-23 12:07:34,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {54041#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54041#(= main_~i~0 0)} is VALID [2018-11-23 12:07:34,443 INFO L273 TraceCheckUtils]: 8: Hoare triple {54041#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {54042#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:34,444 INFO L273 TraceCheckUtils]: 9: Hoare triple {54042#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54042#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:34,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {54042#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54042#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:34,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {54042#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {54043#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:34,445 INFO L273 TraceCheckUtils]: 12: Hoare triple {54043#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54043#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:34,446 INFO L273 TraceCheckUtils]: 13: Hoare triple {54043#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54043#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:34,447 INFO L273 TraceCheckUtils]: 14: Hoare triple {54043#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {54044#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:34,447 INFO L273 TraceCheckUtils]: 15: Hoare triple {54044#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54044#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:34,448 INFO L273 TraceCheckUtils]: 16: Hoare triple {54044#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54044#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:34,448 INFO L273 TraceCheckUtils]: 17: Hoare triple {54044#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {54045#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:34,449 INFO L273 TraceCheckUtils]: 18: Hoare triple {54045#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54045#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:34,449 INFO L273 TraceCheckUtils]: 19: Hoare triple {54045#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54045#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:34,450 INFO L273 TraceCheckUtils]: 20: Hoare triple {54045#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {54046#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:34,451 INFO L273 TraceCheckUtils]: 21: Hoare triple {54046#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54046#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:34,451 INFO L273 TraceCheckUtils]: 22: Hoare triple {54046#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54046#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:34,452 INFO L273 TraceCheckUtils]: 23: Hoare triple {54046#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {54047#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:34,452 INFO L273 TraceCheckUtils]: 24: Hoare triple {54047#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54047#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:34,453 INFO L273 TraceCheckUtils]: 25: Hoare triple {54047#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54047#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:34,454 INFO L273 TraceCheckUtils]: 26: Hoare triple {54047#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {54048#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:34,454 INFO L273 TraceCheckUtils]: 27: Hoare triple {54048#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54048#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:34,455 INFO L273 TraceCheckUtils]: 28: Hoare triple {54048#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54048#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:34,455 INFO L273 TraceCheckUtils]: 29: Hoare triple {54048#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {54049#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:34,456 INFO L273 TraceCheckUtils]: 30: Hoare triple {54049#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54049#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:34,456 INFO L273 TraceCheckUtils]: 31: Hoare triple {54049#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54049#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:34,457 INFO L273 TraceCheckUtils]: 32: Hoare triple {54049#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {54050#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:34,458 INFO L273 TraceCheckUtils]: 33: Hoare triple {54050#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54050#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:34,458 INFO L273 TraceCheckUtils]: 34: Hoare triple {54050#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54050#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:34,459 INFO L273 TraceCheckUtils]: 35: Hoare triple {54050#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {54051#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:34,459 INFO L273 TraceCheckUtils]: 36: Hoare triple {54051#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54051#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:34,460 INFO L273 TraceCheckUtils]: 37: Hoare triple {54051#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54051#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:34,460 INFO L273 TraceCheckUtils]: 38: Hoare triple {54051#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {54052#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:34,461 INFO L273 TraceCheckUtils]: 39: Hoare triple {54052#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54052#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:34,461 INFO L273 TraceCheckUtils]: 40: Hoare triple {54052#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54052#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:34,462 INFO L273 TraceCheckUtils]: 41: Hoare triple {54052#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {54053#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:34,463 INFO L273 TraceCheckUtils]: 42: Hoare triple {54053#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54053#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:34,463 INFO L273 TraceCheckUtils]: 43: Hoare triple {54053#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54053#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:34,464 INFO L273 TraceCheckUtils]: 44: Hoare triple {54053#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {54054#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:34,464 INFO L273 TraceCheckUtils]: 45: Hoare triple {54054#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54054#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:34,465 INFO L273 TraceCheckUtils]: 46: Hoare triple {54054#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54054#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:34,465 INFO L273 TraceCheckUtils]: 47: Hoare triple {54054#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {54055#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:34,466 INFO L273 TraceCheckUtils]: 48: Hoare triple {54055#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54055#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:34,466 INFO L273 TraceCheckUtils]: 49: Hoare triple {54055#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54055#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:34,467 INFO L273 TraceCheckUtils]: 50: Hoare triple {54055#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {54056#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:34,468 INFO L273 TraceCheckUtils]: 51: Hoare triple {54056#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54056#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:34,468 INFO L273 TraceCheckUtils]: 52: Hoare triple {54056#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54056#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:34,469 INFO L273 TraceCheckUtils]: 53: Hoare triple {54056#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {54057#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:34,469 INFO L273 TraceCheckUtils]: 54: Hoare triple {54057#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54057#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:34,470 INFO L273 TraceCheckUtils]: 55: Hoare triple {54057#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54057#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:34,471 INFO L273 TraceCheckUtils]: 56: Hoare triple {54057#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {54058#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:34,471 INFO L273 TraceCheckUtils]: 57: Hoare triple {54058#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54058#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:34,472 INFO L273 TraceCheckUtils]: 58: Hoare triple {54058#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54058#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:34,472 INFO L273 TraceCheckUtils]: 59: Hoare triple {54058#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {54059#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:34,473 INFO L273 TraceCheckUtils]: 60: Hoare triple {54059#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54059#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:34,473 INFO L273 TraceCheckUtils]: 61: Hoare triple {54059#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54059#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:34,474 INFO L273 TraceCheckUtils]: 62: Hoare triple {54059#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {54060#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:34,475 INFO L273 TraceCheckUtils]: 63: Hoare triple {54060#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54060#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:34,475 INFO L273 TraceCheckUtils]: 64: Hoare triple {54060#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54060#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:34,476 INFO L273 TraceCheckUtils]: 65: Hoare triple {54060#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {54061#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:34,476 INFO L273 TraceCheckUtils]: 66: Hoare triple {54061#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54061#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:34,477 INFO L273 TraceCheckUtils]: 67: Hoare triple {54061#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54061#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:34,477 INFO L273 TraceCheckUtils]: 68: Hoare triple {54061#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {54062#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:34,478 INFO L273 TraceCheckUtils]: 69: Hoare triple {54062#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54062#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:34,478 INFO L273 TraceCheckUtils]: 70: Hoare triple {54062#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54062#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:34,479 INFO L273 TraceCheckUtils]: 71: Hoare triple {54062#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {54063#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:34,480 INFO L273 TraceCheckUtils]: 72: Hoare triple {54063#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54063#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:34,480 INFO L273 TraceCheckUtils]: 73: Hoare triple {54063#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54063#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:34,481 INFO L273 TraceCheckUtils]: 74: Hoare triple {54063#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {54064#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:34,481 INFO L273 TraceCheckUtils]: 75: Hoare triple {54064#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54064#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:34,482 INFO L273 TraceCheckUtils]: 76: Hoare triple {54064#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54064#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:34,483 INFO L273 TraceCheckUtils]: 77: Hoare triple {54064#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {54065#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:34,483 INFO L273 TraceCheckUtils]: 78: Hoare triple {54065#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54065#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:34,484 INFO L273 TraceCheckUtils]: 79: Hoare triple {54065#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54065#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:34,484 INFO L273 TraceCheckUtils]: 80: Hoare triple {54065#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {54066#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:34,485 INFO L273 TraceCheckUtils]: 81: Hoare triple {54066#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54066#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:34,485 INFO L273 TraceCheckUtils]: 82: Hoare triple {54066#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54066#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:34,486 INFO L273 TraceCheckUtils]: 83: Hoare triple {54066#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {54067#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:34,486 INFO L273 TraceCheckUtils]: 84: Hoare triple {54067#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54067#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:34,487 INFO L273 TraceCheckUtils]: 85: Hoare triple {54067#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54067#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:34,488 INFO L273 TraceCheckUtils]: 86: Hoare triple {54067#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {54068#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:34,488 INFO L273 TraceCheckUtils]: 87: Hoare triple {54068#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54068#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:34,489 INFO L273 TraceCheckUtils]: 88: Hoare triple {54068#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54068#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:34,489 INFO L273 TraceCheckUtils]: 89: Hoare triple {54068#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {54069#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:34,490 INFO L273 TraceCheckUtils]: 90: Hoare triple {54069#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54069#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:34,490 INFO L273 TraceCheckUtils]: 91: Hoare triple {54069#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54069#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:34,491 INFO L273 TraceCheckUtils]: 92: Hoare triple {54069#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {54070#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:34,492 INFO L273 TraceCheckUtils]: 93: Hoare triple {54070#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54070#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:34,492 INFO L273 TraceCheckUtils]: 94: Hoare triple {54070#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54070#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:34,493 INFO L273 TraceCheckUtils]: 95: Hoare triple {54070#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {54071#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:34,493 INFO L273 TraceCheckUtils]: 96: Hoare triple {54071#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54071#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:34,494 INFO L273 TraceCheckUtils]: 97: Hoare triple {54071#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54071#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:34,494 INFO L273 TraceCheckUtils]: 98: Hoare triple {54071#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {54072#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:34,495 INFO L273 TraceCheckUtils]: 99: Hoare triple {54072#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54072#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:34,495 INFO L273 TraceCheckUtils]: 100: Hoare triple {54072#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54072#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:34,496 INFO L273 TraceCheckUtils]: 101: Hoare triple {54072#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {54073#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:34,497 INFO L273 TraceCheckUtils]: 102: Hoare triple {54073#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54073#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:34,497 INFO L273 TraceCheckUtils]: 103: Hoare triple {54073#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54073#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:34,498 INFO L273 TraceCheckUtils]: 104: Hoare triple {54073#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {54074#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:34,498 INFO L273 TraceCheckUtils]: 105: Hoare triple {54074#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54074#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:34,499 INFO L273 TraceCheckUtils]: 106: Hoare triple {54074#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54074#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:34,500 INFO L273 TraceCheckUtils]: 107: Hoare triple {54074#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {54075#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:34,500 INFO L273 TraceCheckUtils]: 108: Hoare triple {54075#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54075#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:34,501 INFO L273 TraceCheckUtils]: 109: Hoare triple {54075#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54075#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:34,501 INFO L273 TraceCheckUtils]: 110: Hoare triple {54075#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {54076#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:34,502 INFO L273 TraceCheckUtils]: 111: Hoare triple {54076#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54076#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:34,502 INFO L273 TraceCheckUtils]: 112: Hoare triple {54076#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54076#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:34,503 INFO L273 TraceCheckUtils]: 113: Hoare triple {54076#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {54077#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:34,504 INFO L273 TraceCheckUtils]: 114: Hoare triple {54077#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54077#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:34,504 INFO L273 TraceCheckUtils]: 115: Hoare triple {54077#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54077#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:34,505 INFO L273 TraceCheckUtils]: 116: Hoare triple {54077#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {54078#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:34,505 INFO L273 TraceCheckUtils]: 117: Hoare triple {54078#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54078#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:34,506 INFO L273 TraceCheckUtils]: 118: Hoare triple {54078#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54078#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:34,506 INFO L273 TraceCheckUtils]: 119: Hoare triple {54078#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {54079#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:34,507 INFO L273 TraceCheckUtils]: 120: Hoare triple {54079#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54079#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:34,507 INFO L273 TraceCheckUtils]: 121: Hoare triple {54079#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54079#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:34,508 INFO L273 TraceCheckUtils]: 122: Hoare triple {54079#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {54080#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:34,509 INFO L273 TraceCheckUtils]: 123: Hoare triple {54080#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54080#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:34,509 INFO L273 TraceCheckUtils]: 124: Hoare triple {54080#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54080#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:34,510 INFO L273 TraceCheckUtils]: 125: Hoare triple {54080#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {54081#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:34,510 INFO L273 TraceCheckUtils]: 126: Hoare triple {54081#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54081#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:34,511 INFO L273 TraceCheckUtils]: 127: Hoare triple {54081#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54081#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:34,512 INFO L273 TraceCheckUtils]: 128: Hoare triple {54081#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {54082#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:34,512 INFO L273 TraceCheckUtils]: 129: Hoare triple {54082#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54082#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:34,513 INFO L273 TraceCheckUtils]: 130: Hoare triple {54082#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54082#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:34,513 INFO L273 TraceCheckUtils]: 131: Hoare triple {54082#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {54083#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:34,514 INFO L273 TraceCheckUtils]: 132: Hoare triple {54083#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54083#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:34,514 INFO L273 TraceCheckUtils]: 133: Hoare triple {54083#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54083#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:34,515 INFO L273 TraceCheckUtils]: 134: Hoare triple {54083#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {54084#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:34,515 INFO L273 TraceCheckUtils]: 135: Hoare triple {54084#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54084#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:34,516 INFO L273 TraceCheckUtils]: 136: Hoare triple {54084#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54084#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:34,517 INFO L273 TraceCheckUtils]: 137: Hoare triple {54084#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {54085#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:34,517 INFO L273 TraceCheckUtils]: 138: Hoare triple {54085#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54085#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:34,518 INFO L273 TraceCheckUtils]: 139: Hoare triple {54085#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54085#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:34,518 INFO L273 TraceCheckUtils]: 140: Hoare triple {54085#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {54086#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:34,519 INFO L273 TraceCheckUtils]: 141: Hoare triple {54086#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54086#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:34,519 INFO L273 TraceCheckUtils]: 142: Hoare triple {54086#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54086#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:34,520 INFO L273 TraceCheckUtils]: 143: Hoare triple {54086#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {54087#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:34,521 INFO L273 TraceCheckUtils]: 144: Hoare triple {54087#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54087#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:34,521 INFO L273 TraceCheckUtils]: 145: Hoare triple {54087#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54087#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:34,522 INFO L273 TraceCheckUtils]: 146: Hoare triple {54087#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {54088#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:34,522 INFO L273 TraceCheckUtils]: 147: Hoare triple {54088#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54088#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:34,523 INFO L273 TraceCheckUtils]: 148: Hoare triple {54088#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54088#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:34,523 INFO L273 TraceCheckUtils]: 149: Hoare triple {54088#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {54089#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:34,524 INFO L273 TraceCheckUtils]: 150: Hoare triple {54089#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54089#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:34,524 INFO L273 TraceCheckUtils]: 151: Hoare triple {54089#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54089#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:34,525 INFO L273 TraceCheckUtils]: 152: Hoare triple {54089#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {54090#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:34,526 INFO L273 TraceCheckUtils]: 153: Hoare triple {54090#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54090#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:34,526 INFO L273 TraceCheckUtils]: 154: Hoare triple {54090#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54090#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:34,527 INFO L273 TraceCheckUtils]: 155: Hoare triple {54090#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {54091#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:34,527 INFO L273 TraceCheckUtils]: 156: Hoare triple {54091#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54091#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:34,528 INFO L273 TraceCheckUtils]: 157: Hoare triple {54091#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54091#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:34,529 INFO L273 TraceCheckUtils]: 158: Hoare triple {54091#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {54092#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:34,529 INFO L273 TraceCheckUtils]: 159: Hoare triple {54092#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54092#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:34,530 INFO L273 TraceCheckUtils]: 160: Hoare triple {54092#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54092#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:34,530 INFO L273 TraceCheckUtils]: 161: Hoare triple {54092#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {54093#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:34,531 INFO L273 TraceCheckUtils]: 162: Hoare triple {54093#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54093#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:34,531 INFO L273 TraceCheckUtils]: 163: Hoare triple {54093#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54093#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:34,532 INFO L273 TraceCheckUtils]: 164: Hoare triple {54093#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {54094#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:34,533 INFO L273 TraceCheckUtils]: 165: Hoare triple {54094#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54094#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:34,533 INFO L273 TraceCheckUtils]: 166: Hoare triple {54094#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54094#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:34,534 INFO L273 TraceCheckUtils]: 167: Hoare triple {54094#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {54095#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:34,534 INFO L273 TraceCheckUtils]: 168: Hoare triple {54095#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54095#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:34,535 INFO L273 TraceCheckUtils]: 169: Hoare triple {54095#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54095#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:34,536 INFO L273 TraceCheckUtils]: 170: Hoare triple {54095#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {54096#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:34,536 INFO L273 TraceCheckUtils]: 171: Hoare triple {54096#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54096#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:34,537 INFO L273 TraceCheckUtils]: 172: Hoare triple {54096#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54096#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:34,537 INFO L273 TraceCheckUtils]: 173: Hoare triple {54096#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {54097#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:34,538 INFO L273 TraceCheckUtils]: 174: Hoare triple {54097#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54097#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:34,538 INFO L273 TraceCheckUtils]: 175: Hoare triple {54097#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54097#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:34,539 INFO L273 TraceCheckUtils]: 176: Hoare triple {54097#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {54098#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:34,539 INFO L273 TraceCheckUtils]: 177: Hoare triple {54098#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54098#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:34,540 INFO L273 TraceCheckUtils]: 178: Hoare triple {54098#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54098#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:34,541 INFO L273 TraceCheckUtils]: 179: Hoare triple {54098#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {54099#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:34,541 INFO L273 TraceCheckUtils]: 180: Hoare triple {54099#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54099#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:34,542 INFO L273 TraceCheckUtils]: 181: Hoare triple {54099#(<= main_~i~0 58)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54099#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:34,542 INFO L273 TraceCheckUtils]: 182: Hoare triple {54099#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {54100#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:34,543 INFO L273 TraceCheckUtils]: 183: Hoare triple {54100#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54100#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:34,543 INFO L273 TraceCheckUtils]: 184: Hoare triple {54100#(<= main_~i~0 59)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54100#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:34,544 INFO L273 TraceCheckUtils]: 185: Hoare triple {54100#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {54101#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:34,545 INFO L273 TraceCheckUtils]: 186: Hoare triple {54101#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54101#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:34,545 INFO L273 TraceCheckUtils]: 187: Hoare triple {54101#(<= main_~i~0 60)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54101#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:34,546 INFO L273 TraceCheckUtils]: 188: Hoare triple {54101#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {54102#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:34,546 INFO L273 TraceCheckUtils]: 189: Hoare triple {54102#(<= main_~i~0 61)} assume !(~i~0 < 100000); {54040#false} is VALID [2018-11-23 12:07:34,547 INFO L273 TraceCheckUtils]: 190: Hoare triple {54040#false} havoc ~x~0;~x~0 := 0; {54040#false} is VALID [2018-11-23 12:07:34,547 INFO L273 TraceCheckUtils]: 191: Hoare triple {54040#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {54040#false} is VALID [2018-11-23 12:07:34,547 INFO L256 TraceCheckUtils]: 192: Hoare triple {54040#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {54040#false} is VALID [2018-11-23 12:07:34,547 INFO L273 TraceCheckUtils]: 193: Hoare triple {54040#false} ~cond := #in~cond; {54040#false} is VALID [2018-11-23 12:07:34,547 INFO L273 TraceCheckUtils]: 194: Hoare triple {54040#false} assume 0 == ~cond; {54040#false} is VALID [2018-11-23 12:07:34,548 INFO L273 TraceCheckUtils]: 195: Hoare triple {54040#false} assume !false; {54040#false} is VALID [2018-11-23 12:07:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:34,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:34,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:34,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:34,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:35,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {54039#true} call ULTIMATE.init(); {54039#true} is VALID [2018-11-23 12:07:35,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {54039#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {54039#true} is VALID [2018-11-23 12:07:35,393 INFO L273 TraceCheckUtils]: 2: Hoare triple {54039#true} assume true; {54039#true} is VALID [2018-11-23 12:07:35,393 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {54039#true} {54039#true} #55#return; {54039#true} is VALID [2018-11-23 12:07:35,393 INFO L256 TraceCheckUtils]: 4: Hoare triple {54039#true} call #t~ret4 := main(); {54039#true} is VALID [2018-11-23 12:07:35,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {54039#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {54121#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:35,395 INFO L273 TraceCheckUtils]: 6: Hoare triple {54121#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54121#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:35,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {54121#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54121#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:35,396 INFO L273 TraceCheckUtils]: 8: Hoare triple {54121#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {54042#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:35,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {54042#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54042#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:35,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {54042#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54042#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:35,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {54042#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {54043#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:35,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {54043#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54043#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:35,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {54043#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54043#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:35,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {54043#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {54044#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:35,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {54044#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54044#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:35,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {54044#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54044#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:35,400 INFO L273 TraceCheckUtils]: 17: Hoare triple {54044#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {54045#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:35,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {54045#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54045#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:35,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {54045#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54045#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:35,401 INFO L273 TraceCheckUtils]: 20: Hoare triple {54045#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {54046#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:35,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {54046#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54046#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:35,402 INFO L273 TraceCheckUtils]: 22: Hoare triple {54046#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54046#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:35,403 INFO L273 TraceCheckUtils]: 23: Hoare triple {54046#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {54047#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:35,404 INFO L273 TraceCheckUtils]: 24: Hoare triple {54047#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54047#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:35,404 INFO L273 TraceCheckUtils]: 25: Hoare triple {54047#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54047#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:35,405 INFO L273 TraceCheckUtils]: 26: Hoare triple {54047#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {54048#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:35,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {54048#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54048#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:35,406 INFO L273 TraceCheckUtils]: 28: Hoare triple {54048#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54048#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:35,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {54048#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {54049#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:35,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {54049#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54049#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:35,408 INFO L273 TraceCheckUtils]: 31: Hoare triple {54049#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54049#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:35,408 INFO L273 TraceCheckUtils]: 32: Hoare triple {54049#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {54050#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:35,409 INFO L273 TraceCheckUtils]: 33: Hoare triple {54050#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54050#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:35,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {54050#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54050#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:35,410 INFO L273 TraceCheckUtils]: 35: Hoare triple {54050#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {54051#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:35,410 INFO L273 TraceCheckUtils]: 36: Hoare triple {54051#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54051#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:35,411 INFO L273 TraceCheckUtils]: 37: Hoare triple {54051#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54051#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:35,412 INFO L273 TraceCheckUtils]: 38: Hoare triple {54051#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {54052#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:35,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {54052#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54052#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:35,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {54052#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54052#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:35,413 INFO L273 TraceCheckUtils]: 41: Hoare triple {54052#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {54053#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:35,414 INFO L273 TraceCheckUtils]: 42: Hoare triple {54053#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54053#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:35,414 INFO L273 TraceCheckUtils]: 43: Hoare triple {54053#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54053#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:35,415 INFO L273 TraceCheckUtils]: 44: Hoare triple {54053#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {54054#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:35,416 INFO L273 TraceCheckUtils]: 45: Hoare triple {54054#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54054#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:35,416 INFO L273 TraceCheckUtils]: 46: Hoare triple {54054#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54054#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:35,417 INFO L273 TraceCheckUtils]: 47: Hoare triple {54054#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {54055#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:35,417 INFO L273 TraceCheckUtils]: 48: Hoare triple {54055#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54055#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:35,418 INFO L273 TraceCheckUtils]: 49: Hoare triple {54055#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54055#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:35,418 INFO L273 TraceCheckUtils]: 50: Hoare triple {54055#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {54056#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:35,419 INFO L273 TraceCheckUtils]: 51: Hoare triple {54056#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54056#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:35,419 INFO L273 TraceCheckUtils]: 52: Hoare triple {54056#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54056#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:35,420 INFO L273 TraceCheckUtils]: 53: Hoare triple {54056#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {54057#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:35,420 INFO L273 TraceCheckUtils]: 54: Hoare triple {54057#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54057#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:35,421 INFO L273 TraceCheckUtils]: 55: Hoare triple {54057#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54057#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:35,422 INFO L273 TraceCheckUtils]: 56: Hoare triple {54057#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {54058#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:35,422 INFO L273 TraceCheckUtils]: 57: Hoare triple {54058#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54058#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:35,422 INFO L273 TraceCheckUtils]: 58: Hoare triple {54058#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54058#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:35,423 INFO L273 TraceCheckUtils]: 59: Hoare triple {54058#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {54059#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:35,424 INFO L273 TraceCheckUtils]: 60: Hoare triple {54059#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54059#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:35,424 INFO L273 TraceCheckUtils]: 61: Hoare triple {54059#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54059#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:35,425 INFO L273 TraceCheckUtils]: 62: Hoare triple {54059#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {54060#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:35,425 INFO L273 TraceCheckUtils]: 63: Hoare triple {54060#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54060#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:35,426 INFO L273 TraceCheckUtils]: 64: Hoare triple {54060#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54060#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:35,426 INFO L273 TraceCheckUtils]: 65: Hoare triple {54060#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {54061#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:35,427 INFO L273 TraceCheckUtils]: 66: Hoare triple {54061#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54061#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:35,427 INFO L273 TraceCheckUtils]: 67: Hoare triple {54061#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54061#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:35,428 INFO L273 TraceCheckUtils]: 68: Hoare triple {54061#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {54062#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:35,428 INFO L273 TraceCheckUtils]: 69: Hoare triple {54062#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54062#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:35,429 INFO L273 TraceCheckUtils]: 70: Hoare triple {54062#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54062#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:35,430 INFO L273 TraceCheckUtils]: 71: Hoare triple {54062#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {54063#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:35,430 INFO L273 TraceCheckUtils]: 72: Hoare triple {54063#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54063#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:35,430 INFO L273 TraceCheckUtils]: 73: Hoare triple {54063#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54063#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:35,431 INFO L273 TraceCheckUtils]: 74: Hoare triple {54063#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {54064#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:35,432 INFO L273 TraceCheckUtils]: 75: Hoare triple {54064#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54064#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:35,432 INFO L273 TraceCheckUtils]: 76: Hoare triple {54064#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54064#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:35,433 INFO L273 TraceCheckUtils]: 77: Hoare triple {54064#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {54065#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:35,433 INFO L273 TraceCheckUtils]: 78: Hoare triple {54065#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54065#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:35,434 INFO L273 TraceCheckUtils]: 79: Hoare triple {54065#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54065#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:35,434 INFO L273 TraceCheckUtils]: 80: Hoare triple {54065#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {54066#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:35,435 INFO L273 TraceCheckUtils]: 81: Hoare triple {54066#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54066#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:35,435 INFO L273 TraceCheckUtils]: 82: Hoare triple {54066#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54066#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:35,436 INFO L273 TraceCheckUtils]: 83: Hoare triple {54066#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {54067#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:35,436 INFO L273 TraceCheckUtils]: 84: Hoare triple {54067#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54067#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:35,437 INFO L273 TraceCheckUtils]: 85: Hoare triple {54067#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54067#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:35,438 INFO L273 TraceCheckUtils]: 86: Hoare triple {54067#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {54068#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:35,438 INFO L273 TraceCheckUtils]: 87: Hoare triple {54068#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54068#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:35,438 INFO L273 TraceCheckUtils]: 88: Hoare triple {54068#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54068#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:35,439 INFO L273 TraceCheckUtils]: 89: Hoare triple {54068#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {54069#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:35,440 INFO L273 TraceCheckUtils]: 90: Hoare triple {54069#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54069#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:35,440 INFO L273 TraceCheckUtils]: 91: Hoare triple {54069#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54069#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:35,441 INFO L273 TraceCheckUtils]: 92: Hoare triple {54069#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {54070#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:35,441 INFO L273 TraceCheckUtils]: 93: Hoare triple {54070#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54070#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:35,442 INFO L273 TraceCheckUtils]: 94: Hoare triple {54070#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54070#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:35,442 INFO L273 TraceCheckUtils]: 95: Hoare triple {54070#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {54071#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:35,443 INFO L273 TraceCheckUtils]: 96: Hoare triple {54071#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54071#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:35,443 INFO L273 TraceCheckUtils]: 97: Hoare triple {54071#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54071#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:35,444 INFO L273 TraceCheckUtils]: 98: Hoare triple {54071#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {54072#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:35,445 INFO L273 TraceCheckUtils]: 99: Hoare triple {54072#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54072#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:35,445 INFO L273 TraceCheckUtils]: 100: Hoare triple {54072#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54072#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:35,446 INFO L273 TraceCheckUtils]: 101: Hoare triple {54072#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {54073#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:35,446 INFO L273 TraceCheckUtils]: 102: Hoare triple {54073#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54073#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:35,447 INFO L273 TraceCheckUtils]: 103: Hoare triple {54073#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54073#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:35,447 INFO L273 TraceCheckUtils]: 104: Hoare triple {54073#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {54074#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:35,448 INFO L273 TraceCheckUtils]: 105: Hoare triple {54074#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54074#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:35,448 INFO L273 TraceCheckUtils]: 106: Hoare triple {54074#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54074#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:35,449 INFO L273 TraceCheckUtils]: 107: Hoare triple {54074#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {54075#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:35,450 INFO L273 TraceCheckUtils]: 108: Hoare triple {54075#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54075#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:35,450 INFO L273 TraceCheckUtils]: 109: Hoare triple {54075#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54075#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:35,451 INFO L273 TraceCheckUtils]: 110: Hoare triple {54075#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {54076#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:35,451 INFO L273 TraceCheckUtils]: 111: Hoare triple {54076#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54076#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:35,452 INFO L273 TraceCheckUtils]: 112: Hoare triple {54076#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54076#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:35,452 INFO L273 TraceCheckUtils]: 113: Hoare triple {54076#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {54077#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:35,453 INFO L273 TraceCheckUtils]: 114: Hoare triple {54077#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54077#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:35,453 INFO L273 TraceCheckUtils]: 115: Hoare triple {54077#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54077#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:35,454 INFO L273 TraceCheckUtils]: 116: Hoare triple {54077#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {54078#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:35,455 INFO L273 TraceCheckUtils]: 117: Hoare triple {54078#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54078#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:35,455 INFO L273 TraceCheckUtils]: 118: Hoare triple {54078#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54078#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:35,456 INFO L273 TraceCheckUtils]: 119: Hoare triple {54078#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {54079#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:35,456 INFO L273 TraceCheckUtils]: 120: Hoare triple {54079#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54079#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:35,457 INFO L273 TraceCheckUtils]: 121: Hoare triple {54079#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54079#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:35,457 INFO L273 TraceCheckUtils]: 122: Hoare triple {54079#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {54080#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:35,458 INFO L273 TraceCheckUtils]: 123: Hoare triple {54080#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54080#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:35,458 INFO L273 TraceCheckUtils]: 124: Hoare triple {54080#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54080#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:35,459 INFO L273 TraceCheckUtils]: 125: Hoare triple {54080#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {54081#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:35,460 INFO L273 TraceCheckUtils]: 126: Hoare triple {54081#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54081#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:35,460 INFO L273 TraceCheckUtils]: 127: Hoare triple {54081#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54081#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:35,461 INFO L273 TraceCheckUtils]: 128: Hoare triple {54081#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {54082#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:35,461 INFO L273 TraceCheckUtils]: 129: Hoare triple {54082#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54082#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:35,462 INFO L273 TraceCheckUtils]: 130: Hoare triple {54082#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54082#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:35,462 INFO L273 TraceCheckUtils]: 131: Hoare triple {54082#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {54083#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:35,463 INFO L273 TraceCheckUtils]: 132: Hoare triple {54083#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54083#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:35,463 INFO L273 TraceCheckUtils]: 133: Hoare triple {54083#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54083#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:35,464 INFO L273 TraceCheckUtils]: 134: Hoare triple {54083#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {54084#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:35,464 INFO L273 TraceCheckUtils]: 135: Hoare triple {54084#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54084#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:35,465 INFO L273 TraceCheckUtils]: 136: Hoare triple {54084#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54084#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:35,465 INFO L273 TraceCheckUtils]: 137: Hoare triple {54084#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {54085#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:35,466 INFO L273 TraceCheckUtils]: 138: Hoare triple {54085#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54085#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:35,466 INFO L273 TraceCheckUtils]: 139: Hoare triple {54085#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54085#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:35,467 INFO L273 TraceCheckUtils]: 140: Hoare triple {54085#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {54086#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:35,468 INFO L273 TraceCheckUtils]: 141: Hoare triple {54086#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54086#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:35,468 INFO L273 TraceCheckUtils]: 142: Hoare triple {54086#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54086#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:35,469 INFO L273 TraceCheckUtils]: 143: Hoare triple {54086#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {54087#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:35,469 INFO L273 TraceCheckUtils]: 144: Hoare triple {54087#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54087#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:35,470 INFO L273 TraceCheckUtils]: 145: Hoare triple {54087#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54087#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:35,470 INFO L273 TraceCheckUtils]: 146: Hoare triple {54087#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {54088#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:35,471 INFO L273 TraceCheckUtils]: 147: Hoare triple {54088#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54088#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:35,471 INFO L273 TraceCheckUtils]: 148: Hoare triple {54088#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54088#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:35,472 INFO L273 TraceCheckUtils]: 149: Hoare triple {54088#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {54089#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:35,472 INFO L273 TraceCheckUtils]: 150: Hoare triple {54089#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54089#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:35,473 INFO L273 TraceCheckUtils]: 151: Hoare triple {54089#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54089#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:35,473 INFO L273 TraceCheckUtils]: 152: Hoare triple {54089#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {54090#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:35,474 INFO L273 TraceCheckUtils]: 153: Hoare triple {54090#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54090#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:35,474 INFO L273 TraceCheckUtils]: 154: Hoare triple {54090#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54090#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:35,475 INFO L273 TraceCheckUtils]: 155: Hoare triple {54090#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {54091#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:35,476 INFO L273 TraceCheckUtils]: 156: Hoare triple {54091#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54091#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:35,476 INFO L273 TraceCheckUtils]: 157: Hoare triple {54091#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54091#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:35,477 INFO L273 TraceCheckUtils]: 158: Hoare triple {54091#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {54092#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:35,477 INFO L273 TraceCheckUtils]: 159: Hoare triple {54092#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54092#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:35,478 INFO L273 TraceCheckUtils]: 160: Hoare triple {54092#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54092#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:35,478 INFO L273 TraceCheckUtils]: 161: Hoare triple {54092#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {54093#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:35,479 INFO L273 TraceCheckUtils]: 162: Hoare triple {54093#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54093#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:35,479 INFO L273 TraceCheckUtils]: 163: Hoare triple {54093#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54093#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:35,480 INFO L273 TraceCheckUtils]: 164: Hoare triple {54093#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {54094#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:35,480 INFO L273 TraceCheckUtils]: 165: Hoare triple {54094#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54094#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:35,481 INFO L273 TraceCheckUtils]: 166: Hoare triple {54094#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54094#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:35,481 INFO L273 TraceCheckUtils]: 167: Hoare triple {54094#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {54095#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:35,482 INFO L273 TraceCheckUtils]: 168: Hoare triple {54095#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54095#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:35,482 INFO L273 TraceCheckUtils]: 169: Hoare triple {54095#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54095#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:35,483 INFO L273 TraceCheckUtils]: 170: Hoare triple {54095#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {54096#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:35,484 INFO L273 TraceCheckUtils]: 171: Hoare triple {54096#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54096#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:35,484 INFO L273 TraceCheckUtils]: 172: Hoare triple {54096#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54096#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:35,485 INFO L273 TraceCheckUtils]: 173: Hoare triple {54096#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {54097#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:35,485 INFO L273 TraceCheckUtils]: 174: Hoare triple {54097#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54097#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:35,486 INFO L273 TraceCheckUtils]: 175: Hoare triple {54097#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54097#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:35,486 INFO L273 TraceCheckUtils]: 176: Hoare triple {54097#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {54098#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:35,487 INFO L273 TraceCheckUtils]: 177: Hoare triple {54098#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54098#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:35,487 INFO L273 TraceCheckUtils]: 178: Hoare triple {54098#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54098#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:35,488 INFO L273 TraceCheckUtils]: 179: Hoare triple {54098#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {54099#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:35,488 INFO L273 TraceCheckUtils]: 180: Hoare triple {54099#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54099#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:35,489 INFO L273 TraceCheckUtils]: 181: Hoare triple {54099#(<= main_~i~0 58)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54099#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:35,490 INFO L273 TraceCheckUtils]: 182: Hoare triple {54099#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {54100#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:35,490 INFO L273 TraceCheckUtils]: 183: Hoare triple {54100#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54100#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:35,491 INFO L273 TraceCheckUtils]: 184: Hoare triple {54100#(<= main_~i~0 59)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54100#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:35,491 INFO L273 TraceCheckUtils]: 185: Hoare triple {54100#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {54101#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:35,492 INFO L273 TraceCheckUtils]: 186: Hoare triple {54101#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54101#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:35,492 INFO L273 TraceCheckUtils]: 187: Hoare triple {54101#(<= main_~i~0 60)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {54101#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:35,493 INFO L273 TraceCheckUtils]: 188: Hoare triple {54101#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {54102#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:35,494 INFO L273 TraceCheckUtils]: 189: Hoare triple {54102#(<= main_~i~0 61)} assume !(~i~0 < 100000); {54040#false} is VALID [2018-11-23 12:07:35,494 INFO L273 TraceCheckUtils]: 190: Hoare triple {54040#false} havoc ~x~0;~x~0 := 0; {54040#false} is VALID [2018-11-23 12:07:35,494 INFO L273 TraceCheckUtils]: 191: Hoare triple {54040#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {54040#false} is VALID [2018-11-23 12:07:35,494 INFO L256 TraceCheckUtils]: 192: Hoare triple {54040#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {54040#false} is VALID [2018-11-23 12:07:35,494 INFO L273 TraceCheckUtils]: 193: Hoare triple {54040#false} ~cond := #in~cond; {54040#false} is VALID [2018-11-23 12:07:35,495 INFO L273 TraceCheckUtils]: 194: Hoare triple {54040#false} assume 0 == ~cond; {54040#false} is VALID [2018-11-23 12:07:35,495 INFO L273 TraceCheckUtils]: 195: Hoare triple {54040#false} assume !false; {54040#false} is VALID [2018-11-23 12:07:35,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:35,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:35,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2018-11-23 12:07:35,537 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 196 [2018-11-23 12:07:35,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:35,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states. [2018-11-23 12:07:35,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:35,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-23 12:07:35,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-23 12:07:35,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-23 12:07:35,724 INFO L87 Difference]: Start difference. First operand 201 states and 263 transitions. Second operand 65 states. [2018-11-23 12:07:37,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:37,094 INFO L93 Difference]: Finished difference Result 217 states and 282 transitions. [2018-11-23 12:07:37,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-23 12:07:37,094 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 196 [2018-11-23 12:07:37,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:07:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 282 transitions. [2018-11-23 12:07:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:07:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 282 transitions. [2018-11-23 12:07:37,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 282 transitions. [2018-11-23 12:07:37,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:37,366 INFO L225 Difference]: With dead ends: 217 [2018-11-23 12:07:37,366 INFO L226 Difference]: Without dead ends: 206 [2018-11-23 12:07:37,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-23 12:07:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-23 12:07:37,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-11-23 12:07:37,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:37,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 204 states. [2018-11-23 12:07:37,429 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 204 states. [2018-11-23 12:07:37,429 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 204 states. [2018-11-23 12:07:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:37,433 INFO L93 Difference]: Finished difference Result 206 states and 270 transitions. [2018-11-23 12:07:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 270 transitions. [2018-11-23 12:07:37,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:37,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:37,433 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 206 states. [2018-11-23 12:07:37,433 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 206 states. [2018-11-23 12:07:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:37,436 INFO L93 Difference]: Finished difference Result 206 states and 270 transitions. [2018-11-23 12:07:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 270 transitions. [2018-11-23 12:07:37,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:37,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:37,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:37,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:37,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-23 12:07:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 267 transitions. [2018-11-23 12:07:37,439 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 267 transitions. Word has length 196 [2018-11-23 12:07:37,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:37,440 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 267 transitions. [2018-11-23 12:07:37,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-23 12:07:37,440 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 267 transitions. [2018-11-23 12:07:37,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-23 12:07:37,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:37,441 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:37,441 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:37,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:37,441 INFO L82 PathProgramCache]: Analyzing trace with hash -887399175, now seen corresponding path program 62 times [2018-11-23 12:07:37,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:37,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:37,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:37,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:37,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:39,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {55667#true} call ULTIMATE.init(); {55667#true} is VALID [2018-11-23 12:07:39,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {55667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {55667#true} is VALID [2018-11-23 12:07:39,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {55667#true} assume true; {55667#true} is VALID [2018-11-23 12:07:39,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {55667#true} {55667#true} #55#return; {55667#true} is VALID [2018-11-23 12:07:39,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {55667#true} call #t~ret4 := main(); {55667#true} is VALID [2018-11-23 12:07:39,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {55667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {55669#(= main_~i~0 0)} is VALID [2018-11-23 12:07:39,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {55669#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55669#(= main_~i~0 0)} is VALID [2018-11-23 12:07:39,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {55669#(= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55669#(= main_~i~0 0)} is VALID [2018-11-23 12:07:39,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {55669#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {55670#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:39,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {55670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55670#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:39,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {55670#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55670#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:39,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {55670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {55671#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:39,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {55671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55671#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:39,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {55671#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55671#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:39,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {55671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {55672#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:39,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {55672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55672#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:39,270 INFO L273 TraceCheckUtils]: 16: Hoare triple {55672#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55672#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:39,270 INFO L273 TraceCheckUtils]: 17: Hoare triple {55672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {55673#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:39,271 INFO L273 TraceCheckUtils]: 18: Hoare triple {55673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55673#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:39,271 INFO L273 TraceCheckUtils]: 19: Hoare triple {55673#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55673#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:39,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {55673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {55674#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:39,273 INFO L273 TraceCheckUtils]: 21: Hoare triple {55674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55674#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:39,273 INFO L273 TraceCheckUtils]: 22: Hoare triple {55674#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55674#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:39,274 INFO L273 TraceCheckUtils]: 23: Hoare triple {55674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {55675#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:39,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {55675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55675#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:39,275 INFO L273 TraceCheckUtils]: 25: Hoare triple {55675#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55675#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:39,275 INFO L273 TraceCheckUtils]: 26: Hoare triple {55675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {55676#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:39,276 INFO L273 TraceCheckUtils]: 27: Hoare triple {55676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55676#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:39,276 INFO L273 TraceCheckUtils]: 28: Hoare triple {55676#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55676#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:39,277 INFO L273 TraceCheckUtils]: 29: Hoare triple {55676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {55677#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:39,278 INFO L273 TraceCheckUtils]: 30: Hoare triple {55677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55677#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:39,278 INFO L273 TraceCheckUtils]: 31: Hoare triple {55677#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55677#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:39,279 INFO L273 TraceCheckUtils]: 32: Hoare triple {55677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {55678#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:39,279 INFO L273 TraceCheckUtils]: 33: Hoare triple {55678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55678#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:39,280 INFO L273 TraceCheckUtils]: 34: Hoare triple {55678#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55678#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:39,281 INFO L273 TraceCheckUtils]: 35: Hoare triple {55678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {55679#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:39,281 INFO L273 TraceCheckUtils]: 36: Hoare triple {55679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55679#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:39,282 INFO L273 TraceCheckUtils]: 37: Hoare triple {55679#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55679#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:39,282 INFO L273 TraceCheckUtils]: 38: Hoare triple {55679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {55680#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:39,283 INFO L273 TraceCheckUtils]: 39: Hoare triple {55680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55680#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:39,283 INFO L273 TraceCheckUtils]: 40: Hoare triple {55680#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55680#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:39,284 INFO L273 TraceCheckUtils]: 41: Hoare triple {55680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {55681#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:39,284 INFO L273 TraceCheckUtils]: 42: Hoare triple {55681#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55681#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:39,285 INFO L273 TraceCheckUtils]: 43: Hoare triple {55681#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55681#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:39,286 INFO L273 TraceCheckUtils]: 44: Hoare triple {55681#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {55682#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:39,286 INFO L273 TraceCheckUtils]: 45: Hoare triple {55682#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55682#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:39,287 INFO L273 TraceCheckUtils]: 46: Hoare triple {55682#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55682#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:39,287 INFO L273 TraceCheckUtils]: 47: Hoare triple {55682#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {55683#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:39,288 INFO L273 TraceCheckUtils]: 48: Hoare triple {55683#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55683#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:39,288 INFO L273 TraceCheckUtils]: 49: Hoare triple {55683#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55683#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:39,289 INFO L273 TraceCheckUtils]: 50: Hoare triple {55683#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {55684#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:39,290 INFO L273 TraceCheckUtils]: 51: Hoare triple {55684#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55684#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:39,290 INFO L273 TraceCheckUtils]: 52: Hoare triple {55684#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55684#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:39,291 INFO L273 TraceCheckUtils]: 53: Hoare triple {55684#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {55685#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:39,291 INFO L273 TraceCheckUtils]: 54: Hoare triple {55685#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55685#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:39,292 INFO L273 TraceCheckUtils]: 55: Hoare triple {55685#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55685#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:39,292 INFO L273 TraceCheckUtils]: 56: Hoare triple {55685#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {55686#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:39,293 INFO L273 TraceCheckUtils]: 57: Hoare triple {55686#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55686#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:39,293 INFO L273 TraceCheckUtils]: 58: Hoare triple {55686#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55686#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:39,294 INFO L273 TraceCheckUtils]: 59: Hoare triple {55686#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {55687#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:39,295 INFO L273 TraceCheckUtils]: 60: Hoare triple {55687#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55687#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:39,295 INFO L273 TraceCheckUtils]: 61: Hoare triple {55687#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55687#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:39,296 INFO L273 TraceCheckUtils]: 62: Hoare triple {55687#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {55688#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:39,296 INFO L273 TraceCheckUtils]: 63: Hoare triple {55688#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55688#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:39,297 INFO L273 TraceCheckUtils]: 64: Hoare triple {55688#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55688#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:39,297 INFO L273 TraceCheckUtils]: 65: Hoare triple {55688#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {55689#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:39,298 INFO L273 TraceCheckUtils]: 66: Hoare triple {55689#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55689#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:39,298 INFO L273 TraceCheckUtils]: 67: Hoare triple {55689#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55689#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:39,299 INFO L273 TraceCheckUtils]: 68: Hoare triple {55689#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {55690#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:39,300 INFO L273 TraceCheckUtils]: 69: Hoare triple {55690#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55690#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:39,300 INFO L273 TraceCheckUtils]: 70: Hoare triple {55690#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55690#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:39,301 INFO L273 TraceCheckUtils]: 71: Hoare triple {55690#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {55691#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:39,301 INFO L273 TraceCheckUtils]: 72: Hoare triple {55691#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55691#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:39,302 INFO L273 TraceCheckUtils]: 73: Hoare triple {55691#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55691#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:39,303 INFO L273 TraceCheckUtils]: 74: Hoare triple {55691#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {55692#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:39,303 INFO L273 TraceCheckUtils]: 75: Hoare triple {55692#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55692#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:39,304 INFO L273 TraceCheckUtils]: 76: Hoare triple {55692#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55692#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:39,304 INFO L273 TraceCheckUtils]: 77: Hoare triple {55692#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {55693#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:39,305 INFO L273 TraceCheckUtils]: 78: Hoare triple {55693#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55693#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:39,305 INFO L273 TraceCheckUtils]: 79: Hoare triple {55693#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55693#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:39,306 INFO L273 TraceCheckUtils]: 80: Hoare triple {55693#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {55694#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:39,307 INFO L273 TraceCheckUtils]: 81: Hoare triple {55694#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55694#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:39,307 INFO L273 TraceCheckUtils]: 82: Hoare triple {55694#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55694#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:39,308 INFO L273 TraceCheckUtils]: 83: Hoare triple {55694#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {55695#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:39,308 INFO L273 TraceCheckUtils]: 84: Hoare triple {55695#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55695#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:39,309 INFO L273 TraceCheckUtils]: 85: Hoare triple {55695#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55695#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:39,309 INFO L273 TraceCheckUtils]: 86: Hoare triple {55695#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {55696#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:39,310 INFO L273 TraceCheckUtils]: 87: Hoare triple {55696#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55696#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:39,310 INFO L273 TraceCheckUtils]: 88: Hoare triple {55696#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55696#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:39,311 INFO L273 TraceCheckUtils]: 89: Hoare triple {55696#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {55697#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:39,312 INFO L273 TraceCheckUtils]: 90: Hoare triple {55697#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55697#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:39,312 INFO L273 TraceCheckUtils]: 91: Hoare triple {55697#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55697#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:39,313 INFO L273 TraceCheckUtils]: 92: Hoare triple {55697#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {55698#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:39,313 INFO L273 TraceCheckUtils]: 93: Hoare triple {55698#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55698#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:39,314 INFO L273 TraceCheckUtils]: 94: Hoare triple {55698#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55698#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:39,314 INFO L273 TraceCheckUtils]: 95: Hoare triple {55698#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {55699#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:39,315 INFO L273 TraceCheckUtils]: 96: Hoare triple {55699#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55699#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:39,315 INFO L273 TraceCheckUtils]: 97: Hoare triple {55699#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55699#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:39,316 INFO L273 TraceCheckUtils]: 98: Hoare triple {55699#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {55700#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:39,317 INFO L273 TraceCheckUtils]: 99: Hoare triple {55700#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55700#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:39,317 INFO L273 TraceCheckUtils]: 100: Hoare triple {55700#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55700#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:39,318 INFO L273 TraceCheckUtils]: 101: Hoare triple {55700#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {55701#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:39,318 INFO L273 TraceCheckUtils]: 102: Hoare triple {55701#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55701#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:39,319 INFO L273 TraceCheckUtils]: 103: Hoare triple {55701#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55701#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:39,320 INFO L273 TraceCheckUtils]: 104: Hoare triple {55701#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {55702#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:39,320 INFO L273 TraceCheckUtils]: 105: Hoare triple {55702#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55702#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:39,320 INFO L273 TraceCheckUtils]: 106: Hoare triple {55702#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55702#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:39,321 INFO L273 TraceCheckUtils]: 107: Hoare triple {55702#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {55703#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:39,322 INFO L273 TraceCheckUtils]: 108: Hoare triple {55703#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55703#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:39,322 INFO L273 TraceCheckUtils]: 109: Hoare triple {55703#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55703#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:39,323 INFO L273 TraceCheckUtils]: 110: Hoare triple {55703#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {55704#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:39,323 INFO L273 TraceCheckUtils]: 111: Hoare triple {55704#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55704#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:39,324 INFO L273 TraceCheckUtils]: 112: Hoare triple {55704#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55704#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:39,325 INFO L273 TraceCheckUtils]: 113: Hoare triple {55704#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {55705#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:39,325 INFO L273 TraceCheckUtils]: 114: Hoare triple {55705#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55705#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:39,326 INFO L273 TraceCheckUtils]: 115: Hoare triple {55705#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55705#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:39,326 INFO L273 TraceCheckUtils]: 116: Hoare triple {55705#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {55706#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:39,327 INFO L273 TraceCheckUtils]: 117: Hoare triple {55706#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55706#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:39,327 INFO L273 TraceCheckUtils]: 118: Hoare triple {55706#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55706#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:39,328 INFO L273 TraceCheckUtils]: 119: Hoare triple {55706#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {55707#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:39,328 INFO L273 TraceCheckUtils]: 120: Hoare triple {55707#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55707#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:39,329 INFO L273 TraceCheckUtils]: 121: Hoare triple {55707#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55707#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:39,330 INFO L273 TraceCheckUtils]: 122: Hoare triple {55707#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {55708#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:39,330 INFO L273 TraceCheckUtils]: 123: Hoare triple {55708#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55708#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:39,331 INFO L273 TraceCheckUtils]: 124: Hoare triple {55708#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55708#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:39,331 INFO L273 TraceCheckUtils]: 125: Hoare triple {55708#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {55709#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:39,332 INFO L273 TraceCheckUtils]: 126: Hoare triple {55709#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55709#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:39,332 INFO L273 TraceCheckUtils]: 127: Hoare triple {55709#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55709#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:39,333 INFO L273 TraceCheckUtils]: 128: Hoare triple {55709#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {55710#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:39,334 INFO L273 TraceCheckUtils]: 129: Hoare triple {55710#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55710#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:39,334 INFO L273 TraceCheckUtils]: 130: Hoare triple {55710#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55710#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:39,335 INFO L273 TraceCheckUtils]: 131: Hoare triple {55710#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {55711#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:39,335 INFO L273 TraceCheckUtils]: 132: Hoare triple {55711#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55711#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:39,336 INFO L273 TraceCheckUtils]: 133: Hoare triple {55711#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55711#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:39,336 INFO L273 TraceCheckUtils]: 134: Hoare triple {55711#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {55712#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:39,337 INFO L273 TraceCheckUtils]: 135: Hoare triple {55712#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55712#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:39,337 INFO L273 TraceCheckUtils]: 136: Hoare triple {55712#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55712#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:39,338 INFO L273 TraceCheckUtils]: 137: Hoare triple {55712#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {55713#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:39,339 INFO L273 TraceCheckUtils]: 138: Hoare triple {55713#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55713#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:39,339 INFO L273 TraceCheckUtils]: 139: Hoare triple {55713#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55713#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:39,340 INFO L273 TraceCheckUtils]: 140: Hoare triple {55713#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {55714#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:39,340 INFO L273 TraceCheckUtils]: 141: Hoare triple {55714#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55714#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:39,341 INFO L273 TraceCheckUtils]: 142: Hoare triple {55714#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55714#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:39,342 INFO L273 TraceCheckUtils]: 143: Hoare triple {55714#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {55715#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:39,342 INFO L273 TraceCheckUtils]: 144: Hoare triple {55715#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55715#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:39,343 INFO L273 TraceCheckUtils]: 145: Hoare triple {55715#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55715#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:39,343 INFO L273 TraceCheckUtils]: 146: Hoare triple {55715#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {55716#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:39,344 INFO L273 TraceCheckUtils]: 147: Hoare triple {55716#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55716#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:39,344 INFO L273 TraceCheckUtils]: 148: Hoare triple {55716#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55716#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:39,345 INFO L273 TraceCheckUtils]: 149: Hoare triple {55716#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {55717#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:39,345 INFO L273 TraceCheckUtils]: 150: Hoare triple {55717#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55717#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:39,346 INFO L273 TraceCheckUtils]: 151: Hoare triple {55717#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55717#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:39,347 INFO L273 TraceCheckUtils]: 152: Hoare triple {55717#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {55718#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:39,347 INFO L273 TraceCheckUtils]: 153: Hoare triple {55718#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55718#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:39,348 INFO L273 TraceCheckUtils]: 154: Hoare triple {55718#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55718#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:39,348 INFO L273 TraceCheckUtils]: 155: Hoare triple {55718#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {55719#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:39,349 INFO L273 TraceCheckUtils]: 156: Hoare triple {55719#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55719#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:39,349 INFO L273 TraceCheckUtils]: 157: Hoare triple {55719#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55719#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:39,350 INFO L273 TraceCheckUtils]: 158: Hoare triple {55719#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {55720#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:39,351 INFO L273 TraceCheckUtils]: 159: Hoare triple {55720#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55720#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:39,351 INFO L273 TraceCheckUtils]: 160: Hoare triple {55720#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55720#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:39,352 INFO L273 TraceCheckUtils]: 161: Hoare triple {55720#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {55721#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:39,352 INFO L273 TraceCheckUtils]: 162: Hoare triple {55721#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55721#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:39,353 INFO L273 TraceCheckUtils]: 163: Hoare triple {55721#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55721#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:39,353 INFO L273 TraceCheckUtils]: 164: Hoare triple {55721#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {55722#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:39,354 INFO L273 TraceCheckUtils]: 165: Hoare triple {55722#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55722#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:39,354 INFO L273 TraceCheckUtils]: 166: Hoare triple {55722#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55722#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:39,355 INFO L273 TraceCheckUtils]: 167: Hoare triple {55722#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {55723#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:39,356 INFO L273 TraceCheckUtils]: 168: Hoare triple {55723#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55723#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:39,356 INFO L273 TraceCheckUtils]: 169: Hoare triple {55723#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55723#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:39,357 INFO L273 TraceCheckUtils]: 170: Hoare triple {55723#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {55724#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:39,357 INFO L273 TraceCheckUtils]: 171: Hoare triple {55724#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55724#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:39,358 INFO L273 TraceCheckUtils]: 172: Hoare triple {55724#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55724#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:39,358 INFO L273 TraceCheckUtils]: 173: Hoare triple {55724#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {55725#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:39,359 INFO L273 TraceCheckUtils]: 174: Hoare triple {55725#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55725#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:39,359 INFO L273 TraceCheckUtils]: 175: Hoare triple {55725#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55725#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:39,360 INFO L273 TraceCheckUtils]: 176: Hoare triple {55725#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {55726#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:39,361 INFO L273 TraceCheckUtils]: 177: Hoare triple {55726#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55726#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:39,361 INFO L273 TraceCheckUtils]: 178: Hoare triple {55726#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55726#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:39,362 INFO L273 TraceCheckUtils]: 179: Hoare triple {55726#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {55727#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:39,362 INFO L273 TraceCheckUtils]: 180: Hoare triple {55727#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55727#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:39,363 INFO L273 TraceCheckUtils]: 181: Hoare triple {55727#(<= main_~i~0 58)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55727#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:39,364 INFO L273 TraceCheckUtils]: 182: Hoare triple {55727#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {55728#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:39,364 INFO L273 TraceCheckUtils]: 183: Hoare triple {55728#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55728#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:39,365 INFO L273 TraceCheckUtils]: 184: Hoare triple {55728#(<= main_~i~0 59)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55728#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:39,365 INFO L273 TraceCheckUtils]: 185: Hoare triple {55728#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {55729#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:39,366 INFO L273 TraceCheckUtils]: 186: Hoare triple {55729#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55729#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:39,366 INFO L273 TraceCheckUtils]: 187: Hoare triple {55729#(<= main_~i~0 60)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55729#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:39,367 INFO L273 TraceCheckUtils]: 188: Hoare triple {55729#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {55730#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:39,367 INFO L273 TraceCheckUtils]: 189: Hoare triple {55730#(<= main_~i~0 61)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55730#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:39,368 INFO L273 TraceCheckUtils]: 190: Hoare triple {55730#(<= main_~i~0 61)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55730#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:39,369 INFO L273 TraceCheckUtils]: 191: Hoare triple {55730#(<= main_~i~0 61)} ~i~0 := 1 + ~i~0; {55731#(<= main_~i~0 62)} is VALID [2018-11-23 12:07:39,369 INFO L273 TraceCheckUtils]: 192: Hoare triple {55731#(<= main_~i~0 62)} assume !(~i~0 < 100000); {55668#false} is VALID [2018-11-23 12:07:39,370 INFO L273 TraceCheckUtils]: 193: Hoare triple {55668#false} havoc ~x~0;~x~0 := 0; {55668#false} is VALID [2018-11-23 12:07:39,370 INFO L273 TraceCheckUtils]: 194: Hoare triple {55668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {55668#false} is VALID [2018-11-23 12:07:39,370 INFO L256 TraceCheckUtils]: 195: Hoare triple {55668#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {55668#false} is VALID [2018-11-23 12:07:39,370 INFO L273 TraceCheckUtils]: 196: Hoare triple {55668#false} ~cond := #in~cond; {55668#false} is VALID [2018-11-23 12:07:39,370 INFO L273 TraceCheckUtils]: 197: Hoare triple {55668#false} assume 0 == ~cond; {55668#false} is VALID [2018-11-23 12:07:39,370 INFO L273 TraceCheckUtils]: 198: Hoare triple {55668#false} assume !false; {55668#false} is VALID [2018-11-23 12:07:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:39,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:39,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:39,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:07:39,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:07:39,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:39,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:40,100 INFO L256 TraceCheckUtils]: 0: Hoare triple {55667#true} call ULTIMATE.init(); {55667#true} is VALID [2018-11-23 12:07:40,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {55667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {55667#true} is VALID [2018-11-23 12:07:40,100 INFO L273 TraceCheckUtils]: 2: Hoare triple {55667#true} assume true; {55667#true} is VALID [2018-11-23 12:07:40,100 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {55667#true} {55667#true} #55#return; {55667#true} is VALID [2018-11-23 12:07:40,100 INFO L256 TraceCheckUtils]: 4: Hoare triple {55667#true} call #t~ret4 := main(); {55667#true} is VALID [2018-11-23 12:07:40,102 INFO L273 TraceCheckUtils]: 5: Hoare triple {55667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~max~0 := 0;~i~0 := 0; {55750#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:40,102 INFO L273 TraceCheckUtils]: 6: Hoare triple {55750#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55750#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:40,104 INFO L273 TraceCheckUtils]: 7: Hoare triple {55750#(<= main_~i~0 0)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55750#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:40,104 INFO L273 TraceCheckUtils]: 8: Hoare triple {55750#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {55670#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:40,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {55670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55670#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:40,105 INFO L273 TraceCheckUtils]: 10: Hoare triple {55670#(<= main_~i~0 1)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55670#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:40,106 INFO L273 TraceCheckUtils]: 11: Hoare triple {55670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {55671#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:40,106 INFO L273 TraceCheckUtils]: 12: Hoare triple {55671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55671#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:40,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {55671#(<= main_~i~0 2)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55671#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:40,113 INFO L273 TraceCheckUtils]: 14: Hoare triple {55671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {55672#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:40,113 INFO L273 TraceCheckUtils]: 15: Hoare triple {55672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55672#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:40,115 INFO L273 TraceCheckUtils]: 16: Hoare triple {55672#(<= main_~i~0 3)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55672#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:40,115 INFO L273 TraceCheckUtils]: 17: Hoare triple {55672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {55673#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:40,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {55673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55673#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:40,117 INFO L273 TraceCheckUtils]: 19: Hoare triple {55673#(<= main_~i~0 4)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55673#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:40,119 INFO L273 TraceCheckUtils]: 20: Hoare triple {55673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {55674#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:40,119 INFO L273 TraceCheckUtils]: 21: Hoare triple {55674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55674#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:40,122 INFO L273 TraceCheckUtils]: 22: Hoare triple {55674#(<= main_~i~0 5)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55674#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:40,122 INFO L273 TraceCheckUtils]: 23: Hoare triple {55674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {55675#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:40,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {55675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55675#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:40,124 INFO L273 TraceCheckUtils]: 25: Hoare triple {55675#(<= main_~i~0 6)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55675#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:40,126 INFO L273 TraceCheckUtils]: 26: Hoare triple {55675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {55676#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:40,126 INFO L273 TraceCheckUtils]: 27: Hoare triple {55676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55676#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:40,128 INFO L273 TraceCheckUtils]: 28: Hoare triple {55676#(<= main_~i~0 7)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55676#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:40,128 INFO L273 TraceCheckUtils]: 29: Hoare triple {55676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {55677#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:40,130 INFO L273 TraceCheckUtils]: 30: Hoare triple {55677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55677#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:40,130 INFO L273 TraceCheckUtils]: 31: Hoare triple {55677#(<= main_~i~0 8)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55677#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:40,132 INFO L273 TraceCheckUtils]: 32: Hoare triple {55677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {55678#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:40,132 INFO L273 TraceCheckUtils]: 33: Hoare triple {55678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55678#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:40,134 INFO L273 TraceCheckUtils]: 34: Hoare triple {55678#(<= main_~i~0 9)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55678#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:40,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {55678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {55679#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:40,134 INFO L273 TraceCheckUtils]: 36: Hoare triple {55679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55679#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:40,135 INFO L273 TraceCheckUtils]: 37: Hoare triple {55679#(<= main_~i~0 10)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55679#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:40,136 INFO L273 TraceCheckUtils]: 38: Hoare triple {55679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {55680#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:40,136 INFO L273 TraceCheckUtils]: 39: Hoare triple {55680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55680#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:40,138 INFO L273 TraceCheckUtils]: 40: Hoare triple {55680#(<= main_~i~0 11)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55680#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:40,138 INFO L273 TraceCheckUtils]: 41: Hoare triple {55680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {55681#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:40,140 INFO L273 TraceCheckUtils]: 42: Hoare triple {55681#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55681#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:40,140 INFO L273 TraceCheckUtils]: 43: Hoare triple {55681#(<= main_~i~0 12)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55681#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:40,142 INFO L273 TraceCheckUtils]: 44: Hoare triple {55681#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {55682#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:40,142 INFO L273 TraceCheckUtils]: 45: Hoare triple {55682#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55682#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:40,143 INFO L273 TraceCheckUtils]: 46: Hoare triple {55682#(<= main_~i~0 13)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55682#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:40,143 INFO L273 TraceCheckUtils]: 47: Hoare triple {55682#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {55683#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:40,144 INFO L273 TraceCheckUtils]: 48: Hoare triple {55683#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55683#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:40,144 INFO L273 TraceCheckUtils]: 49: Hoare triple {55683#(<= main_~i~0 14)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55683#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:40,145 INFO L273 TraceCheckUtils]: 50: Hoare triple {55683#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {55684#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:40,145 INFO L273 TraceCheckUtils]: 51: Hoare triple {55684#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55684#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:40,147 INFO L273 TraceCheckUtils]: 52: Hoare triple {55684#(<= main_~i~0 15)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55684#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:40,147 INFO L273 TraceCheckUtils]: 53: Hoare triple {55684#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {55685#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:40,148 INFO L273 TraceCheckUtils]: 54: Hoare triple {55685#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55685#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:40,148 INFO L273 TraceCheckUtils]: 55: Hoare triple {55685#(<= main_~i~0 16)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55685#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:40,149 INFO L273 TraceCheckUtils]: 56: Hoare triple {55685#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {55686#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:40,150 INFO L273 TraceCheckUtils]: 57: Hoare triple {55686#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55686#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:40,154 INFO L273 TraceCheckUtils]: 58: Hoare triple {55686#(<= main_~i~0 17)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55686#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:40,154 INFO L273 TraceCheckUtils]: 59: Hoare triple {55686#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {55687#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:40,156 INFO L273 TraceCheckUtils]: 60: Hoare triple {55687#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55687#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:40,156 INFO L273 TraceCheckUtils]: 61: Hoare triple {55687#(<= main_~i~0 18)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55687#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:40,156 INFO L273 TraceCheckUtils]: 62: Hoare triple {55687#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {55688#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:40,157 INFO L273 TraceCheckUtils]: 63: Hoare triple {55688#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55688#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:40,157 INFO L273 TraceCheckUtils]: 64: Hoare triple {55688#(<= main_~i~0 19)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55688#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:40,157 INFO L273 TraceCheckUtils]: 65: Hoare triple {55688#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {55689#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:40,159 INFO L273 TraceCheckUtils]: 66: Hoare triple {55689#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55689#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:40,159 INFO L273 TraceCheckUtils]: 67: Hoare triple {55689#(<= main_~i~0 20)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55689#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:40,161 INFO L273 TraceCheckUtils]: 68: Hoare triple {55689#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {55690#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:40,161 INFO L273 TraceCheckUtils]: 69: Hoare triple {55690#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55690#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:40,162 INFO L273 TraceCheckUtils]: 70: Hoare triple {55690#(<= main_~i~0 21)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55690#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:40,162 INFO L273 TraceCheckUtils]: 71: Hoare triple {55690#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {55691#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:40,163 INFO L273 TraceCheckUtils]: 72: Hoare triple {55691#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55691#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:40,163 INFO L273 TraceCheckUtils]: 73: Hoare triple {55691#(<= main_~i~0 22)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55691#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:40,163 INFO L273 TraceCheckUtils]: 74: Hoare triple {55691#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {55692#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:40,164 INFO L273 TraceCheckUtils]: 75: Hoare triple {55692#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55692#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:40,164 INFO L273 TraceCheckUtils]: 76: Hoare triple {55692#(<= main_~i~0 23)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55692#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:40,164 INFO L273 TraceCheckUtils]: 77: Hoare triple {55692#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {55693#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:40,166 INFO L273 TraceCheckUtils]: 78: Hoare triple {55693#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55693#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:40,166 INFO L273 TraceCheckUtils]: 79: Hoare triple {55693#(<= main_~i~0 24)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55693#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:40,167 INFO L273 TraceCheckUtils]: 80: Hoare triple {55693#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {55694#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:40,167 INFO L273 TraceCheckUtils]: 81: Hoare triple {55694#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55694#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:40,169 INFO L273 TraceCheckUtils]: 82: Hoare triple {55694#(<= main_~i~0 25)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55694#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:40,169 INFO L273 TraceCheckUtils]: 83: Hoare triple {55694#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {55695#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:40,171 INFO L273 TraceCheckUtils]: 84: Hoare triple {55695#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55695#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:40,171 INFO L273 TraceCheckUtils]: 85: Hoare triple {55695#(<= main_~i~0 26)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55695#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:40,173 INFO L273 TraceCheckUtils]: 86: Hoare triple {55695#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {55696#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:40,173 INFO L273 TraceCheckUtils]: 87: Hoare triple {55696#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55696#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:40,175 INFO L273 TraceCheckUtils]: 88: Hoare triple {55696#(<= main_~i~0 27)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55696#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:40,175 INFO L273 TraceCheckUtils]: 89: Hoare triple {55696#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {55697#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:40,178 INFO L273 TraceCheckUtils]: 90: Hoare triple {55697#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55697#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:40,178 INFO L273 TraceCheckUtils]: 91: Hoare triple {55697#(<= main_~i~0 28)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55697#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:40,181 INFO L273 TraceCheckUtils]: 92: Hoare triple {55697#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {55698#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:40,181 INFO L273 TraceCheckUtils]: 93: Hoare triple {55698#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55698#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:40,183 INFO L273 TraceCheckUtils]: 94: Hoare triple {55698#(<= main_~i~0 29)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55698#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:40,183 INFO L273 TraceCheckUtils]: 95: Hoare triple {55698#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {55699#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:40,186 INFO L273 TraceCheckUtils]: 96: Hoare triple {55699#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55699#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:40,186 INFO L273 TraceCheckUtils]: 97: Hoare triple {55699#(<= main_~i~0 30)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55699#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:40,189 INFO L273 TraceCheckUtils]: 98: Hoare triple {55699#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {55700#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:40,189 INFO L273 TraceCheckUtils]: 99: Hoare triple {55700#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55700#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:40,191 INFO L273 TraceCheckUtils]: 100: Hoare triple {55700#(<= main_~i~0 31)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55700#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:40,191 INFO L273 TraceCheckUtils]: 101: Hoare triple {55700#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {55701#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:40,193 INFO L273 TraceCheckUtils]: 102: Hoare triple {55701#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55701#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:40,193 INFO L273 TraceCheckUtils]: 103: Hoare triple {55701#(<= main_~i~0 32)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55701#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:40,196 INFO L273 TraceCheckUtils]: 104: Hoare triple {55701#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {55702#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:40,196 INFO L273 TraceCheckUtils]: 105: Hoare triple {55702#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55702#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:40,198 INFO L273 TraceCheckUtils]: 106: Hoare triple {55702#(<= main_~i~0 33)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55702#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:40,198 INFO L273 TraceCheckUtils]: 107: Hoare triple {55702#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {55703#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:40,201 INFO L273 TraceCheckUtils]: 108: Hoare triple {55703#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55703#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:40,201 INFO L273 TraceCheckUtils]: 109: Hoare triple {55703#(<= main_~i~0 34)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55703#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:40,203 INFO L273 TraceCheckUtils]: 110: Hoare triple {55703#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {55704#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:40,203 INFO L273 TraceCheckUtils]: 111: Hoare triple {55704#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55704#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:40,205 INFO L273 TraceCheckUtils]: 112: Hoare triple {55704#(<= main_~i~0 35)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55704#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:40,205 INFO L273 TraceCheckUtils]: 113: Hoare triple {55704#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {55705#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:40,207 INFO L273 TraceCheckUtils]: 114: Hoare triple {55705#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55705#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:40,207 INFO L273 TraceCheckUtils]: 115: Hoare triple {55705#(<= main_~i~0 36)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55705#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:40,210 INFO L273 TraceCheckUtils]: 116: Hoare triple {55705#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {55706#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:40,210 INFO L273 TraceCheckUtils]: 117: Hoare triple {55706#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55706#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:40,210 INFO L273 TraceCheckUtils]: 118: Hoare triple {55706#(<= main_~i~0 37)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55706#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:40,211 INFO L273 TraceCheckUtils]: 119: Hoare triple {55706#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {55707#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:40,212 INFO L273 TraceCheckUtils]: 120: Hoare triple {55707#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55707#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:40,212 INFO L273 TraceCheckUtils]: 121: Hoare triple {55707#(<= main_~i~0 38)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55707#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:40,212 INFO L273 TraceCheckUtils]: 122: Hoare triple {55707#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {55708#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:40,213 INFO L273 TraceCheckUtils]: 123: Hoare triple {55708#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55708#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:40,213 INFO L273 TraceCheckUtils]: 124: Hoare triple {55708#(<= main_~i~0 39)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55708#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:40,213 INFO L273 TraceCheckUtils]: 125: Hoare triple {55708#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {55709#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:40,214 INFO L273 TraceCheckUtils]: 126: Hoare triple {55709#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55709#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:40,214 INFO L273 TraceCheckUtils]: 127: Hoare triple {55709#(<= main_~i~0 40)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55709#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:40,215 INFO L273 TraceCheckUtils]: 128: Hoare triple {55709#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {55710#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:40,216 INFO L273 TraceCheckUtils]: 129: Hoare triple {55710#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55710#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:40,216 INFO L273 TraceCheckUtils]: 130: Hoare triple {55710#(<= main_~i~0 41)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55710#(<= main_~i~0 41)} is VALID [2018-11-23 12:07:40,217 INFO L273 TraceCheckUtils]: 131: Hoare triple {55710#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {55711#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:40,217 INFO L273 TraceCheckUtils]: 132: Hoare triple {55711#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55711#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:40,218 INFO L273 TraceCheckUtils]: 133: Hoare triple {55711#(<= main_~i~0 42)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55711#(<= main_~i~0 42)} is VALID [2018-11-23 12:07:40,219 INFO L273 TraceCheckUtils]: 134: Hoare triple {55711#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {55712#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:40,219 INFO L273 TraceCheckUtils]: 135: Hoare triple {55712#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55712#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:40,220 INFO L273 TraceCheckUtils]: 136: Hoare triple {55712#(<= main_~i~0 43)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55712#(<= main_~i~0 43)} is VALID [2018-11-23 12:07:40,220 INFO L273 TraceCheckUtils]: 137: Hoare triple {55712#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {55713#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:40,221 INFO L273 TraceCheckUtils]: 138: Hoare triple {55713#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55713#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:40,221 INFO L273 TraceCheckUtils]: 139: Hoare triple {55713#(<= main_~i~0 44)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55713#(<= main_~i~0 44)} is VALID [2018-11-23 12:07:40,222 INFO L273 TraceCheckUtils]: 140: Hoare triple {55713#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {55714#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:40,222 INFO L273 TraceCheckUtils]: 141: Hoare triple {55714#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55714#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:40,223 INFO L273 TraceCheckUtils]: 142: Hoare triple {55714#(<= main_~i~0 45)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55714#(<= main_~i~0 45)} is VALID [2018-11-23 12:07:40,224 INFO L273 TraceCheckUtils]: 143: Hoare triple {55714#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {55715#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:40,224 INFO L273 TraceCheckUtils]: 144: Hoare triple {55715#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55715#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:40,225 INFO L273 TraceCheckUtils]: 145: Hoare triple {55715#(<= main_~i~0 46)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55715#(<= main_~i~0 46)} is VALID [2018-11-23 12:07:40,225 INFO L273 TraceCheckUtils]: 146: Hoare triple {55715#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {55716#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:40,226 INFO L273 TraceCheckUtils]: 147: Hoare triple {55716#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55716#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:40,226 INFO L273 TraceCheckUtils]: 148: Hoare triple {55716#(<= main_~i~0 47)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55716#(<= main_~i~0 47)} is VALID [2018-11-23 12:07:40,227 INFO L273 TraceCheckUtils]: 149: Hoare triple {55716#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {55717#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:40,227 INFO L273 TraceCheckUtils]: 150: Hoare triple {55717#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55717#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:40,228 INFO L273 TraceCheckUtils]: 151: Hoare triple {55717#(<= main_~i~0 48)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55717#(<= main_~i~0 48)} is VALID [2018-11-23 12:07:40,229 INFO L273 TraceCheckUtils]: 152: Hoare triple {55717#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {55718#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:40,229 INFO L273 TraceCheckUtils]: 153: Hoare triple {55718#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55718#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:40,230 INFO L273 TraceCheckUtils]: 154: Hoare triple {55718#(<= main_~i~0 49)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55718#(<= main_~i~0 49)} is VALID [2018-11-23 12:07:40,230 INFO L273 TraceCheckUtils]: 155: Hoare triple {55718#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {55719#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:40,231 INFO L273 TraceCheckUtils]: 156: Hoare triple {55719#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55719#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:40,231 INFO L273 TraceCheckUtils]: 157: Hoare triple {55719#(<= main_~i~0 50)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55719#(<= main_~i~0 50)} is VALID [2018-11-23 12:07:40,232 INFO L273 TraceCheckUtils]: 158: Hoare triple {55719#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {55720#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:40,233 INFO L273 TraceCheckUtils]: 159: Hoare triple {55720#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55720#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:40,233 INFO L273 TraceCheckUtils]: 160: Hoare triple {55720#(<= main_~i~0 51)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55720#(<= main_~i~0 51)} is VALID [2018-11-23 12:07:40,234 INFO L273 TraceCheckUtils]: 161: Hoare triple {55720#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {55721#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:40,234 INFO L273 TraceCheckUtils]: 162: Hoare triple {55721#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55721#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:40,235 INFO L273 TraceCheckUtils]: 163: Hoare triple {55721#(<= main_~i~0 52)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55721#(<= main_~i~0 52)} is VALID [2018-11-23 12:07:40,235 INFO L273 TraceCheckUtils]: 164: Hoare triple {55721#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {55722#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:40,236 INFO L273 TraceCheckUtils]: 165: Hoare triple {55722#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55722#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:40,236 INFO L273 TraceCheckUtils]: 166: Hoare triple {55722#(<= main_~i~0 53)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55722#(<= main_~i~0 53)} is VALID [2018-11-23 12:07:40,237 INFO L273 TraceCheckUtils]: 167: Hoare triple {55722#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {55723#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:40,238 INFO L273 TraceCheckUtils]: 168: Hoare triple {55723#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55723#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:40,238 INFO L273 TraceCheckUtils]: 169: Hoare triple {55723#(<= main_~i~0 54)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55723#(<= main_~i~0 54)} is VALID [2018-11-23 12:07:40,239 INFO L273 TraceCheckUtils]: 170: Hoare triple {55723#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {55724#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:40,239 INFO L273 TraceCheckUtils]: 171: Hoare triple {55724#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55724#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:40,240 INFO L273 TraceCheckUtils]: 172: Hoare triple {55724#(<= main_~i~0 55)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55724#(<= main_~i~0 55)} is VALID [2018-11-23 12:07:40,240 INFO L273 TraceCheckUtils]: 173: Hoare triple {55724#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {55725#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:40,241 INFO L273 TraceCheckUtils]: 174: Hoare triple {55725#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55725#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:40,241 INFO L273 TraceCheckUtils]: 175: Hoare triple {55725#(<= main_~i~0 56)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55725#(<= main_~i~0 56)} is VALID [2018-11-23 12:07:40,242 INFO L273 TraceCheckUtils]: 176: Hoare triple {55725#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {55726#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:40,243 INFO L273 TraceCheckUtils]: 177: Hoare triple {55726#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55726#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:40,243 INFO L273 TraceCheckUtils]: 178: Hoare triple {55726#(<= main_~i~0 57)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55726#(<= main_~i~0 57)} is VALID [2018-11-23 12:07:40,244 INFO L273 TraceCheckUtils]: 179: Hoare triple {55726#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {55727#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:40,244 INFO L273 TraceCheckUtils]: 180: Hoare triple {55727#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55727#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:40,245 INFO L273 TraceCheckUtils]: 181: Hoare triple {55727#(<= main_~i~0 58)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55727#(<= main_~i~0 58)} is VALID [2018-11-23 12:07:40,246 INFO L273 TraceCheckUtils]: 182: Hoare triple {55727#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {55728#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:40,246 INFO L273 TraceCheckUtils]: 183: Hoare triple {55728#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55728#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:40,247 INFO L273 TraceCheckUtils]: 184: Hoare triple {55728#(<= main_~i~0 59)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55728#(<= main_~i~0 59)} is VALID [2018-11-23 12:07:40,247 INFO L273 TraceCheckUtils]: 185: Hoare triple {55728#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {55729#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:40,248 INFO L273 TraceCheckUtils]: 186: Hoare triple {55729#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55729#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:40,248 INFO L273 TraceCheckUtils]: 187: Hoare triple {55729#(<= main_~i~0 60)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55729#(<= main_~i~0 60)} is VALID [2018-11-23 12:07:40,249 INFO L273 TraceCheckUtils]: 188: Hoare triple {55729#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {55730#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:40,249 INFO L273 TraceCheckUtils]: 189: Hoare triple {55730#(<= main_~i~0 61)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55730#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:40,250 INFO L273 TraceCheckUtils]: 190: Hoare triple {55730#(<= main_~i~0 61)} assume #t~mem0 > ~max~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~max~0 := #t~mem1;havoc #t~mem1; {55730#(<= main_~i~0 61)} is VALID [2018-11-23 12:07:40,251 INFO L273 TraceCheckUtils]: 191: Hoare triple {55730#(<= main_~i~0 61)} ~i~0 := 1 + ~i~0; {55731#(<= main_~i~0 62)} is VALID [2018-11-23 12:07:40,251 INFO L273 TraceCheckUtils]: 192: Hoare triple {55731#(<= main_~i~0 62)} assume !(~i~0 < 100000); {55668#false} is VALID [2018-11-23 12:07:40,252 INFO L273 TraceCheckUtils]: 193: Hoare triple {55668#false} havoc ~x~0;~x~0 := 0; {55668#false} is VALID [2018-11-23 12:07:40,252 INFO L273 TraceCheckUtils]: 194: Hoare triple {55668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {55668#false} is VALID [2018-11-23 12:07:40,252 INFO L256 TraceCheckUtils]: 195: Hoare triple {55668#false} call __VERIFIER_assert((if #t~mem3 <= ~max~0 then 1 else 0)); {55668#false} is VALID [2018-11-23 12:07:40,252 INFO L273 TraceCheckUtils]: 196: Hoare triple {55668#false} ~cond := #in~cond; {55668#false} is VALID [2018-11-23 12:07:40,252 INFO L273 TraceCheckUtils]: 197: Hoare triple {55668#false} assume 0 == ~cond; {55668#false} is VALID [2018-11-23 12:07:40,252 INFO L273 TraceCheckUtils]: 198: Hoare triple {55668#false} assume !false; {55668#false} is VALID [2018-11-23 12:07:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:40,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:40,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2018-11-23 12:07:40,296 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 199 [2018-11-23 12:07:40,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:40,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states. [2018-11-23 12:07:40,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:40,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-23 12:07:40,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-23 12:07:40,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 12:07:40,496 INFO L87 Difference]: Start difference. First operand 204 states and 267 transitions. Second operand 66 states. [2018-11-23 12:07:41,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:41,765 INFO L93 Difference]: Finished difference Result 220 states and 286 transitions. [2018-11-23 12:07:41,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-23 12:07:41,765 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 199 [2018-11-23 12:07:41,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:41,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:07:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 286 transitions. [2018-11-23 12:07:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:07:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 286 transitions. [2018-11-23 12:07:41,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 286 transitions. [2018-11-23 12:07:42,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:42,040 INFO L225 Difference]: With dead ends: 220 [2018-11-23 12:07:42,040 INFO L226 Difference]: Without dead ends: 209 [2018-11-23 12:07:42,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 12:07:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-23 12:07:42,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-11-23 12:07:42,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:42,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 207 states. [2018-11-23 12:07:42,096 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 207 states. [2018-11-23 12:07:42,097 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 207 states. [2018-11-23 12:07:42,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:42,100 INFO L93 Difference]: Finished difference Result 209 states and 274 transitions. [2018-11-23 12:07:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 274 transitions. [2018-11-23 12:07:42,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:42,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:42,101 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 209 states. [2018-11-23 12:07:42,101 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 209 states. [2018-11-23 12:07:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:42,104 INFO L93 Difference]: Finished difference Result 209 states and 274 transitions. [2018-11-23 12:07:42,104 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 274 transitions. [2018-11-23 12:07:42,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:42,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:42,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:42,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-23 12:07:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 271 transitions. [2018-11-23 12:07:42,108 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 271 transitions. Word has length 199 [2018-11-23 12:07:42,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:42,108 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 271 transitions. [2018-11-23 12:07:42,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-23 12:07:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 271 transitions. [2018-11-23 12:07:42,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-23 12:07:42,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:42,110 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:42,110 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:42,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:42,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1939749725, now seen corresponding path program 63 times [2018-11-23 12:07:42,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:42,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:42,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:42,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:42,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat