java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-crafted/bAnd3_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:54:26,161 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:54:26,163 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:54:26,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:54:26,175 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:54:26,176 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:54:26,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:54:26,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:54:26,181 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:54:26,182 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:54:26,183 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:54:26,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:54:26,184 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:54:26,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:54:26,186 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:54:26,187 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:54:26,188 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:54:26,190 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:54:26,192 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:54:26,194 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:54:26,195 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:54:26,196 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:54:26,199 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:54:26,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:54:26,199 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:54:26,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:54:26,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:54:26,202 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:54:26,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:54:26,204 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:54:26,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:54:26,205 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:54:26,205 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:54:26,206 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:54:26,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:54:26,207 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:54:26,208 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:54:26,224 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:54:26,224 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:54:26,225 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:54:26,225 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:54:26,226 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:54:26,226 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:54:26,226 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:54:26,227 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:54:26,227 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:54:26,227 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:54:26,227 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:54:26,227 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:54:26,228 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:54:26,228 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:54:26,228 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:54:26,228 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:54:26,228 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:54:26,229 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:54:26,229 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:54:26,229 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:54:26,229 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:54:26,229 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:54:26,230 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:54:26,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:54:26,230 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:54:26,230 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:54:26,230 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:54:26,231 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:54:26,231 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:54:26,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:54:26,231 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:54:26,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:54:26,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:54:26,312 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:54:26,314 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:54:26,314 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:54:26,315 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bAnd3_true-unreach-call.i [2018-11-14 18:54:26,382 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4ead038/9228ac561cd34efaba6118e4e8299ed5/FLAGd526182f0 [2018-11-14 18:54:26,793 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:54:26,794 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd3_true-unreach-call.i [2018-11-14 18:54:26,801 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4ead038/9228ac561cd34efaba6118e4e8299ed5/FLAGd526182f0 [2018-11-14 18:54:26,815 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4ead038/9228ac561cd34efaba6118e4e8299ed5 [2018-11-14 18:54:26,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:54:26,827 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:54:26,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:54:26,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:54:26,832 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:54:26,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:54:26" (1/1) ... [2018-11-14 18:54:26,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6482312d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:26, skipping insertion in model container [2018-11-14 18:54:26,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:54:26" (1/1) ... [2018-11-14 18:54:26,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:54:26,877 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:54:27,130 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:54:27,154 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:54:27,193 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:54:27,219 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:54:27,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:27 WrapperNode [2018-11-14 18:54:27,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:54:27,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:54:27,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:54:27,221 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:54:27,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:27" (1/1) ... [2018-11-14 18:54:27,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:27" (1/1) ... [2018-11-14 18:54:27,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:27" (1/1) ... [2018-11-14 18:54:27,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:27" (1/1) ... [2018-11-14 18:54:27,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:27" (1/1) ... [2018-11-14 18:54:27,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:27" (1/1) ... [2018-11-14 18:54:27,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:27" (1/1) ... [2018-11-14 18:54:27,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:54:27,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:54:27,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:54:27,298 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:54:27,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:54:27,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:54:27,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:54:27,430 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2018-11-14 18:54:27,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:54:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:54:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:54:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2018-11-14 18:54:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:54:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:54:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:54:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:54:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:54:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:54:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:54:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:54:28,176 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:54:28,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:54:28 BoogieIcfgContainer [2018-11-14 18:54:28,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:54:28,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:54:28,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:54:28,182 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:54:28,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:54:26" (1/3) ... [2018-11-14 18:54:28,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e58516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:54:28, skipping insertion in model container [2018-11-14 18:54:28,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:27" (2/3) ... [2018-11-14 18:54:28,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e58516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:54:28, skipping insertion in model container [2018-11-14 18:54:28,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:54:28" (3/3) ... [2018-11-14 18:54:28,185 INFO L112 eAbstractionObserver]: Analyzing ICFG bAnd3_true-unreach-call.i [2018-11-14 18:54:28,193 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:54:28,201 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:54:28,215 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:54:28,249 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:54:28,250 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:54:28,250 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:54:28,250 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:54:28,250 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:54:28,251 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:54:28,251 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:54:28,251 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:54:28,251 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:54:28,269 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 18:54:28,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:54:28,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:28,278 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:28,280 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:28,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:28,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1401494287, now seen corresponding path program 1 times [2018-11-14 18:54:28,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:28,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:28,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:28,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:28,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:28,510 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 18:54:28,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37#true} is VALID [2018-11-14 18:54:28,515 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 18:54:28,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #69#return; {37#true} is VALID [2018-11-14 18:54:28,516 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret13 := main(); {37#true} is VALID [2018-11-14 18:54:28,516 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {37#true} is VALID [2018-11-14 18:54:28,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 18:54:28,517 INFO L256 TraceCheckUtils]: 7: Hoare triple {38#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 18:54:28,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37#true} is VALID [2018-11-14 18:54:28,518 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 18:54:28,518 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 18:54:28,519 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 18:54:28,519 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#true} {38#false} #73#return; {38#false} is VALID [2018-11-14 18:54:28,519 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {38#false} is VALID [2018-11-14 18:54:28,520 INFO L256 TraceCheckUtils]: 14: Hoare triple {38#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 18:54:28,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37#true} is VALID [2018-11-14 18:54:28,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 18:54:28,521 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 18:54:28,522 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 18:54:28,522 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {37#true} {38#false} #75#return; {38#false} is VALID [2018-11-14 18:54:28,522 INFO L273 TraceCheckUtils]: 20: Hoare triple {38#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {38#false} is VALID [2018-11-14 18:54:28,523 INFO L273 TraceCheckUtils]: 21: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 18:54:28,523 INFO L273 TraceCheckUtils]: 22: Hoare triple {38#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {38#false} is VALID [2018-11-14 18:54:28,523 INFO L256 TraceCheckUtils]: 23: Hoare triple {38#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 18:54:28,524 INFO L273 TraceCheckUtils]: 24: Hoare triple {37#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37#true} is VALID [2018-11-14 18:54:28,524 INFO L273 TraceCheckUtils]: 25: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 18:54:28,524 INFO L273 TraceCheckUtils]: 26: Hoare triple {37#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 18:54:28,525 INFO L273 TraceCheckUtils]: 27: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 18:54:28,525 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {37#true} {38#false} #77#return; {38#false} is VALID [2018-11-14 18:54:28,525 INFO L273 TraceCheckUtils]: 29: Hoare triple {38#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {38#false} is VALID [2018-11-14 18:54:28,526 INFO L273 TraceCheckUtils]: 30: Hoare triple {38#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {38#false} is VALID [2018-11-14 18:54:28,526 INFO L273 TraceCheckUtils]: 31: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 18:54:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 18:54:28,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:54:28,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:54:28,541 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 18:54:28,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:28,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:54:28,814 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:28,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:54:28,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:54:28,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:54:28,830 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 18:54:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:28,960 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-14 18:54:28,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:54:28,960 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 18:54:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:54:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 18:54:28,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:54:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 18:54:28,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-14 18:54:29,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:29,448 INFO L225 Difference]: With dead ends: 59 [2018-11-14 18:54:29,448 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 18:54:29,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:54:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 18:54:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 18:54:29,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:29,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 18:54:29,527 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 18:54:29,527 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 18:54:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:29,533 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 18:54:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 18:54:29,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:29,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:29,535 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 18:54:29,535 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 18:54:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:29,540 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 18:54:29,541 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 18:54:29,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:29,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:29,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:29,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:54:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-14 18:54:29,548 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2018-11-14 18:54:29,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:29,548 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-14 18:54:29,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:54:29,549 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 18:54:29,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 18:54:29,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:29,551 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:29,551 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:29,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:29,552 INFO L82 PathProgramCache]: Analyzing trace with hash -741637549, now seen corresponding path program 1 times [2018-11-14 18:54:29,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:29,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:29,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:29,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:29,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:29,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2018-11-14 18:54:29,714 INFO L273 TraceCheckUtils]: 1: Hoare triple {215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {215#true} is VALID [2018-11-14 18:54:29,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:54:29,714 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #69#return; {215#true} is VALID [2018-11-14 18:54:29,715 INFO L256 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret13 := main(); {215#true} is VALID [2018-11-14 18:54:29,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {215#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {217#(= main_~i~1 0)} is VALID [2018-11-14 18:54:29,717 INFO L273 TraceCheckUtils]: 6: Hoare triple {217#(= main_~i~1 0)} assume true; {217#(= main_~i~1 0)} is VALID [2018-11-14 18:54:29,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {217#(= main_~i~1 0)} assume !(~i~1 < 10000); {216#false} is VALID [2018-11-14 18:54:29,719 INFO L256 TraceCheckUtils]: 8: Hoare triple {216#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 18:54:29,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {215#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {215#true} is VALID [2018-11-14 18:54:29,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:54:29,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {215#true} assume !(~i~0 < 10000); {215#true} is VALID [2018-11-14 18:54:29,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {215#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 18:54:29,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:54:29,720 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {215#true} {216#false} #73#return; {216#false} is VALID [2018-11-14 18:54:29,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {216#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {216#false} is VALID [2018-11-14 18:54:29,721 INFO L256 TraceCheckUtils]: 16: Hoare triple {216#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 18:54:29,721 INFO L273 TraceCheckUtils]: 17: Hoare triple {215#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {215#true} is VALID [2018-11-14 18:54:29,722 INFO L273 TraceCheckUtils]: 18: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:54:29,722 INFO L273 TraceCheckUtils]: 19: Hoare triple {215#true} assume !(~i~0 < 10000); {215#true} is VALID [2018-11-14 18:54:29,722 INFO L273 TraceCheckUtils]: 20: Hoare triple {215#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 18:54:29,723 INFO L273 TraceCheckUtils]: 21: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:54:29,723 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {215#true} {216#false} #75#return; {216#false} is VALID [2018-11-14 18:54:29,723 INFO L273 TraceCheckUtils]: 23: Hoare triple {216#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {216#false} is VALID [2018-11-14 18:54:29,723 INFO L273 TraceCheckUtils]: 24: Hoare triple {216#false} assume true; {216#false} is VALID [2018-11-14 18:54:29,724 INFO L273 TraceCheckUtils]: 25: Hoare triple {216#false} assume !(~i~2 < 9999); {216#false} is VALID [2018-11-14 18:54:29,724 INFO L273 TraceCheckUtils]: 26: Hoare triple {216#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {216#false} is VALID [2018-11-14 18:54:29,724 INFO L256 TraceCheckUtils]: 27: Hoare triple {216#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 18:54:29,725 INFO L273 TraceCheckUtils]: 28: Hoare triple {215#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {215#true} is VALID [2018-11-14 18:54:29,725 INFO L273 TraceCheckUtils]: 29: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:54:29,725 INFO L273 TraceCheckUtils]: 30: Hoare triple {215#true} assume !(~i~0 < 10000); {215#true} is VALID [2018-11-14 18:54:29,726 INFO L273 TraceCheckUtils]: 31: Hoare triple {215#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 18:54:29,726 INFO L273 TraceCheckUtils]: 32: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:54:29,726 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {215#true} {216#false} #77#return; {216#false} is VALID [2018-11-14 18:54:29,727 INFO L273 TraceCheckUtils]: 34: Hoare triple {216#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {216#false} is VALID [2018-11-14 18:54:29,727 INFO L273 TraceCheckUtils]: 35: Hoare triple {216#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {216#false} is VALID [2018-11-14 18:54:29,727 INFO L273 TraceCheckUtils]: 36: Hoare triple {216#false} assume !false; {216#false} is VALID [2018-11-14 18:54:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 18:54:29,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:54:29,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:54:29,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 18:54:29,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:29,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:54:29,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:29,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:54:29,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:54:29,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:54:29,842 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-14 18:54:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:30,371 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-14 18:54:30,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:54:30,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 18:54:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:54:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 18:54:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:54:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 18:54:30,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-14 18:54:30,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:30,549 INFO L225 Difference]: With dead ends: 52 [2018-11-14 18:54:30,549 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 18:54:30,550 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:54:30,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 18:54:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-14 18:54:30,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:30,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-14 18:54:30,575 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-14 18:54:30,575 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-14 18:54:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:30,579 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 18:54:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 18:54:30,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:30,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:30,580 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-14 18:54:30,580 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-14 18:54:30,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:30,584 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 18:54:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 18:54:30,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:30,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:30,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:30,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:54:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 18:54:30,589 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2018-11-14 18:54:30,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:30,589 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 18:54:30,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:54:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 18:54:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 18:54:30,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:30,591 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:30,592 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:30,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:30,592 INFO L82 PathProgramCache]: Analyzing trace with hash 989317657, now seen corresponding path program 1 times [2018-11-14 18:54:30,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:30,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:30,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:30,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:30,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:30,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 18:54:30,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {397#true} is VALID [2018-11-14 18:54:30,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:54:30,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 18:54:30,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret13 := main(); {397#true} is VALID [2018-11-14 18:54:30,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {397#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {397#true} is VALID [2018-11-14 18:54:30,679 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:54:30,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {397#true} is VALID [2018-11-14 18:54:30,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {397#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {397#true} is VALID [2018-11-14 18:54:30,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:54:30,680 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 10000); {397#true} is VALID [2018-11-14 18:54:30,681 INFO L256 TraceCheckUtils]: 11: Hoare triple {397#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 18:54:30,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {399#(= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:30,684 INFO L273 TraceCheckUtils]: 13: Hoare triple {399#(= bAnd_~i~0 1)} assume true; {399#(= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:30,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {399#(= bAnd_~i~0 1)} assume !(~i~0 < 10000); {398#false} is VALID [2018-11-14 18:54:30,689 INFO L273 TraceCheckUtils]: 15: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 18:54:30,689 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:54:30,690 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 18:54:30,690 INFO L273 TraceCheckUtils]: 18: Hoare triple {398#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {398#false} is VALID [2018-11-14 18:54:30,690 INFO L256 TraceCheckUtils]: 19: Hoare triple {398#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 18:54:30,691 INFO L273 TraceCheckUtils]: 20: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {397#true} is VALID [2018-11-14 18:54:30,691 INFO L273 TraceCheckUtils]: 21: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:54:30,691 INFO L273 TraceCheckUtils]: 22: Hoare triple {397#true} assume !(~i~0 < 10000); {397#true} is VALID [2018-11-14 18:54:30,692 INFO L273 TraceCheckUtils]: 23: Hoare triple {397#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {397#true} is VALID [2018-11-14 18:54:30,692 INFO L273 TraceCheckUtils]: 24: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:54:30,692 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {397#true} {398#false} #75#return; {398#false} is VALID [2018-11-14 18:54:30,693 INFO L273 TraceCheckUtils]: 26: Hoare triple {398#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {398#false} is VALID [2018-11-14 18:54:30,693 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:54:30,693 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 9999); {398#false} is VALID [2018-11-14 18:54:30,694 INFO L273 TraceCheckUtils]: 29: Hoare triple {398#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {398#false} is VALID [2018-11-14 18:54:30,694 INFO L256 TraceCheckUtils]: 30: Hoare triple {398#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 18:54:30,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {397#true} is VALID [2018-11-14 18:54:30,695 INFO L273 TraceCheckUtils]: 32: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:54:30,695 INFO L273 TraceCheckUtils]: 33: Hoare triple {397#true} assume !(~i~0 < 10000); {397#true} is VALID [2018-11-14 18:54:30,695 INFO L273 TraceCheckUtils]: 34: Hoare triple {397#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {397#true} is VALID [2018-11-14 18:54:30,696 INFO L273 TraceCheckUtils]: 35: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:54:30,696 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {397#true} {398#false} #77#return; {398#false} is VALID [2018-11-14 18:54:30,696 INFO L273 TraceCheckUtils]: 37: Hoare triple {398#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {398#false} is VALID [2018-11-14 18:54:30,696 INFO L273 TraceCheckUtils]: 38: Hoare triple {398#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {398#false} is VALID [2018-11-14 18:54:30,697 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 18:54:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 18:54:30,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:30,701 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:30,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:30,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:30,936 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 18:54:30,937 INFO L273 TraceCheckUtils]: 1: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {397#true} is VALID [2018-11-14 18:54:30,937 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:54:30,937 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 18:54:30,938 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret13 := main(); {397#true} is VALID [2018-11-14 18:54:30,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {397#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {397#true} is VALID [2018-11-14 18:54:30,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:54:30,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {397#true} is VALID [2018-11-14 18:54:30,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {397#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {397#true} is VALID [2018-11-14 18:54:30,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:54:30,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 10000); {397#true} is VALID [2018-11-14 18:54:30,940 INFO L256 TraceCheckUtils]: 11: Hoare triple {397#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 18:54:30,954 INFO L273 TraceCheckUtils]: 12: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {439#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:30,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {439#(<= bAnd_~i~0 1)} assume true; {439#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:30,957 INFO L273 TraceCheckUtils]: 14: Hoare triple {439#(<= bAnd_~i~0 1)} assume !(~i~0 < 10000); {398#false} is VALID [2018-11-14 18:54:30,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 18:54:30,957 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:54:30,958 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 18:54:30,958 INFO L273 TraceCheckUtils]: 18: Hoare triple {398#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {398#false} is VALID [2018-11-14 18:54:30,958 INFO L256 TraceCheckUtils]: 19: Hoare triple {398#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {398#false} is VALID [2018-11-14 18:54:30,959 INFO L273 TraceCheckUtils]: 20: Hoare triple {398#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {398#false} is VALID [2018-11-14 18:54:30,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:54:30,959 INFO L273 TraceCheckUtils]: 22: Hoare triple {398#false} assume !(~i~0 < 10000); {398#false} is VALID [2018-11-14 18:54:30,959 INFO L273 TraceCheckUtils]: 23: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 18:54:30,960 INFO L273 TraceCheckUtils]: 24: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:54:30,960 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {398#false} {398#false} #75#return; {398#false} is VALID [2018-11-14 18:54:30,960 INFO L273 TraceCheckUtils]: 26: Hoare triple {398#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {398#false} is VALID [2018-11-14 18:54:30,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:54:30,961 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 9999); {398#false} is VALID [2018-11-14 18:54:30,961 INFO L273 TraceCheckUtils]: 29: Hoare triple {398#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {398#false} is VALID [2018-11-14 18:54:30,961 INFO L256 TraceCheckUtils]: 30: Hoare triple {398#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {398#false} is VALID [2018-11-14 18:54:30,962 INFO L273 TraceCheckUtils]: 31: Hoare triple {398#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {398#false} is VALID [2018-11-14 18:54:30,962 INFO L273 TraceCheckUtils]: 32: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:54:30,962 INFO L273 TraceCheckUtils]: 33: Hoare triple {398#false} assume !(~i~0 < 10000); {398#false} is VALID [2018-11-14 18:54:30,963 INFO L273 TraceCheckUtils]: 34: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 18:54:30,963 INFO L273 TraceCheckUtils]: 35: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:54:30,963 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {398#false} {398#false} #77#return; {398#false} is VALID [2018-11-14 18:54:30,963 INFO L273 TraceCheckUtils]: 37: Hoare triple {398#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {398#false} is VALID [2018-11-14 18:54:30,964 INFO L273 TraceCheckUtils]: 38: Hoare triple {398#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {398#false} is VALID [2018-11-14 18:54:30,964 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 18:54:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 18:54:30,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:54:30,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-14 18:54:30,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 18:54:30,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:30,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:54:31,187 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-14 18:54:31,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:54:31,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:54:31,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:54:31,188 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-11-14 18:54:31,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:31,418 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-11-14 18:54:31,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:54:31,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 18:54:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:54:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 18:54:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:54:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 18:54:31,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-14 18:54:31,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:31,571 INFO L225 Difference]: With dead ends: 53 [2018-11-14 18:54:31,571 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 18:54:31,571 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:54:31,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 18:54:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-14 18:54:31,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:31,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-14 18:54:31,585 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-14 18:54:31,585 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-14 18:54:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:31,589 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 18:54:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 18:54:31,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:31,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:31,590 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-14 18:54:31,590 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-14 18:54:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:31,593 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 18:54:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 18:54:31,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:31,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:31,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:31,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:54:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-14 18:54:31,598 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 40 [2018-11-14 18:54:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:31,598 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-14 18:54:31,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:54:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 18:54:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 18:54:31,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:31,600 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:31,601 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:31,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:31,601 INFO L82 PathProgramCache]: Analyzing trace with hash 841579359, now seen corresponding path program 1 times [2018-11-14 18:54:31,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:31,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:31,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:31,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:31,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:31,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {705#true} is VALID [2018-11-14 18:54:31,702 INFO L273 TraceCheckUtils]: 1: Hoare triple {705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {705#true} is VALID [2018-11-14 18:54:31,702 INFO L273 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:54:31,703 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #69#return; {705#true} is VALID [2018-11-14 18:54:31,703 INFO L256 TraceCheckUtils]: 4: Hoare triple {705#true} call #t~ret13 := main(); {705#true} is VALID [2018-11-14 18:54:31,703 INFO L273 TraceCheckUtils]: 5: Hoare triple {705#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {705#true} is VALID [2018-11-14 18:54:31,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:54:31,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {705#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {705#true} is VALID [2018-11-14 18:54:31,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {705#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {705#true} is VALID [2018-11-14 18:54:31,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:54:31,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {705#true} assume !(~i~1 < 10000); {705#true} is VALID [2018-11-14 18:54:31,705 INFO L256 TraceCheckUtils]: 11: Hoare triple {705#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 18:54:31,705 INFO L273 TraceCheckUtils]: 12: Hoare triple {705#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {705#true} is VALID [2018-11-14 18:54:31,705 INFO L273 TraceCheckUtils]: 13: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:54:31,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {705#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {705#true} is VALID [2018-11-14 18:54:31,706 INFO L273 TraceCheckUtils]: 15: Hoare triple {705#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {705#true} is VALID [2018-11-14 18:54:31,706 INFO L273 TraceCheckUtils]: 16: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:54:31,707 INFO L273 TraceCheckUtils]: 17: Hoare triple {705#true} assume !(~i~0 < 10000); {705#true} is VALID [2018-11-14 18:54:31,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {705#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 18:54:31,707 INFO L273 TraceCheckUtils]: 19: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:54:31,707 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {705#true} {705#true} #73#return; {705#true} is VALID [2018-11-14 18:54:31,708 INFO L273 TraceCheckUtils]: 21: Hoare triple {705#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {705#true} is VALID [2018-11-14 18:54:31,708 INFO L256 TraceCheckUtils]: 22: Hoare triple {705#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 18:54:31,708 INFO L273 TraceCheckUtils]: 23: Hoare triple {705#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {705#true} is VALID [2018-11-14 18:54:31,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:54:31,709 INFO L273 TraceCheckUtils]: 25: Hoare triple {705#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {705#true} is VALID [2018-11-14 18:54:31,709 INFO L273 TraceCheckUtils]: 26: Hoare triple {705#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {705#true} is VALID [2018-11-14 18:54:31,709 INFO L273 TraceCheckUtils]: 27: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:54:31,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {705#true} assume !(~i~0 < 10000); {705#true} is VALID [2018-11-14 18:54:31,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {705#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 18:54:31,710 INFO L273 TraceCheckUtils]: 30: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:54:31,711 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {705#true} {705#true} #75#return; {705#true} is VALID [2018-11-14 18:54:31,714 INFO L273 TraceCheckUtils]: 32: Hoare triple {705#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {707#(= main_~i~2 0)} is VALID [2018-11-14 18:54:31,715 INFO L273 TraceCheckUtils]: 33: Hoare triple {707#(= main_~i~2 0)} assume true; {707#(= main_~i~2 0)} is VALID [2018-11-14 18:54:31,715 INFO L273 TraceCheckUtils]: 34: Hoare triple {707#(= main_~i~2 0)} assume !(~i~2 < 9999); {706#false} is VALID [2018-11-14 18:54:31,716 INFO L273 TraceCheckUtils]: 35: Hoare triple {706#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {706#false} is VALID [2018-11-14 18:54:31,716 INFO L256 TraceCheckUtils]: 36: Hoare triple {706#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 18:54:31,716 INFO L273 TraceCheckUtils]: 37: Hoare triple {705#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {705#true} is VALID [2018-11-14 18:54:31,717 INFO L273 TraceCheckUtils]: 38: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:54:31,717 INFO L273 TraceCheckUtils]: 39: Hoare triple {705#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {705#true} is VALID [2018-11-14 18:54:31,717 INFO L273 TraceCheckUtils]: 40: Hoare triple {705#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {705#true} is VALID [2018-11-14 18:54:31,718 INFO L273 TraceCheckUtils]: 41: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:54:31,718 INFO L273 TraceCheckUtils]: 42: Hoare triple {705#true} assume !(~i~0 < 10000); {705#true} is VALID [2018-11-14 18:54:31,718 INFO L273 TraceCheckUtils]: 43: Hoare triple {705#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 18:54:31,719 INFO L273 TraceCheckUtils]: 44: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:54:31,719 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {705#true} {706#false} #77#return; {706#false} is VALID [2018-11-14 18:54:31,719 INFO L273 TraceCheckUtils]: 46: Hoare triple {706#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {706#false} is VALID [2018-11-14 18:54:31,719 INFO L273 TraceCheckUtils]: 47: Hoare triple {706#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {706#false} is VALID [2018-11-14 18:54:31,719 INFO L273 TraceCheckUtils]: 48: Hoare triple {706#false} assume !false; {706#false} is VALID [2018-11-14 18:54:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:54:31,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:54:31,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:54:31,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 18:54:31,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:31,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:54:31,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:31,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:54:31,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:54:31,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:54:31,775 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-14 18:54:31,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:31,867 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 18:54:31,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:54:31,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 18:54:31,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:54:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 18:54:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:54:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 18:54:31,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-14 18:54:31,992 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-14 18:54:31,994 INFO L225 Difference]: With dead ends: 51 [2018-11-14 18:54:31,994 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 18:54:31,995 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:54:31,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 18:54:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-14 18:54:32,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:32,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-14 18:54:32,012 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-14 18:54:32,012 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-14 18:54:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:32,016 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 18:54:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 18:54:32,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:32,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:32,017 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-14 18:54:32,017 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-14 18:54:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:32,020 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 18:54:32,020 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 18:54:32,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:32,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:32,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:32,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:54:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-14 18:54:32,024 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 49 [2018-11-14 18:54:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:32,024 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-14 18:54:32,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:54:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-14 18:54:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 18:54:32,026 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:32,026 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:32,027 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:32,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:32,027 INFO L82 PathProgramCache]: Analyzing trace with hash 611709709, now seen corresponding path program 1 times [2018-11-14 18:54:32,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:32,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:32,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:32,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:32,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:32,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 18:54:32,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {900#true} is VALID [2018-11-14 18:54:32,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:54:32,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 18:54:32,155 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret13 := main(); {900#true} is VALID [2018-11-14 18:54:32,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {902#(= main_~i~1 0)} is VALID [2018-11-14 18:54:32,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {902#(= main_~i~1 0)} assume true; {902#(= main_~i~1 0)} is VALID [2018-11-14 18:54:32,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {902#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {902#(= main_~i~1 0)} is VALID [2018-11-14 18:54:32,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {902#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {903#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:32,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:32,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 10000); {901#false} is VALID [2018-11-14 18:54:32,164 INFO L256 TraceCheckUtils]: 11: Hoare triple {901#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 18:54:32,164 INFO L273 TraceCheckUtils]: 12: Hoare triple {900#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {900#true} is VALID [2018-11-14 18:54:32,164 INFO L273 TraceCheckUtils]: 13: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:54:32,165 INFO L273 TraceCheckUtils]: 14: Hoare triple {900#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {900#true} is VALID [2018-11-14 18:54:32,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {900#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {900#true} is VALID [2018-11-14 18:54:32,165 INFO L273 TraceCheckUtils]: 16: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:54:32,165 INFO L273 TraceCheckUtils]: 17: Hoare triple {900#true} assume !(~i~0 < 10000); {900#true} is VALID [2018-11-14 18:54:32,166 INFO L273 TraceCheckUtils]: 18: Hoare triple {900#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 18:54:32,166 INFO L273 TraceCheckUtils]: 19: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:54:32,166 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {900#true} {901#false} #73#return; {901#false} is VALID [2018-11-14 18:54:32,166 INFO L273 TraceCheckUtils]: 21: Hoare triple {901#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {901#false} is VALID [2018-11-14 18:54:32,167 INFO L256 TraceCheckUtils]: 22: Hoare triple {901#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 18:54:32,167 INFO L273 TraceCheckUtils]: 23: Hoare triple {900#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {900#true} is VALID [2018-11-14 18:54:32,167 INFO L273 TraceCheckUtils]: 24: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:54:32,167 INFO L273 TraceCheckUtils]: 25: Hoare triple {900#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {900#true} is VALID [2018-11-14 18:54:32,168 INFO L273 TraceCheckUtils]: 26: Hoare triple {900#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {900#true} is VALID [2018-11-14 18:54:32,168 INFO L273 TraceCheckUtils]: 27: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:54:32,168 INFO L273 TraceCheckUtils]: 28: Hoare triple {900#true} assume !(~i~0 < 10000); {900#true} is VALID [2018-11-14 18:54:32,169 INFO L273 TraceCheckUtils]: 29: Hoare triple {900#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 18:54:32,169 INFO L273 TraceCheckUtils]: 30: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:54:32,169 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {900#true} {901#false} #75#return; {901#false} is VALID [2018-11-14 18:54:32,170 INFO L273 TraceCheckUtils]: 32: Hoare triple {901#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {901#false} is VALID [2018-11-14 18:54:32,170 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:54:32,170 INFO L273 TraceCheckUtils]: 34: Hoare triple {901#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {901#false} is VALID [2018-11-14 18:54:32,170 INFO L273 TraceCheckUtils]: 35: Hoare triple {901#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {901#false} is VALID [2018-11-14 18:54:32,171 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:54:32,171 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 9999); {901#false} is VALID [2018-11-14 18:54:32,171 INFO L273 TraceCheckUtils]: 38: Hoare triple {901#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {901#false} is VALID [2018-11-14 18:54:32,172 INFO L256 TraceCheckUtils]: 39: Hoare triple {901#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 18:54:32,172 INFO L273 TraceCheckUtils]: 40: Hoare triple {900#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {900#true} is VALID [2018-11-14 18:54:32,172 INFO L273 TraceCheckUtils]: 41: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:54:32,172 INFO L273 TraceCheckUtils]: 42: Hoare triple {900#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {900#true} is VALID [2018-11-14 18:54:32,173 INFO L273 TraceCheckUtils]: 43: Hoare triple {900#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {900#true} is VALID [2018-11-14 18:54:32,173 INFO L273 TraceCheckUtils]: 44: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:54:32,173 INFO L273 TraceCheckUtils]: 45: Hoare triple {900#true} assume !(~i~0 < 10000); {900#true} is VALID [2018-11-14 18:54:32,173 INFO L273 TraceCheckUtils]: 46: Hoare triple {900#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 18:54:32,173 INFO L273 TraceCheckUtils]: 47: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:54:32,174 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {900#true} {901#false} #77#return; {901#false} is VALID [2018-11-14 18:54:32,174 INFO L273 TraceCheckUtils]: 49: Hoare triple {901#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {901#false} is VALID [2018-11-14 18:54:32,174 INFO L273 TraceCheckUtils]: 50: Hoare triple {901#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {901#false} is VALID [2018-11-14 18:54:32,174 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 18:54:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:54:32,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:32,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:32,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:32,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:32,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 18:54:32,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {900#true} is VALID [2018-11-14 18:54:32,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:54:32,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 18:54:32,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret13 := main(); {900#true} is VALID [2018-11-14 18:54:32,584 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {922#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:32,585 INFO L273 TraceCheckUtils]: 6: Hoare triple {922#(<= main_~i~1 0)} assume true; {922#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:32,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {922#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {922#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:32,586 INFO L273 TraceCheckUtils]: 8: Hoare triple {922#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {903#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:32,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:32,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 10000); {901#false} is VALID [2018-11-14 18:54:32,588 INFO L256 TraceCheckUtils]: 11: Hoare triple {901#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 18:54:32,588 INFO L273 TraceCheckUtils]: 12: Hoare triple {901#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {901#false} is VALID [2018-11-14 18:54:32,588 INFO L273 TraceCheckUtils]: 13: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:54:32,588 INFO L273 TraceCheckUtils]: 14: Hoare triple {901#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {901#false} is VALID [2018-11-14 18:54:32,589 INFO L273 TraceCheckUtils]: 15: Hoare triple {901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {901#false} is VALID [2018-11-14 18:54:32,589 INFO L273 TraceCheckUtils]: 16: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:54:32,590 INFO L273 TraceCheckUtils]: 17: Hoare triple {901#false} assume !(~i~0 < 10000); {901#false} is VALID [2018-11-14 18:54:32,590 INFO L273 TraceCheckUtils]: 18: Hoare triple {901#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 18:54:32,591 INFO L273 TraceCheckUtils]: 19: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:54:32,591 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {901#false} {901#false} #73#return; {901#false} is VALID [2018-11-14 18:54:32,592 INFO L273 TraceCheckUtils]: 21: Hoare triple {901#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {901#false} is VALID [2018-11-14 18:54:32,592 INFO L256 TraceCheckUtils]: 22: Hoare triple {901#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 18:54:32,592 INFO L273 TraceCheckUtils]: 23: Hoare triple {901#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {901#false} is VALID [2018-11-14 18:54:32,592 INFO L273 TraceCheckUtils]: 24: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:54:32,593 INFO L273 TraceCheckUtils]: 25: Hoare triple {901#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {901#false} is VALID [2018-11-14 18:54:32,593 INFO L273 TraceCheckUtils]: 26: Hoare triple {901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {901#false} is VALID [2018-11-14 18:54:32,593 INFO L273 TraceCheckUtils]: 27: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:54:32,593 INFO L273 TraceCheckUtils]: 28: Hoare triple {901#false} assume !(~i~0 < 10000); {901#false} is VALID [2018-11-14 18:54:32,594 INFO L273 TraceCheckUtils]: 29: Hoare triple {901#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 18:54:32,594 INFO L273 TraceCheckUtils]: 30: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:54:32,594 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {901#false} {901#false} #75#return; {901#false} is VALID [2018-11-14 18:54:32,594 INFO L273 TraceCheckUtils]: 32: Hoare triple {901#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {901#false} is VALID [2018-11-14 18:54:32,595 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:54:32,595 INFO L273 TraceCheckUtils]: 34: Hoare triple {901#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {901#false} is VALID [2018-11-14 18:54:32,595 INFO L273 TraceCheckUtils]: 35: Hoare triple {901#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {901#false} is VALID [2018-11-14 18:54:32,595 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:54:32,596 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 9999); {901#false} is VALID [2018-11-14 18:54:32,596 INFO L273 TraceCheckUtils]: 38: Hoare triple {901#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {901#false} is VALID [2018-11-14 18:54:32,596 INFO L256 TraceCheckUtils]: 39: Hoare triple {901#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 18:54:32,597 INFO L273 TraceCheckUtils]: 40: Hoare triple {901#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {901#false} is VALID [2018-11-14 18:54:32,597 INFO L273 TraceCheckUtils]: 41: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:54:32,597 INFO L273 TraceCheckUtils]: 42: Hoare triple {901#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {901#false} is VALID [2018-11-14 18:54:32,597 INFO L273 TraceCheckUtils]: 43: Hoare triple {901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {901#false} is VALID [2018-11-14 18:54:32,598 INFO L273 TraceCheckUtils]: 44: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:54:32,598 INFO L273 TraceCheckUtils]: 45: Hoare triple {901#false} assume !(~i~0 < 10000); {901#false} is VALID [2018-11-14 18:54:32,598 INFO L273 TraceCheckUtils]: 46: Hoare triple {901#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 18:54:32,598 INFO L273 TraceCheckUtils]: 47: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:54:32,599 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {901#false} {901#false} #77#return; {901#false} is VALID [2018-11-14 18:54:32,599 INFO L273 TraceCheckUtils]: 49: Hoare triple {901#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {901#false} is VALID [2018-11-14 18:54:32,599 INFO L273 TraceCheckUtils]: 50: Hoare triple {901#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {901#false} is VALID [2018-11-14 18:54:32,599 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 18:54:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:54:32,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:32,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 18:54:32,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 18:54:32,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:32,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:54:32,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:32,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:54:32,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:54:32,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:54:32,719 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2018-11-14 18:54:32,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:32,851 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-14 18:54:32,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:54:32,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 18:54:32,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:54:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 18:54:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:54:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 18:54:32,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2018-11-14 18:54:33,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:33,057 INFO L225 Difference]: With dead ends: 63 [2018-11-14 18:54:33,057 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 18:54:33,058 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:54:33,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 18:54:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-14 18:54:33,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:33,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-14 18:54:33,086 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-14 18:54:33,086 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-14 18:54:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:33,088 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 18:54:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 18:54:33,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:33,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:33,089 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-14 18:54:33,089 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-14 18:54:33,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:33,092 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 18:54:33,092 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 18:54:33,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:33,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:33,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:33,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:54:33,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-14 18:54:33,096 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 52 [2018-11-14 18:54:33,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:33,096 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-14 18:54:33,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:54:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 18:54:33,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 18:54:33,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:33,098 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:33,099 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:33,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:33,099 INFO L82 PathProgramCache]: Analyzing trace with hash -349935993, now seen corresponding path program 2 times [2018-11-14 18:54:33,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:33,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:33,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:33,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:33,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:33,255 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 18:54:33,255 INFO L273 TraceCheckUtils]: 1: Hoare triple {1277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1277#true} is VALID [2018-11-14 18:54:33,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:54:33,256 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 18:54:33,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret13 := main(); {1277#true} is VALID [2018-11-14 18:54:33,257 INFO L273 TraceCheckUtils]: 5: Hoare triple {1277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1279#(= main_~i~1 0)} is VALID [2018-11-14 18:54:33,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {1279#(= main_~i~1 0)} assume true; {1279#(= main_~i~1 0)} is VALID [2018-11-14 18:54:33,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {1279#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1279#(= main_~i~1 0)} is VALID [2018-11-14 18:54:33,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {1279#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:33,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(<= main_~i~1 1)} assume true; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:33,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:33,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {1280#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:33,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {1281#(<= main_~i~1 2)} assume true; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:33,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 10000); {1278#false} is VALID [2018-11-14 18:54:33,266 INFO L256 TraceCheckUtils]: 14: Hoare triple {1278#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 18:54:33,266 INFO L273 TraceCheckUtils]: 15: Hoare triple {1277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1277#true} is VALID [2018-11-14 18:54:33,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:54:33,267 INFO L273 TraceCheckUtils]: 17: Hoare triple {1277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1277#true} is VALID [2018-11-14 18:54:33,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {1277#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1277#true} is VALID [2018-11-14 18:54:33,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:54:33,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {1277#true} assume !(~i~0 < 10000); {1277#true} is VALID [2018-11-14 18:54:33,268 INFO L273 TraceCheckUtils]: 21: Hoare triple {1277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 18:54:33,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:54:33,268 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1277#true} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 18:54:33,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {1278#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1278#false} is VALID [2018-11-14 18:54:33,269 INFO L256 TraceCheckUtils]: 25: Hoare triple {1278#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 18:54:33,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {1277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1277#true} is VALID [2018-11-14 18:54:33,269 INFO L273 TraceCheckUtils]: 27: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:54:33,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {1277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1277#true} is VALID [2018-11-14 18:54:33,270 INFO L273 TraceCheckUtils]: 29: Hoare triple {1277#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1277#true} is VALID [2018-11-14 18:54:33,270 INFO L273 TraceCheckUtils]: 30: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:54:33,270 INFO L273 TraceCheckUtils]: 31: Hoare triple {1277#true} assume !(~i~0 < 10000); {1277#true} is VALID [2018-11-14 18:54:33,270 INFO L273 TraceCheckUtils]: 32: Hoare triple {1277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 18:54:33,271 INFO L273 TraceCheckUtils]: 33: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:54:33,271 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1277#true} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 18:54:33,271 INFO L273 TraceCheckUtils]: 35: Hoare triple {1278#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1278#false} is VALID [2018-11-14 18:54:33,271 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:54:33,271 INFO L273 TraceCheckUtils]: 37: Hoare triple {1278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1278#false} is VALID [2018-11-14 18:54:33,272 INFO L273 TraceCheckUtils]: 38: Hoare triple {1278#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1278#false} is VALID [2018-11-14 18:54:33,272 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:54:33,272 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 9999); {1278#false} is VALID [2018-11-14 18:54:33,272 INFO L273 TraceCheckUtils]: 41: Hoare triple {1278#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {1278#false} is VALID [2018-11-14 18:54:33,272 INFO L256 TraceCheckUtils]: 42: Hoare triple {1278#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 18:54:33,272 INFO L273 TraceCheckUtils]: 43: Hoare triple {1277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1277#true} is VALID [2018-11-14 18:54:33,273 INFO L273 TraceCheckUtils]: 44: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:54:33,273 INFO L273 TraceCheckUtils]: 45: Hoare triple {1277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1277#true} is VALID [2018-11-14 18:54:33,273 INFO L273 TraceCheckUtils]: 46: Hoare triple {1277#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1277#true} is VALID [2018-11-14 18:54:33,273 INFO L273 TraceCheckUtils]: 47: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:54:33,273 INFO L273 TraceCheckUtils]: 48: Hoare triple {1277#true} assume !(~i~0 < 10000); {1277#true} is VALID [2018-11-14 18:54:33,274 INFO L273 TraceCheckUtils]: 49: Hoare triple {1277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 18:54:33,274 INFO L273 TraceCheckUtils]: 50: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:54:33,274 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1277#true} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 18:54:33,274 INFO L273 TraceCheckUtils]: 52: Hoare triple {1278#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1278#false} is VALID [2018-11-14 18:54:33,274 INFO L273 TraceCheckUtils]: 53: Hoare triple {1278#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1278#false} is VALID [2018-11-14 18:54:33,275 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 18:54:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:54:33,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:33,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:33,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:54:33,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:54:33,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:33,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:33,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 18:54:33,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {1277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1277#true} is VALID [2018-11-14 18:54:33,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:54:33,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 18:54:33,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret13 := main(); {1277#true} is VALID [2018-11-14 18:54:33,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {1277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:33,525 INFO L273 TraceCheckUtils]: 6: Hoare triple {1300#(<= main_~i~1 0)} assume true; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:33,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {1300#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:33,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {1300#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:33,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(<= main_~i~1 1)} assume true; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:33,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:33,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {1280#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:33,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {1281#(<= main_~i~1 2)} assume true; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:33,529 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 10000); {1278#false} is VALID [2018-11-14 18:54:33,529 INFO L256 TraceCheckUtils]: 14: Hoare triple {1278#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 18:54:33,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {1278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1278#false} is VALID [2018-11-14 18:54:33,530 INFO L273 TraceCheckUtils]: 16: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:54:33,530 INFO L273 TraceCheckUtils]: 17: Hoare triple {1278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1278#false} is VALID [2018-11-14 18:54:33,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {1278#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1278#false} is VALID [2018-11-14 18:54:33,531 INFO L273 TraceCheckUtils]: 19: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:54:33,531 INFO L273 TraceCheckUtils]: 20: Hoare triple {1278#false} assume !(~i~0 < 10000); {1278#false} is VALID [2018-11-14 18:54:33,531 INFO L273 TraceCheckUtils]: 21: Hoare triple {1278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 18:54:33,532 INFO L273 TraceCheckUtils]: 22: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:54:33,532 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1278#false} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 18:54:33,532 INFO L273 TraceCheckUtils]: 24: Hoare triple {1278#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1278#false} is VALID [2018-11-14 18:54:33,533 INFO L256 TraceCheckUtils]: 25: Hoare triple {1278#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 18:54:33,533 INFO L273 TraceCheckUtils]: 26: Hoare triple {1278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1278#false} is VALID [2018-11-14 18:54:33,534 INFO L273 TraceCheckUtils]: 27: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:54:33,534 INFO L273 TraceCheckUtils]: 28: Hoare triple {1278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1278#false} is VALID [2018-11-14 18:54:33,534 INFO L273 TraceCheckUtils]: 29: Hoare triple {1278#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1278#false} is VALID [2018-11-14 18:54:33,535 INFO L273 TraceCheckUtils]: 30: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:54:33,535 INFO L273 TraceCheckUtils]: 31: Hoare triple {1278#false} assume !(~i~0 < 10000); {1278#false} is VALID [2018-11-14 18:54:33,535 INFO L273 TraceCheckUtils]: 32: Hoare triple {1278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 18:54:33,535 INFO L273 TraceCheckUtils]: 33: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:54:33,535 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1278#false} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 18:54:33,536 INFO L273 TraceCheckUtils]: 35: Hoare triple {1278#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1278#false} is VALID [2018-11-14 18:54:33,536 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:54:33,536 INFO L273 TraceCheckUtils]: 37: Hoare triple {1278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1278#false} is VALID [2018-11-14 18:54:33,536 INFO L273 TraceCheckUtils]: 38: Hoare triple {1278#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1278#false} is VALID [2018-11-14 18:54:33,537 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:54:33,537 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 9999); {1278#false} is VALID [2018-11-14 18:54:33,537 INFO L273 TraceCheckUtils]: 41: Hoare triple {1278#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {1278#false} is VALID [2018-11-14 18:54:33,537 INFO L256 TraceCheckUtils]: 42: Hoare triple {1278#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 18:54:33,538 INFO L273 TraceCheckUtils]: 43: Hoare triple {1278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1278#false} is VALID [2018-11-14 18:54:33,538 INFO L273 TraceCheckUtils]: 44: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:54:33,538 INFO L273 TraceCheckUtils]: 45: Hoare triple {1278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1278#false} is VALID [2018-11-14 18:54:33,538 INFO L273 TraceCheckUtils]: 46: Hoare triple {1278#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1278#false} is VALID [2018-11-14 18:54:33,539 INFO L273 TraceCheckUtils]: 47: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:54:33,539 INFO L273 TraceCheckUtils]: 48: Hoare triple {1278#false} assume !(~i~0 < 10000); {1278#false} is VALID [2018-11-14 18:54:33,539 INFO L273 TraceCheckUtils]: 49: Hoare triple {1278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 18:54:33,539 INFO L273 TraceCheckUtils]: 50: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:54:33,539 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1278#false} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 18:54:33,540 INFO L273 TraceCheckUtils]: 52: Hoare triple {1278#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1278#false} is VALID [2018-11-14 18:54:33,540 INFO L273 TraceCheckUtils]: 53: Hoare triple {1278#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1278#false} is VALID [2018-11-14 18:54:33,540 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 18:54:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:54:33,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:33,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 18:54:33,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 18:54:33,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:33,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:54:33,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:33,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:54:33,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:54:33,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:54:33,624 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2018-11-14 18:54:33,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:33,777 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-14 18:54:33,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:54:33,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 18:54:33,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:54:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 18:54:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:54:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 18:54:33,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2018-11-14 18:54:33,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:33,979 INFO L225 Difference]: With dead ends: 66 [2018-11-14 18:54:33,979 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 18:54:33,980 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:54:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 18:54:34,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-14 18:54:34,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:34,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-14 18:54:34,002 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-14 18:54:34,002 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-14 18:54:34,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:34,005 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 18:54:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 18:54:34,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:34,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:34,006 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-14 18:54:34,007 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-14 18:54:34,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:34,009 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 18:54:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 18:54:34,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:34,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:34,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:34,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 18:54:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-14 18:54:34,012 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 55 [2018-11-14 18:54:34,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:34,013 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-14 18:54:34,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:54:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-14 18:54:34,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 18:54:34,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:34,014 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:34,014 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:34,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:34,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1305179955, now seen corresponding path program 3 times [2018-11-14 18:54:34,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:34,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:34,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:34,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:34,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:34,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 18:54:34,146 INFO L273 TraceCheckUtils]: 1: Hoare triple {1678#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1678#true} is VALID [2018-11-14 18:54:34,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 18:54:34,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret13 := main(); {1678#true} is VALID [2018-11-14 18:54:34,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {1678#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1680#(= main_~i~1 0)} is VALID [2018-11-14 18:54:34,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {1680#(= main_~i~1 0)} assume true; {1680#(= main_~i~1 0)} is VALID [2018-11-14 18:54:34,149 INFO L273 TraceCheckUtils]: 7: Hoare triple {1680#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1680#(= main_~i~1 0)} is VALID [2018-11-14 18:54:34,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {1680#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:34,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {1681#(<= main_~i~1 1)} assume true; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:34,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {1681#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:34,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {1681#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:34,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {1682#(<= main_~i~1 2)} assume true; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:34,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {1682#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:34,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {1682#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1683#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:34,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {1683#(<= main_~i~1 3)} assume true; {1683#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:34,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {1683#(<= main_~i~1 3)} assume !(~i~1 < 10000); {1679#false} is VALID [2018-11-14 18:54:34,157 INFO L256 TraceCheckUtils]: 17: Hoare triple {1679#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:54:34,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 18:54:34,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {1678#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 18:54:34,158 INFO L273 TraceCheckUtils]: 21: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 18:54:34,158 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,158 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 10000); {1678#true} is VALID [2018-11-14 18:54:34,159 INFO L273 TraceCheckUtils]: 24: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 18:54:34,159 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,159 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1679#false} #73#return; {1679#false} is VALID [2018-11-14 18:54:34,160 INFO L273 TraceCheckUtils]: 27: Hoare triple {1679#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1679#false} is VALID [2018-11-14 18:54:34,160 INFO L256 TraceCheckUtils]: 28: Hoare triple {1679#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:54:34,160 INFO L273 TraceCheckUtils]: 29: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 18:54:34,161 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,161 INFO L273 TraceCheckUtils]: 31: Hoare triple {1678#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 18:54:34,161 INFO L273 TraceCheckUtils]: 32: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 18:54:34,161 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,162 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 10000); {1678#true} is VALID [2018-11-14 18:54:34,162 INFO L273 TraceCheckUtils]: 35: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 18:54:34,162 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,162 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1679#false} #75#return; {1679#false} is VALID [2018-11-14 18:54:34,163 INFO L273 TraceCheckUtils]: 38: Hoare triple {1679#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1679#false} is VALID [2018-11-14 18:54:34,163 INFO L273 TraceCheckUtils]: 39: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 18:54:34,163 INFO L273 TraceCheckUtils]: 40: Hoare triple {1679#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1679#false} is VALID [2018-11-14 18:54:34,163 INFO L273 TraceCheckUtils]: 41: Hoare triple {1679#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1679#false} is VALID [2018-11-14 18:54:34,163 INFO L273 TraceCheckUtils]: 42: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 18:54:34,163 INFO L273 TraceCheckUtils]: 43: Hoare triple {1679#false} assume !(~i~2 < 9999); {1679#false} is VALID [2018-11-14 18:54:34,164 INFO L273 TraceCheckUtils]: 44: Hoare triple {1679#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {1679#false} is VALID [2018-11-14 18:54:34,164 INFO L256 TraceCheckUtils]: 45: Hoare triple {1679#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:54:34,164 INFO L273 TraceCheckUtils]: 46: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 18:54:34,164 INFO L273 TraceCheckUtils]: 47: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,164 INFO L273 TraceCheckUtils]: 48: Hoare triple {1678#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 18:54:34,164 INFO L273 TraceCheckUtils]: 49: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 18:54:34,165 INFO L273 TraceCheckUtils]: 50: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,165 INFO L273 TraceCheckUtils]: 51: Hoare triple {1678#true} assume !(~i~0 < 10000); {1678#true} is VALID [2018-11-14 18:54:34,165 INFO L273 TraceCheckUtils]: 52: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 18:54:34,165 INFO L273 TraceCheckUtils]: 53: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,165 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1678#true} {1679#false} #77#return; {1679#false} is VALID [2018-11-14 18:54:34,166 INFO L273 TraceCheckUtils]: 55: Hoare triple {1679#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1679#false} is VALID [2018-11-14 18:54:34,166 INFO L273 TraceCheckUtils]: 56: Hoare triple {1679#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1679#false} is VALID [2018-11-14 18:54:34,166 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 18:54:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:54:34,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:34,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:34,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:54:34,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 18:54:34,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:34,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:34,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 18:54:34,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {1678#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1678#true} is VALID [2018-11-14 18:54:34,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 18:54:34,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret13 := main(); {1678#true} is VALID [2018-11-14 18:54:34,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {1678#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1678#true} is VALID [2018-11-14 18:54:34,787 INFO L273 TraceCheckUtils]: 6: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {1678#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1678#true} is VALID [2018-11-14 18:54:34,788 INFO L273 TraceCheckUtils]: 8: Hoare triple {1678#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1678#true} is VALID [2018-11-14 18:54:34,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {1678#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1678#true} is VALID [2018-11-14 18:54:34,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {1678#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1678#true} is VALID [2018-11-14 18:54:34,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {1678#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1678#true} is VALID [2018-11-14 18:54:34,788 INFO L273 TraceCheckUtils]: 14: Hoare triple {1678#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1678#true} is VALID [2018-11-14 18:54:34,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {1678#true} assume !(~i~1 < 10000); {1678#true} is VALID [2018-11-14 18:54:34,789 INFO L256 TraceCheckUtils]: 17: Hoare triple {1678#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:54:34,789 INFO L273 TraceCheckUtils]: 18: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 18:54:34,789 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,789 INFO L273 TraceCheckUtils]: 20: Hoare triple {1678#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 18:54:34,789 INFO L273 TraceCheckUtils]: 21: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 18:54:34,790 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,790 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 10000); {1678#true} is VALID [2018-11-14 18:54:34,790 INFO L273 TraceCheckUtils]: 24: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 18:54:34,790 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,790 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1678#true} #73#return; {1678#true} is VALID [2018-11-14 18:54:34,790 INFO L273 TraceCheckUtils]: 27: Hoare triple {1678#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1678#true} is VALID [2018-11-14 18:54:34,791 INFO L256 TraceCheckUtils]: 28: Hoare triple {1678#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:54:34,791 INFO L273 TraceCheckUtils]: 29: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 18:54:34,791 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,791 INFO L273 TraceCheckUtils]: 31: Hoare triple {1678#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 18:54:34,791 INFO L273 TraceCheckUtils]: 32: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 18:54:34,791 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,792 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 10000); {1678#true} is VALID [2018-11-14 18:54:34,792 INFO L273 TraceCheckUtils]: 35: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 18:54:34,792 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,792 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1678#true} #75#return; {1678#true} is VALID [2018-11-14 18:54:34,792 INFO L273 TraceCheckUtils]: 38: Hoare triple {1678#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1678#true} is VALID [2018-11-14 18:54:34,792 INFO L273 TraceCheckUtils]: 39: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,793 INFO L273 TraceCheckUtils]: 40: Hoare triple {1678#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1678#true} is VALID [2018-11-14 18:54:34,793 INFO L273 TraceCheckUtils]: 41: Hoare triple {1678#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1678#true} is VALID [2018-11-14 18:54:34,793 INFO L273 TraceCheckUtils]: 42: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:54:34,793 INFO L273 TraceCheckUtils]: 43: Hoare triple {1678#true} assume !(~i~2 < 9999); {1678#true} is VALID [2018-11-14 18:54:34,794 INFO L273 TraceCheckUtils]: 44: Hoare triple {1678#true} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {1678#true} is VALID [2018-11-14 18:54:34,794 INFO L256 TraceCheckUtils]: 45: Hoare triple {1678#true} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:54:34,806 INFO L273 TraceCheckUtils]: 46: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1825#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:34,807 INFO L273 TraceCheckUtils]: 47: Hoare triple {1825#(<= bAnd_~i~0 1)} assume true; {1825#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:34,808 INFO L273 TraceCheckUtils]: 48: Hoare triple {1825#(<= bAnd_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1825#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:34,808 INFO L273 TraceCheckUtils]: 49: Hoare triple {1825#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1835#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:54:34,809 INFO L273 TraceCheckUtils]: 50: Hoare triple {1835#(<= bAnd_~i~0 2)} assume true; {1835#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:54:34,810 INFO L273 TraceCheckUtils]: 51: Hoare triple {1835#(<= bAnd_~i~0 2)} assume !(~i~0 < 10000); {1679#false} is VALID [2018-11-14 18:54:34,810 INFO L273 TraceCheckUtils]: 52: Hoare triple {1679#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1679#false} is VALID [2018-11-14 18:54:34,810 INFO L273 TraceCheckUtils]: 53: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 18:54:34,811 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1679#false} {1678#true} #77#return; {1679#false} is VALID [2018-11-14 18:54:34,811 INFO L273 TraceCheckUtils]: 55: Hoare triple {1679#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1679#false} is VALID [2018-11-14 18:54:34,811 INFO L273 TraceCheckUtils]: 56: Hoare triple {1679#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1679#false} is VALID [2018-11-14 18:54:34,811 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 18:54:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-14 18:54:34,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:34,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-14 18:54:34,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 18:54:34,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:34,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:54:34,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:34,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:54:34,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:54:34,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:54:34,958 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-14 18:54:35,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:35,454 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-11-14 18:54:35,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:54:35,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 18:54:35,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:54:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 18:54:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:54:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 18:54:35,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2018-11-14 18:54:35,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:35,583 INFO L225 Difference]: With dead ends: 73 [2018-11-14 18:54:35,583 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 18:54:35,584 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:54:35,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 18:54:35,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-14 18:54:35,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:35,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-14 18:54:35,603 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-14 18:54:35,603 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-14 18:54:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:35,606 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 18:54:35,606 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 18:54:35,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:35,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:35,607 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-14 18:54:35,607 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-14 18:54:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:35,609 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 18:54:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 18:54:35,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:35,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:35,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:35,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:35,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 18:54:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-14 18:54:35,612 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 58 [2018-11-14 18:54:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:35,613 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-14 18:54:35,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:54:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 18:54:35,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-14 18:54:35,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:35,614 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:35,614 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:35,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:35,614 INFO L82 PathProgramCache]: Analyzing trace with hash 375282389, now seen corresponding path program 4 times [2018-11-14 18:54:35,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:35,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:35,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:35,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:35,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:35,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 18:54:35,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {2121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2121#true} is VALID [2018-11-14 18:54:35,915 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:54:35,915 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 18:54:35,916 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret13 := main(); {2121#true} is VALID [2018-11-14 18:54:35,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {2121#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2123#(= main_~i~1 0)} is VALID [2018-11-14 18:54:35,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {2123#(= main_~i~1 0)} assume true; {2123#(= main_~i~1 0)} is VALID [2018-11-14 18:54:35,918 INFO L273 TraceCheckUtils]: 7: Hoare triple {2123#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2123#(= main_~i~1 0)} is VALID [2018-11-14 18:54:35,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {2123#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:35,919 INFO L273 TraceCheckUtils]: 9: Hoare triple {2124#(<= main_~i~1 1)} assume true; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:35,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {2124#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:35,920 INFO L273 TraceCheckUtils]: 11: Hoare triple {2124#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:35,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {2125#(<= main_~i~1 2)} assume true; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:35,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {2125#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:35,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {2125#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:35,922 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#(<= main_~i~1 3)} assume true; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:35,923 INFO L273 TraceCheckUtils]: 16: Hoare triple {2126#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:35,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {2126#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:35,924 INFO L273 TraceCheckUtils]: 18: Hoare triple {2127#(<= main_~i~1 4)} assume true; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:35,925 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(<= main_~i~1 4)} assume !(~i~1 < 10000); {2122#false} is VALID [2018-11-14 18:54:35,925 INFO L256 TraceCheckUtils]: 20: Hoare triple {2122#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 18:54:35,925 INFO L273 TraceCheckUtils]: 21: Hoare triple {2121#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2121#true} is VALID [2018-11-14 18:54:35,926 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:54:35,926 INFO L273 TraceCheckUtils]: 23: Hoare triple {2121#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 18:54:35,926 INFO L273 TraceCheckUtils]: 24: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 18:54:35,927 INFO L273 TraceCheckUtils]: 25: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:54:35,927 INFO L273 TraceCheckUtils]: 26: Hoare triple {2121#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 18:54:35,927 INFO L273 TraceCheckUtils]: 27: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 18:54:35,927 INFO L273 TraceCheckUtils]: 28: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:54:35,928 INFO L273 TraceCheckUtils]: 29: Hoare triple {2121#true} assume !(~i~0 < 10000); {2121#true} is VALID [2018-11-14 18:54:35,928 INFO L273 TraceCheckUtils]: 30: Hoare triple {2121#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 18:54:35,928 INFO L273 TraceCheckUtils]: 31: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:54:35,929 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2121#true} {2122#false} #73#return; {2122#false} is VALID [2018-11-14 18:54:35,929 INFO L273 TraceCheckUtils]: 33: Hoare triple {2122#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2122#false} is VALID [2018-11-14 18:54:35,929 INFO L256 TraceCheckUtils]: 34: Hoare triple {2122#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 18:54:35,930 INFO L273 TraceCheckUtils]: 35: Hoare triple {2121#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2121#true} is VALID [2018-11-14 18:54:35,930 INFO L273 TraceCheckUtils]: 36: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:54:35,930 INFO L273 TraceCheckUtils]: 37: Hoare triple {2121#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 18:54:35,930 INFO L273 TraceCheckUtils]: 38: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 18:54:35,931 INFO L273 TraceCheckUtils]: 39: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:54:35,931 INFO L273 TraceCheckUtils]: 40: Hoare triple {2121#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 18:54:35,931 INFO L273 TraceCheckUtils]: 41: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 18:54:35,931 INFO L273 TraceCheckUtils]: 42: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:54:35,931 INFO L273 TraceCheckUtils]: 43: Hoare triple {2121#true} assume !(~i~0 < 10000); {2121#true} is VALID [2018-11-14 18:54:35,932 INFO L273 TraceCheckUtils]: 44: Hoare triple {2121#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 18:54:35,932 INFO L273 TraceCheckUtils]: 45: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:54:35,932 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2121#true} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 18:54:35,932 INFO L273 TraceCheckUtils]: 47: Hoare triple {2122#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2122#false} is VALID [2018-11-14 18:54:35,932 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:35,933 INFO L273 TraceCheckUtils]: 49: Hoare triple {2122#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2122#false} is VALID [2018-11-14 18:54:35,933 INFO L273 TraceCheckUtils]: 50: Hoare triple {2122#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2122#false} is VALID [2018-11-14 18:54:35,933 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:35,933 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 9999); {2122#false} is VALID [2018-11-14 18:54:35,933 INFO L273 TraceCheckUtils]: 53: Hoare triple {2122#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {2122#false} is VALID [2018-11-14 18:54:35,934 INFO L256 TraceCheckUtils]: 54: Hoare triple {2122#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 18:54:35,934 INFO L273 TraceCheckUtils]: 55: Hoare triple {2121#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2121#true} is VALID [2018-11-14 18:54:35,934 INFO L273 TraceCheckUtils]: 56: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:54:35,934 INFO L273 TraceCheckUtils]: 57: Hoare triple {2121#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 18:54:35,935 INFO L273 TraceCheckUtils]: 58: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 18:54:35,935 INFO L273 TraceCheckUtils]: 59: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:54:35,935 INFO L273 TraceCheckUtils]: 60: Hoare triple {2121#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 18:54:35,935 INFO L273 TraceCheckUtils]: 61: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 18:54:35,935 INFO L273 TraceCheckUtils]: 62: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:54:35,936 INFO L273 TraceCheckUtils]: 63: Hoare triple {2121#true} assume !(~i~0 < 10000); {2121#true} is VALID [2018-11-14 18:54:35,936 INFO L273 TraceCheckUtils]: 64: Hoare triple {2121#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 18:54:35,936 INFO L273 TraceCheckUtils]: 65: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:54:35,936 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2121#true} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 18:54:35,936 INFO L273 TraceCheckUtils]: 67: Hoare triple {2122#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2122#false} is VALID [2018-11-14 18:54:35,937 INFO L273 TraceCheckUtils]: 68: Hoare triple {2122#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2122#false} is VALID [2018-11-14 18:54:35,937 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 18:54:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-14 18:54:35,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:35,942 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:35,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:54:36,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:54:36,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:36,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:36,173 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 18:54:36,174 INFO L273 TraceCheckUtils]: 1: Hoare triple {2121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2121#true} is VALID [2018-11-14 18:54:36,174 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:54:36,174 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 18:54:36,175 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret13 := main(); {2121#true} is VALID [2018-11-14 18:54:36,175 INFO L273 TraceCheckUtils]: 5: Hoare triple {2121#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2146#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:36,176 INFO L273 TraceCheckUtils]: 6: Hoare triple {2146#(<= main_~i~1 0)} assume true; {2146#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:36,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {2146#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2146#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:36,177 INFO L273 TraceCheckUtils]: 8: Hoare triple {2146#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:36,177 INFO L273 TraceCheckUtils]: 9: Hoare triple {2124#(<= main_~i~1 1)} assume true; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:36,178 INFO L273 TraceCheckUtils]: 10: Hoare triple {2124#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:36,178 INFO L273 TraceCheckUtils]: 11: Hoare triple {2124#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:36,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {2125#(<= main_~i~1 2)} assume true; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:36,179 INFO L273 TraceCheckUtils]: 13: Hoare triple {2125#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:36,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {2125#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:36,181 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#(<= main_~i~1 3)} assume true; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:36,181 INFO L273 TraceCheckUtils]: 16: Hoare triple {2126#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:36,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {2126#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:36,183 INFO L273 TraceCheckUtils]: 18: Hoare triple {2127#(<= main_~i~1 4)} assume true; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:36,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(<= main_~i~1 4)} assume !(~i~1 < 10000); {2122#false} is VALID [2018-11-14 18:54:36,184 INFO L256 TraceCheckUtils]: 20: Hoare triple {2122#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 18:54:36,184 INFO L273 TraceCheckUtils]: 21: Hoare triple {2122#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2122#false} is VALID [2018-11-14 18:54:36,184 INFO L273 TraceCheckUtils]: 22: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:36,184 INFO L273 TraceCheckUtils]: 23: Hoare triple {2122#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 18:54:36,184 INFO L273 TraceCheckUtils]: 24: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 18:54:36,185 INFO L273 TraceCheckUtils]: 25: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:36,185 INFO L273 TraceCheckUtils]: 26: Hoare triple {2122#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 18:54:36,185 INFO L273 TraceCheckUtils]: 27: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 18:54:36,185 INFO L273 TraceCheckUtils]: 28: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:36,185 INFO L273 TraceCheckUtils]: 29: Hoare triple {2122#false} assume !(~i~0 < 10000); {2122#false} is VALID [2018-11-14 18:54:36,186 INFO L273 TraceCheckUtils]: 30: Hoare triple {2122#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 18:54:36,186 INFO L273 TraceCheckUtils]: 31: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:36,186 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2122#false} {2122#false} #73#return; {2122#false} is VALID [2018-11-14 18:54:36,186 INFO L273 TraceCheckUtils]: 33: Hoare triple {2122#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2122#false} is VALID [2018-11-14 18:54:36,187 INFO L256 TraceCheckUtils]: 34: Hoare triple {2122#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 18:54:36,187 INFO L273 TraceCheckUtils]: 35: Hoare triple {2122#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2122#false} is VALID [2018-11-14 18:54:36,187 INFO L273 TraceCheckUtils]: 36: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:36,187 INFO L273 TraceCheckUtils]: 37: Hoare triple {2122#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 18:54:36,187 INFO L273 TraceCheckUtils]: 38: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 18:54:36,187 INFO L273 TraceCheckUtils]: 39: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:36,187 INFO L273 TraceCheckUtils]: 40: Hoare triple {2122#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 18:54:36,188 INFO L273 TraceCheckUtils]: 41: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 18:54:36,188 INFO L273 TraceCheckUtils]: 42: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:36,188 INFO L273 TraceCheckUtils]: 43: Hoare triple {2122#false} assume !(~i~0 < 10000); {2122#false} is VALID [2018-11-14 18:54:36,188 INFO L273 TraceCheckUtils]: 44: Hoare triple {2122#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 18:54:36,188 INFO L273 TraceCheckUtils]: 45: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:36,188 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2122#false} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 18:54:36,188 INFO L273 TraceCheckUtils]: 47: Hoare triple {2122#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2122#false} is VALID [2018-11-14 18:54:36,188 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:36,189 INFO L273 TraceCheckUtils]: 49: Hoare triple {2122#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2122#false} is VALID [2018-11-14 18:54:36,189 INFO L273 TraceCheckUtils]: 50: Hoare triple {2122#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2122#false} is VALID [2018-11-14 18:54:36,189 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:36,189 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 9999); {2122#false} is VALID [2018-11-14 18:54:36,189 INFO L273 TraceCheckUtils]: 53: Hoare triple {2122#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {2122#false} is VALID [2018-11-14 18:54:36,189 INFO L256 TraceCheckUtils]: 54: Hoare triple {2122#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 18:54:36,189 INFO L273 TraceCheckUtils]: 55: Hoare triple {2122#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2122#false} is VALID [2018-11-14 18:54:36,189 INFO L273 TraceCheckUtils]: 56: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:36,190 INFO L273 TraceCheckUtils]: 57: Hoare triple {2122#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 18:54:36,190 INFO L273 TraceCheckUtils]: 58: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 18:54:36,190 INFO L273 TraceCheckUtils]: 59: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:36,190 INFO L273 TraceCheckUtils]: 60: Hoare triple {2122#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 18:54:36,190 INFO L273 TraceCheckUtils]: 61: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 18:54:36,190 INFO L273 TraceCheckUtils]: 62: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:36,191 INFO L273 TraceCheckUtils]: 63: Hoare triple {2122#false} assume !(~i~0 < 10000); {2122#false} is VALID [2018-11-14 18:54:36,191 INFO L273 TraceCheckUtils]: 64: Hoare triple {2122#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 18:54:36,191 INFO L273 TraceCheckUtils]: 65: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:54:36,191 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2122#false} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 18:54:36,191 INFO L273 TraceCheckUtils]: 67: Hoare triple {2122#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2122#false} is VALID [2018-11-14 18:54:36,192 INFO L273 TraceCheckUtils]: 68: Hoare triple {2122#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2122#false} is VALID [2018-11-14 18:54:36,192 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 18:54:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-14 18:54:36,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:36,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 18:54:36,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-14 18:54:36,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:36,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:54:36,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:36,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:54:36,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:54:36,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:54:36,322 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 8 states. [2018-11-14 18:54:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:36,750 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-14 18:54:36,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:54:36,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-14 18:54:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:54:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-14 18:54:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:54:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-14 18:54:36,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2018-11-14 18:54:36,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:36,871 INFO L225 Difference]: With dead ends: 78 [2018-11-14 18:54:36,871 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 18:54:36,873 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:54:36,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 18:54:36,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-14 18:54:36,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:36,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-14 18:54:36,920 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-14 18:54:36,920 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-14 18:54:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:36,923 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 18:54:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 18:54:36,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:36,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:36,924 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-14 18:54:36,924 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-14 18:54:36,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:36,926 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 18:54:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 18:54:36,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:36,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:36,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:36,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 18:54:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-14 18:54:36,929 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 70 [2018-11-14 18:54:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:36,930 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-14 18:54:36,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:54:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-14 18:54:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-14 18:54:36,931 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:36,931 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:36,931 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:36,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:36,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1521001423, now seen corresponding path program 5 times [2018-11-14 18:54:36,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:36,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:36,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:36,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:36,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:37,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2018-11-14 18:54:37,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {2615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2615#true} is VALID [2018-11-14 18:54:37,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} #69#return; {2615#true} is VALID [2018-11-14 18:54:37,161 INFO L256 TraceCheckUtils]: 4: Hoare triple {2615#true} call #t~ret13 := main(); {2615#true} is VALID [2018-11-14 18:54:37,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {2615#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2617#(= main_~i~1 0)} is VALID [2018-11-14 18:54:37,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {2617#(= main_~i~1 0)} assume true; {2617#(= main_~i~1 0)} is VALID [2018-11-14 18:54:37,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {2617#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2617#(= main_~i~1 0)} is VALID [2018-11-14 18:54:37,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {2617#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2618#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:37,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {2618#(<= main_~i~1 1)} assume true; {2618#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:37,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {2618#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2618#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:37,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {2618#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2619#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:37,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {2619#(<= main_~i~1 2)} assume true; {2619#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:37,166 INFO L273 TraceCheckUtils]: 13: Hoare triple {2619#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2619#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:37,166 INFO L273 TraceCheckUtils]: 14: Hoare triple {2619#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2620#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:37,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {2620#(<= main_~i~1 3)} assume true; {2620#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:37,168 INFO L273 TraceCheckUtils]: 16: Hoare triple {2620#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2620#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:37,168 INFO L273 TraceCheckUtils]: 17: Hoare triple {2620#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2621#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:37,169 INFO L273 TraceCheckUtils]: 18: Hoare triple {2621#(<= main_~i~1 4)} assume true; {2621#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:37,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {2621#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2621#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:37,170 INFO L273 TraceCheckUtils]: 20: Hoare triple {2621#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2622#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:37,171 INFO L273 TraceCheckUtils]: 21: Hoare triple {2622#(<= main_~i~1 5)} assume true; {2622#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:37,172 INFO L273 TraceCheckUtils]: 22: Hoare triple {2622#(<= main_~i~1 5)} assume !(~i~1 < 10000); {2616#false} is VALID [2018-11-14 18:54:37,172 INFO L256 TraceCheckUtils]: 23: Hoare triple {2616#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 18:54:37,172 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2615#true} is VALID [2018-11-14 18:54:37,172 INFO L273 TraceCheckUtils]: 25: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,172 INFO L273 TraceCheckUtils]: 26: Hoare triple {2615#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 18:54:37,173 INFO L273 TraceCheckUtils]: 27: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 18:54:37,173 INFO L273 TraceCheckUtils]: 28: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,173 INFO L273 TraceCheckUtils]: 29: Hoare triple {2615#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 18:54:37,173 INFO L273 TraceCheckUtils]: 30: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 18:54:37,173 INFO L273 TraceCheckUtils]: 31: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,174 INFO L273 TraceCheckUtils]: 32: Hoare triple {2615#true} assume !(~i~0 < 10000); {2615#true} is VALID [2018-11-14 18:54:37,174 INFO L273 TraceCheckUtils]: 33: Hoare triple {2615#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2615#true} is VALID [2018-11-14 18:54:37,174 INFO L273 TraceCheckUtils]: 34: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,174 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2615#true} {2616#false} #73#return; {2616#false} is VALID [2018-11-14 18:54:37,175 INFO L273 TraceCheckUtils]: 36: Hoare triple {2616#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2616#false} is VALID [2018-11-14 18:54:37,175 INFO L256 TraceCheckUtils]: 37: Hoare triple {2616#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 18:54:37,175 INFO L273 TraceCheckUtils]: 38: Hoare triple {2615#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2615#true} is VALID [2018-11-14 18:54:37,175 INFO L273 TraceCheckUtils]: 39: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,175 INFO L273 TraceCheckUtils]: 40: Hoare triple {2615#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 18:54:37,175 INFO L273 TraceCheckUtils]: 41: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 18:54:37,175 INFO L273 TraceCheckUtils]: 42: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,175 INFO L273 TraceCheckUtils]: 43: Hoare triple {2615#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 18:54:37,176 INFO L273 TraceCheckUtils]: 44: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 18:54:37,176 INFO L273 TraceCheckUtils]: 45: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,176 INFO L273 TraceCheckUtils]: 46: Hoare triple {2615#true} assume !(~i~0 < 10000); {2615#true} is VALID [2018-11-14 18:54:37,176 INFO L273 TraceCheckUtils]: 47: Hoare triple {2615#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2615#true} is VALID [2018-11-14 18:54:37,176 INFO L273 TraceCheckUtils]: 48: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,176 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2615#true} {2616#false} #75#return; {2616#false} is VALID [2018-11-14 18:54:37,176 INFO L273 TraceCheckUtils]: 50: Hoare triple {2616#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2616#false} is VALID [2018-11-14 18:54:37,176 INFO L273 TraceCheckUtils]: 51: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:54:37,177 INFO L273 TraceCheckUtils]: 52: Hoare triple {2616#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2616#false} is VALID [2018-11-14 18:54:37,177 INFO L273 TraceCheckUtils]: 53: Hoare triple {2616#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2616#false} is VALID [2018-11-14 18:54:37,177 INFO L273 TraceCheckUtils]: 54: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:54:37,177 INFO L273 TraceCheckUtils]: 55: Hoare triple {2616#false} assume !(~i~2 < 9999); {2616#false} is VALID [2018-11-14 18:54:37,177 INFO L273 TraceCheckUtils]: 56: Hoare triple {2616#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {2616#false} is VALID [2018-11-14 18:54:37,177 INFO L256 TraceCheckUtils]: 57: Hoare triple {2616#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 18:54:37,178 INFO L273 TraceCheckUtils]: 58: Hoare triple {2615#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2615#true} is VALID [2018-11-14 18:54:37,178 INFO L273 TraceCheckUtils]: 59: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,178 INFO L273 TraceCheckUtils]: 60: Hoare triple {2615#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 18:54:37,178 INFO L273 TraceCheckUtils]: 61: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 18:54:37,178 INFO L273 TraceCheckUtils]: 62: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,179 INFO L273 TraceCheckUtils]: 63: Hoare triple {2615#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 18:54:37,179 INFO L273 TraceCheckUtils]: 64: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 18:54:37,179 INFO L273 TraceCheckUtils]: 65: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,179 INFO L273 TraceCheckUtils]: 66: Hoare triple {2615#true} assume !(~i~0 < 10000); {2615#true} is VALID [2018-11-14 18:54:37,179 INFO L273 TraceCheckUtils]: 67: Hoare triple {2615#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2615#true} is VALID [2018-11-14 18:54:37,179 INFO L273 TraceCheckUtils]: 68: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,180 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {2615#true} {2616#false} #77#return; {2616#false} is VALID [2018-11-14 18:54:37,180 INFO L273 TraceCheckUtils]: 70: Hoare triple {2616#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2616#false} is VALID [2018-11-14 18:54:37,180 INFO L273 TraceCheckUtils]: 71: Hoare triple {2616#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2616#false} is VALID [2018-11-14 18:54:37,180 INFO L273 TraceCheckUtils]: 72: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2018-11-14 18:54:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-14 18:54:37,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:37,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:37,201 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:54:37,276 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 18:54:37,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:37,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:37,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2018-11-14 18:54:37,457 INFO L273 TraceCheckUtils]: 1: Hoare triple {2615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2615#true} is VALID [2018-11-14 18:54:37,458 INFO L273 TraceCheckUtils]: 2: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,458 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} #69#return; {2615#true} is VALID [2018-11-14 18:54:37,458 INFO L256 TraceCheckUtils]: 4: Hoare triple {2615#true} call #t~ret13 := main(); {2615#true} is VALID [2018-11-14 18:54:37,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {2615#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2615#true} is VALID [2018-11-14 18:54:37,459 INFO L273 TraceCheckUtils]: 6: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {2615#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 18:54:37,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 18:54:37,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {2615#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 18:54:37,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 18:54:37,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {2615#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 18:54:37,460 INFO L273 TraceCheckUtils]: 14: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 18:54:37,460 INFO L273 TraceCheckUtils]: 15: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,461 INFO L273 TraceCheckUtils]: 16: Hoare triple {2615#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 18:54:37,461 INFO L273 TraceCheckUtils]: 17: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 18:54:37,461 INFO L273 TraceCheckUtils]: 18: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,461 INFO L273 TraceCheckUtils]: 19: Hoare triple {2615#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 18:54:37,461 INFO L273 TraceCheckUtils]: 20: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 18:54:37,461 INFO L273 TraceCheckUtils]: 21: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:54:37,461 INFO L273 TraceCheckUtils]: 22: Hoare triple {2615#true} assume !(~i~1 < 10000); {2615#true} is VALID [2018-11-14 18:54:37,461 INFO L256 TraceCheckUtils]: 23: Hoare triple {2615#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 18:54:37,462 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2698#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:37,462 INFO L273 TraceCheckUtils]: 25: Hoare triple {2698#(<= bAnd_~i~0 1)} assume true; {2698#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:37,463 INFO L273 TraceCheckUtils]: 26: Hoare triple {2698#(<= bAnd_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2698#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:37,463 INFO L273 TraceCheckUtils]: 27: Hoare triple {2698#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2708#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:54:37,463 INFO L273 TraceCheckUtils]: 28: Hoare triple {2708#(<= bAnd_~i~0 2)} assume true; {2708#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:54:37,464 INFO L273 TraceCheckUtils]: 29: Hoare triple {2708#(<= bAnd_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2708#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:54:37,464 INFO L273 TraceCheckUtils]: 30: Hoare triple {2708#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2718#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:54:37,465 INFO L273 TraceCheckUtils]: 31: Hoare triple {2718#(<= bAnd_~i~0 3)} assume true; {2718#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:54:37,465 INFO L273 TraceCheckUtils]: 32: Hoare triple {2718#(<= bAnd_~i~0 3)} assume !(~i~0 < 10000); {2616#false} is VALID [2018-11-14 18:54:37,465 INFO L273 TraceCheckUtils]: 33: Hoare triple {2616#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2616#false} is VALID [2018-11-14 18:54:37,465 INFO L273 TraceCheckUtils]: 34: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:54:37,465 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2616#false} {2615#true} #73#return; {2616#false} is VALID [2018-11-14 18:54:37,466 INFO L273 TraceCheckUtils]: 36: Hoare triple {2616#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2616#false} is VALID [2018-11-14 18:54:37,466 INFO L256 TraceCheckUtils]: 37: Hoare triple {2616#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {2616#false} is VALID [2018-11-14 18:54:37,466 INFO L273 TraceCheckUtils]: 38: Hoare triple {2616#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2616#false} is VALID [2018-11-14 18:54:37,467 INFO L273 TraceCheckUtils]: 39: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:54:37,467 INFO L273 TraceCheckUtils]: 40: Hoare triple {2616#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 18:54:37,467 INFO L273 TraceCheckUtils]: 41: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 18:54:37,467 INFO L273 TraceCheckUtils]: 42: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:54:37,468 INFO L273 TraceCheckUtils]: 43: Hoare triple {2616#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 18:54:37,468 INFO L273 TraceCheckUtils]: 44: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 18:54:37,468 INFO L273 TraceCheckUtils]: 45: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:54:37,468 INFO L273 TraceCheckUtils]: 46: Hoare triple {2616#false} assume !(~i~0 < 10000); {2616#false} is VALID [2018-11-14 18:54:37,468 INFO L273 TraceCheckUtils]: 47: Hoare triple {2616#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2616#false} is VALID [2018-11-14 18:54:37,469 INFO L273 TraceCheckUtils]: 48: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:54:37,469 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2616#false} {2616#false} #75#return; {2616#false} is VALID [2018-11-14 18:54:37,469 INFO L273 TraceCheckUtils]: 50: Hoare triple {2616#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2616#false} is VALID [2018-11-14 18:54:37,469 INFO L273 TraceCheckUtils]: 51: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:54:37,469 INFO L273 TraceCheckUtils]: 52: Hoare triple {2616#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2616#false} is VALID [2018-11-14 18:54:37,469 INFO L273 TraceCheckUtils]: 53: Hoare triple {2616#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2616#false} is VALID [2018-11-14 18:54:37,470 INFO L273 TraceCheckUtils]: 54: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:54:37,470 INFO L273 TraceCheckUtils]: 55: Hoare triple {2616#false} assume !(~i~2 < 9999); {2616#false} is VALID [2018-11-14 18:54:37,470 INFO L273 TraceCheckUtils]: 56: Hoare triple {2616#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {2616#false} is VALID [2018-11-14 18:54:37,470 INFO L256 TraceCheckUtils]: 57: Hoare triple {2616#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {2616#false} is VALID [2018-11-14 18:54:37,470 INFO L273 TraceCheckUtils]: 58: Hoare triple {2616#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2616#false} is VALID [2018-11-14 18:54:37,471 INFO L273 TraceCheckUtils]: 59: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:54:37,471 INFO L273 TraceCheckUtils]: 60: Hoare triple {2616#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 18:54:37,471 INFO L273 TraceCheckUtils]: 61: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 18:54:37,471 INFO L273 TraceCheckUtils]: 62: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:54:37,471 INFO L273 TraceCheckUtils]: 63: Hoare triple {2616#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 18:54:37,472 INFO L273 TraceCheckUtils]: 64: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 18:54:37,472 INFO L273 TraceCheckUtils]: 65: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:54:37,472 INFO L273 TraceCheckUtils]: 66: Hoare triple {2616#false} assume !(~i~0 < 10000); {2616#false} is VALID [2018-11-14 18:54:37,472 INFO L273 TraceCheckUtils]: 67: Hoare triple {2616#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2616#false} is VALID [2018-11-14 18:54:37,472 INFO L273 TraceCheckUtils]: 68: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:54:37,472 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {2616#false} {2616#false} #77#return; {2616#false} is VALID [2018-11-14 18:54:37,473 INFO L273 TraceCheckUtils]: 70: Hoare triple {2616#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2616#false} is VALID [2018-11-14 18:54:37,473 INFO L273 TraceCheckUtils]: 71: Hoare triple {2616#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2616#false} is VALID [2018-11-14 18:54:37,473 INFO L273 TraceCheckUtils]: 72: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2018-11-14 18:54:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 46 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-14 18:54:37,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:37,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-14 18:54:37,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-11-14 18:54:37,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:37,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:54:37,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:37,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:54:37,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:54:37,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:54:37,676 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 11 states. [2018-11-14 18:54:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:38,467 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2018-11-14 18:54:38,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:54:38,467 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-11-14 18:54:38,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:54:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-14 18:54:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:54:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-14 18:54:38,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 88 transitions. [2018-11-14 18:54:38,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:38,558 INFO L225 Difference]: With dead ends: 85 [2018-11-14 18:54:38,559 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 18:54:38,559 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:54:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 18:54:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-14 18:54:38,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:38,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-14 18:54:38,625 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-14 18:54:38,625 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-14 18:54:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:38,628 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 18:54:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 18:54:38,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:38,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:38,628 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-14 18:54:38,629 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-14 18:54:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:38,631 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 18:54:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 18:54:38,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:38,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:38,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:38,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 18:54:38,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-14 18:54:38,634 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 73 [2018-11-14 18:54:38,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:38,634 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-14 18:54:38,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:54:38,635 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-14 18:54:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-14 18:54:38,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:38,636 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 7, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:38,636 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:38,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:38,636 INFO L82 PathProgramCache]: Analyzing trace with hash -335328825, now seen corresponding path program 6 times [2018-11-14 18:54:38,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:38,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:38,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:38,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:38,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:38,956 INFO L256 TraceCheckUtils]: 0: Hoare triple {3152#true} call ULTIMATE.init(); {3152#true} is VALID [2018-11-14 18:54:38,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {3152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3152#true} is VALID [2018-11-14 18:54:38,957 INFO L273 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,957 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #69#return; {3152#true} is VALID [2018-11-14 18:54:38,958 INFO L256 TraceCheckUtils]: 4: Hoare triple {3152#true} call #t~ret13 := main(); {3152#true} is VALID [2018-11-14 18:54:38,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {3152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3154#(= main_~i~1 0)} is VALID [2018-11-14 18:54:38,959 INFO L273 TraceCheckUtils]: 6: Hoare triple {3154#(= main_~i~1 0)} assume true; {3154#(= main_~i~1 0)} is VALID [2018-11-14 18:54:38,959 INFO L273 TraceCheckUtils]: 7: Hoare triple {3154#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3154#(= main_~i~1 0)} is VALID [2018-11-14 18:54:38,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {3154#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3155#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:38,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {3155#(<= main_~i~1 1)} assume true; {3155#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:38,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {3155#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3155#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:38,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {3155#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3156#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:38,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {3156#(<= main_~i~1 2)} assume true; {3156#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:38,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {3156#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3156#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:38,962 INFO L273 TraceCheckUtils]: 14: Hoare triple {3156#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3157#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:38,962 INFO L273 TraceCheckUtils]: 15: Hoare triple {3157#(<= main_~i~1 3)} assume true; {3157#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:38,963 INFO L273 TraceCheckUtils]: 16: Hoare triple {3157#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3157#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:38,963 INFO L273 TraceCheckUtils]: 17: Hoare triple {3157#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3158#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:38,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {3158#(<= main_~i~1 4)} assume true; {3158#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:38,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {3158#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3158#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:38,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {3158#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3159#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:38,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {3159#(<= main_~i~1 5)} assume true; {3159#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:38,966 INFO L273 TraceCheckUtils]: 22: Hoare triple {3159#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3159#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:38,967 INFO L273 TraceCheckUtils]: 23: Hoare triple {3159#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3160#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:38,968 INFO L273 TraceCheckUtils]: 24: Hoare triple {3160#(<= main_~i~1 6)} assume true; {3160#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:38,968 INFO L273 TraceCheckUtils]: 25: Hoare triple {3160#(<= main_~i~1 6)} assume !(~i~1 < 10000); {3153#false} is VALID [2018-11-14 18:54:38,968 INFO L256 TraceCheckUtils]: 26: Hoare triple {3153#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 18:54:38,969 INFO L273 TraceCheckUtils]: 27: Hoare triple {3152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 18:54:38,969 INFO L273 TraceCheckUtils]: 28: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,969 INFO L273 TraceCheckUtils]: 29: Hoare triple {3152#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:54:38,969 INFO L273 TraceCheckUtils]: 30: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:54:38,969 INFO L273 TraceCheckUtils]: 31: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,970 INFO L273 TraceCheckUtils]: 32: Hoare triple {3152#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:54:38,970 INFO L273 TraceCheckUtils]: 33: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:54:38,970 INFO L273 TraceCheckUtils]: 34: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,970 INFO L273 TraceCheckUtils]: 35: Hoare triple {3152#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:54:38,970 INFO L273 TraceCheckUtils]: 36: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:54:38,970 INFO L273 TraceCheckUtils]: 37: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,971 INFO L273 TraceCheckUtils]: 38: Hoare triple {3152#true} assume !(~i~0 < 10000); {3152#true} is VALID [2018-11-14 18:54:38,971 INFO L273 TraceCheckUtils]: 39: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 18:54:38,971 INFO L273 TraceCheckUtils]: 40: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,971 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3152#true} {3153#false} #73#return; {3153#false} is VALID [2018-11-14 18:54:38,971 INFO L273 TraceCheckUtils]: 42: Hoare triple {3153#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3153#false} is VALID [2018-11-14 18:54:38,971 INFO L256 TraceCheckUtils]: 43: Hoare triple {3153#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 18:54:38,971 INFO L273 TraceCheckUtils]: 44: Hoare triple {3152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 18:54:38,971 INFO L273 TraceCheckUtils]: 45: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,972 INFO L273 TraceCheckUtils]: 46: Hoare triple {3152#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:54:38,972 INFO L273 TraceCheckUtils]: 47: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:54:38,972 INFO L273 TraceCheckUtils]: 48: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,972 INFO L273 TraceCheckUtils]: 49: Hoare triple {3152#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:54:38,972 INFO L273 TraceCheckUtils]: 50: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:54:38,972 INFO L273 TraceCheckUtils]: 51: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,972 INFO L273 TraceCheckUtils]: 52: Hoare triple {3152#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:54:38,972 INFO L273 TraceCheckUtils]: 53: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:54:38,972 INFO L273 TraceCheckUtils]: 54: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,973 INFO L273 TraceCheckUtils]: 55: Hoare triple {3152#true} assume !(~i~0 < 10000); {3152#true} is VALID [2018-11-14 18:54:38,973 INFO L273 TraceCheckUtils]: 56: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 18:54:38,973 INFO L273 TraceCheckUtils]: 57: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,973 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3152#true} {3153#false} #75#return; {3153#false} is VALID [2018-11-14 18:54:38,973 INFO L273 TraceCheckUtils]: 59: Hoare triple {3153#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3153#false} is VALID [2018-11-14 18:54:38,973 INFO L273 TraceCheckUtils]: 60: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 18:54:38,973 INFO L273 TraceCheckUtils]: 61: Hoare triple {3153#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3153#false} is VALID [2018-11-14 18:54:38,973 INFO L273 TraceCheckUtils]: 62: Hoare triple {3153#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3153#false} is VALID [2018-11-14 18:54:38,974 INFO L273 TraceCheckUtils]: 63: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 18:54:38,974 INFO L273 TraceCheckUtils]: 64: Hoare triple {3153#false} assume !(~i~2 < 9999); {3153#false} is VALID [2018-11-14 18:54:38,974 INFO L273 TraceCheckUtils]: 65: Hoare triple {3153#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {3153#false} is VALID [2018-11-14 18:54:38,974 INFO L256 TraceCheckUtils]: 66: Hoare triple {3153#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 18:54:38,974 INFO L273 TraceCheckUtils]: 67: Hoare triple {3152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 18:54:38,974 INFO L273 TraceCheckUtils]: 68: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,974 INFO L273 TraceCheckUtils]: 69: Hoare triple {3152#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:54:38,974 INFO L273 TraceCheckUtils]: 70: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:54:38,975 INFO L273 TraceCheckUtils]: 71: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,975 INFO L273 TraceCheckUtils]: 72: Hoare triple {3152#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:54:38,975 INFO L273 TraceCheckUtils]: 73: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:54:38,975 INFO L273 TraceCheckUtils]: 74: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,975 INFO L273 TraceCheckUtils]: 75: Hoare triple {3152#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:54:38,975 INFO L273 TraceCheckUtils]: 76: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:54:38,975 INFO L273 TraceCheckUtils]: 77: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,975 INFO L273 TraceCheckUtils]: 78: Hoare triple {3152#true} assume !(~i~0 < 10000); {3152#true} is VALID [2018-11-14 18:54:38,976 INFO L273 TraceCheckUtils]: 79: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 18:54:38,976 INFO L273 TraceCheckUtils]: 80: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:38,976 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {3152#true} {3153#false} #77#return; {3153#false} is VALID [2018-11-14 18:54:38,976 INFO L273 TraceCheckUtils]: 82: Hoare triple {3153#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3153#false} is VALID [2018-11-14 18:54:38,976 INFO L273 TraceCheckUtils]: 83: Hoare triple {3153#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3153#false} is VALID [2018-11-14 18:54:38,976 INFO L273 TraceCheckUtils]: 84: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2018-11-14 18:54:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-14 18:54:38,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:38,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:38,988 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:54:39,083 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-14 18:54:39,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:39,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:39,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {3152#true} call ULTIMATE.init(); {3152#true} is VALID [2018-11-14 18:54:39,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {3152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3152#true} is VALID [2018-11-14 18:54:39,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,262 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #69#return; {3152#true} is VALID [2018-11-14 18:54:39,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {3152#true} call #t~ret13 := main(); {3152#true} is VALID [2018-11-14 18:54:39,263 INFO L273 TraceCheckUtils]: 5: Hoare triple {3152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3152#true} is VALID [2018-11-14 18:54:39,263 INFO L273 TraceCheckUtils]: 6: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,263 INFO L273 TraceCheckUtils]: 7: Hoare triple {3152#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 18:54:39,263 INFO L273 TraceCheckUtils]: 8: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 18:54:39,264 INFO L273 TraceCheckUtils]: 9: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,264 INFO L273 TraceCheckUtils]: 10: Hoare triple {3152#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 18:54:39,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 18:54:39,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {3152#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 18:54:39,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 18:54:39,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,265 INFO L273 TraceCheckUtils]: 16: Hoare triple {3152#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 18:54:39,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 18:54:39,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {3152#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 18:54:39,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 18:54:39,266 INFO L273 TraceCheckUtils]: 21: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,266 INFO L273 TraceCheckUtils]: 22: Hoare triple {3152#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 18:54:39,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 18:54:39,266 INFO L273 TraceCheckUtils]: 24: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,266 INFO L273 TraceCheckUtils]: 25: Hoare triple {3152#true} assume !(~i~1 < 10000); {3152#true} is VALID [2018-11-14 18:54:39,266 INFO L256 TraceCheckUtils]: 26: Hoare triple {3152#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 18:54:39,267 INFO L273 TraceCheckUtils]: 27: Hoare triple {3152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 18:54:39,267 INFO L273 TraceCheckUtils]: 28: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,267 INFO L273 TraceCheckUtils]: 29: Hoare triple {3152#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:54:39,267 INFO L273 TraceCheckUtils]: 30: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:54:39,267 INFO L273 TraceCheckUtils]: 31: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,267 INFO L273 TraceCheckUtils]: 32: Hoare triple {3152#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:54:39,267 INFO L273 TraceCheckUtils]: 33: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:54:39,268 INFO L273 TraceCheckUtils]: 34: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,268 INFO L273 TraceCheckUtils]: 35: Hoare triple {3152#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:54:39,268 INFO L273 TraceCheckUtils]: 36: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:54:39,268 INFO L273 TraceCheckUtils]: 37: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,268 INFO L273 TraceCheckUtils]: 38: Hoare triple {3152#true} assume !(~i~0 < 10000); {3152#true} is VALID [2018-11-14 18:54:39,268 INFO L273 TraceCheckUtils]: 39: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 18:54:39,268 INFO L273 TraceCheckUtils]: 40: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,268 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3152#true} {3152#true} #73#return; {3152#true} is VALID [2018-11-14 18:54:39,269 INFO L273 TraceCheckUtils]: 42: Hoare triple {3152#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3152#true} is VALID [2018-11-14 18:54:39,269 INFO L256 TraceCheckUtils]: 43: Hoare triple {3152#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 18:54:39,269 INFO L273 TraceCheckUtils]: 44: Hoare triple {3152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 18:54:39,269 INFO L273 TraceCheckUtils]: 45: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,269 INFO L273 TraceCheckUtils]: 46: Hoare triple {3152#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:54:39,269 INFO L273 TraceCheckUtils]: 47: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:54:39,269 INFO L273 TraceCheckUtils]: 48: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,269 INFO L273 TraceCheckUtils]: 49: Hoare triple {3152#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:54:39,269 INFO L273 TraceCheckUtils]: 50: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:54:39,270 INFO L273 TraceCheckUtils]: 51: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,270 INFO L273 TraceCheckUtils]: 52: Hoare triple {3152#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:54:39,270 INFO L273 TraceCheckUtils]: 53: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:54:39,270 INFO L273 TraceCheckUtils]: 54: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,270 INFO L273 TraceCheckUtils]: 55: Hoare triple {3152#true} assume !(~i~0 < 10000); {3152#true} is VALID [2018-11-14 18:54:39,270 INFO L273 TraceCheckUtils]: 56: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 18:54:39,270 INFO L273 TraceCheckUtils]: 57: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:54:39,270 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3152#true} {3152#true} #75#return; {3152#true} is VALID [2018-11-14 18:54:39,271 INFO L273 TraceCheckUtils]: 59: Hoare triple {3152#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3341#(<= main_~i~2 0)} is VALID [2018-11-14 18:54:39,272 INFO L273 TraceCheckUtils]: 60: Hoare triple {3341#(<= main_~i~2 0)} assume true; {3341#(<= main_~i~2 0)} is VALID [2018-11-14 18:54:39,272 INFO L273 TraceCheckUtils]: 61: Hoare triple {3341#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3341#(<= main_~i~2 0)} is VALID [2018-11-14 18:54:39,274 INFO L273 TraceCheckUtils]: 62: Hoare triple {3341#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3351#(<= main_~i~2 1)} is VALID [2018-11-14 18:54:39,274 INFO L273 TraceCheckUtils]: 63: Hoare triple {3351#(<= main_~i~2 1)} assume true; {3351#(<= main_~i~2 1)} is VALID [2018-11-14 18:54:39,276 INFO L273 TraceCheckUtils]: 64: Hoare triple {3351#(<= main_~i~2 1)} assume !(~i~2 < 9999); {3153#false} is VALID [2018-11-14 18:54:39,276 INFO L273 TraceCheckUtils]: 65: Hoare triple {3153#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {3153#false} is VALID [2018-11-14 18:54:39,276 INFO L256 TraceCheckUtils]: 66: Hoare triple {3153#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {3153#false} is VALID [2018-11-14 18:54:39,276 INFO L273 TraceCheckUtils]: 67: Hoare triple {3153#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3153#false} is VALID [2018-11-14 18:54:39,276 INFO L273 TraceCheckUtils]: 68: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 18:54:39,276 INFO L273 TraceCheckUtils]: 69: Hoare triple {3153#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3153#false} is VALID [2018-11-14 18:54:39,276 INFO L273 TraceCheckUtils]: 70: Hoare triple {3153#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3153#false} is VALID [2018-11-14 18:54:39,277 INFO L273 TraceCheckUtils]: 71: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 18:54:39,277 INFO L273 TraceCheckUtils]: 72: Hoare triple {3153#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3153#false} is VALID [2018-11-14 18:54:39,277 INFO L273 TraceCheckUtils]: 73: Hoare triple {3153#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3153#false} is VALID [2018-11-14 18:54:39,277 INFO L273 TraceCheckUtils]: 74: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 18:54:39,277 INFO L273 TraceCheckUtils]: 75: Hoare triple {3153#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3153#false} is VALID [2018-11-14 18:54:39,277 INFO L273 TraceCheckUtils]: 76: Hoare triple {3153#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3153#false} is VALID [2018-11-14 18:54:39,277 INFO L273 TraceCheckUtils]: 77: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 18:54:39,278 INFO L273 TraceCheckUtils]: 78: Hoare triple {3153#false} assume !(~i~0 < 10000); {3153#false} is VALID [2018-11-14 18:54:39,278 INFO L273 TraceCheckUtils]: 79: Hoare triple {3153#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3153#false} is VALID [2018-11-14 18:54:39,278 INFO L273 TraceCheckUtils]: 80: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 18:54:39,278 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {3153#false} {3153#false} #77#return; {3153#false} is VALID [2018-11-14 18:54:39,278 INFO L273 TraceCheckUtils]: 82: Hoare triple {3153#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3153#false} is VALID [2018-11-14 18:54:39,278 INFO L273 TraceCheckUtils]: 83: Hoare triple {3153#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3153#false} is VALID [2018-11-14 18:54:39,279 INFO L273 TraceCheckUtils]: 84: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2018-11-14 18:54:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-14 18:54:39,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:39,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-14 18:54:39,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-14 18:54:39,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:39,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:54:39,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:39,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:54:39,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:54:39,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:54:39,423 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 11 states. [2018-11-14 18:54:39,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:39,772 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-14 18:54:39,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:54:39,772 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-14 18:54:39,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:54:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-14 18:54:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:54:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-14 18:54:39,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 85 transitions. [2018-11-14 18:54:39,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:39,866 INFO L225 Difference]: With dead ends: 94 [2018-11-14 18:54:39,866 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 18:54:39,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:54:39,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 18:54:39,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-14 18:54:39,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:39,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 62 states. [2018-11-14 18:54:39,902 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 62 states. [2018-11-14 18:54:39,902 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 62 states. [2018-11-14 18:54:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:39,904 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-14 18:54:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-14 18:54:39,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:39,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:39,904 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 64 states. [2018-11-14 18:54:39,904 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 64 states. [2018-11-14 18:54:39,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:39,906 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-14 18:54:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-14 18:54:39,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:39,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:39,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:39,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 18:54:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-11-14 18:54:39,909 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 85 [2018-11-14 18:54:39,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:39,909 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-11-14 18:54:39,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:54:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-14 18:54:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-14 18:54:39,911 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:39,911 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 8, 7, 7, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:39,911 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:39,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:39,912 INFO L82 PathProgramCache]: Analyzing trace with hash 318027935, now seen corresponding path program 7 times [2018-11-14 18:54:39,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:39,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:39,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:39,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:39,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:40,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {3757#true} call ULTIMATE.init(); {3757#true} is VALID [2018-11-14 18:54:40,098 INFO L273 TraceCheckUtils]: 1: Hoare triple {3757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3757#true} is VALID [2018-11-14 18:54:40,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3757#true} {3757#true} #69#return; {3757#true} is VALID [2018-11-14 18:54:40,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {3757#true} call #t~ret13 := main(); {3757#true} is VALID [2018-11-14 18:54:40,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {3757#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3759#(= main_~i~1 0)} is VALID [2018-11-14 18:54:40,100 INFO L273 TraceCheckUtils]: 6: Hoare triple {3759#(= main_~i~1 0)} assume true; {3759#(= main_~i~1 0)} is VALID [2018-11-14 18:54:40,100 INFO L273 TraceCheckUtils]: 7: Hoare triple {3759#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3759#(= main_~i~1 0)} is VALID [2018-11-14 18:54:40,101 INFO L273 TraceCheckUtils]: 8: Hoare triple {3759#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:40,101 INFO L273 TraceCheckUtils]: 9: Hoare triple {3760#(<= main_~i~1 1)} assume true; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:40,101 INFO L273 TraceCheckUtils]: 10: Hoare triple {3760#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:40,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {3760#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:40,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {3761#(<= main_~i~1 2)} assume true; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:40,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {3761#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:40,103 INFO L273 TraceCheckUtils]: 14: Hoare triple {3761#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:40,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {3762#(<= main_~i~1 3)} assume true; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:40,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {3762#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:40,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {3762#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:40,106 INFO L273 TraceCheckUtils]: 18: Hoare triple {3763#(<= main_~i~1 4)} assume true; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:40,106 INFO L273 TraceCheckUtils]: 19: Hoare triple {3763#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:40,107 INFO L273 TraceCheckUtils]: 20: Hoare triple {3763#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:40,107 INFO L273 TraceCheckUtils]: 21: Hoare triple {3764#(<= main_~i~1 5)} assume true; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:40,108 INFO L273 TraceCheckUtils]: 22: Hoare triple {3764#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:40,109 INFO L273 TraceCheckUtils]: 23: Hoare triple {3764#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:40,109 INFO L273 TraceCheckUtils]: 24: Hoare triple {3765#(<= main_~i~1 6)} assume true; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:40,110 INFO L273 TraceCheckUtils]: 25: Hoare triple {3765#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:40,111 INFO L273 TraceCheckUtils]: 26: Hoare triple {3765#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:40,111 INFO L273 TraceCheckUtils]: 27: Hoare triple {3766#(<= main_~i~1 7)} assume true; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:40,112 INFO L273 TraceCheckUtils]: 28: Hoare triple {3766#(<= main_~i~1 7)} assume !(~i~1 < 10000); {3758#false} is VALID [2018-11-14 18:54:40,112 INFO L256 TraceCheckUtils]: 29: Hoare triple {3758#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {3757#true} is VALID [2018-11-14 18:54:40,112 INFO L273 TraceCheckUtils]: 30: Hoare triple {3757#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3757#true} is VALID [2018-11-14 18:54:40,112 INFO L273 TraceCheckUtils]: 31: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,113 INFO L273 TraceCheckUtils]: 32: Hoare triple {3757#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:54:40,113 INFO L273 TraceCheckUtils]: 33: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:54:40,113 INFO L273 TraceCheckUtils]: 34: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,113 INFO L273 TraceCheckUtils]: 35: Hoare triple {3757#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:54:40,113 INFO L273 TraceCheckUtils]: 36: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:54:40,114 INFO L273 TraceCheckUtils]: 37: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,114 INFO L273 TraceCheckUtils]: 38: Hoare triple {3757#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:54:40,114 INFO L273 TraceCheckUtils]: 39: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:54:40,114 INFO L273 TraceCheckUtils]: 40: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,114 INFO L273 TraceCheckUtils]: 41: Hoare triple {3757#true} assume !(~i~0 < 10000); {3757#true} is VALID [2018-11-14 18:54:40,115 INFO L273 TraceCheckUtils]: 42: Hoare triple {3757#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3757#true} is VALID [2018-11-14 18:54:40,115 INFO L273 TraceCheckUtils]: 43: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,115 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3757#true} {3758#false} #73#return; {3758#false} is VALID [2018-11-14 18:54:40,115 INFO L273 TraceCheckUtils]: 45: Hoare triple {3758#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3758#false} is VALID [2018-11-14 18:54:40,116 INFO L256 TraceCheckUtils]: 46: Hoare triple {3758#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {3757#true} is VALID [2018-11-14 18:54:40,116 INFO L273 TraceCheckUtils]: 47: Hoare triple {3757#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3757#true} is VALID [2018-11-14 18:54:40,116 INFO L273 TraceCheckUtils]: 48: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,116 INFO L273 TraceCheckUtils]: 49: Hoare triple {3757#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:54:40,116 INFO L273 TraceCheckUtils]: 50: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:54:40,116 INFO L273 TraceCheckUtils]: 51: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,117 INFO L273 TraceCheckUtils]: 52: Hoare triple {3757#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:54:40,117 INFO L273 TraceCheckUtils]: 53: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:54:40,117 INFO L273 TraceCheckUtils]: 54: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,117 INFO L273 TraceCheckUtils]: 55: Hoare triple {3757#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:54:40,117 INFO L273 TraceCheckUtils]: 56: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:54:40,117 INFO L273 TraceCheckUtils]: 57: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,117 INFO L273 TraceCheckUtils]: 58: Hoare triple {3757#true} assume !(~i~0 < 10000); {3757#true} is VALID [2018-11-14 18:54:40,117 INFO L273 TraceCheckUtils]: 59: Hoare triple {3757#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3757#true} is VALID [2018-11-14 18:54:40,117 INFO L273 TraceCheckUtils]: 60: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,118 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3757#true} {3758#false} #75#return; {3758#false} is VALID [2018-11-14 18:54:40,118 INFO L273 TraceCheckUtils]: 62: Hoare triple {3758#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3758#false} is VALID [2018-11-14 18:54:40,118 INFO L273 TraceCheckUtils]: 63: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,118 INFO L273 TraceCheckUtils]: 64: Hoare triple {3758#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 18:54:40,118 INFO L273 TraceCheckUtils]: 65: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 18:54:40,118 INFO L273 TraceCheckUtils]: 66: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,118 INFO L273 TraceCheckUtils]: 67: Hoare triple {3758#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 18:54:40,118 INFO L273 TraceCheckUtils]: 68: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 18:54:40,119 INFO L273 TraceCheckUtils]: 69: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,119 INFO L273 TraceCheckUtils]: 70: Hoare triple {3758#false} assume !(~i~2 < 9999); {3758#false} is VALID [2018-11-14 18:54:40,119 INFO L273 TraceCheckUtils]: 71: Hoare triple {3758#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {3758#false} is VALID [2018-11-14 18:54:40,119 INFO L256 TraceCheckUtils]: 72: Hoare triple {3758#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {3757#true} is VALID [2018-11-14 18:54:40,119 INFO L273 TraceCheckUtils]: 73: Hoare triple {3757#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3757#true} is VALID [2018-11-14 18:54:40,119 INFO L273 TraceCheckUtils]: 74: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,119 INFO L273 TraceCheckUtils]: 75: Hoare triple {3757#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:54:40,119 INFO L273 TraceCheckUtils]: 76: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:54:40,120 INFO L273 TraceCheckUtils]: 77: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,120 INFO L273 TraceCheckUtils]: 78: Hoare triple {3757#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:54:40,120 INFO L273 TraceCheckUtils]: 79: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:54:40,120 INFO L273 TraceCheckUtils]: 80: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,120 INFO L273 TraceCheckUtils]: 81: Hoare triple {3757#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:54:40,120 INFO L273 TraceCheckUtils]: 82: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:54:40,120 INFO L273 TraceCheckUtils]: 83: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,120 INFO L273 TraceCheckUtils]: 84: Hoare triple {3757#true} assume !(~i~0 < 10000); {3757#true} is VALID [2018-11-14 18:54:40,120 INFO L273 TraceCheckUtils]: 85: Hoare triple {3757#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3757#true} is VALID [2018-11-14 18:54:40,121 INFO L273 TraceCheckUtils]: 86: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,121 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3757#true} {3758#false} #77#return; {3758#false} is VALID [2018-11-14 18:54:40,121 INFO L273 TraceCheckUtils]: 88: Hoare triple {3758#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3758#false} is VALID [2018-11-14 18:54:40,121 INFO L273 TraceCheckUtils]: 89: Hoare triple {3758#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3758#false} is VALID [2018-11-14 18:54:40,121 INFO L273 TraceCheckUtils]: 90: Hoare triple {3758#false} assume !false; {3758#false} is VALID [2018-11-14 18:54:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 18:54:40,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:40,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:40,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:40,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:40,518 INFO L256 TraceCheckUtils]: 0: Hoare triple {3757#true} call ULTIMATE.init(); {3757#true} is VALID [2018-11-14 18:54:40,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {3757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3757#true} is VALID [2018-11-14 18:54:40,518 INFO L273 TraceCheckUtils]: 2: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:54:40,518 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3757#true} {3757#true} #69#return; {3757#true} is VALID [2018-11-14 18:54:40,519 INFO L256 TraceCheckUtils]: 4: Hoare triple {3757#true} call #t~ret13 := main(); {3757#true} is VALID [2018-11-14 18:54:40,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {3757#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3785#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:40,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {3785#(<= main_~i~1 0)} assume true; {3785#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:40,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {3785#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3785#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:40,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {3785#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:40,526 INFO L273 TraceCheckUtils]: 9: Hoare triple {3760#(<= main_~i~1 1)} assume true; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:40,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {3760#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:40,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {3760#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:40,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {3761#(<= main_~i~1 2)} assume true; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:40,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {3761#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:40,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {3761#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:40,532 INFO L273 TraceCheckUtils]: 15: Hoare triple {3762#(<= main_~i~1 3)} assume true; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:40,532 INFO L273 TraceCheckUtils]: 16: Hoare triple {3762#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:40,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {3762#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:40,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {3763#(<= main_~i~1 4)} assume true; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:40,537 INFO L273 TraceCheckUtils]: 19: Hoare triple {3763#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:40,537 INFO L273 TraceCheckUtils]: 20: Hoare triple {3763#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:40,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {3764#(<= main_~i~1 5)} assume true; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:40,539 INFO L273 TraceCheckUtils]: 22: Hoare triple {3764#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:40,541 INFO L273 TraceCheckUtils]: 23: Hoare triple {3764#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:40,541 INFO L273 TraceCheckUtils]: 24: Hoare triple {3765#(<= main_~i~1 6)} assume true; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:40,543 INFO L273 TraceCheckUtils]: 25: Hoare triple {3765#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:40,543 INFO L273 TraceCheckUtils]: 26: Hoare triple {3765#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:40,545 INFO L273 TraceCheckUtils]: 27: Hoare triple {3766#(<= main_~i~1 7)} assume true; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:40,545 INFO L273 TraceCheckUtils]: 28: Hoare triple {3766#(<= main_~i~1 7)} assume !(~i~1 < 10000); {3758#false} is VALID [2018-11-14 18:54:40,545 INFO L256 TraceCheckUtils]: 29: Hoare triple {3758#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {3758#false} is VALID [2018-11-14 18:54:40,545 INFO L273 TraceCheckUtils]: 30: Hoare triple {3758#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3758#false} is VALID [2018-11-14 18:54:40,545 INFO L273 TraceCheckUtils]: 31: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,546 INFO L273 TraceCheckUtils]: 32: Hoare triple {3758#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:54:40,546 INFO L273 TraceCheckUtils]: 33: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:54:40,546 INFO L273 TraceCheckUtils]: 34: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,546 INFO L273 TraceCheckUtils]: 35: Hoare triple {3758#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:54:40,546 INFO L273 TraceCheckUtils]: 36: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:54:40,546 INFO L273 TraceCheckUtils]: 37: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,546 INFO L273 TraceCheckUtils]: 38: Hoare triple {3758#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:54:40,546 INFO L273 TraceCheckUtils]: 39: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:54:40,547 INFO L273 TraceCheckUtils]: 40: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,547 INFO L273 TraceCheckUtils]: 41: Hoare triple {3758#false} assume !(~i~0 < 10000); {3758#false} is VALID [2018-11-14 18:54:40,547 INFO L273 TraceCheckUtils]: 42: Hoare triple {3758#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3758#false} is VALID [2018-11-14 18:54:40,547 INFO L273 TraceCheckUtils]: 43: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,547 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3758#false} {3758#false} #73#return; {3758#false} is VALID [2018-11-14 18:54:40,547 INFO L273 TraceCheckUtils]: 45: Hoare triple {3758#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3758#false} is VALID [2018-11-14 18:54:40,547 INFO L256 TraceCheckUtils]: 46: Hoare triple {3758#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {3758#false} is VALID [2018-11-14 18:54:40,547 INFO L273 TraceCheckUtils]: 47: Hoare triple {3758#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3758#false} is VALID [2018-11-14 18:54:40,547 INFO L273 TraceCheckUtils]: 48: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,548 INFO L273 TraceCheckUtils]: 49: Hoare triple {3758#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:54:40,548 INFO L273 TraceCheckUtils]: 50: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:54:40,548 INFO L273 TraceCheckUtils]: 51: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,548 INFO L273 TraceCheckUtils]: 52: Hoare triple {3758#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:54:40,548 INFO L273 TraceCheckUtils]: 53: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:54:40,548 INFO L273 TraceCheckUtils]: 54: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,548 INFO L273 TraceCheckUtils]: 55: Hoare triple {3758#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:54:40,548 INFO L273 TraceCheckUtils]: 56: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:54:40,549 INFO L273 TraceCheckUtils]: 57: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,549 INFO L273 TraceCheckUtils]: 58: Hoare triple {3758#false} assume !(~i~0 < 10000); {3758#false} is VALID [2018-11-14 18:54:40,549 INFO L273 TraceCheckUtils]: 59: Hoare triple {3758#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3758#false} is VALID [2018-11-14 18:54:40,549 INFO L273 TraceCheckUtils]: 60: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,549 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3758#false} {3758#false} #75#return; {3758#false} is VALID [2018-11-14 18:54:40,549 INFO L273 TraceCheckUtils]: 62: Hoare triple {3758#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3758#false} is VALID [2018-11-14 18:54:40,549 INFO L273 TraceCheckUtils]: 63: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,549 INFO L273 TraceCheckUtils]: 64: Hoare triple {3758#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 18:54:40,550 INFO L273 TraceCheckUtils]: 65: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 18:54:40,550 INFO L273 TraceCheckUtils]: 66: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,550 INFO L273 TraceCheckUtils]: 67: Hoare triple {3758#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 18:54:40,550 INFO L273 TraceCheckUtils]: 68: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 18:54:40,550 INFO L273 TraceCheckUtils]: 69: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,550 INFO L273 TraceCheckUtils]: 70: Hoare triple {3758#false} assume !(~i~2 < 9999); {3758#false} is VALID [2018-11-14 18:54:40,550 INFO L273 TraceCheckUtils]: 71: Hoare triple {3758#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {3758#false} is VALID [2018-11-14 18:54:40,550 INFO L256 TraceCheckUtils]: 72: Hoare triple {3758#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {3758#false} is VALID [2018-11-14 18:54:40,550 INFO L273 TraceCheckUtils]: 73: Hoare triple {3758#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3758#false} is VALID [2018-11-14 18:54:40,551 INFO L273 TraceCheckUtils]: 74: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,551 INFO L273 TraceCheckUtils]: 75: Hoare triple {3758#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:54:40,551 INFO L273 TraceCheckUtils]: 76: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:54:40,551 INFO L273 TraceCheckUtils]: 77: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,551 INFO L273 TraceCheckUtils]: 78: Hoare triple {3758#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:54:40,551 INFO L273 TraceCheckUtils]: 79: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:54:40,551 INFO L273 TraceCheckUtils]: 80: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,551 INFO L273 TraceCheckUtils]: 81: Hoare triple {3758#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:54:40,552 INFO L273 TraceCheckUtils]: 82: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:54:40,552 INFO L273 TraceCheckUtils]: 83: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,552 INFO L273 TraceCheckUtils]: 84: Hoare triple {3758#false} assume !(~i~0 < 10000); {3758#false} is VALID [2018-11-14 18:54:40,552 INFO L273 TraceCheckUtils]: 85: Hoare triple {3758#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3758#false} is VALID [2018-11-14 18:54:40,552 INFO L273 TraceCheckUtils]: 86: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:54:40,552 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3758#false} {3758#false} #77#return; {3758#false} is VALID [2018-11-14 18:54:40,552 INFO L273 TraceCheckUtils]: 88: Hoare triple {3758#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3758#false} is VALID [2018-11-14 18:54:40,552 INFO L273 TraceCheckUtils]: 89: Hoare triple {3758#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3758#false} is VALID [2018-11-14 18:54:40,553 INFO L273 TraceCheckUtils]: 90: Hoare triple {3758#false} assume !false; {3758#false} is VALID [2018-11-14 18:54:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 18:54:40,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:40,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 18:54:40,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-11-14 18:54:40,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:40,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:54:40,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:40,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:54:40,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:54:40,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:54:40,679 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 11 states. [2018-11-14 18:54:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:41,030 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-11-14 18:54:41,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:54:41,030 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-11-14 18:54:41,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:54:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-14 18:54:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:54:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-14 18:54:41,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2018-11-14 18:54:41,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:41,116 INFO L225 Difference]: With dead ends: 99 [2018-11-14 18:54:41,117 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 18:54:41,117 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:54:41,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 18:54:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-14 18:54:41,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:41,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-14 18:54:41,206 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-14 18:54:41,206 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-14 18:54:41,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:41,207 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 18:54:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 18:54:41,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:41,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:41,208 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-14 18:54:41,208 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-14 18:54:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:41,209 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 18:54:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 18:54:41,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:41,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:41,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:41,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 18:54:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-14 18:54:41,212 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 91 [2018-11-14 18:54:41,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:41,212 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-14 18:54:41,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:54:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-14 18:54:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-14 18:54:41,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:41,213 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 8, 8, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:41,214 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:41,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:41,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1006612453, now seen corresponding path program 8 times [2018-11-14 18:54:41,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:41,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:41,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:41,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:41,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:41,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {4395#true} call ULTIMATE.init(); {4395#true} is VALID [2018-11-14 18:54:41,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {4395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4395#true} is VALID [2018-11-14 18:54:41,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4395#true} {4395#true} #69#return; {4395#true} is VALID [2018-11-14 18:54:41,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {4395#true} call #t~ret13 := main(); {4395#true} is VALID [2018-11-14 18:54:41,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {4395#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4397#(= main_~i~1 0)} is VALID [2018-11-14 18:54:41,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {4397#(= main_~i~1 0)} assume true; {4397#(= main_~i~1 0)} is VALID [2018-11-14 18:54:41,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {4397#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4397#(= main_~i~1 0)} is VALID [2018-11-14 18:54:41,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {4397#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:41,871 INFO L273 TraceCheckUtils]: 9: Hoare triple {4398#(<= main_~i~1 1)} assume true; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:41,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {4398#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:41,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {4398#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:41,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {4399#(<= main_~i~1 2)} assume true; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:41,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {4399#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:41,874 INFO L273 TraceCheckUtils]: 14: Hoare triple {4399#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:41,874 INFO L273 TraceCheckUtils]: 15: Hoare triple {4400#(<= main_~i~1 3)} assume true; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:41,875 INFO L273 TraceCheckUtils]: 16: Hoare triple {4400#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:41,876 INFO L273 TraceCheckUtils]: 17: Hoare triple {4400#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:41,876 INFO L273 TraceCheckUtils]: 18: Hoare triple {4401#(<= main_~i~1 4)} assume true; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:41,877 INFO L273 TraceCheckUtils]: 19: Hoare triple {4401#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:41,877 INFO L273 TraceCheckUtils]: 20: Hoare triple {4401#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:41,878 INFO L273 TraceCheckUtils]: 21: Hoare triple {4402#(<= main_~i~1 5)} assume true; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:41,878 INFO L273 TraceCheckUtils]: 22: Hoare triple {4402#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:41,879 INFO L273 TraceCheckUtils]: 23: Hoare triple {4402#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:41,880 INFO L273 TraceCheckUtils]: 24: Hoare triple {4403#(<= main_~i~1 6)} assume true; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:41,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {4403#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:41,881 INFO L273 TraceCheckUtils]: 26: Hoare triple {4403#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:41,882 INFO L273 TraceCheckUtils]: 27: Hoare triple {4404#(<= main_~i~1 7)} assume true; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:41,882 INFO L273 TraceCheckUtils]: 28: Hoare triple {4404#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:41,883 INFO L273 TraceCheckUtils]: 29: Hoare triple {4404#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:41,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {4405#(<= main_~i~1 8)} assume true; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:41,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {4405#(<= main_~i~1 8)} assume !(~i~1 < 10000); {4396#false} is VALID [2018-11-14 18:54:41,884 INFO L256 TraceCheckUtils]: 32: Hoare triple {4396#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {4395#true} is VALID [2018-11-14 18:54:41,885 INFO L273 TraceCheckUtils]: 33: Hoare triple {4395#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4395#true} is VALID [2018-11-14 18:54:41,885 INFO L273 TraceCheckUtils]: 34: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,885 INFO L273 TraceCheckUtils]: 35: Hoare triple {4395#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:54:41,885 INFO L273 TraceCheckUtils]: 36: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:54:41,885 INFO L273 TraceCheckUtils]: 37: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,886 INFO L273 TraceCheckUtils]: 38: Hoare triple {4395#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:54:41,886 INFO L273 TraceCheckUtils]: 39: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:54:41,886 INFO L273 TraceCheckUtils]: 40: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,886 INFO L273 TraceCheckUtils]: 41: Hoare triple {4395#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:54:41,886 INFO L273 TraceCheckUtils]: 42: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:54:41,887 INFO L273 TraceCheckUtils]: 43: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,887 INFO L273 TraceCheckUtils]: 44: Hoare triple {4395#true} assume !(~i~0 < 10000); {4395#true} is VALID [2018-11-14 18:54:41,887 INFO L273 TraceCheckUtils]: 45: Hoare triple {4395#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4395#true} is VALID [2018-11-14 18:54:41,887 INFO L273 TraceCheckUtils]: 46: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,887 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4395#true} {4396#false} #73#return; {4396#false} is VALID [2018-11-14 18:54:41,887 INFO L273 TraceCheckUtils]: 48: Hoare triple {4396#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {4396#false} is VALID [2018-11-14 18:54:41,887 INFO L256 TraceCheckUtils]: 49: Hoare triple {4396#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {4395#true} is VALID [2018-11-14 18:54:41,887 INFO L273 TraceCheckUtils]: 50: Hoare triple {4395#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4395#true} is VALID [2018-11-14 18:54:41,888 INFO L273 TraceCheckUtils]: 51: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,888 INFO L273 TraceCheckUtils]: 52: Hoare triple {4395#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:54:41,888 INFO L273 TraceCheckUtils]: 53: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:54:41,888 INFO L273 TraceCheckUtils]: 54: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,888 INFO L273 TraceCheckUtils]: 55: Hoare triple {4395#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:54:41,888 INFO L273 TraceCheckUtils]: 56: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:54:41,888 INFO L273 TraceCheckUtils]: 57: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,888 INFO L273 TraceCheckUtils]: 58: Hoare triple {4395#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:54:41,889 INFO L273 TraceCheckUtils]: 59: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:54:41,889 INFO L273 TraceCheckUtils]: 60: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,889 INFO L273 TraceCheckUtils]: 61: Hoare triple {4395#true} assume !(~i~0 < 10000); {4395#true} is VALID [2018-11-14 18:54:41,889 INFO L273 TraceCheckUtils]: 62: Hoare triple {4395#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4395#true} is VALID [2018-11-14 18:54:41,889 INFO L273 TraceCheckUtils]: 63: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,889 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {4395#true} {4396#false} #75#return; {4396#false} is VALID [2018-11-14 18:54:41,889 INFO L273 TraceCheckUtils]: 65: Hoare triple {4396#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4396#false} is VALID [2018-11-14 18:54:41,889 INFO L273 TraceCheckUtils]: 66: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:41,889 INFO L273 TraceCheckUtils]: 67: Hoare triple {4396#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 18:54:41,890 INFO L273 TraceCheckUtils]: 68: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 18:54:41,890 INFO L273 TraceCheckUtils]: 69: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:41,890 INFO L273 TraceCheckUtils]: 70: Hoare triple {4396#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 18:54:41,890 INFO L273 TraceCheckUtils]: 71: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 18:54:41,890 INFO L273 TraceCheckUtils]: 72: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:41,890 INFO L273 TraceCheckUtils]: 73: Hoare triple {4396#false} assume !(~i~2 < 9999); {4396#false} is VALID [2018-11-14 18:54:41,890 INFO L273 TraceCheckUtils]: 74: Hoare triple {4396#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {4396#false} is VALID [2018-11-14 18:54:41,890 INFO L256 TraceCheckUtils]: 75: Hoare triple {4396#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {4395#true} is VALID [2018-11-14 18:54:41,891 INFO L273 TraceCheckUtils]: 76: Hoare triple {4395#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4395#true} is VALID [2018-11-14 18:54:41,891 INFO L273 TraceCheckUtils]: 77: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,891 INFO L273 TraceCheckUtils]: 78: Hoare triple {4395#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:54:41,891 INFO L273 TraceCheckUtils]: 79: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:54:41,891 INFO L273 TraceCheckUtils]: 80: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,891 INFO L273 TraceCheckUtils]: 81: Hoare triple {4395#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:54:41,891 INFO L273 TraceCheckUtils]: 82: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:54:41,891 INFO L273 TraceCheckUtils]: 83: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,892 INFO L273 TraceCheckUtils]: 84: Hoare triple {4395#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:54:41,892 INFO L273 TraceCheckUtils]: 85: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:54:41,892 INFO L273 TraceCheckUtils]: 86: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,892 INFO L273 TraceCheckUtils]: 87: Hoare triple {4395#true} assume !(~i~0 < 10000); {4395#true} is VALID [2018-11-14 18:54:41,892 INFO L273 TraceCheckUtils]: 88: Hoare triple {4395#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4395#true} is VALID [2018-11-14 18:54:41,892 INFO L273 TraceCheckUtils]: 89: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:41,892 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {4395#true} {4396#false} #77#return; {4396#false} is VALID [2018-11-14 18:54:41,892 INFO L273 TraceCheckUtils]: 91: Hoare triple {4396#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4396#false} is VALID [2018-11-14 18:54:41,892 INFO L273 TraceCheckUtils]: 92: Hoare triple {4396#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4396#false} is VALID [2018-11-14 18:54:41,893 INFO L273 TraceCheckUtils]: 93: Hoare triple {4396#false} assume !false; {4396#false} is VALID [2018-11-14 18:54:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 18:54:41,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:41,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:41,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:54:41,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:54:41,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:41,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:42,115 INFO L256 TraceCheckUtils]: 0: Hoare triple {4395#true} call ULTIMATE.init(); {4395#true} is VALID [2018-11-14 18:54:42,115 INFO L273 TraceCheckUtils]: 1: Hoare triple {4395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4395#true} is VALID [2018-11-14 18:54:42,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:54:42,116 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4395#true} {4395#true} #69#return; {4395#true} is VALID [2018-11-14 18:54:42,116 INFO L256 TraceCheckUtils]: 4: Hoare triple {4395#true} call #t~ret13 := main(); {4395#true} is VALID [2018-11-14 18:54:42,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {4395#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4424#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:42,117 INFO L273 TraceCheckUtils]: 6: Hoare triple {4424#(<= main_~i~1 0)} assume true; {4424#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:42,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {4424#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4424#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:42,118 INFO L273 TraceCheckUtils]: 8: Hoare triple {4424#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:42,119 INFO L273 TraceCheckUtils]: 9: Hoare triple {4398#(<= main_~i~1 1)} assume true; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:42,119 INFO L273 TraceCheckUtils]: 10: Hoare triple {4398#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:42,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {4398#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:42,120 INFO L273 TraceCheckUtils]: 12: Hoare triple {4399#(<= main_~i~1 2)} assume true; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:42,121 INFO L273 TraceCheckUtils]: 13: Hoare triple {4399#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:42,121 INFO L273 TraceCheckUtils]: 14: Hoare triple {4399#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:42,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {4400#(<= main_~i~1 3)} assume true; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:42,123 INFO L273 TraceCheckUtils]: 16: Hoare triple {4400#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:42,123 INFO L273 TraceCheckUtils]: 17: Hoare triple {4400#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:42,124 INFO L273 TraceCheckUtils]: 18: Hoare triple {4401#(<= main_~i~1 4)} assume true; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:42,125 INFO L273 TraceCheckUtils]: 19: Hoare triple {4401#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:42,126 INFO L273 TraceCheckUtils]: 20: Hoare triple {4401#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:42,126 INFO L273 TraceCheckUtils]: 21: Hoare triple {4402#(<= main_~i~1 5)} assume true; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:42,127 INFO L273 TraceCheckUtils]: 22: Hoare triple {4402#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:42,128 INFO L273 TraceCheckUtils]: 23: Hoare triple {4402#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:42,128 INFO L273 TraceCheckUtils]: 24: Hoare triple {4403#(<= main_~i~1 6)} assume true; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:42,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {4403#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:42,130 INFO L273 TraceCheckUtils]: 26: Hoare triple {4403#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:42,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {4404#(<= main_~i~1 7)} assume true; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:42,131 INFO L273 TraceCheckUtils]: 28: Hoare triple {4404#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:42,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {4404#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:42,133 INFO L273 TraceCheckUtils]: 30: Hoare triple {4405#(<= main_~i~1 8)} assume true; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:42,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {4405#(<= main_~i~1 8)} assume !(~i~1 < 10000); {4396#false} is VALID [2018-11-14 18:54:42,134 INFO L256 TraceCheckUtils]: 32: Hoare triple {4396#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {4396#false} is VALID [2018-11-14 18:54:42,134 INFO L273 TraceCheckUtils]: 33: Hoare triple {4396#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4396#false} is VALID [2018-11-14 18:54:42,134 INFO L273 TraceCheckUtils]: 34: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {4396#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:54:42,135 INFO L273 TraceCheckUtils]: 36: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:54:42,135 INFO L273 TraceCheckUtils]: 37: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,135 INFO L273 TraceCheckUtils]: 38: Hoare triple {4396#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:54:42,135 INFO L273 TraceCheckUtils]: 39: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:54:42,136 INFO L273 TraceCheckUtils]: 40: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,136 INFO L273 TraceCheckUtils]: 41: Hoare triple {4396#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:54:42,136 INFO L273 TraceCheckUtils]: 42: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:54:42,137 INFO L273 TraceCheckUtils]: 43: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,137 INFO L273 TraceCheckUtils]: 44: Hoare triple {4396#false} assume !(~i~0 < 10000); {4396#false} is VALID [2018-11-14 18:54:42,137 INFO L273 TraceCheckUtils]: 45: Hoare triple {4396#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4396#false} is VALID [2018-11-14 18:54:42,137 INFO L273 TraceCheckUtils]: 46: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,137 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4396#false} {4396#false} #73#return; {4396#false} is VALID [2018-11-14 18:54:42,138 INFO L273 TraceCheckUtils]: 48: Hoare triple {4396#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {4396#false} is VALID [2018-11-14 18:54:42,138 INFO L256 TraceCheckUtils]: 49: Hoare triple {4396#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {4396#false} is VALID [2018-11-14 18:54:42,138 INFO L273 TraceCheckUtils]: 50: Hoare triple {4396#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4396#false} is VALID [2018-11-14 18:54:42,138 INFO L273 TraceCheckUtils]: 51: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,138 INFO L273 TraceCheckUtils]: 52: Hoare triple {4396#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:54:42,138 INFO L273 TraceCheckUtils]: 53: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:54:42,138 INFO L273 TraceCheckUtils]: 54: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,139 INFO L273 TraceCheckUtils]: 55: Hoare triple {4396#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:54:42,139 INFO L273 TraceCheckUtils]: 56: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:54:42,139 INFO L273 TraceCheckUtils]: 57: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,139 INFO L273 TraceCheckUtils]: 58: Hoare triple {4396#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:54:42,139 INFO L273 TraceCheckUtils]: 59: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:54:42,139 INFO L273 TraceCheckUtils]: 60: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,140 INFO L273 TraceCheckUtils]: 61: Hoare triple {4396#false} assume !(~i~0 < 10000); {4396#false} is VALID [2018-11-14 18:54:42,140 INFO L273 TraceCheckUtils]: 62: Hoare triple {4396#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4396#false} is VALID [2018-11-14 18:54:42,140 INFO L273 TraceCheckUtils]: 63: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,140 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {4396#false} {4396#false} #75#return; {4396#false} is VALID [2018-11-14 18:54:42,140 INFO L273 TraceCheckUtils]: 65: Hoare triple {4396#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4396#false} is VALID [2018-11-14 18:54:42,140 INFO L273 TraceCheckUtils]: 66: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,140 INFO L273 TraceCheckUtils]: 67: Hoare triple {4396#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 18:54:42,141 INFO L273 TraceCheckUtils]: 68: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 18:54:42,141 INFO L273 TraceCheckUtils]: 69: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,141 INFO L273 TraceCheckUtils]: 70: Hoare triple {4396#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 18:54:42,141 INFO L273 TraceCheckUtils]: 71: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 18:54:42,141 INFO L273 TraceCheckUtils]: 72: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,141 INFO L273 TraceCheckUtils]: 73: Hoare triple {4396#false} assume !(~i~2 < 9999); {4396#false} is VALID [2018-11-14 18:54:42,141 INFO L273 TraceCheckUtils]: 74: Hoare triple {4396#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {4396#false} is VALID [2018-11-14 18:54:42,142 INFO L256 TraceCheckUtils]: 75: Hoare triple {4396#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {4396#false} is VALID [2018-11-14 18:54:42,142 INFO L273 TraceCheckUtils]: 76: Hoare triple {4396#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4396#false} is VALID [2018-11-14 18:54:42,142 INFO L273 TraceCheckUtils]: 77: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,142 INFO L273 TraceCheckUtils]: 78: Hoare triple {4396#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:54:42,142 INFO L273 TraceCheckUtils]: 79: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:54:42,142 INFO L273 TraceCheckUtils]: 80: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,143 INFO L273 TraceCheckUtils]: 81: Hoare triple {4396#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:54:42,143 INFO L273 TraceCheckUtils]: 82: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:54:42,143 INFO L273 TraceCheckUtils]: 83: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,143 INFO L273 TraceCheckUtils]: 84: Hoare triple {4396#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:54:42,143 INFO L273 TraceCheckUtils]: 85: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:54:42,143 INFO L273 TraceCheckUtils]: 86: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,143 INFO L273 TraceCheckUtils]: 87: Hoare triple {4396#false} assume !(~i~0 < 10000); {4396#false} is VALID [2018-11-14 18:54:42,144 INFO L273 TraceCheckUtils]: 88: Hoare triple {4396#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4396#false} is VALID [2018-11-14 18:54:42,144 INFO L273 TraceCheckUtils]: 89: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:54:42,144 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {4396#false} {4396#false} #77#return; {4396#false} is VALID [2018-11-14 18:54:42,144 INFO L273 TraceCheckUtils]: 91: Hoare triple {4396#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4396#false} is VALID [2018-11-14 18:54:42,144 INFO L273 TraceCheckUtils]: 92: Hoare triple {4396#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4396#false} is VALID [2018-11-14 18:54:42,144 INFO L273 TraceCheckUtils]: 93: Hoare triple {4396#false} assume !false; {4396#false} is VALID [2018-11-14 18:54:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 18:54:42,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:42,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 18:54:42,174 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-14 18:54:42,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:42,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:54:42,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:42,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:54:42,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:54:42,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:54:42,278 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 12 states. [2018-11-14 18:54:42,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:42,651 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-11-14 18:54:42,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:54:42,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-14 18:54:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:54:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-14 18:54:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:54:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-14 18:54:42,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 84 transitions. [2018-11-14 18:54:42,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:42,822 INFO L225 Difference]: With dead ends: 102 [2018-11-14 18:54:42,822 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 18:54:42,823 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:54:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 18:54:42,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-14 18:54:42,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:42,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2018-11-14 18:54:42,916 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2018-11-14 18:54:42,916 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2018-11-14 18:54:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:42,919 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 18:54:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 18:54:42,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:42,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:42,920 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2018-11-14 18:54:42,920 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2018-11-14 18:54:42,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:42,921 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 18:54:42,922 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 18:54:42,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:42,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:42,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:42,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 18:54:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-14 18:54:42,925 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 94 [2018-11-14 18:54:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:42,925 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-14 18:54:42,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:54:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 18:54:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-14 18:54:42,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:42,927 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 9, 9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:42,927 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:42,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:42,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1864182495, now seen corresponding path program 9 times [2018-11-14 18:54:42,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:42,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:42,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:42,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:42,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:43,271 INFO L256 TraceCheckUtils]: 0: Hoare triple {5057#true} call ULTIMATE.init(); {5057#true} is VALID [2018-11-14 18:54:43,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {5057#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5057#true} is VALID [2018-11-14 18:54:43,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5057#true} {5057#true} #69#return; {5057#true} is VALID [2018-11-14 18:54:43,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {5057#true} call #t~ret13 := main(); {5057#true} is VALID [2018-11-14 18:54:43,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {5057#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5059#(= main_~i~1 0)} is VALID [2018-11-14 18:54:43,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {5059#(= main_~i~1 0)} assume true; {5059#(= main_~i~1 0)} is VALID [2018-11-14 18:54:43,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {5059#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5059#(= main_~i~1 0)} is VALID [2018-11-14 18:54:43,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {5059#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5060#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:43,275 INFO L273 TraceCheckUtils]: 9: Hoare triple {5060#(<= main_~i~1 1)} assume true; {5060#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:43,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {5060#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5060#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:43,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {5060#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5061#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:43,276 INFO L273 TraceCheckUtils]: 12: Hoare triple {5061#(<= main_~i~1 2)} assume true; {5061#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:43,276 INFO L273 TraceCheckUtils]: 13: Hoare triple {5061#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5061#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:43,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {5061#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5062#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:43,277 INFO L273 TraceCheckUtils]: 15: Hoare triple {5062#(<= main_~i~1 3)} assume true; {5062#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:43,278 INFO L273 TraceCheckUtils]: 16: Hoare triple {5062#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5062#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:43,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {5062#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5063#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:43,279 INFO L273 TraceCheckUtils]: 18: Hoare triple {5063#(<= main_~i~1 4)} assume true; {5063#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:43,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {5063#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5063#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:43,280 INFO L273 TraceCheckUtils]: 20: Hoare triple {5063#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5064#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:43,281 INFO L273 TraceCheckUtils]: 21: Hoare triple {5064#(<= main_~i~1 5)} assume true; {5064#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:43,281 INFO L273 TraceCheckUtils]: 22: Hoare triple {5064#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5064#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:43,282 INFO L273 TraceCheckUtils]: 23: Hoare triple {5064#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5065#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:43,283 INFO L273 TraceCheckUtils]: 24: Hoare triple {5065#(<= main_~i~1 6)} assume true; {5065#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:43,283 INFO L273 TraceCheckUtils]: 25: Hoare triple {5065#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5065#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:43,303 INFO L273 TraceCheckUtils]: 26: Hoare triple {5065#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5066#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:43,303 INFO L273 TraceCheckUtils]: 27: Hoare triple {5066#(<= main_~i~1 7)} assume true; {5066#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:43,304 INFO L273 TraceCheckUtils]: 28: Hoare triple {5066#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5066#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:43,304 INFO L273 TraceCheckUtils]: 29: Hoare triple {5066#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5067#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:43,305 INFO L273 TraceCheckUtils]: 30: Hoare triple {5067#(<= main_~i~1 8)} assume true; {5067#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:43,305 INFO L273 TraceCheckUtils]: 31: Hoare triple {5067#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5067#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:43,305 INFO L273 TraceCheckUtils]: 32: Hoare triple {5067#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5068#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:43,306 INFO L273 TraceCheckUtils]: 33: Hoare triple {5068#(<= main_~i~1 9)} assume true; {5068#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:43,306 INFO L273 TraceCheckUtils]: 34: Hoare triple {5068#(<= main_~i~1 9)} assume !(~i~1 < 10000); {5058#false} is VALID [2018-11-14 18:54:43,306 INFO L256 TraceCheckUtils]: 35: Hoare triple {5058#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 18:54:43,307 INFO L273 TraceCheckUtils]: 36: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 18:54:43,307 INFO L273 TraceCheckUtils]: 37: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,307 INFO L273 TraceCheckUtils]: 38: Hoare triple {5057#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:54:43,307 INFO L273 TraceCheckUtils]: 39: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:54:43,308 INFO L273 TraceCheckUtils]: 40: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,308 INFO L273 TraceCheckUtils]: 41: Hoare triple {5057#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:54:43,308 INFO L273 TraceCheckUtils]: 42: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:54:43,309 INFO L273 TraceCheckUtils]: 43: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,309 INFO L273 TraceCheckUtils]: 44: Hoare triple {5057#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:54:43,309 INFO L273 TraceCheckUtils]: 45: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:54:43,309 INFO L273 TraceCheckUtils]: 46: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,310 INFO L273 TraceCheckUtils]: 47: Hoare triple {5057#true} assume !(~i~0 < 10000); {5057#true} is VALID [2018-11-14 18:54:43,310 INFO L273 TraceCheckUtils]: 48: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 18:54:43,310 INFO L273 TraceCheckUtils]: 49: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,310 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5057#true} {5058#false} #73#return; {5058#false} is VALID [2018-11-14 18:54:43,310 INFO L273 TraceCheckUtils]: 51: Hoare triple {5058#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5058#false} is VALID [2018-11-14 18:54:43,310 INFO L256 TraceCheckUtils]: 52: Hoare triple {5058#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 18:54:43,311 INFO L273 TraceCheckUtils]: 53: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 18:54:43,311 INFO L273 TraceCheckUtils]: 54: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,311 INFO L273 TraceCheckUtils]: 55: Hoare triple {5057#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:54:43,311 INFO L273 TraceCheckUtils]: 56: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:54:43,311 INFO L273 TraceCheckUtils]: 57: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,311 INFO L273 TraceCheckUtils]: 58: Hoare triple {5057#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:54:43,311 INFO L273 TraceCheckUtils]: 59: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:54:43,312 INFO L273 TraceCheckUtils]: 60: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,312 INFO L273 TraceCheckUtils]: 61: Hoare triple {5057#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:54:43,312 INFO L273 TraceCheckUtils]: 62: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:54:43,312 INFO L273 TraceCheckUtils]: 63: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,312 INFO L273 TraceCheckUtils]: 64: Hoare triple {5057#true} assume !(~i~0 < 10000); {5057#true} is VALID [2018-11-14 18:54:43,312 INFO L273 TraceCheckUtils]: 65: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 18:54:43,313 INFO L273 TraceCheckUtils]: 66: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,313 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5057#true} {5058#false} #75#return; {5058#false} is VALID [2018-11-14 18:54:43,313 INFO L273 TraceCheckUtils]: 68: Hoare triple {5058#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5058#false} is VALID [2018-11-14 18:54:43,313 INFO L273 TraceCheckUtils]: 69: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 18:54:43,313 INFO L273 TraceCheckUtils]: 70: Hoare triple {5058#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5058#false} is VALID [2018-11-14 18:54:43,313 INFO L273 TraceCheckUtils]: 71: Hoare triple {5058#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5058#false} is VALID [2018-11-14 18:54:43,313 INFO L273 TraceCheckUtils]: 72: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 18:54:43,314 INFO L273 TraceCheckUtils]: 73: Hoare triple {5058#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5058#false} is VALID [2018-11-14 18:54:43,314 INFO L273 TraceCheckUtils]: 74: Hoare triple {5058#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5058#false} is VALID [2018-11-14 18:54:43,314 INFO L273 TraceCheckUtils]: 75: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 18:54:43,314 INFO L273 TraceCheckUtils]: 76: Hoare triple {5058#false} assume !(~i~2 < 9999); {5058#false} is VALID [2018-11-14 18:54:43,314 INFO L273 TraceCheckUtils]: 77: Hoare triple {5058#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {5058#false} is VALID [2018-11-14 18:54:43,314 INFO L256 TraceCheckUtils]: 78: Hoare triple {5058#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 18:54:43,314 INFO L273 TraceCheckUtils]: 79: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 18:54:43,314 INFO L273 TraceCheckUtils]: 80: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,314 INFO L273 TraceCheckUtils]: 81: Hoare triple {5057#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:54:43,315 INFO L273 TraceCheckUtils]: 82: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:54:43,315 INFO L273 TraceCheckUtils]: 83: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,315 INFO L273 TraceCheckUtils]: 84: Hoare triple {5057#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:54:43,315 INFO L273 TraceCheckUtils]: 85: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:54:43,315 INFO L273 TraceCheckUtils]: 86: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,315 INFO L273 TraceCheckUtils]: 87: Hoare triple {5057#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:54:43,315 INFO L273 TraceCheckUtils]: 88: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:54:43,315 INFO L273 TraceCheckUtils]: 89: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,316 INFO L273 TraceCheckUtils]: 90: Hoare triple {5057#true} assume !(~i~0 < 10000); {5057#true} is VALID [2018-11-14 18:54:43,316 INFO L273 TraceCheckUtils]: 91: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 18:54:43,316 INFO L273 TraceCheckUtils]: 92: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,316 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {5057#true} {5058#false} #77#return; {5058#false} is VALID [2018-11-14 18:54:43,316 INFO L273 TraceCheckUtils]: 94: Hoare triple {5058#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5058#false} is VALID [2018-11-14 18:54:43,316 INFO L273 TraceCheckUtils]: 95: Hoare triple {5058#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5058#false} is VALID [2018-11-14 18:54:43,316 INFO L273 TraceCheckUtils]: 96: Hoare triple {5058#false} assume !false; {5058#false} is VALID [2018-11-14 18:54:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 18:54:43,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:43,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:43,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:54:43,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 18:54:43,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:43,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:43,513 INFO L256 TraceCheckUtils]: 0: Hoare triple {5057#true} call ULTIMATE.init(); {5057#true} is VALID [2018-11-14 18:54:43,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {5057#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5057#true} is VALID [2018-11-14 18:54:43,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,513 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5057#true} {5057#true} #69#return; {5057#true} is VALID [2018-11-14 18:54:43,514 INFO L256 TraceCheckUtils]: 4: Hoare triple {5057#true} call #t~ret13 := main(); {5057#true} is VALID [2018-11-14 18:54:43,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {5057#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5057#true} is VALID [2018-11-14 18:54:43,514 INFO L273 TraceCheckUtils]: 6: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {5057#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:54:43,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:54:43,514 INFO L273 TraceCheckUtils]: 9: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,514 INFO L273 TraceCheckUtils]: 10: Hoare triple {5057#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:54:43,514 INFO L273 TraceCheckUtils]: 11: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:54:43,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,515 INFO L273 TraceCheckUtils]: 13: Hoare triple {5057#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:54:43,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:54:43,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,515 INFO L273 TraceCheckUtils]: 16: Hoare triple {5057#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:54:43,515 INFO L273 TraceCheckUtils]: 17: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:54:43,515 INFO L273 TraceCheckUtils]: 18: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,515 INFO L273 TraceCheckUtils]: 19: Hoare triple {5057#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:54:43,515 INFO L273 TraceCheckUtils]: 20: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:54:43,516 INFO L273 TraceCheckUtils]: 21: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,516 INFO L273 TraceCheckUtils]: 22: Hoare triple {5057#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:54:43,516 INFO L273 TraceCheckUtils]: 23: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:54:43,516 INFO L273 TraceCheckUtils]: 24: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,516 INFO L273 TraceCheckUtils]: 25: Hoare triple {5057#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:54:43,516 INFO L273 TraceCheckUtils]: 26: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:54:43,516 INFO L273 TraceCheckUtils]: 27: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,516 INFO L273 TraceCheckUtils]: 28: Hoare triple {5057#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:54:43,517 INFO L273 TraceCheckUtils]: 29: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:54:43,517 INFO L273 TraceCheckUtils]: 30: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,517 INFO L273 TraceCheckUtils]: 31: Hoare triple {5057#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:54:43,517 INFO L273 TraceCheckUtils]: 32: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:54:43,517 INFO L273 TraceCheckUtils]: 33: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,517 INFO L273 TraceCheckUtils]: 34: Hoare triple {5057#true} assume !(~i~1 < 10000); {5057#true} is VALID [2018-11-14 18:54:43,517 INFO L256 TraceCheckUtils]: 35: Hoare triple {5057#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 18:54:43,517 INFO L273 TraceCheckUtils]: 36: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 18:54:43,517 INFO L273 TraceCheckUtils]: 37: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,518 INFO L273 TraceCheckUtils]: 38: Hoare triple {5057#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:54:43,518 INFO L273 TraceCheckUtils]: 39: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:54:43,518 INFO L273 TraceCheckUtils]: 40: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,518 INFO L273 TraceCheckUtils]: 41: Hoare triple {5057#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:54:43,518 INFO L273 TraceCheckUtils]: 42: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:54:43,518 INFO L273 TraceCheckUtils]: 43: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,518 INFO L273 TraceCheckUtils]: 44: Hoare triple {5057#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:54:43,518 INFO L273 TraceCheckUtils]: 45: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:54:43,519 INFO L273 TraceCheckUtils]: 46: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,519 INFO L273 TraceCheckUtils]: 47: Hoare triple {5057#true} assume !(~i~0 < 10000); {5057#true} is VALID [2018-11-14 18:54:43,519 INFO L273 TraceCheckUtils]: 48: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 18:54:43,519 INFO L273 TraceCheckUtils]: 49: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,519 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5057#true} {5057#true} #73#return; {5057#true} is VALID [2018-11-14 18:54:43,519 INFO L273 TraceCheckUtils]: 51: Hoare triple {5057#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5057#true} is VALID [2018-11-14 18:54:43,519 INFO L256 TraceCheckUtils]: 52: Hoare triple {5057#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 18:54:43,519 INFO L273 TraceCheckUtils]: 53: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 18:54:43,519 INFO L273 TraceCheckUtils]: 54: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,520 INFO L273 TraceCheckUtils]: 55: Hoare triple {5057#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:54:43,520 INFO L273 TraceCheckUtils]: 56: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:54:43,520 INFO L273 TraceCheckUtils]: 57: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,520 INFO L273 TraceCheckUtils]: 58: Hoare triple {5057#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:54:43,520 INFO L273 TraceCheckUtils]: 59: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:54:43,520 INFO L273 TraceCheckUtils]: 60: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,520 INFO L273 TraceCheckUtils]: 61: Hoare triple {5057#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:54:43,520 INFO L273 TraceCheckUtils]: 62: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:54:43,521 INFO L273 TraceCheckUtils]: 63: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,521 INFO L273 TraceCheckUtils]: 64: Hoare triple {5057#true} assume !(~i~0 < 10000); {5057#true} is VALID [2018-11-14 18:54:43,521 INFO L273 TraceCheckUtils]: 65: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 18:54:43,521 INFO L273 TraceCheckUtils]: 66: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,521 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5057#true} {5057#true} #75#return; {5057#true} is VALID [2018-11-14 18:54:43,521 INFO L273 TraceCheckUtils]: 68: Hoare triple {5057#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5057#true} is VALID [2018-11-14 18:54:43,521 INFO L273 TraceCheckUtils]: 69: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,521 INFO L273 TraceCheckUtils]: 70: Hoare triple {5057#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5057#true} is VALID [2018-11-14 18:54:43,521 INFO L273 TraceCheckUtils]: 71: Hoare triple {5057#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5057#true} is VALID [2018-11-14 18:54:43,522 INFO L273 TraceCheckUtils]: 72: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,522 INFO L273 TraceCheckUtils]: 73: Hoare triple {5057#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5057#true} is VALID [2018-11-14 18:54:43,522 INFO L273 TraceCheckUtils]: 74: Hoare triple {5057#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5057#true} is VALID [2018-11-14 18:54:43,522 INFO L273 TraceCheckUtils]: 75: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:54:43,522 INFO L273 TraceCheckUtils]: 76: Hoare triple {5057#true} assume !(~i~2 < 9999); {5057#true} is VALID [2018-11-14 18:54:43,522 INFO L273 TraceCheckUtils]: 77: Hoare triple {5057#true} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {5057#true} is VALID [2018-11-14 18:54:43,522 INFO L256 TraceCheckUtils]: 78: Hoare triple {5057#true} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 18:54:43,523 INFO L273 TraceCheckUtils]: 79: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5309#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:43,523 INFO L273 TraceCheckUtils]: 80: Hoare triple {5309#(<= bAnd_~i~0 1)} assume true; {5309#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:43,524 INFO L273 TraceCheckUtils]: 81: Hoare triple {5309#(<= bAnd_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5309#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:43,524 INFO L273 TraceCheckUtils]: 82: Hoare triple {5309#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5319#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:54:43,526 INFO L273 TraceCheckUtils]: 83: Hoare triple {5319#(<= bAnd_~i~0 2)} assume true; {5319#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:54:43,526 INFO L273 TraceCheckUtils]: 84: Hoare triple {5319#(<= bAnd_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5319#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:54:43,528 INFO L273 TraceCheckUtils]: 85: Hoare triple {5319#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5329#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:54:43,528 INFO L273 TraceCheckUtils]: 86: Hoare triple {5329#(<= bAnd_~i~0 3)} assume true; {5329#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:54:43,528 INFO L273 TraceCheckUtils]: 87: Hoare triple {5329#(<= bAnd_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5329#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:54:43,529 INFO L273 TraceCheckUtils]: 88: Hoare triple {5329#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5339#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:54:43,529 INFO L273 TraceCheckUtils]: 89: Hoare triple {5339#(<= bAnd_~i~0 4)} assume true; {5339#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:54:43,529 INFO L273 TraceCheckUtils]: 90: Hoare triple {5339#(<= bAnd_~i~0 4)} assume !(~i~0 < 10000); {5058#false} is VALID [2018-11-14 18:54:43,530 INFO L273 TraceCheckUtils]: 91: Hoare triple {5058#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5058#false} is VALID [2018-11-14 18:54:43,530 INFO L273 TraceCheckUtils]: 92: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 18:54:43,530 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {5058#false} {5057#true} #77#return; {5058#false} is VALID [2018-11-14 18:54:43,530 INFO L273 TraceCheckUtils]: 94: Hoare triple {5058#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5058#false} is VALID [2018-11-14 18:54:43,530 INFO L273 TraceCheckUtils]: 95: Hoare triple {5058#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5058#false} is VALID [2018-11-14 18:54:43,530 INFO L273 TraceCheckUtils]: 96: Hoare triple {5058#false} assume !false; {5058#false} is VALID [2018-11-14 18:54:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-14 18:54:43,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:43,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-11-14 18:54:43,555 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2018-11-14 18:54:43,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:43,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:54:43,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:43,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:54:43,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:54:43,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:54:43,642 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 16 states. [2018-11-14 18:54:44,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:44,086 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-14 18:54:44,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:54:44,086 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2018-11-14 18:54:44,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:54:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2018-11-14 18:54:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:54:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2018-11-14 18:54:44,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 103 transitions. [2018-11-14 18:54:44,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:44,528 INFO L225 Difference]: With dead ends: 109 [2018-11-14 18:54:44,528 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 18:54:44,529 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:54:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 18:54:45,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-14 18:54:45,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:45,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2018-11-14 18:54:45,064 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2018-11-14 18:54:45,064 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2018-11-14 18:54:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:45,066 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-14 18:54:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-14 18:54:45,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:45,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:45,067 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2018-11-14 18:54:45,067 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2018-11-14 18:54:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:45,069 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-14 18:54:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-14 18:54:45,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:45,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:45,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:45,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 18:54:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-11-14 18:54:45,072 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 97 [2018-11-14 18:54:45,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:45,072 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-11-14 18:54:45,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:54:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-14 18:54:45,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-14 18:54:45,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:45,074 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 11, 10, 10, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:45,074 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:45,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:45,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1090680019, now seen corresponding path program 10 times [2018-11-14 18:54:45,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:45,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:45,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:45,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:45,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:45,538 INFO L256 TraceCheckUtils]: 0: Hoare triple {5763#true} call ULTIMATE.init(); {5763#true} is VALID [2018-11-14 18:54:45,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {5763#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5763#true} is VALID [2018-11-14 18:54:45,538 INFO L273 TraceCheckUtils]: 2: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,538 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5763#true} {5763#true} #69#return; {5763#true} is VALID [2018-11-14 18:54:45,538 INFO L256 TraceCheckUtils]: 4: Hoare triple {5763#true} call #t~ret13 := main(); {5763#true} is VALID [2018-11-14 18:54:45,539 INFO L273 TraceCheckUtils]: 5: Hoare triple {5763#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5765#(= main_~i~1 0)} is VALID [2018-11-14 18:54:45,540 INFO L273 TraceCheckUtils]: 6: Hoare triple {5765#(= main_~i~1 0)} assume true; {5765#(= main_~i~1 0)} is VALID [2018-11-14 18:54:45,540 INFO L273 TraceCheckUtils]: 7: Hoare triple {5765#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5765#(= main_~i~1 0)} is VALID [2018-11-14 18:54:45,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {5765#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:45,542 INFO L273 TraceCheckUtils]: 9: Hoare triple {5766#(<= main_~i~1 1)} assume true; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:45,544 INFO L273 TraceCheckUtils]: 10: Hoare triple {5766#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:45,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {5766#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:45,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {5767#(<= main_~i~1 2)} assume true; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:45,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {5767#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:45,551 INFO L273 TraceCheckUtils]: 14: Hoare triple {5767#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:45,551 INFO L273 TraceCheckUtils]: 15: Hoare triple {5768#(<= main_~i~1 3)} assume true; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:45,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {5768#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:45,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {5768#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:45,555 INFO L273 TraceCheckUtils]: 18: Hoare triple {5769#(<= main_~i~1 4)} assume true; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:45,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {5769#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:45,558 INFO L273 TraceCheckUtils]: 20: Hoare triple {5769#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:45,558 INFO L273 TraceCheckUtils]: 21: Hoare triple {5770#(<= main_~i~1 5)} assume true; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:45,561 INFO L273 TraceCheckUtils]: 22: Hoare triple {5770#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:45,561 INFO L273 TraceCheckUtils]: 23: Hoare triple {5770#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:45,563 INFO L273 TraceCheckUtils]: 24: Hoare triple {5771#(<= main_~i~1 6)} assume true; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:45,563 INFO L273 TraceCheckUtils]: 25: Hoare triple {5771#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:45,566 INFO L273 TraceCheckUtils]: 26: Hoare triple {5771#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:45,566 INFO L273 TraceCheckUtils]: 27: Hoare triple {5772#(<= main_~i~1 7)} assume true; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:45,569 INFO L273 TraceCheckUtils]: 28: Hoare triple {5772#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:45,569 INFO L273 TraceCheckUtils]: 29: Hoare triple {5772#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:45,571 INFO L273 TraceCheckUtils]: 30: Hoare triple {5773#(<= main_~i~1 8)} assume true; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:45,571 INFO L273 TraceCheckUtils]: 31: Hoare triple {5773#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:45,573 INFO L273 TraceCheckUtils]: 32: Hoare triple {5773#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:45,573 INFO L273 TraceCheckUtils]: 33: Hoare triple {5774#(<= main_~i~1 9)} assume true; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:45,575 INFO L273 TraceCheckUtils]: 34: Hoare triple {5774#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:45,575 INFO L273 TraceCheckUtils]: 35: Hoare triple {5774#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:45,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {5775#(<= main_~i~1 10)} assume true; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:45,577 INFO L273 TraceCheckUtils]: 37: Hoare triple {5775#(<= main_~i~1 10)} assume !(~i~1 < 10000); {5764#false} is VALID [2018-11-14 18:54:45,577 INFO L256 TraceCheckUtils]: 38: Hoare triple {5764#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {5763#true} is VALID [2018-11-14 18:54:45,577 INFO L273 TraceCheckUtils]: 39: Hoare triple {5763#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5763#true} is VALID [2018-11-14 18:54:45,578 INFO L273 TraceCheckUtils]: 40: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,578 INFO L273 TraceCheckUtils]: 41: Hoare triple {5763#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:54:45,578 INFO L273 TraceCheckUtils]: 42: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:54:45,578 INFO L273 TraceCheckUtils]: 43: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,578 INFO L273 TraceCheckUtils]: 44: Hoare triple {5763#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:54:45,578 INFO L273 TraceCheckUtils]: 45: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:54:45,578 INFO L273 TraceCheckUtils]: 46: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,578 INFO L273 TraceCheckUtils]: 47: Hoare triple {5763#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:54:45,578 INFO L273 TraceCheckUtils]: 48: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:54:45,579 INFO L273 TraceCheckUtils]: 49: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,579 INFO L273 TraceCheckUtils]: 50: Hoare triple {5763#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:54:45,579 INFO L273 TraceCheckUtils]: 51: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:54:45,579 INFO L273 TraceCheckUtils]: 52: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,579 INFO L273 TraceCheckUtils]: 53: Hoare triple {5763#true} assume !(~i~0 < 10000); {5763#true} is VALID [2018-11-14 18:54:45,579 INFO L273 TraceCheckUtils]: 54: Hoare triple {5763#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5763#true} is VALID [2018-11-14 18:54:45,579 INFO L273 TraceCheckUtils]: 55: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,579 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {5763#true} {5764#false} #73#return; {5764#false} is VALID [2018-11-14 18:54:45,580 INFO L273 TraceCheckUtils]: 57: Hoare triple {5764#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5764#false} is VALID [2018-11-14 18:54:45,582 INFO L256 TraceCheckUtils]: 58: Hoare triple {5764#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {5763#true} is VALID [2018-11-14 18:54:45,582 INFO L273 TraceCheckUtils]: 59: Hoare triple {5763#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5763#true} is VALID [2018-11-14 18:54:45,582 INFO L273 TraceCheckUtils]: 60: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,582 INFO L273 TraceCheckUtils]: 61: Hoare triple {5763#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:54:45,583 INFO L273 TraceCheckUtils]: 62: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:54:45,583 INFO L273 TraceCheckUtils]: 63: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,583 INFO L273 TraceCheckUtils]: 64: Hoare triple {5763#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:54:45,583 INFO L273 TraceCheckUtils]: 65: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:54:45,583 INFO L273 TraceCheckUtils]: 66: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,583 INFO L273 TraceCheckUtils]: 67: Hoare triple {5763#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:54:45,584 INFO L273 TraceCheckUtils]: 68: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:54:45,584 INFO L273 TraceCheckUtils]: 69: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,584 INFO L273 TraceCheckUtils]: 70: Hoare triple {5763#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:54:45,584 INFO L273 TraceCheckUtils]: 71: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:54:45,584 INFO L273 TraceCheckUtils]: 72: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,585 INFO L273 TraceCheckUtils]: 73: Hoare triple {5763#true} assume !(~i~0 < 10000); {5763#true} is VALID [2018-11-14 18:54:45,585 INFO L273 TraceCheckUtils]: 74: Hoare triple {5763#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5763#true} is VALID [2018-11-14 18:54:45,585 INFO L273 TraceCheckUtils]: 75: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,585 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {5763#true} {5764#false} #75#return; {5764#false} is VALID [2018-11-14 18:54:45,585 INFO L273 TraceCheckUtils]: 77: Hoare triple {5764#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5764#false} is VALID [2018-11-14 18:54:45,585 INFO L273 TraceCheckUtils]: 78: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,586 INFO L273 TraceCheckUtils]: 79: Hoare triple {5764#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 18:54:45,586 INFO L273 TraceCheckUtils]: 80: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 18:54:45,586 INFO L273 TraceCheckUtils]: 81: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,586 INFO L273 TraceCheckUtils]: 82: Hoare triple {5764#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 18:54:45,586 INFO L273 TraceCheckUtils]: 83: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 18:54:45,586 INFO L273 TraceCheckUtils]: 84: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,587 INFO L273 TraceCheckUtils]: 85: Hoare triple {5764#false} assume !(~i~2 < 9999); {5764#false} is VALID [2018-11-14 18:54:45,587 INFO L273 TraceCheckUtils]: 86: Hoare triple {5764#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {5764#false} is VALID [2018-11-14 18:54:45,587 INFO L256 TraceCheckUtils]: 87: Hoare triple {5764#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {5763#true} is VALID [2018-11-14 18:54:45,587 INFO L273 TraceCheckUtils]: 88: Hoare triple {5763#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5763#true} is VALID [2018-11-14 18:54:45,587 INFO L273 TraceCheckUtils]: 89: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,587 INFO L273 TraceCheckUtils]: 90: Hoare triple {5763#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:54:45,588 INFO L273 TraceCheckUtils]: 91: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:54:45,588 INFO L273 TraceCheckUtils]: 92: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,588 INFO L273 TraceCheckUtils]: 93: Hoare triple {5763#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:54:45,588 INFO L273 TraceCheckUtils]: 94: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:54:45,588 INFO L273 TraceCheckUtils]: 95: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,588 INFO L273 TraceCheckUtils]: 96: Hoare triple {5763#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:54:45,589 INFO L273 TraceCheckUtils]: 97: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:54:45,589 INFO L273 TraceCheckUtils]: 98: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,589 INFO L273 TraceCheckUtils]: 99: Hoare triple {5763#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:54:45,589 INFO L273 TraceCheckUtils]: 100: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:54:45,589 INFO L273 TraceCheckUtils]: 101: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,589 INFO L273 TraceCheckUtils]: 102: Hoare triple {5763#true} assume !(~i~0 < 10000); {5763#true} is VALID [2018-11-14 18:54:45,590 INFO L273 TraceCheckUtils]: 103: Hoare triple {5763#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5763#true} is VALID [2018-11-14 18:54:45,590 INFO L273 TraceCheckUtils]: 104: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,590 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {5763#true} {5764#false} #77#return; {5764#false} is VALID [2018-11-14 18:54:45,590 INFO L273 TraceCheckUtils]: 106: Hoare triple {5764#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5764#false} is VALID [2018-11-14 18:54:45,590 INFO L273 TraceCheckUtils]: 107: Hoare triple {5764#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5764#false} is VALID [2018-11-14 18:54:45,590 INFO L273 TraceCheckUtils]: 108: Hoare triple {5764#false} assume !false; {5764#false} is VALID [2018-11-14 18:54:45,597 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-14 18:54:45,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:45,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:45,613 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:54:45,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:54:45,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:45,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:45,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {5763#true} call ULTIMATE.init(); {5763#true} is VALID [2018-11-14 18:54:45,868 INFO L273 TraceCheckUtils]: 1: Hoare triple {5763#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5763#true} is VALID [2018-11-14 18:54:45,868 INFO L273 TraceCheckUtils]: 2: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:54:45,868 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5763#true} {5763#true} #69#return; {5763#true} is VALID [2018-11-14 18:54:45,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {5763#true} call #t~ret13 := main(); {5763#true} is VALID [2018-11-14 18:54:45,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {5763#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5794#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:45,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {5794#(<= main_~i~1 0)} assume true; {5794#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:45,870 INFO L273 TraceCheckUtils]: 7: Hoare triple {5794#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5794#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:45,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {5794#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:45,871 INFO L273 TraceCheckUtils]: 9: Hoare triple {5766#(<= main_~i~1 1)} assume true; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:45,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {5766#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:45,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {5766#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:45,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {5767#(<= main_~i~1 2)} assume true; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:45,872 INFO L273 TraceCheckUtils]: 13: Hoare triple {5767#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:45,873 INFO L273 TraceCheckUtils]: 14: Hoare triple {5767#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:45,873 INFO L273 TraceCheckUtils]: 15: Hoare triple {5768#(<= main_~i~1 3)} assume true; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:45,874 INFO L273 TraceCheckUtils]: 16: Hoare triple {5768#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:45,875 INFO L273 TraceCheckUtils]: 17: Hoare triple {5768#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:45,875 INFO L273 TraceCheckUtils]: 18: Hoare triple {5769#(<= main_~i~1 4)} assume true; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:45,876 INFO L273 TraceCheckUtils]: 19: Hoare triple {5769#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:45,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {5769#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:45,877 INFO L273 TraceCheckUtils]: 21: Hoare triple {5770#(<= main_~i~1 5)} assume true; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:45,878 INFO L273 TraceCheckUtils]: 22: Hoare triple {5770#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:45,878 INFO L273 TraceCheckUtils]: 23: Hoare triple {5770#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:45,879 INFO L273 TraceCheckUtils]: 24: Hoare triple {5771#(<= main_~i~1 6)} assume true; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:45,879 INFO L273 TraceCheckUtils]: 25: Hoare triple {5771#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:45,880 INFO L273 TraceCheckUtils]: 26: Hoare triple {5771#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:45,881 INFO L273 TraceCheckUtils]: 27: Hoare triple {5772#(<= main_~i~1 7)} assume true; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:45,881 INFO L273 TraceCheckUtils]: 28: Hoare triple {5772#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:45,882 INFO L273 TraceCheckUtils]: 29: Hoare triple {5772#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:45,882 INFO L273 TraceCheckUtils]: 30: Hoare triple {5773#(<= main_~i~1 8)} assume true; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:45,883 INFO L273 TraceCheckUtils]: 31: Hoare triple {5773#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:45,884 INFO L273 TraceCheckUtils]: 32: Hoare triple {5773#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:45,884 INFO L273 TraceCheckUtils]: 33: Hoare triple {5774#(<= main_~i~1 9)} assume true; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:45,885 INFO L273 TraceCheckUtils]: 34: Hoare triple {5774#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:45,886 INFO L273 TraceCheckUtils]: 35: Hoare triple {5774#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:45,886 INFO L273 TraceCheckUtils]: 36: Hoare triple {5775#(<= main_~i~1 10)} assume true; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:45,887 INFO L273 TraceCheckUtils]: 37: Hoare triple {5775#(<= main_~i~1 10)} assume !(~i~1 < 10000); {5764#false} is VALID [2018-11-14 18:54:45,887 INFO L256 TraceCheckUtils]: 38: Hoare triple {5764#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {5764#false} is VALID [2018-11-14 18:54:45,887 INFO L273 TraceCheckUtils]: 39: Hoare triple {5764#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5764#false} is VALID [2018-11-14 18:54:45,887 INFO L273 TraceCheckUtils]: 40: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,888 INFO L273 TraceCheckUtils]: 41: Hoare triple {5764#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:54:45,888 INFO L273 TraceCheckUtils]: 42: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:54:45,888 INFO L273 TraceCheckUtils]: 43: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,888 INFO L273 TraceCheckUtils]: 44: Hoare triple {5764#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:54:45,888 INFO L273 TraceCheckUtils]: 45: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:54:45,888 INFO L273 TraceCheckUtils]: 46: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,889 INFO L273 TraceCheckUtils]: 47: Hoare triple {5764#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:54:45,889 INFO L273 TraceCheckUtils]: 48: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:54:45,889 INFO L273 TraceCheckUtils]: 49: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,889 INFO L273 TraceCheckUtils]: 50: Hoare triple {5764#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:54:45,889 INFO L273 TraceCheckUtils]: 51: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:54:45,889 INFO L273 TraceCheckUtils]: 52: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,890 INFO L273 TraceCheckUtils]: 53: Hoare triple {5764#false} assume !(~i~0 < 10000); {5764#false} is VALID [2018-11-14 18:54:45,890 INFO L273 TraceCheckUtils]: 54: Hoare triple {5764#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5764#false} is VALID [2018-11-14 18:54:45,890 INFO L273 TraceCheckUtils]: 55: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,890 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {5764#false} {5764#false} #73#return; {5764#false} is VALID [2018-11-14 18:54:45,890 INFO L273 TraceCheckUtils]: 57: Hoare triple {5764#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5764#false} is VALID [2018-11-14 18:54:45,890 INFO L256 TraceCheckUtils]: 58: Hoare triple {5764#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {5764#false} is VALID [2018-11-14 18:54:45,891 INFO L273 TraceCheckUtils]: 59: Hoare triple {5764#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5764#false} is VALID [2018-11-14 18:54:45,891 INFO L273 TraceCheckUtils]: 60: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,891 INFO L273 TraceCheckUtils]: 61: Hoare triple {5764#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:54:45,891 INFO L273 TraceCheckUtils]: 62: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:54:45,891 INFO L273 TraceCheckUtils]: 63: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,891 INFO L273 TraceCheckUtils]: 64: Hoare triple {5764#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:54:45,892 INFO L273 TraceCheckUtils]: 65: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:54:45,892 INFO L273 TraceCheckUtils]: 66: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,892 INFO L273 TraceCheckUtils]: 67: Hoare triple {5764#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:54:45,892 INFO L273 TraceCheckUtils]: 68: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:54:45,892 INFO L273 TraceCheckUtils]: 69: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,892 INFO L273 TraceCheckUtils]: 70: Hoare triple {5764#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:54:45,893 INFO L273 TraceCheckUtils]: 71: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:54:45,893 INFO L273 TraceCheckUtils]: 72: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,893 INFO L273 TraceCheckUtils]: 73: Hoare triple {5764#false} assume !(~i~0 < 10000); {5764#false} is VALID [2018-11-14 18:54:45,893 INFO L273 TraceCheckUtils]: 74: Hoare triple {5764#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5764#false} is VALID [2018-11-14 18:54:45,893 INFO L273 TraceCheckUtils]: 75: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,893 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {5764#false} {5764#false} #75#return; {5764#false} is VALID [2018-11-14 18:54:45,894 INFO L273 TraceCheckUtils]: 77: Hoare triple {5764#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5764#false} is VALID [2018-11-14 18:54:45,894 INFO L273 TraceCheckUtils]: 78: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,894 INFO L273 TraceCheckUtils]: 79: Hoare triple {5764#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 18:54:45,894 INFO L273 TraceCheckUtils]: 80: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 18:54:45,894 INFO L273 TraceCheckUtils]: 81: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,894 INFO L273 TraceCheckUtils]: 82: Hoare triple {5764#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 18:54:45,894 INFO L273 TraceCheckUtils]: 83: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 18:54:45,895 INFO L273 TraceCheckUtils]: 84: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,895 INFO L273 TraceCheckUtils]: 85: Hoare triple {5764#false} assume !(~i~2 < 9999); {5764#false} is VALID [2018-11-14 18:54:45,895 INFO L273 TraceCheckUtils]: 86: Hoare triple {5764#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {5764#false} is VALID [2018-11-14 18:54:45,895 INFO L256 TraceCheckUtils]: 87: Hoare triple {5764#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {5764#false} is VALID [2018-11-14 18:54:45,895 INFO L273 TraceCheckUtils]: 88: Hoare triple {5764#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5764#false} is VALID [2018-11-14 18:54:45,895 INFO L273 TraceCheckUtils]: 89: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,896 INFO L273 TraceCheckUtils]: 90: Hoare triple {5764#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:54:45,896 INFO L273 TraceCheckUtils]: 91: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:54:45,896 INFO L273 TraceCheckUtils]: 92: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,896 INFO L273 TraceCheckUtils]: 93: Hoare triple {5764#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:54:45,896 INFO L273 TraceCheckUtils]: 94: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:54:45,896 INFO L273 TraceCheckUtils]: 95: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,897 INFO L273 TraceCheckUtils]: 96: Hoare triple {5764#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:54:45,897 INFO L273 TraceCheckUtils]: 97: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:54:45,897 INFO L273 TraceCheckUtils]: 98: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,897 INFO L273 TraceCheckUtils]: 99: Hoare triple {5764#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:54:45,897 INFO L273 TraceCheckUtils]: 100: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:54:45,897 INFO L273 TraceCheckUtils]: 101: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,897 INFO L273 TraceCheckUtils]: 102: Hoare triple {5764#false} assume !(~i~0 < 10000); {5764#false} is VALID [2018-11-14 18:54:45,898 INFO L273 TraceCheckUtils]: 103: Hoare triple {5764#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5764#false} is VALID [2018-11-14 18:54:45,898 INFO L273 TraceCheckUtils]: 104: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:54:45,898 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {5764#false} {5764#false} #77#return; {5764#false} is VALID [2018-11-14 18:54:45,898 INFO L273 TraceCheckUtils]: 106: Hoare triple {5764#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5764#false} is VALID [2018-11-14 18:54:45,898 INFO L273 TraceCheckUtils]: 107: Hoare triple {5764#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5764#false} is VALID [2018-11-14 18:54:45,898 INFO L273 TraceCheckUtils]: 108: Hoare triple {5764#false} assume !false; {5764#false} is VALID [2018-11-14 18:54:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-14 18:54:45,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:45,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 18:54:45,925 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2018-11-14 18:54:45,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:45,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:54:46,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:46,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:54:46,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:54:46,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:54:46,006 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 14 states. [2018-11-14 18:54:46,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:46,349 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-14 18:54:46,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 18:54:46,349 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2018-11-14 18:54:46,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:54:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2018-11-14 18:54:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:54:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2018-11-14 18:54:46,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 90 transitions. [2018-11-14 18:54:46,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:46,443 INFO L225 Difference]: With dead ends: 114 [2018-11-14 18:54:46,443 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 18:54:46,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 109 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-14 18:54:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 18:54:46,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-14 18:54:46,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:46,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-14 18:54:46,469 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-14 18:54:46,469 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-14 18:54:46,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:46,471 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-14 18:54:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-14 18:54:46,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:46,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:46,472 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-14 18:54:46,472 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-14 18:54:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:46,474 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-14 18:54:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-14 18:54:46,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:46,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:46,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:46,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 18:54:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-14 18:54:46,477 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 109 [2018-11-14 18:54:46,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:46,478 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-14 18:54:46,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:54:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-14 18:54:46,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-14 18:54:46,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:46,479 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 12, 11, 11, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:46,480 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:46,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:46,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1670093159, now seen corresponding path program 11 times [2018-11-14 18:54:46,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:46,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:46,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:46,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:46,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:47,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {6518#true} call ULTIMATE.init(); {6518#true} is VALID [2018-11-14 18:54:47,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {6518#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6518#true} is VALID [2018-11-14 18:54:47,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,622 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6518#true} {6518#true} #69#return; {6518#true} is VALID [2018-11-14 18:54:47,622 INFO L256 TraceCheckUtils]: 4: Hoare triple {6518#true} call #t~ret13 := main(); {6518#true} is VALID [2018-11-14 18:54:47,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {6518#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6520#(= main_~i~1 0)} is VALID [2018-11-14 18:54:47,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {6520#(= main_~i~1 0)} assume true; {6520#(= main_~i~1 0)} is VALID [2018-11-14 18:54:47,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {6520#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6520#(= main_~i~1 0)} is VALID [2018-11-14 18:54:47,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {6520#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6521#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:47,624 INFO L273 TraceCheckUtils]: 9: Hoare triple {6521#(<= main_~i~1 1)} assume true; {6521#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:47,624 INFO L273 TraceCheckUtils]: 10: Hoare triple {6521#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6521#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:47,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {6521#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6522#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:47,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {6522#(<= main_~i~1 2)} assume true; {6522#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:47,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {6522#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6522#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:47,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {6522#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6523#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:47,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {6523#(<= main_~i~1 3)} assume true; {6523#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:47,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {6523#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6523#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:47,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {6523#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6524#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:47,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {6524#(<= main_~i~1 4)} assume true; {6524#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:47,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {6524#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6524#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:47,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {6524#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6525#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:47,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {6525#(<= main_~i~1 5)} assume true; {6525#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:47,631 INFO L273 TraceCheckUtils]: 22: Hoare triple {6525#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6525#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:47,631 INFO L273 TraceCheckUtils]: 23: Hoare triple {6525#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6526#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:47,632 INFO L273 TraceCheckUtils]: 24: Hoare triple {6526#(<= main_~i~1 6)} assume true; {6526#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:47,632 INFO L273 TraceCheckUtils]: 25: Hoare triple {6526#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6526#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:47,633 INFO L273 TraceCheckUtils]: 26: Hoare triple {6526#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6527#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:47,634 INFO L273 TraceCheckUtils]: 27: Hoare triple {6527#(<= main_~i~1 7)} assume true; {6527#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:47,634 INFO L273 TraceCheckUtils]: 28: Hoare triple {6527#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6527#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:47,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {6527#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6528#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:47,635 INFO L273 TraceCheckUtils]: 30: Hoare triple {6528#(<= main_~i~1 8)} assume true; {6528#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:47,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {6528#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6528#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:47,636 INFO L273 TraceCheckUtils]: 32: Hoare triple {6528#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6529#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:47,637 INFO L273 TraceCheckUtils]: 33: Hoare triple {6529#(<= main_~i~1 9)} assume true; {6529#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:47,637 INFO L273 TraceCheckUtils]: 34: Hoare triple {6529#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6529#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:47,638 INFO L273 TraceCheckUtils]: 35: Hoare triple {6529#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6530#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:47,639 INFO L273 TraceCheckUtils]: 36: Hoare triple {6530#(<= main_~i~1 10)} assume true; {6530#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:47,639 INFO L273 TraceCheckUtils]: 37: Hoare triple {6530#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6530#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:47,640 INFO L273 TraceCheckUtils]: 38: Hoare triple {6530#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6531#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:47,640 INFO L273 TraceCheckUtils]: 39: Hoare triple {6531#(<= main_~i~1 11)} assume true; {6531#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:47,641 INFO L273 TraceCheckUtils]: 40: Hoare triple {6531#(<= main_~i~1 11)} assume !(~i~1 < 10000); {6519#false} is VALID [2018-11-14 18:54:47,641 INFO L256 TraceCheckUtils]: 41: Hoare triple {6519#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 18:54:47,641 INFO L273 TraceCheckUtils]: 42: Hoare triple {6518#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6518#true} is VALID [2018-11-14 18:54:47,641 INFO L273 TraceCheckUtils]: 43: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,642 INFO L273 TraceCheckUtils]: 44: Hoare triple {6518#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:54:47,642 INFO L273 TraceCheckUtils]: 45: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:54:47,642 INFO L273 TraceCheckUtils]: 46: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,642 INFO L273 TraceCheckUtils]: 47: Hoare triple {6518#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:54:47,642 INFO L273 TraceCheckUtils]: 48: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:54:47,643 INFO L273 TraceCheckUtils]: 49: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,643 INFO L273 TraceCheckUtils]: 50: Hoare triple {6518#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:54:47,643 INFO L273 TraceCheckUtils]: 51: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:54:47,643 INFO L273 TraceCheckUtils]: 52: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,643 INFO L273 TraceCheckUtils]: 53: Hoare triple {6518#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:54:47,644 INFO L273 TraceCheckUtils]: 54: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:54:47,644 INFO L273 TraceCheckUtils]: 55: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,644 INFO L273 TraceCheckUtils]: 56: Hoare triple {6518#true} assume !(~i~0 < 10000); {6518#true} is VALID [2018-11-14 18:54:47,644 INFO L273 TraceCheckUtils]: 57: Hoare triple {6518#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6518#true} is VALID [2018-11-14 18:54:47,644 INFO L273 TraceCheckUtils]: 58: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,644 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6518#true} {6519#false} #73#return; {6519#false} is VALID [2018-11-14 18:54:47,644 INFO L273 TraceCheckUtils]: 60: Hoare triple {6519#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {6519#false} is VALID [2018-11-14 18:54:47,644 INFO L256 TraceCheckUtils]: 61: Hoare triple {6519#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 18:54:47,644 INFO L273 TraceCheckUtils]: 62: Hoare triple {6518#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6518#true} is VALID [2018-11-14 18:54:47,645 INFO L273 TraceCheckUtils]: 63: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,645 INFO L273 TraceCheckUtils]: 64: Hoare triple {6518#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:54:47,645 INFO L273 TraceCheckUtils]: 65: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:54:47,645 INFO L273 TraceCheckUtils]: 66: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,645 INFO L273 TraceCheckUtils]: 67: Hoare triple {6518#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:54:47,645 INFO L273 TraceCheckUtils]: 68: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:54:47,645 INFO L273 TraceCheckUtils]: 69: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,645 INFO L273 TraceCheckUtils]: 70: Hoare triple {6518#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:54:47,645 INFO L273 TraceCheckUtils]: 71: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:54:47,646 INFO L273 TraceCheckUtils]: 72: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,646 INFO L273 TraceCheckUtils]: 73: Hoare triple {6518#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:54:47,646 INFO L273 TraceCheckUtils]: 74: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:54:47,646 INFO L273 TraceCheckUtils]: 75: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,646 INFO L273 TraceCheckUtils]: 76: Hoare triple {6518#true} assume !(~i~0 < 10000); {6518#true} is VALID [2018-11-14 18:54:47,646 INFO L273 TraceCheckUtils]: 77: Hoare triple {6518#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6518#true} is VALID [2018-11-14 18:54:47,646 INFO L273 TraceCheckUtils]: 78: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,646 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6518#true} {6519#false} #75#return; {6519#false} is VALID [2018-11-14 18:54:47,646 INFO L273 TraceCheckUtils]: 80: Hoare triple {6519#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6519#false} is VALID [2018-11-14 18:54:47,647 INFO L273 TraceCheckUtils]: 81: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:47,647 INFO L273 TraceCheckUtils]: 82: Hoare triple {6519#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 18:54:47,647 INFO L273 TraceCheckUtils]: 83: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 18:54:47,647 INFO L273 TraceCheckUtils]: 84: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:47,647 INFO L273 TraceCheckUtils]: 85: Hoare triple {6519#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 18:54:47,647 INFO L273 TraceCheckUtils]: 86: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 18:54:47,647 INFO L273 TraceCheckUtils]: 87: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:47,647 INFO L273 TraceCheckUtils]: 88: Hoare triple {6519#false} assume !(~i~2 < 9999); {6519#false} is VALID [2018-11-14 18:54:47,648 INFO L273 TraceCheckUtils]: 89: Hoare triple {6519#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {6519#false} is VALID [2018-11-14 18:54:47,648 INFO L256 TraceCheckUtils]: 90: Hoare triple {6519#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 18:54:47,648 INFO L273 TraceCheckUtils]: 91: Hoare triple {6518#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6518#true} is VALID [2018-11-14 18:54:47,648 INFO L273 TraceCheckUtils]: 92: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,648 INFO L273 TraceCheckUtils]: 93: Hoare triple {6518#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:54:47,648 INFO L273 TraceCheckUtils]: 94: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:54:47,648 INFO L273 TraceCheckUtils]: 95: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,648 INFO L273 TraceCheckUtils]: 96: Hoare triple {6518#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:54:47,648 INFO L273 TraceCheckUtils]: 97: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:54:47,649 INFO L273 TraceCheckUtils]: 98: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,649 INFO L273 TraceCheckUtils]: 99: Hoare triple {6518#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:54:47,649 INFO L273 TraceCheckUtils]: 100: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:54:47,649 INFO L273 TraceCheckUtils]: 101: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,649 INFO L273 TraceCheckUtils]: 102: Hoare triple {6518#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:54:47,649 INFO L273 TraceCheckUtils]: 103: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:54:47,649 INFO L273 TraceCheckUtils]: 104: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,649 INFO L273 TraceCheckUtils]: 105: Hoare triple {6518#true} assume !(~i~0 < 10000); {6518#true} is VALID [2018-11-14 18:54:47,649 INFO L273 TraceCheckUtils]: 106: Hoare triple {6518#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6518#true} is VALID [2018-11-14 18:54:47,650 INFO L273 TraceCheckUtils]: 107: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:47,650 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {6518#true} {6519#false} #77#return; {6519#false} is VALID [2018-11-14 18:54:47,650 INFO L273 TraceCheckUtils]: 109: Hoare triple {6519#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6519#false} is VALID [2018-11-14 18:54:47,650 INFO L273 TraceCheckUtils]: 110: Hoare triple {6519#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6519#false} is VALID [2018-11-14 18:54:47,650 INFO L273 TraceCheckUtils]: 111: Hoare triple {6519#false} assume !false; {6519#false} is VALID [2018-11-14 18:54:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-14 18:54:47,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:47,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:47,664 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:54:47,996 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-14 18:54:47,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:48,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:48,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {6518#true} call ULTIMATE.init(); {6518#true} is VALID [2018-11-14 18:54:48,178 INFO L273 TraceCheckUtils]: 1: Hoare triple {6518#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6518#true} is VALID [2018-11-14 18:54:48,178 INFO L273 TraceCheckUtils]: 2: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:48,178 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6518#true} {6518#true} #69#return; {6518#true} is VALID [2018-11-14 18:54:48,178 INFO L256 TraceCheckUtils]: 4: Hoare triple {6518#true} call #t~ret13 := main(); {6518#true} is VALID [2018-11-14 18:54:48,178 INFO L273 TraceCheckUtils]: 5: Hoare triple {6518#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6518#true} is VALID [2018-11-14 18:54:48,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:48,179 INFO L273 TraceCheckUtils]: 7: Hoare triple {6518#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:54:48,179 INFO L273 TraceCheckUtils]: 8: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:54:48,179 INFO L273 TraceCheckUtils]: 9: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:48,179 INFO L273 TraceCheckUtils]: 10: Hoare triple {6518#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:54:48,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:54:48,180 INFO L273 TraceCheckUtils]: 12: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:48,180 INFO L273 TraceCheckUtils]: 13: Hoare triple {6518#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:54:48,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:54:48,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:48,180 INFO L273 TraceCheckUtils]: 16: Hoare triple {6518#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:54:48,180 INFO L273 TraceCheckUtils]: 17: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:54:48,181 INFO L273 TraceCheckUtils]: 18: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:48,181 INFO L273 TraceCheckUtils]: 19: Hoare triple {6518#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:54:48,181 INFO L273 TraceCheckUtils]: 20: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:54:48,181 INFO L273 TraceCheckUtils]: 21: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:48,181 INFO L273 TraceCheckUtils]: 22: Hoare triple {6518#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:54:48,181 INFO L273 TraceCheckUtils]: 23: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:54:48,182 INFO L273 TraceCheckUtils]: 24: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:48,182 INFO L273 TraceCheckUtils]: 25: Hoare triple {6518#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:54:48,182 INFO L273 TraceCheckUtils]: 26: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:54:48,182 INFO L273 TraceCheckUtils]: 27: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:48,182 INFO L273 TraceCheckUtils]: 28: Hoare triple {6518#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:54:48,183 INFO L273 TraceCheckUtils]: 29: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:54:48,183 INFO L273 TraceCheckUtils]: 30: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:48,183 INFO L273 TraceCheckUtils]: 31: Hoare triple {6518#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:54:48,183 INFO L273 TraceCheckUtils]: 32: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:54:48,183 INFO L273 TraceCheckUtils]: 33: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:48,183 INFO L273 TraceCheckUtils]: 34: Hoare triple {6518#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:54:48,184 INFO L273 TraceCheckUtils]: 35: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:54:48,184 INFO L273 TraceCheckUtils]: 36: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:48,184 INFO L273 TraceCheckUtils]: 37: Hoare triple {6518#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:54:48,184 INFO L273 TraceCheckUtils]: 38: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:54:48,184 INFO L273 TraceCheckUtils]: 39: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:54:48,184 INFO L273 TraceCheckUtils]: 40: Hoare triple {6518#true} assume !(~i~1 < 10000); {6518#true} is VALID [2018-11-14 18:54:48,185 INFO L256 TraceCheckUtils]: 41: Hoare triple {6518#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 18:54:48,198 INFO L273 TraceCheckUtils]: 42: Hoare triple {6518#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6661#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:48,206 INFO L273 TraceCheckUtils]: 43: Hoare triple {6661#(<= bAnd_~i~0 1)} assume true; {6661#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:48,221 INFO L273 TraceCheckUtils]: 44: Hoare triple {6661#(<= bAnd_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6661#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:48,230 INFO L273 TraceCheckUtils]: 45: Hoare triple {6661#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6671#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:54:48,240 INFO L273 TraceCheckUtils]: 46: Hoare triple {6671#(<= bAnd_~i~0 2)} assume true; {6671#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:54:48,241 INFO L273 TraceCheckUtils]: 47: Hoare triple {6671#(<= bAnd_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6671#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:54:48,242 INFO L273 TraceCheckUtils]: 48: Hoare triple {6671#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6681#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:54:48,242 INFO L273 TraceCheckUtils]: 49: Hoare triple {6681#(<= bAnd_~i~0 3)} assume true; {6681#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:54:48,244 INFO L273 TraceCheckUtils]: 50: Hoare triple {6681#(<= bAnd_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6681#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:54:48,244 INFO L273 TraceCheckUtils]: 51: Hoare triple {6681#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6691#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:54:48,244 INFO L273 TraceCheckUtils]: 52: Hoare triple {6691#(<= bAnd_~i~0 4)} assume true; {6691#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:54:48,245 INFO L273 TraceCheckUtils]: 53: Hoare triple {6691#(<= bAnd_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6691#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:54:48,245 INFO L273 TraceCheckUtils]: 54: Hoare triple {6691#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6701#(<= bAnd_~i~0 5)} is VALID [2018-11-14 18:54:48,245 INFO L273 TraceCheckUtils]: 55: Hoare triple {6701#(<= bAnd_~i~0 5)} assume true; {6701#(<= bAnd_~i~0 5)} is VALID [2018-11-14 18:54:48,246 INFO L273 TraceCheckUtils]: 56: Hoare triple {6701#(<= bAnd_~i~0 5)} assume !(~i~0 < 10000); {6519#false} is VALID [2018-11-14 18:54:48,246 INFO L273 TraceCheckUtils]: 57: Hoare triple {6519#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6519#false} is VALID [2018-11-14 18:54:48,246 INFO L273 TraceCheckUtils]: 58: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,246 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6519#false} {6518#true} #73#return; {6519#false} is VALID [2018-11-14 18:54:48,246 INFO L273 TraceCheckUtils]: 60: Hoare triple {6519#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {6519#false} is VALID [2018-11-14 18:54:48,246 INFO L256 TraceCheckUtils]: 61: Hoare triple {6519#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {6519#false} is VALID [2018-11-14 18:54:48,247 INFO L273 TraceCheckUtils]: 62: Hoare triple {6519#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6519#false} is VALID [2018-11-14 18:54:48,247 INFO L273 TraceCheckUtils]: 63: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,247 INFO L273 TraceCheckUtils]: 64: Hoare triple {6519#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:54:48,247 INFO L273 TraceCheckUtils]: 65: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:54:48,247 INFO L273 TraceCheckUtils]: 66: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,247 INFO L273 TraceCheckUtils]: 67: Hoare triple {6519#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:54:48,247 INFO L273 TraceCheckUtils]: 68: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:54:48,247 INFO L273 TraceCheckUtils]: 69: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,247 INFO L273 TraceCheckUtils]: 70: Hoare triple {6519#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:54:48,248 INFO L273 TraceCheckUtils]: 71: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:54:48,248 INFO L273 TraceCheckUtils]: 72: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,248 INFO L273 TraceCheckUtils]: 73: Hoare triple {6519#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:54:48,248 INFO L273 TraceCheckUtils]: 74: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:54:48,248 INFO L273 TraceCheckUtils]: 75: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,248 INFO L273 TraceCheckUtils]: 76: Hoare triple {6519#false} assume !(~i~0 < 10000); {6519#false} is VALID [2018-11-14 18:54:48,248 INFO L273 TraceCheckUtils]: 77: Hoare triple {6519#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6519#false} is VALID [2018-11-14 18:54:48,248 INFO L273 TraceCheckUtils]: 78: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,249 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6519#false} {6519#false} #75#return; {6519#false} is VALID [2018-11-14 18:54:48,249 INFO L273 TraceCheckUtils]: 80: Hoare triple {6519#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6519#false} is VALID [2018-11-14 18:54:48,249 INFO L273 TraceCheckUtils]: 81: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,249 INFO L273 TraceCheckUtils]: 82: Hoare triple {6519#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 18:54:48,249 INFO L273 TraceCheckUtils]: 83: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 18:54:48,249 INFO L273 TraceCheckUtils]: 84: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,249 INFO L273 TraceCheckUtils]: 85: Hoare triple {6519#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 18:54:48,249 INFO L273 TraceCheckUtils]: 86: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 18:54:48,249 INFO L273 TraceCheckUtils]: 87: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,250 INFO L273 TraceCheckUtils]: 88: Hoare triple {6519#false} assume !(~i~2 < 9999); {6519#false} is VALID [2018-11-14 18:54:48,250 INFO L273 TraceCheckUtils]: 89: Hoare triple {6519#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {6519#false} is VALID [2018-11-14 18:54:48,250 INFO L256 TraceCheckUtils]: 90: Hoare triple {6519#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {6519#false} is VALID [2018-11-14 18:54:48,250 INFO L273 TraceCheckUtils]: 91: Hoare triple {6519#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6519#false} is VALID [2018-11-14 18:54:48,250 INFO L273 TraceCheckUtils]: 92: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,250 INFO L273 TraceCheckUtils]: 93: Hoare triple {6519#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:54:48,250 INFO L273 TraceCheckUtils]: 94: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:54:48,250 INFO L273 TraceCheckUtils]: 95: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,250 INFO L273 TraceCheckUtils]: 96: Hoare triple {6519#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:54:48,251 INFO L273 TraceCheckUtils]: 97: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:54:48,251 INFO L273 TraceCheckUtils]: 98: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,251 INFO L273 TraceCheckUtils]: 99: Hoare triple {6519#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:54:48,251 INFO L273 TraceCheckUtils]: 100: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:54:48,251 INFO L273 TraceCheckUtils]: 101: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,251 INFO L273 TraceCheckUtils]: 102: Hoare triple {6519#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:54:48,251 INFO L273 TraceCheckUtils]: 103: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:54:48,251 INFO L273 TraceCheckUtils]: 104: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,252 INFO L273 TraceCheckUtils]: 105: Hoare triple {6519#false} assume !(~i~0 < 10000); {6519#false} is VALID [2018-11-14 18:54:48,252 INFO L273 TraceCheckUtils]: 106: Hoare triple {6519#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6519#false} is VALID [2018-11-14 18:54:48,252 INFO L273 TraceCheckUtils]: 107: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:54:48,252 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {6519#false} {6519#false} #77#return; {6519#false} is VALID [2018-11-14 18:54:48,252 INFO L273 TraceCheckUtils]: 109: Hoare triple {6519#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6519#false} is VALID [2018-11-14 18:54:48,252 INFO L273 TraceCheckUtils]: 110: Hoare triple {6519#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6519#false} is VALID [2018-11-14 18:54:48,252 INFO L273 TraceCheckUtils]: 111: Hoare triple {6519#false} assume !false; {6519#false} is VALID [2018-11-14 18:54:48,257 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 134 proven. 26 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-11-14 18:54:48,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:48,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-14 18:54:48,279 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2018-11-14 18:54:48,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:48,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 18:54:48,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:48,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 18:54:48,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 18:54:48,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:54:48,381 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 19 states. [2018-11-14 18:54:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:48,818 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-11-14 18:54:48,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 18:54:48,819 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2018-11-14 18:54:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:54:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 112 transitions. [2018-11-14 18:54:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:54:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 112 transitions. [2018-11-14 18:54:48,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 112 transitions. [2018-11-14 18:54:49,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:49,289 INFO L225 Difference]: With dead ends: 121 [2018-11-14 18:54:49,289 INFO L226 Difference]: Without dead ends: 85 [2018-11-14 18:54:49,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:54:49,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-14 18:54:49,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-11-14 18:54:49,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:49,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 83 states. [2018-11-14 18:54:49,400 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 83 states. [2018-11-14 18:54:49,400 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 83 states. [2018-11-14 18:54:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:49,403 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-14 18:54:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-14 18:54:49,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:49,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:49,404 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 85 states. [2018-11-14 18:54:49,404 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 85 states. [2018-11-14 18:54:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:49,406 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-14 18:54:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-14 18:54:49,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:49,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:49,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:49,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 18:54:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-14 18:54:49,409 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 112 [2018-11-14 18:54:49,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:49,410 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-14 18:54:49,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 18:54:49,410 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-14 18:54:49,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-14 18:54:49,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:49,411 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 13, 12, 12, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:49,412 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:49,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:49,412 INFO L82 PathProgramCache]: Analyzing trace with hash -167472347, now seen corresponding path program 12 times [2018-11-14 18:54:49,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:49,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:49,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:49,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:49,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:50,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {7318#true} call ULTIMATE.init(); {7318#true} is VALID [2018-11-14 18:54:50,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {7318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7318#true} is VALID [2018-11-14 18:54:50,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,223 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7318#true} {7318#true} #69#return; {7318#true} is VALID [2018-11-14 18:54:50,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {7318#true} call #t~ret13 := main(); {7318#true} is VALID [2018-11-14 18:54:50,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {7318#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7320#(= main_~i~1 0)} is VALID [2018-11-14 18:54:50,224 INFO L273 TraceCheckUtils]: 6: Hoare triple {7320#(= main_~i~1 0)} assume true; {7320#(= main_~i~1 0)} is VALID [2018-11-14 18:54:50,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {7320#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7320#(= main_~i~1 0)} is VALID [2018-11-14 18:54:50,224 INFO L273 TraceCheckUtils]: 8: Hoare triple {7320#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7321#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:50,225 INFO L273 TraceCheckUtils]: 9: Hoare triple {7321#(<= main_~i~1 1)} assume true; {7321#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:50,225 INFO L273 TraceCheckUtils]: 10: Hoare triple {7321#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7321#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:50,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {7321#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7322#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:50,226 INFO L273 TraceCheckUtils]: 12: Hoare triple {7322#(<= main_~i~1 2)} assume true; {7322#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:50,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {7322#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7322#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:50,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {7322#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7323#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:50,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {7323#(<= main_~i~1 3)} assume true; {7323#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:50,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {7323#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7323#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:50,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {7323#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7324#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:50,229 INFO L273 TraceCheckUtils]: 18: Hoare triple {7324#(<= main_~i~1 4)} assume true; {7324#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:50,230 INFO L273 TraceCheckUtils]: 19: Hoare triple {7324#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7324#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:50,230 INFO L273 TraceCheckUtils]: 20: Hoare triple {7324#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7325#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:50,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {7325#(<= main_~i~1 5)} assume true; {7325#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:50,232 INFO L273 TraceCheckUtils]: 22: Hoare triple {7325#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7325#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:50,232 INFO L273 TraceCheckUtils]: 23: Hoare triple {7325#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7326#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:50,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {7326#(<= main_~i~1 6)} assume true; {7326#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:50,233 INFO L273 TraceCheckUtils]: 25: Hoare triple {7326#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7326#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:50,234 INFO L273 TraceCheckUtils]: 26: Hoare triple {7326#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7327#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:50,235 INFO L273 TraceCheckUtils]: 27: Hoare triple {7327#(<= main_~i~1 7)} assume true; {7327#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:50,235 INFO L273 TraceCheckUtils]: 28: Hoare triple {7327#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7327#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:50,236 INFO L273 TraceCheckUtils]: 29: Hoare triple {7327#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7328#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:50,236 INFO L273 TraceCheckUtils]: 30: Hoare triple {7328#(<= main_~i~1 8)} assume true; {7328#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:50,237 INFO L273 TraceCheckUtils]: 31: Hoare triple {7328#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7328#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:50,238 INFO L273 TraceCheckUtils]: 32: Hoare triple {7328#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7329#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:50,238 INFO L273 TraceCheckUtils]: 33: Hoare triple {7329#(<= main_~i~1 9)} assume true; {7329#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:50,239 INFO L273 TraceCheckUtils]: 34: Hoare triple {7329#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7329#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:50,239 INFO L273 TraceCheckUtils]: 35: Hoare triple {7329#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7330#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:50,240 INFO L273 TraceCheckUtils]: 36: Hoare triple {7330#(<= main_~i~1 10)} assume true; {7330#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:50,241 INFO L273 TraceCheckUtils]: 37: Hoare triple {7330#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7330#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:50,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {7330#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7331#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:50,242 INFO L273 TraceCheckUtils]: 39: Hoare triple {7331#(<= main_~i~1 11)} assume true; {7331#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:50,242 INFO L273 TraceCheckUtils]: 40: Hoare triple {7331#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7331#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:50,243 INFO L273 TraceCheckUtils]: 41: Hoare triple {7331#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7332#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:50,244 INFO L273 TraceCheckUtils]: 42: Hoare triple {7332#(<= main_~i~1 12)} assume true; {7332#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:50,244 INFO L273 TraceCheckUtils]: 43: Hoare triple {7332#(<= main_~i~1 12)} assume !(~i~1 < 10000); {7319#false} is VALID [2018-11-14 18:54:50,244 INFO L256 TraceCheckUtils]: 44: Hoare triple {7319#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 18:54:50,245 INFO L273 TraceCheckUtils]: 45: Hoare triple {7318#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 18:54:50,245 INFO L273 TraceCheckUtils]: 46: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,245 INFO L273 TraceCheckUtils]: 47: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,245 INFO L273 TraceCheckUtils]: 48: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,245 INFO L273 TraceCheckUtils]: 49: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,246 INFO L273 TraceCheckUtils]: 50: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,246 INFO L273 TraceCheckUtils]: 51: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,246 INFO L273 TraceCheckUtils]: 52: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,246 INFO L273 TraceCheckUtils]: 53: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,246 INFO L273 TraceCheckUtils]: 54: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,247 INFO L273 TraceCheckUtils]: 55: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,247 INFO L273 TraceCheckUtils]: 56: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,247 INFO L273 TraceCheckUtils]: 57: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,247 INFO L273 TraceCheckUtils]: 58: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,247 INFO L273 TraceCheckUtils]: 59: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,248 INFO L273 TraceCheckUtils]: 60: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,248 INFO L273 TraceCheckUtils]: 61: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,248 INFO L273 TraceCheckUtils]: 62: Hoare triple {7318#true} assume !(~i~0 < 10000); {7318#true} is VALID [2018-11-14 18:54:50,248 INFO L273 TraceCheckUtils]: 63: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 18:54:50,248 INFO L273 TraceCheckUtils]: 64: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,249 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {7318#true} {7319#false} #73#return; {7319#false} is VALID [2018-11-14 18:54:50,249 INFO L273 TraceCheckUtils]: 66: Hoare triple {7319#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {7319#false} is VALID [2018-11-14 18:54:50,249 INFO L256 TraceCheckUtils]: 67: Hoare triple {7319#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 18:54:50,249 INFO L273 TraceCheckUtils]: 68: Hoare triple {7318#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 18:54:50,249 INFO L273 TraceCheckUtils]: 69: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,249 INFO L273 TraceCheckUtils]: 70: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,249 INFO L273 TraceCheckUtils]: 71: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,249 INFO L273 TraceCheckUtils]: 72: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,250 INFO L273 TraceCheckUtils]: 73: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,250 INFO L273 TraceCheckUtils]: 74: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,250 INFO L273 TraceCheckUtils]: 75: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,250 INFO L273 TraceCheckUtils]: 76: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,250 INFO L273 TraceCheckUtils]: 77: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,250 INFO L273 TraceCheckUtils]: 78: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,250 INFO L273 TraceCheckUtils]: 79: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,250 INFO L273 TraceCheckUtils]: 80: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,250 INFO L273 TraceCheckUtils]: 81: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,251 INFO L273 TraceCheckUtils]: 82: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,251 INFO L273 TraceCheckUtils]: 83: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,251 INFO L273 TraceCheckUtils]: 84: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,251 INFO L273 TraceCheckUtils]: 85: Hoare triple {7318#true} assume !(~i~0 < 10000); {7318#true} is VALID [2018-11-14 18:54:50,251 INFO L273 TraceCheckUtils]: 86: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 18:54:50,251 INFO L273 TraceCheckUtils]: 87: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,251 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {7318#true} {7319#false} #75#return; {7319#false} is VALID [2018-11-14 18:54:50,251 INFO L273 TraceCheckUtils]: 89: Hoare triple {7319#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7319#false} is VALID [2018-11-14 18:54:50,251 INFO L273 TraceCheckUtils]: 90: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:54:50,252 INFO L273 TraceCheckUtils]: 91: Hoare triple {7319#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7319#false} is VALID [2018-11-14 18:54:50,252 INFO L273 TraceCheckUtils]: 92: Hoare triple {7319#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7319#false} is VALID [2018-11-14 18:54:50,252 INFO L273 TraceCheckUtils]: 93: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:54:50,252 INFO L273 TraceCheckUtils]: 94: Hoare triple {7319#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7319#false} is VALID [2018-11-14 18:54:50,252 INFO L273 TraceCheckUtils]: 95: Hoare triple {7319#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7319#false} is VALID [2018-11-14 18:54:50,252 INFO L273 TraceCheckUtils]: 96: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:54:50,252 INFO L273 TraceCheckUtils]: 97: Hoare triple {7319#false} assume !(~i~2 < 9999); {7319#false} is VALID [2018-11-14 18:54:50,252 INFO L273 TraceCheckUtils]: 98: Hoare triple {7319#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {7319#false} is VALID [2018-11-14 18:54:50,253 INFO L256 TraceCheckUtils]: 99: Hoare triple {7319#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 18:54:50,253 INFO L273 TraceCheckUtils]: 100: Hoare triple {7318#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 18:54:50,253 INFO L273 TraceCheckUtils]: 101: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,253 INFO L273 TraceCheckUtils]: 102: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,253 INFO L273 TraceCheckUtils]: 103: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,253 INFO L273 TraceCheckUtils]: 104: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,253 INFO L273 TraceCheckUtils]: 105: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,253 INFO L273 TraceCheckUtils]: 106: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,253 INFO L273 TraceCheckUtils]: 107: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,254 INFO L273 TraceCheckUtils]: 108: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,254 INFO L273 TraceCheckUtils]: 109: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,254 INFO L273 TraceCheckUtils]: 110: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,254 INFO L273 TraceCheckUtils]: 111: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,254 INFO L273 TraceCheckUtils]: 112: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,254 INFO L273 TraceCheckUtils]: 113: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,254 INFO L273 TraceCheckUtils]: 114: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,254 INFO L273 TraceCheckUtils]: 115: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,254 INFO L273 TraceCheckUtils]: 116: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,255 INFO L273 TraceCheckUtils]: 117: Hoare triple {7318#true} assume !(~i~0 < 10000); {7318#true} is VALID [2018-11-14 18:54:50,255 INFO L273 TraceCheckUtils]: 118: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 18:54:50,255 INFO L273 TraceCheckUtils]: 119: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,255 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {7318#true} {7319#false} #77#return; {7319#false} is VALID [2018-11-14 18:54:50,255 INFO L273 TraceCheckUtils]: 121: Hoare triple {7319#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7319#false} is VALID [2018-11-14 18:54:50,255 INFO L273 TraceCheckUtils]: 122: Hoare triple {7319#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7319#false} is VALID [2018-11-14 18:54:50,255 INFO L273 TraceCheckUtils]: 123: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2018-11-14 18:54:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2018-11-14 18:54:50,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:50,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:50,271 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:54:50,338 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 18:54:50,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:50,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:50,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {7318#true} call ULTIMATE.init(); {7318#true} is VALID [2018-11-14 18:54:50,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {7318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7318#true} is VALID [2018-11-14 18:54:50,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,799 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7318#true} {7318#true} #69#return; {7318#true} is VALID [2018-11-14 18:54:50,799 INFO L256 TraceCheckUtils]: 4: Hoare triple {7318#true} call #t~ret13 := main(); {7318#true} is VALID [2018-11-14 18:54:50,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {7318#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7318#true} is VALID [2018-11-14 18:54:50,800 INFO L273 TraceCheckUtils]: 6: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {7318#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:54:50,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:54:50,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {7318#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:54:50,800 INFO L273 TraceCheckUtils]: 11: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:54:50,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {7318#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:54:50,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:54:50,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {7318#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:54:50,801 INFO L273 TraceCheckUtils]: 17: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:54:50,801 INFO L273 TraceCheckUtils]: 18: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {7318#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:54:50,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:54:50,801 INFO L273 TraceCheckUtils]: 21: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,801 INFO L273 TraceCheckUtils]: 22: Hoare triple {7318#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:54:50,802 INFO L273 TraceCheckUtils]: 23: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:54:50,802 INFO L273 TraceCheckUtils]: 24: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,802 INFO L273 TraceCheckUtils]: 25: Hoare triple {7318#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:54:50,802 INFO L273 TraceCheckUtils]: 26: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:54:50,802 INFO L273 TraceCheckUtils]: 27: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,802 INFO L273 TraceCheckUtils]: 28: Hoare triple {7318#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:54:50,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:54:50,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {7318#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:54:50,803 INFO L273 TraceCheckUtils]: 32: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:54:50,803 INFO L273 TraceCheckUtils]: 33: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,803 INFO L273 TraceCheckUtils]: 34: Hoare triple {7318#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:54:50,803 INFO L273 TraceCheckUtils]: 35: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:54:50,803 INFO L273 TraceCheckUtils]: 36: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,803 INFO L273 TraceCheckUtils]: 37: Hoare triple {7318#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:54:50,803 INFO L273 TraceCheckUtils]: 38: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:54:50,803 INFO L273 TraceCheckUtils]: 39: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,804 INFO L273 TraceCheckUtils]: 40: Hoare triple {7318#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:54:50,804 INFO L273 TraceCheckUtils]: 41: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:54:50,804 INFO L273 TraceCheckUtils]: 42: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,804 INFO L273 TraceCheckUtils]: 43: Hoare triple {7318#true} assume !(~i~1 < 10000); {7318#true} is VALID [2018-11-14 18:54:50,804 INFO L256 TraceCheckUtils]: 44: Hoare triple {7318#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 18:54:50,804 INFO L273 TraceCheckUtils]: 45: Hoare triple {7318#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 18:54:50,804 INFO L273 TraceCheckUtils]: 46: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,804 INFO L273 TraceCheckUtils]: 47: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,804 INFO L273 TraceCheckUtils]: 48: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,805 INFO L273 TraceCheckUtils]: 49: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,805 INFO L273 TraceCheckUtils]: 50: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,805 INFO L273 TraceCheckUtils]: 51: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,805 INFO L273 TraceCheckUtils]: 52: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,805 INFO L273 TraceCheckUtils]: 53: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,805 INFO L273 TraceCheckUtils]: 54: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,805 INFO L273 TraceCheckUtils]: 55: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,805 INFO L273 TraceCheckUtils]: 56: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,806 INFO L273 TraceCheckUtils]: 57: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,806 INFO L273 TraceCheckUtils]: 58: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,806 INFO L273 TraceCheckUtils]: 59: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,806 INFO L273 TraceCheckUtils]: 60: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,806 INFO L273 TraceCheckUtils]: 61: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,806 INFO L273 TraceCheckUtils]: 62: Hoare triple {7318#true} assume !(~i~0 < 10000); {7318#true} is VALID [2018-11-14 18:54:50,806 INFO L273 TraceCheckUtils]: 63: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 18:54:50,806 INFO L273 TraceCheckUtils]: 64: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,806 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {7318#true} {7318#true} #73#return; {7318#true} is VALID [2018-11-14 18:54:50,807 INFO L273 TraceCheckUtils]: 66: Hoare triple {7318#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {7318#true} is VALID [2018-11-14 18:54:50,807 INFO L256 TraceCheckUtils]: 67: Hoare triple {7318#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 18:54:50,807 INFO L273 TraceCheckUtils]: 68: Hoare triple {7318#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 18:54:50,807 INFO L273 TraceCheckUtils]: 69: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,807 INFO L273 TraceCheckUtils]: 70: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,807 INFO L273 TraceCheckUtils]: 71: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,807 INFO L273 TraceCheckUtils]: 72: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,807 INFO L273 TraceCheckUtils]: 73: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,807 INFO L273 TraceCheckUtils]: 74: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,808 INFO L273 TraceCheckUtils]: 75: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,808 INFO L273 TraceCheckUtils]: 76: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,808 INFO L273 TraceCheckUtils]: 77: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,808 INFO L273 TraceCheckUtils]: 78: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,808 INFO L273 TraceCheckUtils]: 79: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,808 INFO L273 TraceCheckUtils]: 80: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,808 INFO L273 TraceCheckUtils]: 81: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,808 INFO L273 TraceCheckUtils]: 82: Hoare triple {7318#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:54:50,809 INFO L273 TraceCheckUtils]: 83: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:54:50,809 INFO L273 TraceCheckUtils]: 84: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,809 INFO L273 TraceCheckUtils]: 85: Hoare triple {7318#true} assume !(~i~0 < 10000); {7318#true} is VALID [2018-11-14 18:54:50,809 INFO L273 TraceCheckUtils]: 86: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 18:54:50,809 INFO L273 TraceCheckUtils]: 87: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:54:50,809 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {7318#true} {7318#true} #75#return; {7318#true} is VALID [2018-11-14 18:54:50,810 INFO L273 TraceCheckUtils]: 89: Hoare triple {7318#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7603#(<= main_~i~2 0)} is VALID [2018-11-14 18:54:50,810 INFO L273 TraceCheckUtils]: 90: Hoare triple {7603#(<= main_~i~2 0)} assume true; {7603#(<= main_~i~2 0)} is VALID [2018-11-14 18:54:50,811 INFO L273 TraceCheckUtils]: 91: Hoare triple {7603#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7603#(<= main_~i~2 0)} is VALID [2018-11-14 18:54:50,811 INFO L273 TraceCheckUtils]: 92: Hoare triple {7603#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7613#(<= main_~i~2 1)} is VALID [2018-11-14 18:54:50,813 INFO L273 TraceCheckUtils]: 93: Hoare triple {7613#(<= main_~i~2 1)} assume true; {7613#(<= main_~i~2 1)} is VALID [2018-11-14 18:54:50,813 INFO L273 TraceCheckUtils]: 94: Hoare triple {7613#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7613#(<= main_~i~2 1)} is VALID [2018-11-14 18:54:50,815 INFO L273 TraceCheckUtils]: 95: Hoare triple {7613#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7623#(<= main_~i~2 2)} is VALID [2018-11-14 18:54:50,815 INFO L273 TraceCheckUtils]: 96: Hoare triple {7623#(<= main_~i~2 2)} assume true; {7623#(<= main_~i~2 2)} is VALID [2018-11-14 18:54:50,817 INFO L273 TraceCheckUtils]: 97: Hoare triple {7623#(<= main_~i~2 2)} assume !(~i~2 < 9999); {7319#false} is VALID [2018-11-14 18:54:50,817 INFO L273 TraceCheckUtils]: 98: Hoare triple {7319#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {7319#false} is VALID [2018-11-14 18:54:50,817 INFO L256 TraceCheckUtils]: 99: Hoare triple {7319#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {7319#false} is VALID [2018-11-14 18:54:50,817 INFO L273 TraceCheckUtils]: 100: Hoare triple {7319#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7319#false} is VALID [2018-11-14 18:54:50,817 INFO L273 TraceCheckUtils]: 101: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:54:50,817 INFO L273 TraceCheckUtils]: 102: Hoare triple {7319#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 18:54:50,817 INFO L273 TraceCheckUtils]: 103: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 18:54:50,817 INFO L273 TraceCheckUtils]: 104: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:54:50,818 INFO L273 TraceCheckUtils]: 105: Hoare triple {7319#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 18:54:50,818 INFO L273 TraceCheckUtils]: 106: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 18:54:50,818 INFO L273 TraceCheckUtils]: 107: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:54:50,818 INFO L273 TraceCheckUtils]: 108: Hoare triple {7319#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 18:54:50,818 INFO L273 TraceCheckUtils]: 109: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 18:54:50,818 INFO L273 TraceCheckUtils]: 110: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:54:50,818 INFO L273 TraceCheckUtils]: 111: Hoare triple {7319#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 18:54:50,818 INFO L273 TraceCheckUtils]: 112: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 18:54:50,819 INFO L273 TraceCheckUtils]: 113: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:54:50,819 INFO L273 TraceCheckUtils]: 114: Hoare triple {7319#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 18:54:50,819 INFO L273 TraceCheckUtils]: 115: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 18:54:50,819 INFO L273 TraceCheckUtils]: 116: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:54:50,819 INFO L273 TraceCheckUtils]: 117: Hoare triple {7319#false} assume !(~i~0 < 10000); {7319#false} is VALID [2018-11-14 18:54:50,819 INFO L273 TraceCheckUtils]: 118: Hoare triple {7319#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7319#false} is VALID [2018-11-14 18:54:50,819 INFO L273 TraceCheckUtils]: 119: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:54:50,819 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {7319#false} {7319#false} #77#return; {7319#false} is VALID [2018-11-14 18:54:50,820 INFO L273 TraceCheckUtils]: 121: Hoare triple {7319#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7319#false} is VALID [2018-11-14 18:54:50,820 INFO L273 TraceCheckUtils]: 122: Hoare triple {7319#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7319#false} is VALID [2018-11-14 18:54:50,820 INFO L273 TraceCheckUtils]: 123: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2018-11-14 18:54:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 202 proven. 7 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2018-11-14 18:54:50,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:50,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2018-11-14 18:54:50,854 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2018-11-14 18:54:50,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:50,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:54:50,980 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-14 18:54:50,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:54:50,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:54:50,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:54:50,981 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 18 states. [2018-11-14 18:54:51,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:51,535 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-14 18:54:51,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 18:54:51,535 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2018-11-14 18:54:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:54:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 106 transitions. [2018-11-14 18:54:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:54:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 106 transitions. [2018-11-14 18:54:51,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 106 transitions. [2018-11-14 18:54:52,037 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-14 18:54:52,041 INFO L225 Difference]: With dead ends: 130 [2018-11-14 18:54:52,041 INFO L226 Difference]: Without dead ends: 91 [2018-11-14 18:54:52,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:54:52,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-14 18:54:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-11-14 18:54:52,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:52,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 89 states. [2018-11-14 18:54:52,073 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 89 states. [2018-11-14 18:54:52,073 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 89 states. [2018-11-14 18:54:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:52,077 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-14 18:54:52,078 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-14 18:54:52,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:52,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:52,078 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 91 states. [2018-11-14 18:54:52,079 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 91 states. [2018-11-14 18:54:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:52,081 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-14 18:54:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-14 18:54:52,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:52,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:52,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:52,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 18:54:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-14 18:54:52,085 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-14 18:54:52,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:52,085 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-14 18:54:52,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:54:52,085 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-14 18:54:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-14 18:54:52,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:52,087 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 14, 13, 13, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:52,087 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:52,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:52,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1755612877, now seen corresponding path program 13 times [2018-11-14 18:54:52,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:52,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:52,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:52,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:52,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:52,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {8185#true} call ULTIMATE.init(); {8185#true} is VALID [2018-11-14 18:54:52,447 INFO L273 TraceCheckUtils]: 1: Hoare triple {8185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8185#true} is VALID [2018-11-14 18:54:52,448 INFO L273 TraceCheckUtils]: 2: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,448 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8185#true} {8185#true} #69#return; {8185#true} is VALID [2018-11-14 18:54:52,448 INFO L256 TraceCheckUtils]: 4: Hoare triple {8185#true} call #t~ret13 := main(); {8185#true} is VALID [2018-11-14 18:54:52,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {8185#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8187#(= main_~i~1 0)} is VALID [2018-11-14 18:54:52,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {8187#(= main_~i~1 0)} assume true; {8187#(= main_~i~1 0)} is VALID [2018-11-14 18:54:52,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {8187#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8187#(= main_~i~1 0)} is VALID [2018-11-14 18:54:52,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {8187#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:52,451 INFO L273 TraceCheckUtils]: 9: Hoare triple {8188#(<= main_~i~1 1)} assume true; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:52,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {8188#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:52,451 INFO L273 TraceCheckUtils]: 11: Hoare triple {8188#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:52,452 INFO L273 TraceCheckUtils]: 12: Hoare triple {8189#(<= main_~i~1 2)} assume true; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:52,452 INFO L273 TraceCheckUtils]: 13: Hoare triple {8189#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:52,453 INFO L273 TraceCheckUtils]: 14: Hoare triple {8189#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:52,453 INFO L273 TraceCheckUtils]: 15: Hoare triple {8190#(<= main_~i~1 3)} assume true; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:52,454 INFO L273 TraceCheckUtils]: 16: Hoare triple {8190#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:52,455 INFO L273 TraceCheckUtils]: 17: Hoare triple {8190#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:52,455 INFO L273 TraceCheckUtils]: 18: Hoare triple {8191#(<= main_~i~1 4)} assume true; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:52,456 INFO L273 TraceCheckUtils]: 19: Hoare triple {8191#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:52,457 INFO L273 TraceCheckUtils]: 20: Hoare triple {8191#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:52,457 INFO L273 TraceCheckUtils]: 21: Hoare triple {8192#(<= main_~i~1 5)} assume true; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:52,458 INFO L273 TraceCheckUtils]: 22: Hoare triple {8192#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:52,461 INFO L273 TraceCheckUtils]: 23: Hoare triple {8192#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:52,462 INFO L273 TraceCheckUtils]: 24: Hoare triple {8193#(<= main_~i~1 6)} assume true; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:52,462 INFO L273 TraceCheckUtils]: 25: Hoare triple {8193#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:52,463 INFO L273 TraceCheckUtils]: 26: Hoare triple {8193#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:52,463 INFO L273 TraceCheckUtils]: 27: Hoare triple {8194#(<= main_~i~1 7)} assume true; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:52,463 INFO L273 TraceCheckUtils]: 28: Hoare triple {8194#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:52,464 INFO L273 TraceCheckUtils]: 29: Hoare triple {8194#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:52,464 INFO L273 TraceCheckUtils]: 30: Hoare triple {8195#(<= main_~i~1 8)} assume true; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:52,464 INFO L273 TraceCheckUtils]: 31: Hoare triple {8195#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:52,465 INFO L273 TraceCheckUtils]: 32: Hoare triple {8195#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:52,465 INFO L273 TraceCheckUtils]: 33: Hoare triple {8196#(<= main_~i~1 9)} assume true; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:52,466 INFO L273 TraceCheckUtils]: 34: Hoare triple {8196#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:52,467 INFO L273 TraceCheckUtils]: 35: Hoare triple {8196#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:52,467 INFO L273 TraceCheckUtils]: 36: Hoare triple {8197#(<= main_~i~1 10)} assume true; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:52,468 INFO L273 TraceCheckUtils]: 37: Hoare triple {8197#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:52,468 INFO L273 TraceCheckUtils]: 38: Hoare triple {8197#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:52,469 INFO L273 TraceCheckUtils]: 39: Hoare triple {8198#(<= main_~i~1 11)} assume true; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:52,469 INFO L273 TraceCheckUtils]: 40: Hoare triple {8198#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:52,470 INFO L273 TraceCheckUtils]: 41: Hoare triple {8198#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:52,471 INFO L273 TraceCheckUtils]: 42: Hoare triple {8199#(<= main_~i~1 12)} assume true; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:52,471 INFO L273 TraceCheckUtils]: 43: Hoare triple {8199#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:52,472 INFO L273 TraceCheckUtils]: 44: Hoare triple {8199#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:52,473 INFO L273 TraceCheckUtils]: 45: Hoare triple {8200#(<= main_~i~1 13)} assume true; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:52,473 INFO L273 TraceCheckUtils]: 46: Hoare triple {8200#(<= main_~i~1 13)} assume !(~i~1 < 10000); {8186#false} is VALID [2018-11-14 18:54:52,473 INFO L256 TraceCheckUtils]: 47: Hoare triple {8186#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {8185#true} is VALID [2018-11-14 18:54:52,474 INFO L273 TraceCheckUtils]: 48: Hoare triple {8185#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8185#true} is VALID [2018-11-14 18:54:52,474 INFO L273 TraceCheckUtils]: 49: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,474 INFO L273 TraceCheckUtils]: 50: Hoare triple {8185#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:54:52,474 INFO L273 TraceCheckUtils]: 51: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:54:52,475 INFO L273 TraceCheckUtils]: 52: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,475 INFO L273 TraceCheckUtils]: 53: Hoare triple {8185#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:54:52,475 INFO L273 TraceCheckUtils]: 54: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:54:52,475 INFO L273 TraceCheckUtils]: 55: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,475 INFO L273 TraceCheckUtils]: 56: Hoare triple {8185#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:54:52,476 INFO L273 TraceCheckUtils]: 57: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:54:52,476 INFO L273 TraceCheckUtils]: 58: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,476 INFO L273 TraceCheckUtils]: 59: Hoare triple {8185#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:54:52,476 INFO L273 TraceCheckUtils]: 60: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:54:52,476 INFO L273 TraceCheckUtils]: 61: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,477 INFO L273 TraceCheckUtils]: 62: Hoare triple {8185#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:54:52,477 INFO L273 TraceCheckUtils]: 63: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:54:52,477 INFO L273 TraceCheckUtils]: 64: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,477 INFO L273 TraceCheckUtils]: 65: Hoare triple {8185#true} assume !(~i~0 < 10000); {8185#true} is VALID [2018-11-14 18:54:52,477 INFO L273 TraceCheckUtils]: 66: Hoare triple {8185#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8185#true} is VALID [2018-11-14 18:54:52,478 INFO L273 TraceCheckUtils]: 67: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,478 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {8185#true} {8186#false} #73#return; {8186#false} is VALID [2018-11-14 18:54:52,478 INFO L273 TraceCheckUtils]: 69: Hoare triple {8186#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {8186#false} is VALID [2018-11-14 18:54:52,478 INFO L256 TraceCheckUtils]: 70: Hoare triple {8186#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {8185#true} is VALID [2018-11-14 18:54:52,478 INFO L273 TraceCheckUtils]: 71: Hoare triple {8185#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8185#true} is VALID [2018-11-14 18:54:52,478 INFO L273 TraceCheckUtils]: 72: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,478 INFO L273 TraceCheckUtils]: 73: Hoare triple {8185#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:54:52,478 INFO L273 TraceCheckUtils]: 74: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:54:52,479 INFO L273 TraceCheckUtils]: 75: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,479 INFO L273 TraceCheckUtils]: 76: Hoare triple {8185#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:54:52,479 INFO L273 TraceCheckUtils]: 77: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:54:52,479 INFO L273 TraceCheckUtils]: 78: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,479 INFO L273 TraceCheckUtils]: 79: Hoare triple {8185#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:54:52,479 INFO L273 TraceCheckUtils]: 80: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:54:52,479 INFO L273 TraceCheckUtils]: 81: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,479 INFO L273 TraceCheckUtils]: 82: Hoare triple {8185#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:54:52,479 INFO L273 TraceCheckUtils]: 83: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:54:52,480 INFO L273 TraceCheckUtils]: 84: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,480 INFO L273 TraceCheckUtils]: 85: Hoare triple {8185#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:54:52,480 INFO L273 TraceCheckUtils]: 86: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:54:52,480 INFO L273 TraceCheckUtils]: 87: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,480 INFO L273 TraceCheckUtils]: 88: Hoare triple {8185#true} assume !(~i~0 < 10000); {8185#true} is VALID [2018-11-14 18:54:52,480 INFO L273 TraceCheckUtils]: 89: Hoare triple {8185#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8185#true} is VALID [2018-11-14 18:54:52,480 INFO L273 TraceCheckUtils]: 90: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,480 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {8185#true} {8186#false} #75#return; {8186#false} is VALID [2018-11-14 18:54:52,481 INFO L273 TraceCheckUtils]: 92: Hoare triple {8186#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8186#false} is VALID [2018-11-14 18:54:52,481 INFO L273 TraceCheckUtils]: 93: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,481 INFO L273 TraceCheckUtils]: 94: Hoare triple {8186#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 18:54:52,481 INFO L273 TraceCheckUtils]: 95: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 18:54:52,481 INFO L273 TraceCheckUtils]: 96: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,481 INFO L273 TraceCheckUtils]: 97: Hoare triple {8186#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 18:54:52,481 INFO L273 TraceCheckUtils]: 98: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 18:54:52,481 INFO L273 TraceCheckUtils]: 99: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,481 INFO L273 TraceCheckUtils]: 100: Hoare triple {8186#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 18:54:52,482 INFO L273 TraceCheckUtils]: 101: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 18:54:52,482 INFO L273 TraceCheckUtils]: 102: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,482 INFO L273 TraceCheckUtils]: 103: Hoare triple {8186#false} assume !(~i~2 < 9999); {8186#false} is VALID [2018-11-14 18:54:52,482 INFO L273 TraceCheckUtils]: 104: Hoare triple {8186#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {8186#false} is VALID [2018-11-14 18:54:52,482 INFO L256 TraceCheckUtils]: 105: Hoare triple {8186#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {8185#true} is VALID [2018-11-14 18:54:52,482 INFO L273 TraceCheckUtils]: 106: Hoare triple {8185#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8185#true} is VALID [2018-11-14 18:54:52,482 INFO L273 TraceCheckUtils]: 107: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,482 INFO L273 TraceCheckUtils]: 108: Hoare triple {8185#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:54:52,482 INFO L273 TraceCheckUtils]: 109: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:54:52,483 INFO L273 TraceCheckUtils]: 110: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,483 INFO L273 TraceCheckUtils]: 111: Hoare triple {8185#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:54:52,483 INFO L273 TraceCheckUtils]: 112: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:54:52,483 INFO L273 TraceCheckUtils]: 113: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,483 INFO L273 TraceCheckUtils]: 114: Hoare triple {8185#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:54:52,483 INFO L273 TraceCheckUtils]: 115: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:54:52,483 INFO L273 TraceCheckUtils]: 116: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,483 INFO L273 TraceCheckUtils]: 117: Hoare triple {8185#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:54:52,484 INFO L273 TraceCheckUtils]: 118: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:54:52,484 INFO L273 TraceCheckUtils]: 119: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,484 INFO L273 TraceCheckUtils]: 120: Hoare triple {8185#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:54:52,484 INFO L273 TraceCheckUtils]: 121: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:54:52,484 INFO L273 TraceCheckUtils]: 122: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,484 INFO L273 TraceCheckUtils]: 123: Hoare triple {8185#true} assume !(~i~0 < 10000); {8185#true} is VALID [2018-11-14 18:54:52,484 INFO L273 TraceCheckUtils]: 124: Hoare triple {8185#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8185#true} is VALID [2018-11-14 18:54:52,484 INFO L273 TraceCheckUtils]: 125: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,484 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {8185#true} {8186#false} #77#return; {8186#false} is VALID [2018-11-14 18:54:52,485 INFO L273 TraceCheckUtils]: 127: Hoare triple {8186#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8186#false} is VALID [2018-11-14 18:54:52,485 INFO L273 TraceCheckUtils]: 128: Hoare triple {8186#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8186#false} is VALID [2018-11-14 18:54:52,485 INFO L273 TraceCheckUtils]: 129: Hoare triple {8186#false} assume !false; {8186#false} is VALID [2018-11-14 18:54:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 18:54:52,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:52,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:52,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:52,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:52,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {8185#true} call ULTIMATE.init(); {8185#true} is VALID [2018-11-14 18:54:52,868 INFO L273 TraceCheckUtils]: 1: Hoare triple {8185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8185#true} is VALID [2018-11-14 18:54:52,868 INFO L273 TraceCheckUtils]: 2: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:54:52,868 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8185#true} {8185#true} #69#return; {8185#true} is VALID [2018-11-14 18:54:52,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {8185#true} call #t~ret13 := main(); {8185#true} is VALID [2018-11-14 18:54:52,870 INFO L273 TraceCheckUtils]: 5: Hoare triple {8185#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8219#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:52,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {8219#(<= main_~i~1 0)} assume true; {8219#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:52,870 INFO L273 TraceCheckUtils]: 7: Hoare triple {8219#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8219#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:52,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {8219#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:52,871 INFO L273 TraceCheckUtils]: 9: Hoare triple {8188#(<= main_~i~1 1)} assume true; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:52,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {8188#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:52,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {8188#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:52,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {8189#(<= main_~i~1 2)} assume true; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:52,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {8189#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:52,874 INFO L273 TraceCheckUtils]: 14: Hoare triple {8189#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:52,874 INFO L273 TraceCheckUtils]: 15: Hoare triple {8190#(<= main_~i~1 3)} assume true; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:52,875 INFO L273 TraceCheckUtils]: 16: Hoare triple {8190#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:52,876 INFO L273 TraceCheckUtils]: 17: Hoare triple {8190#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:52,876 INFO L273 TraceCheckUtils]: 18: Hoare triple {8191#(<= main_~i~1 4)} assume true; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:52,877 INFO L273 TraceCheckUtils]: 19: Hoare triple {8191#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:52,877 INFO L273 TraceCheckUtils]: 20: Hoare triple {8191#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:52,878 INFO L273 TraceCheckUtils]: 21: Hoare triple {8192#(<= main_~i~1 5)} assume true; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:52,878 INFO L273 TraceCheckUtils]: 22: Hoare triple {8192#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:52,879 INFO L273 TraceCheckUtils]: 23: Hoare triple {8192#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:52,880 INFO L273 TraceCheckUtils]: 24: Hoare triple {8193#(<= main_~i~1 6)} assume true; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:52,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {8193#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:52,881 INFO L273 TraceCheckUtils]: 26: Hoare triple {8193#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:52,882 INFO L273 TraceCheckUtils]: 27: Hoare triple {8194#(<= main_~i~1 7)} assume true; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:52,882 INFO L273 TraceCheckUtils]: 28: Hoare triple {8194#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:52,883 INFO L273 TraceCheckUtils]: 29: Hoare triple {8194#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:52,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {8195#(<= main_~i~1 8)} assume true; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:52,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {8195#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:52,885 INFO L273 TraceCheckUtils]: 32: Hoare triple {8195#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:52,885 INFO L273 TraceCheckUtils]: 33: Hoare triple {8196#(<= main_~i~1 9)} assume true; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:52,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {8196#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:52,886 INFO L273 TraceCheckUtils]: 35: Hoare triple {8196#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:52,887 INFO L273 TraceCheckUtils]: 36: Hoare triple {8197#(<= main_~i~1 10)} assume true; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:52,888 INFO L273 TraceCheckUtils]: 37: Hoare triple {8197#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:52,888 INFO L273 TraceCheckUtils]: 38: Hoare triple {8197#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:52,889 INFO L273 TraceCheckUtils]: 39: Hoare triple {8198#(<= main_~i~1 11)} assume true; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:52,889 INFO L273 TraceCheckUtils]: 40: Hoare triple {8198#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:52,890 INFO L273 TraceCheckUtils]: 41: Hoare triple {8198#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:52,891 INFO L273 TraceCheckUtils]: 42: Hoare triple {8199#(<= main_~i~1 12)} assume true; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:52,891 INFO L273 TraceCheckUtils]: 43: Hoare triple {8199#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:52,892 INFO L273 TraceCheckUtils]: 44: Hoare triple {8199#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:52,892 INFO L273 TraceCheckUtils]: 45: Hoare triple {8200#(<= main_~i~1 13)} assume true; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:52,893 INFO L273 TraceCheckUtils]: 46: Hoare triple {8200#(<= main_~i~1 13)} assume !(~i~1 < 10000); {8186#false} is VALID [2018-11-14 18:54:52,893 INFO L256 TraceCheckUtils]: 47: Hoare triple {8186#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {8186#false} is VALID [2018-11-14 18:54:52,894 INFO L273 TraceCheckUtils]: 48: Hoare triple {8186#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8186#false} is VALID [2018-11-14 18:54:52,894 INFO L273 TraceCheckUtils]: 49: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,894 INFO L273 TraceCheckUtils]: 50: Hoare triple {8186#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:54:52,894 INFO L273 TraceCheckUtils]: 51: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:54:52,894 INFO L273 TraceCheckUtils]: 52: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,895 INFO L273 TraceCheckUtils]: 53: Hoare triple {8186#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:54:52,895 INFO L273 TraceCheckUtils]: 54: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:54:52,895 INFO L273 TraceCheckUtils]: 55: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,895 INFO L273 TraceCheckUtils]: 56: Hoare triple {8186#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:54:52,895 INFO L273 TraceCheckUtils]: 57: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:54:52,895 INFO L273 TraceCheckUtils]: 58: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,896 INFO L273 TraceCheckUtils]: 59: Hoare triple {8186#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:54:52,896 INFO L273 TraceCheckUtils]: 60: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:54:52,896 INFO L273 TraceCheckUtils]: 61: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,896 INFO L273 TraceCheckUtils]: 62: Hoare triple {8186#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:54:52,896 INFO L273 TraceCheckUtils]: 63: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:54:52,896 INFO L273 TraceCheckUtils]: 64: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,896 INFO L273 TraceCheckUtils]: 65: Hoare triple {8186#false} assume !(~i~0 < 10000); {8186#false} is VALID [2018-11-14 18:54:52,896 INFO L273 TraceCheckUtils]: 66: Hoare triple {8186#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8186#false} is VALID [2018-11-14 18:54:52,897 INFO L273 TraceCheckUtils]: 67: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,897 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {8186#false} {8186#false} #73#return; {8186#false} is VALID [2018-11-14 18:54:52,897 INFO L273 TraceCheckUtils]: 69: Hoare triple {8186#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {8186#false} is VALID [2018-11-14 18:54:52,897 INFO L256 TraceCheckUtils]: 70: Hoare triple {8186#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {8186#false} is VALID [2018-11-14 18:54:52,897 INFO L273 TraceCheckUtils]: 71: Hoare triple {8186#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8186#false} is VALID [2018-11-14 18:54:52,897 INFO L273 TraceCheckUtils]: 72: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,897 INFO L273 TraceCheckUtils]: 73: Hoare triple {8186#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:54:52,897 INFO L273 TraceCheckUtils]: 74: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:54:52,897 INFO L273 TraceCheckUtils]: 75: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,898 INFO L273 TraceCheckUtils]: 76: Hoare triple {8186#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:54:52,898 INFO L273 TraceCheckUtils]: 77: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:54:52,898 INFO L273 TraceCheckUtils]: 78: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,898 INFO L273 TraceCheckUtils]: 79: Hoare triple {8186#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:54:52,898 INFO L273 TraceCheckUtils]: 80: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:54:52,898 INFO L273 TraceCheckUtils]: 81: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,898 INFO L273 TraceCheckUtils]: 82: Hoare triple {8186#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:54:52,898 INFO L273 TraceCheckUtils]: 83: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:54:52,899 INFO L273 TraceCheckUtils]: 84: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,899 INFO L273 TraceCheckUtils]: 85: Hoare triple {8186#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:54:52,899 INFO L273 TraceCheckUtils]: 86: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:54:52,899 INFO L273 TraceCheckUtils]: 87: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,899 INFO L273 TraceCheckUtils]: 88: Hoare triple {8186#false} assume !(~i~0 < 10000); {8186#false} is VALID [2018-11-14 18:54:52,899 INFO L273 TraceCheckUtils]: 89: Hoare triple {8186#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8186#false} is VALID [2018-11-14 18:54:52,899 INFO L273 TraceCheckUtils]: 90: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,899 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {8186#false} {8186#false} #75#return; {8186#false} is VALID [2018-11-14 18:54:52,899 INFO L273 TraceCheckUtils]: 92: Hoare triple {8186#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8186#false} is VALID [2018-11-14 18:54:52,900 INFO L273 TraceCheckUtils]: 93: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,900 INFO L273 TraceCheckUtils]: 94: Hoare triple {8186#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 18:54:52,900 INFO L273 TraceCheckUtils]: 95: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 18:54:52,900 INFO L273 TraceCheckUtils]: 96: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,900 INFO L273 TraceCheckUtils]: 97: Hoare triple {8186#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 18:54:52,900 INFO L273 TraceCheckUtils]: 98: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 18:54:52,900 INFO L273 TraceCheckUtils]: 99: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,900 INFO L273 TraceCheckUtils]: 100: Hoare triple {8186#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 18:54:52,901 INFO L273 TraceCheckUtils]: 101: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 18:54:52,901 INFO L273 TraceCheckUtils]: 102: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,901 INFO L273 TraceCheckUtils]: 103: Hoare triple {8186#false} assume !(~i~2 < 9999); {8186#false} is VALID [2018-11-14 18:54:52,901 INFO L273 TraceCheckUtils]: 104: Hoare triple {8186#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {8186#false} is VALID [2018-11-14 18:54:52,901 INFO L256 TraceCheckUtils]: 105: Hoare triple {8186#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {8186#false} is VALID [2018-11-14 18:54:52,901 INFO L273 TraceCheckUtils]: 106: Hoare triple {8186#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8186#false} is VALID [2018-11-14 18:54:52,901 INFO L273 TraceCheckUtils]: 107: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,901 INFO L273 TraceCheckUtils]: 108: Hoare triple {8186#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:54:52,901 INFO L273 TraceCheckUtils]: 109: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:54:52,902 INFO L273 TraceCheckUtils]: 110: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,902 INFO L273 TraceCheckUtils]: 111: Hoare triple {8186#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:54:52,902 INFO L273 TraceCheckUtils]: 112: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:54:52,902 INFO L273 TraceCheckUtils]: 113: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,902 INFO L273 TraceCheckUtils]: 114: Hoare triple {8186#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:54:52,902 INFO L273 TraceCheckUtils]: 115: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:54:52,902 INFO L273 TraceCheckUtils]: 116: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,902 INFO L273 TraceCheckUtils]: 117: Hoare triple {8186#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:54:52,902 INFO L273 TraceCheckUtils]: 118: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:54:52,903 INFO L273 TraceCheckUtils]: 119: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,903 INFO L273 TraceCheckUtils]: 120: Hoare triple {8186#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:54:52,903 INFO L273 TraceCheckUtils]: 121: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:54:52,903 INFO L273 TraceCheckUtils]: 122: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,903 INFO L273 TraceCheckUtils]: 123: Hoare triple {8186#false} assume !(~i~0 < 10000); {8186#false} is VALID [2018-11-14 18:54:52,903 INFO L273 TraceCheckUtils]: 124: Hoare triple {8186#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8186#false} is VALID [2018-11-14 18:54:52,903 INFO L273 TraceCheckUtils]: 125: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:54:52,903 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {8186#false} {8186#false} #77#return; {8186#false} is VALID [2018-11-14 18:54:52,904 INFO L273 TraceCheckUtils]: 127: Hoare triple {8186#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8186#false} is VALID [2018-11-14 18:54:52,904 INFO L273 TraceCheckUtils]: 128: Hoare triple {8186#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8186#false} is VALID [2018-11-14 18:54:52,904 INFO L273 TraceCheckUtils]: 129: Hoare triple {8186#false} assume !false; {8186#false} is VALID [2018-11-14 18:54:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 18:54:52,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:52,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 18:54:52,932 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2018-11-14 18:54:52,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:52,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 18:54:53,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:53,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 18:54:53,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 18:54:53,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:54:53,050 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 17 states. [2018-11-14 18:54:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:53,384 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-11-14 18:54:53,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:54:53,385 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2018-11-14 18:54:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:53,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:54:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-14 18:54:53,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:54:53,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-14 18:54:53,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 99 transitions. [2018-11-14 18:54:53,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:53,489 INFO L225 Difference]: With dead ends: 135 [2018-11-14 18:54:53,489 INFO L226 Difference]: Without dead ends: 93 [2018-11-14 18:54:53,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:54:53,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-14 18:54:53,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-14 18:54:53,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:53,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 92 states. [2018-11-14 18:54:53,516 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 92 states. [2018-11-14 18:54:53,516 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 92 states. [2018-11-14 18:54:53,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:53,519 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-14 18:54:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-14 18:54:53,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:53,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:53,519 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 93 states. [2018-11-14 18:54:53,520 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 93 states. [2018-11-14 18:54:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:53,522 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-14 18:54:53,522 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-14 18:54:53,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:53,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:53,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:53,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 18:54:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-11-14 18:54:53,525 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 130 [2018-11-14 18:54:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:53,525 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-11-14 18:54:53,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 18:54:53,526 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-14 18:54:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-14 18:54:53,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:53,527 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 14, 14, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:53,527 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:53,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:53,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1039240391, now seen corresponding path program 14 times [2018-11-14 18:54:53,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:53,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:53,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:53,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:53,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:54,304 INFO L256 TraceCheckUtils]: 0: Hoare triple {9084#true} call ULTIMATE.init(); {9084#true} is VALID [2018-11-14 18:54:54,305 INFO L273 TraceCheckUtils]: 1: Hoare triple {9084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9084#true} is VALID [2018-11-14 18:54:54,305 INFO L273 TraceCheckUtils]: 2: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,305 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9084#true} {9084#true} #69#return; {9084#true} is VALID [2018-11-14 18:54:54,305 INFO L256 TraceCheckUtils]: 4: Hoare triple {9084#true} call #t~ret13 := main(); {9084#true} is VALID [2018-11-14 18:54:54,306 INFO L273 TraceCheckUtils]: 5: Hoare triple {9084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9086#(= main_~i~1 0)} is VALID [2018-11-14 18:54:54,306 INFO L273 TraceCheckUtils]: 6: Hoare triple {9086#(= main_~i~1 0)} assume true; {9086#(= main_~i~1 0)} is VALID [2018-11-14 18:54:54,307 INFO L273 TraceCheckUtils]: 7: Hoare triple {9086#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9086#(= main_~i~1 0)} is VALID [2018-11-14 18:54:54,307 INFO L273 TraceCheckUtils]: 8: Hoare triple {9086#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:54,307 INFO L273 TraceCheckUtils]: 9: Hoare triple {9087#(<= main_~i~1 1)} assume true; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:54,308 INFO L273 TraceCheckUtils]: 10: Hoare triple {9087#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:54,308 INFO L273 TraceCheckUtils]: 11: Hoare triple {9087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:54,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {9088#(<= main_~i~1 2)} assume true; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:54,309 INFO L273 TraceCheckUtils]: 13: Hoare triple {9088#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:54,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {9088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:54,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {9089#(<= main_~i~1 3)} assume true; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:54,310 INFO L273 TraceCheckUtils]: 16: Hoare triple {9089#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:54,311 INFO L273 TraceCheckUtils]: 17: Hoare triple {9089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:54,312 INFO L273 TraceCheckUtils]: 18: Hoare triple {9090#(<= main_~i~1 4)} assume true; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:54,312 INFO L273 TraceCheckUtils]: 19: Hoare triple {9090#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:54,313 INFO L273 TraceCheckUtils]: 20: Hoare triple {9090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:54,314 INFO L273 TraceCheckUtils]: 21: Hoare triple {9091#(<= main_~i~1 5)} assume true; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:54,314 INFO L273 TraceCheckUtils]: 22: Hoare triple {9091#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:54,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {9091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:54,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {9092#(<= main_~i~1 6)} assume true; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:54,316 INFO L273 TraceCheckUtils]: 25: Hoare triple {9092#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:54,317 INFO L273 TraceCheckUtils]: 26: Hoare triple {9092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:54,317 INFO L273 TraceCheckUtils]: 27: Hoare triple {9093#(<= main_~i~1 7)} assume true; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:54,318 INFO L273 TraceCheckUtils]: 28: Hoare triple {9093#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:54,319 INFO L273 TraceCheckUtils]: 29: Hoare triple {9093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:54,319 INFO L273 TraceCheckUtils]: 30: Hoare triple {9094#(<= main_~i~1 8)} assume true; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:54,320 INFO L273 TraceCheckUtils]: 31: Hoare triple {9094#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:54,321 INFO L273 TraceCheckUtils]: 32: Hoare triple {9094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:54,321 INFO L273 TraceCheckUtils]: 33: Hoare triple {9095#(<= main_~i~1 9)} assume true; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:54,322 INFO L273 TraceCheckUtils]: 34: Hoare triple {9095#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:54,322 INFO L273 TraceCheckUtils]: 35: Hoare triple {9095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:54,323 INFO L273 TraceCheckUtils]: 36: Hoare triple {9096#(<= main_~i~1 10)} assume true; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:54,323 INFO L273 TraceCheckUtils]: 37: Hoare triple {9096#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:54,324 INFO L273 TraceCheckUtils]: 38: Hoare triple {9096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:54,325 INFO L273 TraceCheckUtils]: 39: Hoare triple {9097#(<= main_~i~1 11)} assume true; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:54,325 INFO L273 TraceCheckUtils]: 40: Hoare triple {9097#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:54,326 INFO L273 TraceCheckUtils]: 41: Hoare triple {9097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:54,327 INFO L273 TraceCheckUtils]: 42: Hoare triple {9098#(<= main_~i~1 12)} assume true; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:54,327 INFO L273 TraceCheckUtils]: 43: Hoare triple {9098#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:54,328 INFO L273 TraceCheckUtils]: 44: Hoare triple {9098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:54,328 INFO L273 TraceCheckUtils]: 45: Hoare triple {9099#(<= main_~i~1 13)} assume true; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:54,329 INFO L273 TraceCheckUtils]: 46: Hoare triple {9099#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:54,330 INFO L273 TraceCheckUtils]: 47: Hoare triple {9099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 18:54:54,330 INFO L273 TraceCheckUtils]: 48: Hoare triple {9100#(<= main_~i~1 14)} assume true; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 18:54:54,331 INFO L273 TraceCheckUtils]: 49: Hoare triple {9100#(<= main_~i~1 14)} assume !(~i~1 < 10000); {9085#false} is VALID [2018-11-14 18:54:54,331 INFO L256 TraceCheckUtils]: 50: Hoare triple {9085#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {9084#true} is VALID [2018-11-14 18:54:54,331 INFO L273 TraceCheckUtils]: 51: Hoare triple {9084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9084#true} is VALID [2018-11-14 18:54:54,331 INFO L273 TraceCheckUtils]: 52: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,332 INFO L273 TraceCheckUtils]: 53: Hoare triple {9084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:54:54,332 INFO L273 TraceCheckUtils]: 54: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:54:54,332 INFO L273 TraceCheckUtils]: 55: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,332 INFO L273 TraceCheckUtils]: 56: Hoare triple {9084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:54:54,332 INFO L273 TraceCheckUtils]: 57: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:54:54,333 INFO L273 TraceCheckUtils]: 58: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,333 INFO L273 TraceCheckUtils]: 59: Hoare triple {9084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:54:54,333 INFO L273 TraceCheckUtils]: 60: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:54:54,333 INFO L273 TraceCheckUtils]: 61: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,333 INFO L273 TraceCheckUtils]: 62: Hoare triple {9084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:54:54,334 INFO L273 TraceCheckUtils]: 63: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:54:54,334 INFO L273 TraceCheckUtils]: 64: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,334 INFO L273 TraceCheckUtils]: 65: Hoare triple {9084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:54:54,334 INFO L273 TraceCheckUtils]: 66: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:54:54,334 INFO L273 TraceCheckUtils]: 67: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,334 INFO L273 TraceCheckUtils]: 68: Hoare triple {9084#true} assume !(~i~0 < 10000); {9084#true} is VALID [2018-11-14 18:54:54,335 INFO L273 TraceCheckUtils]: 69: Hoare triple {9084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9084#true} is VALID [2018-11-14 18:54:54,335 INFO L273 TraceCheckUtils]: 70: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,335 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {9084#true} {9085#false} #73#return; {9085#false} is VALID [2018-11-14 18:54:54,335 INFO L273 TraceCheckUtils]: 72: Hoare triple {9085#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {9085#false} is VALID [2018-11-14 18:54:54,335 INFO L256 TraceCheckUtils]: 73: Hoare triple {9085#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {9084#true} is VALID [2018-11-14 18:54:54,335 INFO L273 TraceCheckUtils]: 74: Hoare triple {9084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9084#true} is VALID [2018-11-14 18:54:54,335 INFO L273 TraceCheckUtils]: 75: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,335 INFO L273 TraceCheckUtils]: 76: Hoare triple {9084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:54:54,336 INFO L273 TraceCheckUtils]: 77: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:54:54,336 INFO L273 TraceCheckUtils]: 78: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,336 INFO L273 TraceCheckUtils]: 79: Hoare triple {9084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:54:54,336 INFO L273 TraceCheckUtils]: 80: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:54:54,336 INFO L273 TraceCheckUtils]: 81: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,336 INFO L273 TraceCheckUtils]: 82: Hoare triple {9084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:54:54,336 INFO L273 TraceCheckUtils]: 83: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:54:54,336 INFO L273 TraceCheckUtils]: 84: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,336 INFO L273 TraceCheckUtils]: 85: Hoare triple {9084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:54:54,337 INFO L273 TraceCheckUtils]: 86: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:54:54,337 INFO L273 TraceCheckUtils]: 87: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,337 INFO L273 TraceCheckUtils]: 88: Hoare triple {9084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:54:54,337 INFO L273 TraceCheckUtils]: 89: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:54:54,337 INFO L273 TraceCheckUtils]: 90: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,337 INFO L273 TraceCheckUtils]: 91: Hoare triple {9084#true} assume !(~i~0 < 10000); {9084#true} is VALID [2018-11-14 18:54:54,337 INFO L273 TraceCheckUtils]: 92: Hoare triple {9084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9084#true} is VALID [2018-11-14 18:54:54,337 INFO L273 TraceCheckUtils]: 93: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,338 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9084#true} {9085#false} #75#return; {9085#false} is VALID [2018-11-14 18:54:54,338 INFO L273 TraceCheckUtils]: 95: Hoare triple {9085#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9085#false} is VALID [2018-11-14 18:54:54,338 INFO L273 TraceCheckUtils]: 96: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,338 INFO L273 TraceCheckUtils]: 97: Hoare triple {9085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 18:54:54,338 INFO L273 TraceCheckUtils]: 98: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 18:54:54,338 INFO L273 TraceCheckUtils]: 99: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,339 INFO L273 TraceCheckUtils]: 100: Hoare triple {9085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 18:54:54,339 INFO L273 TraceCheckUtils]: 101: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 18:54:54,339 INFO L273 TraceCheckUtils]: 102: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,339 INFO L273 TraceCheckUtils]: 103: Hoare triple {9085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 18:54:54,339 INFO L273 TraceCheckUtils]: 104: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 18:54:54,340 INFO L273 TraceCheckUtils]: 105: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,340 INFO L273 TraceCheckUtils]: 106: Hoare triple {9085#false} assume !(~i~2 < 9999); {9085#false} is VALID [2018-11-14 18:54:54,340 INFO L273 TraceCheckUtils]: 107: Hoare triple {9085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {9085#false} is VALID [2018-11-14 18:54:54,340 INFO L256 TraceCheckUtils]: 108: Hoare triple {9085#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {9084#true} is VALID [2018-11-14 18:54:54,340 INFO L273 TraceCheckUtils]: 109: Hoare triple {9084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9084#true} is VALID [2018-11-14 18:54:54,340 INFO L273 TraceCheckUtils]: 110: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,341 INFO L273 TraceCheckUtils]: 111: Hoare triple {9084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:54:54,341 INFO L273 TraceCheckUtils]: 112: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:54:54,341 INFO L273 TraceCheckUtils]: 113: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,341 INFO L273 TraceCheckUtils]: 114: Hoare triple {9084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:54:54,341 INFO L273 TraceCheckUtils]: 115: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:54:54,342 INFO L273 TraceCheckUtils]: 116: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,342 INFO L273 TraceCheckUtils]: 117: Hoare triple {9084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:54:54,342 INFO L273 TraceCheckUtils]: 118: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:54:54,342 INFO L273 TraceCheckUtils]: 119: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,342 INFO L273 TraceCheckUtils]: 120: Hoare triple {9084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:54:54,342 INFO L273 TraceCheckUtils]: 121: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:54:54,342 INFO L273 TraceCheckUtils]: 122: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,343 INFO L273 TraceCheckUtils]: 123: Hoare triple {9084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:54:54,343 INFO L273 TraceCheckUtils]: 124: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:54:54,343 INFO L273 TraceCheckUtils]: 125: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,343 INFO L273 TraceCheckUtils]: 126: Hoare triple {9084#true} assume !(~i~0 < 10000); {9084#true} is VALID [2018-11-14 18:54:54,343 INFO L273 TraceCheckUtils]: 127: Hoare triple {9084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9084#true} is VALID [2018-11-14 18:54:54,343 INFO L273 TraceCheckUtils]: 128: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,344 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {9084#true} {9085#false} #77#return; {9085#false} is VALID [2018-11-14 18:54:54,344 INFO L273 TraceCheckUtils]: 130: Hoare triple {9085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9085#false} is VALID [2018-11-14 18:54:54,344 INFO L273 TraceCheckUtils]: 131: Hoare triple {9085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9085#false} is VALID [2018-11-14 18:54:54,344 INFO L273 TraceCheckUtils]: 132: Hoare triple {9085#false} assume !false; {9085#false} is VALID [2018-11-14 18:54:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 18:54:54,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:54,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:54,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:54:54,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:54:54,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:54,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:54,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {9084#true} call ULTIMATE.init(); {9084#true} is VALID [2018-11-14 18:54:54,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {9084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9084#true} is VALID [2018-11-14 18:54:54,704 INFO L273 TraceCheckUtils]: 2: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:54:54,704 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9084#true} {9084#true} #69#return; {9084#true} is VALID [2018-11-14 18:54:54,704 INFO L256 TraceCheckUtils]: 4: Hoare triple {9084#true} call #t~ret13 := main(); {9084#true} is VALID [2018-11-14 18:54:54,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {9084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9119#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:54,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {9119#(<= main_~i~1 0)} assume true; {9119#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:54,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {9119#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9119#(<= main_~i~1 0)} is VALID [2018-11-14 18:54:54,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {9119#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:54,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {9087#(<= main_~i~1 1)} assume true; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:54,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {9087#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:54,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {9087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:54,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {9088#(<= main_~i~1 2)} assume true; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:54,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {9088#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:54,709 INFO L273 TraceCheckUtils]: 14: Hoare triple {9088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:54,717 INFO L273 TraceCheckUtils]: 15: Hoare triple {9089#(<= main_~i~1 3)} assume true; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:54,718 INFO L273 TraceCheckUtils]: 16: Hoare triple {9089#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:54,718 INFO L273 TraceCheckUtils]: 17: Hoare triple {9089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:54,719 INFO L273 TraceCheckUtils]: 18: Hoare triple {9090#(<= main_~i~1 4)} assume true; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:54,719 INFO L273 TraceCheckUtils]: 19: Hoare triple {9090#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:54,719 INFO L273 TraceCheckUtils]: 20: Hoare triple {9090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:54,720 INFO L273 TraceCheckUtils]: 21: Hoare triple {9091#(<= main_~i~1 5)} assume true; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:54,720 INFO L273 TraceCheckUtils]: 22: Hoare triple {9091#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:54,720 INFO L273 TraceCheckUtils]: 23: Hoare triple {9091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:54,721 INFO L273 TraceCheckUtils]: 24: Hoare triple {9092#(<= main_~i~1 6)} assume true; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:54,721 INFO L273 TraceCheckUtils]: 25: Hoare triple {9092#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:54,722 INFO L273 TraceCheckUtils]: 26: Hoare triple {9092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:54,722 INFO L273 TraceCheckUtils]: 27: Hoare triple {9093#(<= main_~i~1 7)} assume true; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:54,723 INFO L273 TraceCheckUtils]: 28: Hoare triple {9093#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:54,724 INFO L273 TraceCheckUtils]: 29: Hoare triple {9093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:54,724 INFO L273 TraceCheckUtils]: 30: Hoare triple {9094#(<= main_~i~1 8)} assume true; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:54,725 INFO L273 TraceCheckUtils]: 31: Hoare triple {9094#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:54,725 INFO L273 TraceCheckUtils]: 32: Hoare triple {9094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:54,726 INFO L273 TraceCheckUtils]: 33: Hoare triple {9095#(<= main_~i~1 9)} assume true; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:54,726 INFO L273 TraceCheckUtils]: 34: Hoare triple {9095#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:54,727 INFO L273 TraceCheckUtils]: 35: Hoare triple {9095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:54,728 INFO L273 TraceCheckUtils]: 36: Hoare triple {9096#(<= main_~i~1 10)} assume true; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:54,728 INFO L273 TraceCheckUtils]: 37: Hoare triple {9096#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:54,729 INFO L273 TraceCheckUtils]: 38: Hoare triple {9096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:54,730 INFO L273 TraceCheckUtils]: 39: Hoare triple {9097#(<= main_~i~1 11)} assume true; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:54,730 INFO L273 TraceCheckUtils]: 40: Hoare triple {9097#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:54,731 INFO L273 TraceCheckUtils]: 41: Hoare triple {9097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:54,731 INFO L273 TraceCheckUtils]: 42: Hoare triple {9098#(<= main_~i~1 12)} assume true; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:54,732 INFO L273 TraceCheckUtils]: 43: Hoare triple {9098#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:54,733 INFO L273 TraceCheckUtils]: 44: Hoare triple {9098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:54,733 INFO L273 TraceCheckUtils]: 45: Hoare triple {9099#(<= main_~i~1 13)} assume true; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:54,734 INFO L273 TraceCheckUtils]: 46: Hoare triple {9099#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:54,734 INFO L273 TraceCheckUtils]: 47: Hoare triple {9099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 18:54:54,735 INFO L273 TraceCheckUtils]: 48: Hoare triple {9100#(<= main_~i~1 14)} assume true; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 18:54:54,736 INFO L273 TraceCheckUtils]: 49: Hoare triple {9100#(<= main_~i~1 14)} assume !(~i~1 < 10000); {9085#false} is VALID [2018-11-14 18:54:54,736 INFO L256 TraceCheckUtils]: 50: Hoare triple {9085#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {9085#false} is VALID [2018-11-14 18:54:54,736 INFO L273 TraceCheckUtils]: 51: Hoare triple {9085#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9085#false} is VALID [2018-11-14 18:54:54,736 INFO L273 TraceCheckUtils]: 52: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,736 INFO L273 TraceCheckUtils]: 53: Hoare triple {9085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:54:54,737 INFO L273 TraceCheckUtils]: 54: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:54:54,737 INFO L273 TraceCheckUtils]: 55: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,737 INFO L273 TraceCheckUtils]: 56: Hoare triple {9085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:54:54,737 INFO L273 TraceCheckUtils]: 57: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:54:54,737 INFO L273 TraceCheckUtils]: 58: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,738 INFO L273 TraceCheckUtils]: 59: Hoare triple {9085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:54:54,738 INFO L273 TraceCheckUtils]: 60: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:54:54,738 INFO L273 TraceCheckUtils]: 61: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,738 INFO L273 TraceCheckUtils]: 62: Hoare triple {9085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:54:54,738 INFO L273 TraceCheckUtils]: 63: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:54:54,739 INFO L273 TraceCheckUtils]: 64: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,739 INFO L273 TraceCheckUtils]: 65: Hoare triple {9085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:54:54,739 INFO L273 TraceCheckUtils]: 66: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:54:54,739 INFO L273 TraceCheckUtils]: 67: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,739 INFO L273 TraceCheckUtils]: 68: Hoare triple {9085#false} assume !(~i~0 < 10000); {9085#false} is VALID [2018-11-14 18:54:54,740 INFO L273 TraceCheckUtils]: 69: Hoare triple {9085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9085#false} is VALID [2018-11-14 18:54:54,740 INFO L273 TraceCheckUtils]: 70: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,740 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {9085#false} {9085#false} #73#return; {9085#false} is VALID [2018-11-14 18:54:54,740 INFO L273 TraceCheckUtils]: 72: Hoare triple {9085#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {9085#false} is VALID [2018-11-14 18:54:54,740 INFO L256 TraceCheckUtils]: 73: Hoare triple {9085#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {9085#false} is VALID [2018-11-14 18:54:54,741 INFO L273 TraceCheckUtils]: 74: Hoare triple {9085#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9085#false} is VALID [2018-11-14 18:54:54,741 INFO L273 TraceCheckUtils]: 75: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,741 INFO L273 TraceCheckUtils]: 76: Hoare triple {9085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:54:54,741 INFO L273 TraceCheckUtils]: 77: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:54:54,741 INFO L273 TraceCheckUtils]: 78: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,741 INFO L273 TraceCheckUtils]: 79: Hoare triple {9085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:54:54,741 INFO L273 TraceCheckUtils]: 80: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:54:54,742 INFO L273 TraceCheckUtils]: 81: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,742 INFO L273 TraceCheckUtils]: 82: Hoare triple {9085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:54:54,742 INFO L273 TraceCheckUtils]: 83: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:54:54,742 INFO L273 TraceCheckUtils]: 84: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,742 INFO L273 TraceCheckUtils]: 85: Hoare triple {9085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:54:54,742 INFO L273 TraceCheckUtils]: 86: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:54:54,742 INFO L273 TraceCheckUtils]: 87: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,742 INFO L273 TraceCheckUtils]: 88: Hoare triple {9085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:54:54,742 INFO L273 TraceCheckUtils]: 89: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:54:54,743 INFO L273 TraceCheckUtils]: 90: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,743 INFO L273 TraceCheckUtils]: 91: Hoare triple {9085#false} assume !(~i~0 < 10000); {9085#false} is VALID [2018-11-14 18:54:54,743 INFO L273 TraceCheckUtils]: 92: Hoare triple {9085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9085#false} is VALID [2018-11-14 18:54:54,743 INFO L273 TraceCheckUtils]: 93: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,743 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9085#false} {9085#false} #75#return; {9085#false} is VALID [2018-11-14 18:54:54,743 INFO L273 TraceCheckUtils]: 95: Hoare triple {9085#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9085#false} is VALID [2018-11-14 18:54:54,743 INFO L273 TraceCheckUtils]: 96: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,743 INFO L273 TraceCheckUtils]: 97: Hoare triple {9085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 18:54:54,744 INFO L273 TraceCheckUtils]: 98: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 18:54:54,744 INFO L273 TraceCheckUtils]: 99: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,744 INFO L273 TraceCheckUtils]: 100: Hoare triple {9085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 18:54:54,744 INFO L273 TraceCheckUtils]: 101: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 18:54:54,744 INFO L273 TraceCheckUtils]: 102: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,744 INFO L273 TraceCheckUtils]: 103: Hoare triple {9085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 18:54:54,744 INFO L273 TraceCheckUtils]: 104: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 18:54:54,744 INFO L273 TraceCheckUtils]: 105: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,744 INFO L273 TraceCheckUtils]: 106: Hoare triple {9085#false} assume !(~i~2 < 9999); {9085#false} is VALID [2018-11-14 18:54:54,745 INFO L273 TraceCheckUtils]: 107: Hoare triple {9085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {9085#false} is VALID [2018-11-14 18:54:54,745 INFO L256 TraceCheckUtils]: 108: Hoare triple {9085#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {9085#false} is VALID [2018-11-14 18:54:54,745 INFO L273 TraceCheckUtils]: 109: Hoare triple {9085#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9085#false} is VALID [2018-11-14 18:54:54,745 INFO L273 TraceCheckUtils]: 110: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,745 INFO L273 TraceCheckUtils]: 111: Hoare triple {9085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:54:54,745 INFO L273 TraceCheckUtils]: 112: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:54:54,745 INFO L273 TraceCheckUtils]: 113: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,745 INFO L273 TraceCheckUtils]: 114: Hoare triple {9085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:54:54,745 INFO L273 TraceCheckUtils]: 115: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:54:54,746 INFO L273 TraceCheckUtils]: 116: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,746 INFO L273 TraceCheckUtils]: 117: Hoare triple {9085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:54:54,746 INFO L273 TraceCheckUtils]: 118: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:54:54,746 INFO L273 TraceCheckUtils]: 119: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,746 INFO L273 TraceCheckUtils]: 120: Hoare triple {9085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:54:54,746 INFO L273 TraceCheckUtils]: 121: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:54:54,746 INFO L273 TraceCheckUtils]: 122: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,746 INFO L273 TraceCheckUtils]: 123: Hoare triple {9085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:54:54,746 INFO L273 TraceCheckUtils]: 124: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:54:54,747 INFO L273 TraceCheckUtils]: 125: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,747 INFO L273 TraceCheckUtils]: 126: Hoare triple {9085#false} assume !(~i~0 < 10000); {9085#false} is VALID [2018-11-14 18:54:54,747 INFO L273 TraceCheckUtils]: 127: Hoare triple {9085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9085#false} is VALID [2018-11-14 18:54:54,747 INFO L273 TraceCheckUtils]: 128: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:54:54,747 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {9085#false} {9085#false} #77#return; {9085#false} is VALID [2018-11-14 18:54:54,747 INFO L273 TraceCheckUtils]: 130: Hoare triple {9085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9085#false} is VALID [2018-11-14 18:54:54,747 INFO L273 TraceCheckUtils]: 131: Hoare triple {9085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9085#false} is VALID [2018-11-14 18:54:54,748 INFO L273 TraceCheckUtils]: 132: Hoare triple {9085#false} assume !false; {9085#false} is VALID [2018-11-14 18:54:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 18:54:54,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:54,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 18:54:54,777 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2018-11-14 18:54:54,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:54,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:54:54,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:54,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:54:54,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:54:54,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:54:54,859 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 18 states. [2018-11-14 18:54:55,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:55,878 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-14 18:54:55,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 18:54:55,878 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2018-11-14 18:54:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:54:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-14 18:54:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:54:55,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-14 18:54:55,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 102 transitions. [2018-11-14 18:54:55,981 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-14 18:54:55,983 INFO L225 Difference]: With dead ends: 138 [2018-11-14 18:54:55,983 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 18:54:55,984 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:54:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 18:54:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-14 18:54:56,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:56,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-14 18:54:56,018 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-14 18:54:56,018 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-14 18:54:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:56,021 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 18:54:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 18:54:56,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:56,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:56,021 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-14 18:54:56,022 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-14 18:54:56,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:56,024 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 18:54:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 18:54:56,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:56,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:56,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:56,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-14 18:54:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-14 18:54:56,026 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 133 [2018-11-14 18:54:56,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:56,027 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-14 18:54:56,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:54:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-14 18:54:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-14 18:54:56,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:56,028 INFO L375 BasicCegarLoop]: trace histogram [18, 16, 15, 15, 15, 15, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:56,028 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:56,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:56,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1279003789, now seen corresponding path program 15 times [2018-11-14 18:54:56,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:56,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:56,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:56,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:56,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:56,762 INFO L256 TraceCheckUtils]: 0: Hoare triple {10007#true} call ULTIMATE.init(); {10007#true} is VALID [2018-11-14 18:54:56,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {10007#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10007#true} is VALID [2018-11-14 18:54:56,763 INFO L273 TraceCheckUtils]: 2: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,764 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10007#true} {10007#true} #69#return; {10007#true} is VALID [2018-11-14 18:54:56,764 INFO L256 TraceCheckUtils]: 4: Hoare triple {10007#true} call #t~ret13 := main(); {10007#true} is VALID [2018-11-14 18:54:56,764 INFO L273 TraceCheckUtils]: 5: Hoare triple {10007#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10009#(= main_~i~1 0)} is VALID [2018-11-14 18:54:56,765 INFO L273 TraceCheckUtils]: 6: Hoare triple {10009#(= main_~i~1 0)} assume true; {10009#(= main_~i~1 0)} is VALID [2018-11-14 18:54:56,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {10009#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10009#(= main_~i~1 0)} is VALID [2018-11-14 18:54:56,766 INFO L273 TraceCheckUtils]: 8: Hoare triple {10009#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10010#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:56,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {10010#(<= main_~i~1 1)} assume true; {10010#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:56,767 INFO L273 TraceCheckUtils]: 10: Hoare triple {10010#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10010#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:56,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {10010#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10011#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:56,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {10011#(<= main_~i~1 2)} assume true; {10011#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:56,768 INFO L273 TraceCheckUtils]: 13: Hoare triple {10011#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10011#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:56,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {10011#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10012#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:56,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {10012#(<= main_~i~1 3)} assume true; {10012#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:56,770 INFO L273 TraceCheckUtils]: 16: Hoare triple {10012#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10012#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:56,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {10012#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10013#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:56,771 INFO L273 TraceCheckUtils]: 18: Hoare triple {10013#(<= main_~i~1 4)} assume true; {10013#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:56,771 INFO L273 TraceCheckUtils]: 19: Hoare triple {10013#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10013#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:56,772 INFO L273 TraceCheckUtils]: 20: Hoare triple {10013#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10014#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:56,773 INFO L273 TraceCheckUtils]: 21: Hoare triple {10014#(<= main_~i~1 5)} assume true; {10014#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:56,773 INFO L273 TraceCheckUtils]: 22: Hoare triple {10014#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10014#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:56,774 INFO L273 TraceCheckUtils]: 23: Hoare triple {10014#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10015#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:56,775 INFO L273 TraceCheckUtils]: 24: Hoare triple {10015#(<= main_~i~1 6)} assume true; {10015#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:56,775 INFO L273 TraceCheckUtils]: 25: Hoare triple {10015#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10015#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:56,776 INFO L273 TraceCheckUtils]: 26: Hoare triple {10015#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10016#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:56,776 INFO L273 TraceCheckUtils]: 27: Hoare triple {10016#(<= main_~i~1 7)} assume true; {10016#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:56,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {10016#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10016#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:56,778 INFO L273 TraceCheckUtils]: 29: Hoare triple {10016#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10017#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:56,778 INFO L273 TraceCheckUtils]: 30: Hoare triple {10017#(<= main_~i~1 8)} assume true; {10017#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:56,779 INFO L273 TraceCheckUtils]: 31: Hoare triple {10017#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10017#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:56,780 INFO L273 TraceCheckUtils]: 32: Hoare triple {10017#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10018#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:56,780 INFO L273 TraceCheckUtils]: 33: Hoare triple {10018#(<= main_~i~1 9)} assume true; {10018#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:56,781 INFO L273 TraceCheckUtils]: 34: Hoare triple {10018#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10018#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:56,781 INFO L273 TraceCheckUtils]: 35: Hoare triple {10018#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10019#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:56,782 INFO L273 TraceCheckUtils]: 36: Hoare triple {10019#(<= main_~i~1 10)} assume true; {10019#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:56,782 INFO L273 TraceCheckUtils]: 37: Hoare triple {10019#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10019#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:56,783 INFO L273 TraceCheckUtils]: 38: Hoare triple {10019#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10020#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:56,784 INFO L273 TraceCheckUtils]: 39: Hoare triple {10020#(<= main_~i~1 11)} assume true; {10020#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:56,784 INFO L273 TraceCheckUtils]: 40: Hoare triple {10020#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10020#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:56,785 INFO L273 TraceCheckUtils]: 41: Hoare triple {10020#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10021#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:56,785 INFO L273 TraceCheckUtils]: 42: Hoare triple {10021#(<= main_~i~1 12)} assume true; {10021#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:56,786 INFO L273 TraceCheckUtils]: 43: Hoare triple {10021#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10021#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:56,787 INFO L273 TraceCheckUtils]: 44: Hoare triple {10021#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10022#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:56,787 INFO L273 TraceCheckUtils]: 45: Hoare triple {10022#(<= main_~i~1 13)} assume true; {10022#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:56,788 INFO L273 TraceCheckUtils]: 46: Hoare triple {10022#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10022#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:56,789 INFO L273 TraceCheckUtils]: 47: Hoare triple {10022#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10023#(<= main_~i~1 14)} is VALID [2018-11-14 18:54:56,789 INFO L273 TraceCheckUtils]: 48: Hoare triple {10023#(<= main_~i~1 14)} assume true; {10023#(<= main_~i~1 14)} is VALID [2018-11-14 18:54:56,790 INFO L273 TraceCheckUtils]: 49: Hoare triple {10023#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10023#(<= main_~i~1 14)} is VALID [2018-11-14 18:54:56,790 INFO L273 TraceCheckUtils]: 50: Hoare triple {10023#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10024#(<= main_~i~1 15)} is VALID [2018-11-14 18:54:56,791 INFO L273 TraceCheckUtils]: 51: Hoare triple {10024#(<= main_~i~1 15)} assume true; {10024#(<= main_~i~1 15)} is VALID [2018-11-14 18:54:56,792 INFO L273 TraceCheckUtils]: 52: Hoare triple {10024#(<= main_~i~1 15)} assume !(~i~1 < 10000); {10008#false} is VALID [2018-11-14 18:54:56,792 INFO L256 TraceCheckUtils]: 53: Hoare triple {10008#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 18:54:56,792 INFO L273 TraceCheckUtils]: 54: Hoare triple {10007#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 18:54:56,792 INFO L273 TraceCheckUtils]: 55: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,792 INFO L273 TraceCheckUtils]: 56: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:56,793 INFO L273 TraceCheckUtils]: 57: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:56,793 INFO L273 TraceCheckUtils]: 58: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,793 INFO L273 TraceCheckUtils]: 59: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:56,793 INFO L273 TraceCheckUtils]: 60: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:56,793 INFO L273 TraceCheckUtils]: 61: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,794 INFO L273 TraceCheckUtils]: 62: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:56,794 INFO L273 TraceCheckUtils]: 63: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:56,794 INFO L273 TraceCheckUtils]: 64: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,794 INFO L273 TraceCheckUtils]: 65: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:56,794 INFO L273 TraceCheckUtils]: 66: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:56,794 INFO L273 TraceCheckUtils]: 67: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,795 INFO L273 TraceCheckUtils]: 68: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:56,795 INFO L273 TraceCheckUtils]: 69: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:56,795 INFO L273 TraceCheckUtils]: 70: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,795 INFO L273 TraceCheckUtils]: 71: Hoare triple {10007#true} assume !(~i~0 < 10000); {10007#true} is VALID [2018-11-14 18:54:56,795 INFO L273 TraceCheckUtils]: 72: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 18:54:56,796 INFO L273 TraceCheckUtils]: 73: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,796 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {10007#true} {10008#false} #73#return; {10008#false} is VALID [2018-11-14 18:54:56,796 INFO L273 TraceCheckUtils]: 75: Hoare triple {10008#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10008#false} is VALID [2018-11-14 18:54:56,796 INFO L256 TraceCheckUtils]: 76: Hoare triple {10008#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 18:54:56,796 INFO L273 TraceCheckUtils]: 77: Hoare triple {10007#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 18:54:56,796 INFO L273 TraceCheckUtils]: 78: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,796 INFO L273 TraceCheckUtils]: 79: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:56,796 INFO L273 TraceCheckUtils]: 80: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:56,797 INFO L273 TraceCheckUtils]: 81: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,797 INFO L273 TraceCheckUtils]: 82: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:56,797 INFO L273 TraceCheckUtils]: 83: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:56,797 INFO L273 TraceCheckUtils]: 84: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,797 INFO L273 TraceCheckUtils]: 85: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:56,797 INFO L273 TraceCheckUtils]: 86: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:56,797 INFO L273 TraceCheckUtils]: 87: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,797 INFO L273 TraceCheckUtils]: 88: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:56,797 INFO L273 TraceCheckUtils]: 89: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:56,798 INFO L273 TraceCheckUtils]: 90: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,798 INFO L273 TraceCheckUtils]: 91: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:56,798 INFO L273 TraceCheckUtils]: 92: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:56,798 INFO L273 TraceCheckUtils]: 93: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,798 INFO L273 TraceCheckUtils]: 94: Hoare triple {10007#true} assume !(~i~0 < 10000); {10007#true} is VALID [2018-11-14 18:54:56,798 INFO L273 TraceCheckUtils]: 95: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 18:54:56,798 INFO L273 TraceCheckUtils]: 96: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,798 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {10007#true} {10008#false} #75#return; {10008#false} is VALID [2018-11-14 18:54:56,798 INFO L273 TraceCheckUtils]: 98: Hoare triple {10008#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10008#false} is VALID [2018-11-14 18:54:56,799 INFO L273 TraceCheckUtils]: 99: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:54:56,799 INFO L273 TraceCheckUtils]: 100: Hoare triple {10008#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10008#false} is VALID [2018-11-14 18:54:56,799 INFO L273 TraceCheckUtils]: 101: Hoare triple {10008#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10008#false} is VALID [2018-11-14 18:54:56,799 INFO L273 TraceCheckUtils]: 102: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:54:56,799 INFO L273 TraceCheckUtils]: 103: Hoare triple {10008#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10008#false} is VALID [2018-11-14 18:54:56,799 INFO L273 TraceCheckUtils]: 104: Hoare triple {10008#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10008#false} is VALID [2018-11-14 18:54:56,799 INFO L273 TraceCheckUtils]: 105: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:54:56,799 INFO L273 TraceCheckUtils]: 106: Hoare triple {10008#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10008#false} is VALID [2018-11-14 18:54:56,799 INFO L273 TraceCheckUtils]: 107: Hoare triple {10008#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10008#false} is VALID [2018-11-14 18:54:56,800 INFO L273 TraceCheckUtils]: 108: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:54:56,800 INFO L273 TraceCheckUtils]: 109: Hoare triple {10008#false} assume !(~i~2 < 9999); {10008#false} is VALID [2018-11-14 18:54:56,800 INFO L273 TraceCheckUtils]: 110: Hoare triple {10008#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {10008#false} is VALID [2018-11-14 18:54:56,800 INFO L256 TraceCheckUtils]: 111: Hoare triple {10008#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 18:54:56,800 INFO L273 TraceCheckUtils]: 112: Hoare triple {10007#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 18:54:56,800 INFO L273 TraceCheckUtils]: 113: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,800 INFO L273 TraceCheckUtils]: 114: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:56,800 INFO L273 TraceCheckUtils]: 115: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:56,800 INFO L273 TraceCheckUtils]: 116: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,801 INFO L273 TraceCheckUtils]: 117: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:56,801 INFO L273 TraceCheckUtils]: 118: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:56,801 INFO L273 TraceCheckUtils]: 119: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,801 INFO L273 TraceCheckUtils]: 120: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:56,801 INFO L273 TraceCheckUtils]: 121: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:56,801 INFO L273 TraceCheckUtils]: 122: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,801 INFO L273 TraceCheckUtils]: 123: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:56,801 INFO L273 TraceCheckUtils]: 124: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:56,801 INFO L273 TraceCheckUtils]: 125: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,802 INFO L273 TraceCheckUtils]: 126: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:56,802 INFO L273 TraceCheckUtils]: 127: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:56,802 INFO L273 TraceCheckUtils]: 128: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,802 INFO L273 TraceCheckUtils]: 129: Hoare triple {10007#true} assume !(~i~0 < 10000); {10007#true} is VALID [2018-11-14 18:54:56,802 INFO L273 TraceCheckUtils]: 130: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 18:54:56,802 INFO L273 TraceCheckUtils]: 131: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:56,802 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {10007#true} {10008#false} #77#return; {10008#false} is VALID [2018-11-14 18:54:56,802 INFO L273 TraceCheckUtils]: 133: Hoare triple {10008#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10008#false} is VALID [2018-11-14 18:54:56,803 INFO L273 TraceCheckUtils]: 134: Hoare triple {10008#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10008#false} is VALID [2018-11-14 18:54:56,803 INFO L273 TraceCheckUtils]: 135: Hoare triple {10008#false} assume !false; {10008#false} is VALID [2018-11-14 18:54:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 18:54:56,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:56,811 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:56,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:54:56,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 18:54:56,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:56,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:57,074 INFO L256 TraceCheckUtils]: 0: Hoare triple {10007#true} call ULTIMATE.init(); {10007#true} is VALID [2018-11-14 18:54:57,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {10007#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10007#true} is VALID [2018-11-14 18:54:57,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,075 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10007#true} {10007#true} #69#return; {10007#true} is VALID [2018-11-14 18:54:57,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {10007#true} call #t~ret13 := main(); {10007#true} is VALID [2018-11-14 18:54:57,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {10007#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10007#true} is VALID [2018-11-14 18:54:57,076 INFO L273 TraceCheckUtils]: 6: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,076 INFO L273 TraceCheckUtils]: 7: Hoare triple {10007#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:54:57,076 INFO L273 TraceCheckUtils]: 8: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:54:57,076 INFO L273 TraceCheckUtils]: 9: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,077 INFO L273 TraceCheckUtils]: 10: Hoare triple {10007#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:54:57,077 INFO L273 TraceCheckUtils]: 11: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:54:57,077 INFO L273 TraceCheckUtils]: 12: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {10007#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:54:57,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:54:57,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,077 INFO L273 TraceCheckUtils]: 16: Hoare triple {10007#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:54:57,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:54:57,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {10007#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:54:57,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:54:57,078 INFO L273 TraceCheckUtils]: 21: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,078 INFO L273 TraceCheckUtils]: 22: Hoare triple {10007#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:54:57,078 INFO L273 TraceCheckUtils]: 23: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:54:57,078 INFO L273 TraceCheckUtils]: 24: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,078 INFO L273 TraceCheckUtils]: 25: Hoare triple {10007#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:54:57,078 INFO L273 TraceCheckUtils]: 26: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:54:57,078 INFO L273 TraceCheckUtils]: 27: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,079 INFO L273 TraceCheckUtils]: 28: Hoare triple {10007#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:54:57,079 INFO L273 TraceCheckUtils]: 29: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:54:57,079 INFO L273 TraceCheckUtils]: 30: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,079 INFO L273 TraceCheckUtils]: 31: Hoare triple {10007#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:54:57,079 INFO L273 TraceCheckUtils]: 32: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:54:57,079 INFO L273 TraceCheckUtils]: 33: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,079 INFO L273 TraceCheckUtils]: 34: Hoare triple {10007#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:54:57,079 INFO L273 TraceCheckUtils]: 35: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:54:57,079 INFO L273 TraceCheckUtils]: 36: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,080 INFO L273 TraceCheckUtils]: 37: Hoare triple {10007#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:54:57,080 INFO L273 TraceCheckUtils]: 38: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:54:57,080 INFO L273 TraceCheckUtils]: 39: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,080 INFO L273 TraceCheckUtils]: 40: Hoare triple {10007#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:54:57,080 INFO L273 TraceCheckUtils]: 41: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:54:57,080 INFO L273 TraceCheckUtils]: 42: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,080 INFO L273 TraceCheckUtils]: 43: Hoare triple {10007#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:54:57,080 INFO L273 TraceCheckUtils]: 44: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:54:57,080 INFO L273 TraceCheckUtils]: 45: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,081 INFO L273 TraceCheckUtils]: 46: Hoare triple {10007#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:54:57,081 INFO L273 TraceCheckUtils]: 47: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:54:57,081 INFO L273 TraceCheckUtils]: 48: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,081 INFO L273 TraceCheckUtils]: 49: Hoare triple {10007#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:54:57,081 INFO L273 TraceCheckUtils]: 50: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:54:57,081 INFO L273 TraceCheckUtils]: 51: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,081 INFO L273 TraceCheckUtils]: 52: Hoare triple {10007#true} assume !(~i~1 < 10000); {10007#true} is VALID [2018-11-14 18:54:57,081 INFO L256 TraceCheckUtils]: 53: Hoare triple {10007#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 18:54:57,081 INFO L273 TraceCheckUtils]: 54: Hoare triple {10007#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 18:54:57,082 INFO L273 TraceCheckUtils]: 55: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,082 INFO L273 TraceCheckUtils]: 56: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:57,082 INFO L273 TraceCheckUtils]: 57: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:57,082 INFO L273 TraceCheckUtils]: 58: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,082 INFO L273 TraceCheckUtils]: 59: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:57,082 INFO L273 TraceCheckUtils]: 60: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:57,082 INFO L273 TraceCheckUtils]: 61: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,082 INFO L273 TraceCheckUtils]: 62: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:57,082 INFO L273 TraceCheckUtils]: 63: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:57,083 INFO L273 TraceCheckUtils]: 64: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,083 INFO L273 TraceCheckUtils]: 65: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:57,083 INFO L273 TraceCheckUtils]: 66: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:57,083 INFO L273 TraceCheckUtils]: 67: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,083 INFO L273 TraceCheckUtils]: 68: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:57,083 INFO L273 TraceCheckUtils]: 69: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:57,083 INFO L273 TraceCheckUtils]: 70: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,083 INFO L273 TraceCheckUtils]: 71: Hoare triple {10007#true} assume !(~i~0 < 10000); {10007#true} is VALID [2018-11-14 18:54:57,083 INFO L273 TraceCheckUtils]: 72: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 18:54:57,084 INFO L273 TraceCheckUtils]: 73: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,084 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {10007#true} {10007#true} #73#return; {10007#true} is VALID [2018-11-14 18:54:57,084 INFO L273 TraceCheckUtils]: 75: Hoare triple {10007#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10007#true} is VALID [2018-11-14 18:54:57,084 INFO L256 TraceCheckUtils]: 76: Hoare triple {10007#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 18:54:57,084 INFO L273 TraceCheckUtils]: 77: Hoare triple {10007#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 18:54:57,084 INFO L273 TraceCheckUtils]: 78: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,084 INFO L273 TraceCheckUtils]: 79: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:57,084 INFO L273 TraceCheckUtils]: 80: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:57,084 INFO L273 TraceCheckUtils]: 81: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,085 INFO L273 TraceCheckUtils]: 82: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:57,085 INFO L273 TraceCheckUtils]: 83: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:57,085 INFO L273 TraceCheckUtils]: 84: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,085 INFO L273 TraceCheckUtils]: 85: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:57,085 INFO L273 TraceCheckUtils]: 86: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:57,085 INFO L273 TraceCheckUtils]: 87: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,085 INFO L273 TraceCheckUtils]: 88: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:57,085 INFO L273 TraceCheckUtils]: 89: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:57,085 INFO L273 TraceCheckUtils]: 90: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,086 INFO L273 TraceCheckUtils]: 91: Hoare triple {10007#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:54:57,086 INFO L273 TraceCheckUtils]: 92: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:54:57,086 INFO L273 TraceCheckUtils]: 93: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,086 INFO L273 TraceCheckUtils]: 94: Hoare triple {10007#true} assume !(~i~0 < 10000); {10007#true} is VALID [2018-11-14 18:54:57,086 INFO L273 TraceCheckUtils]: 95: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 18:54:57,086 INFO L273 TraceCheckUtils]: 96: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:54:57,086 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {10007#true} {10007#true} #75#return; {10007#true} is VALID [2018-11-14 18:54:57,087 INFO L273 TraceCheckUtils]: 98: Hoare triple {10007#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10322#(<= main_~i~2 0)} is VALID [2018-11-14 18:54:57,087 INFO L273 TraceCheckUtils]: 99: Hoare triple {10322#(<= main_~i~2 0)} assume true; {10322#(<= main_~i~2 0)} is VALID [2018-11-14 18:54:57,087 INFO L273 TraceCheckUtils]: 100: Hoare triple {10322#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10322#(<= main_~i~2 0)} is VALID [2018-11-14 18:54:57,088 INFO L273 TraceCheckUtils]: 101: Hoare triple {10322#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10332#(<= main_~i~2 1)} is VALID [2018-11-14 18:54:57,088 INFO L273 TraceCheckUtils]: 102: Hoare triple {10332#(<= main_~i~2 1)} assume true; {10332#(<= main_~i~2 1)} is VALID [2018-11-14 18:54:57,089 INFO L273 TraceCheckUtils]: 103: Hoare triple {10332#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10332#(<= main_~i~2 1)} is VALID [2018-11-14 18:54:57,089 INFO L273 TraceCheckUtils]: 104: Hoare triple {10332#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10342#(<= main_~i~2 2)} is VALID [2018-11-14 18:54:57,089 INFO L273 TraceCheckUtils]: 105: Hoare triple {10342#(<= main_~i~2 2)} assume true; {10342#(<= main_~i~2 2)} is VALID [2018-11-14 18:54:57,090 INFO L273 TraceCheckUtils]: 106: Hoare triple {10342#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10342#(<= main_~i~2 2)} is VALID [2018-11-14 18:54:57,091 INFO L273 TraceCheckUtils]: 107: Hoare triple {10342#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10352#(<= main_~i~2 3)} is VALID [2018-11-14 18:54:57,091 INFO L273 TraceCheckUtils]: 108: Hoare triple {10352#(<= main_~i~2 3)} assume true; {10352#(<= main_~i~2 3)} is VALID [2018-11-14 18:54:57,092 INFO L273 TraceCheckUtils]: 109: Hoare triple {10352#(<= main_~i~2 3)} assume !(~i~2 < 9999); {10008#false} is VALID [2018-11-14 18:54:57,092 INFO L273 TraceCheckUtils]: 110: Hoare triple {10008#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {10008#false} is VALID [2018-11-14 18:54:57,092 INFO L256 TraceCheckUtils]: 111: Hoare triple {10008#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {10008#false} is VALID [2018-11-14 18:54:57,092 INFO L273 TraceCheckUtils]: 112: Hoare triple {10008#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10008#false} is VALID [2018-11-14 18:54:57,093 INFO L273 TraceCheckUtils]: 113: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:54:57,093 INFO L273 TraceCheckUtils]: 114: Hoare triple {10008#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 18:54:57,093 INFO L273 TraceCheckUtils]: 115: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 18:54:57,093 INFO L273 TraceCheckUtils]: 116: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:54:57,093 INFO L273 TraceCheckUtils]: 117: Hoare triple {10008#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 18:54:57,094 INFO L273 TraceCheckUtils]: 118: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 18:54:57,094 INFO L273 TraceCheckUtils]: 119: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:54:57,094 INFO L273 TraceCheckUtils]: 120: Hoare triple {10008#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 18:54:57,094 INFO L273 TraceCheckUtils]: 121: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 18:54:57,094 INFO L273 TraceCheckUtils]: 122: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:54:57,094 INFO L273 TraceCheckUtils]: 123: Hoare triple {10008#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 18:54:57,095 INFO L273 TraceCheckUtils]: 124: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 18:54:57,095 INFO L273 TraceCheckUtils]: 125: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:54:57,095 INFO L273 TraceCheckUtils]: 126: Hoare triple {10008#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 18:54:57,095 INFO L273 TraceCheckUtils]: 127: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 18:54:57,095 INFO L273 TraceCheckUtils]: 128: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:54:57,095 INFO L273 TraceCheckUtils]: 129: Hoare triple {10008#false} assume !(~i~0 < 10000); {10008#false} is VALID [2018-11-14 18:54:57,095 INFO L273 TraceCheckUtils]: 130: Hoare triple {10008#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10008#false} is VALID [2018-11-14 18:54:57,095 INFO L273 TraceCheckUtils]: 131: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:54:57,095 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {10008#false} {10008#false} #77#return; {10008#false} is VALID [2018-11-14 18:54:57,096 INFO L273 TraceCheckUtils]: 133: Hoare triple {10008#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10008#false} is VALID [2018-11-14 18:54:57,096 INFO L273 TraceCheckUtils]: 134: Hoare triple {10008#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10008#false} is VALID [2018-11-14 18:54:57,096 INFO L273 TraceCheckUtils]: 135: Hoare triple {10008#false} assume !false; {10008#false} is VALID [2018-11-14 18:54:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 202 proven. 15 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2018-11-14 18:54:57,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:57,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6] total 22 [2018-11-14 18:54:57,124 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 136 [2018-11-14 18:54:57,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:57,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 18:54:57,226 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-14 18:54:57,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 18:54:57,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 18:54:57,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:54:57,227 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 22 states. [2018-11-14 18:54:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:57,695 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-11-14 18:54:57,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 18:54:57,696 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 136 [2018-11-14 18:54:57,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:54:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 118 transitions. [2018-11-14 18:54:57,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:54:57,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 118 transitions. [2018-11-14 18:54:57,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 118 transitions. [2018-11-14 18:54:57,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:57,845 INFO L225 Difference]: With dead ends: 145 [2018-11-14 18:54:57,845 INFO L226 Difference]: Without dead ends: 103 [2018-11-14 18:54:57,846 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:54:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-14 18:54:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-11-14 18:54:57,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:57,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 101 states. [2018-11-14 18:54:57,881 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 101 states. [2018-11-14 18:54:57,881 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 101 states. [2018-11-14 18:54:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:57,883 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-14 18:54:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-14 18:54:57,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:57,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:57,884 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 103 states. [2018-11-14 18:54:57,884 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 103 states. [2018-11-14 18:54:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:57,886 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-14 18:54:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-14 18:54:57,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:57,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:57,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:57,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 18:54:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-11-14 18:54:57,890 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 136 [2018-11-14 18:54:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:57,890 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-11-14 18:54:57,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 18:54:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-14 18:54:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-14 18:54:57,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:57,891 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 16, 16, 15, 15, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:57,892 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:57,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:57,892 INFO L82 PathProgramCache]: Analyzing trace with hash 562002789, now seen corresponding path program 16 times [2018-11-14 18:54:57,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:57,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:57,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:57,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:57,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:58,311 INFO L256 TraceCheckUtils]: 0: Hoare triple {10974#true} call ULTIMATE.init(); {10974#true} is VALID [2018-11-14 18:54:58,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {10974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10974#true} is VALID [2018-11-14 18:54:58,312 INFO L273 TraceCheckUtils]: 2: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,312 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10974#true} {10974#true} #69#return; {10974#true} is VALID [2018-11-14 18:54:58,312 INFO L256 TraceCheckUtils]: 4: Hoare triple {10974#true} call #t~ret13 := main(); {10974#true} is VALID [2018-11-14 18:54:58,312 INFO L273 TraceCheckUtils]: 5: Hoare triple {10974#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10976#(= main_~i~1 0)} is VALID [2018-11-14 18:54:58,313 INFO L273 TraceCheckUtils]: 6: Hoare triple {10976#(= main_~i~1 0)} assume true; {10976#(= main_~i~1 0)} is VALID [2018-11-14 18:54:58,313 INFO L273 TraceCheckUtils]: 7: Hoare triple {10976#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10976#(= main_~i~1 0)} is VALID [2018-11-14 18:54:58,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {10976#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10977#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:58,314 INFO L273 TraceCheckUtils]: 9: Hoare triple {10977#(<= main_~i~1 1)} assume true; {10977#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:58,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {10977#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10977#(<= main_~i~1 1)} is VALID [2018-11-14 18:54:58,314 INFO L273 TraceCheckUtils]: 11: Hoare triple {10977#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10978#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:58,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {10978#(<= main_~i~1 2)} assume true; {10978#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:58,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {10978#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10978#(<= main_~i~1 2)} is VALID [2018-11-14 18:54:58,316 INFO L273 TraceCheckUtils]: 14: Hoare triple {10978#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10979#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:58,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {10979#(<= main_~i~1 3)} assume true; {10979#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:58,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {10979#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10979#(<= main_~i~1 3)} is VALID [2018-11-14 18:54:58,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {10979#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10980#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:58,317 INFO L273 TraceCheckUtils]: 18: Hoare triple {10980#(<= main_~i~1 4)} assume true; {10980#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:58,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {10980#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10980#(<= main_~i~1 4)} is VALID [2018-11-14 18:54:58,318 INFO L273 TraceCheckUtils]: 20: Hoare triple {10980#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10981#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:58,319 INFO L273 TraceCheckUtils]: 21: Hoare triple {10981#(<= main_~i~1 5)} assume true; {10981#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:58,319 INFO L273 TraceCheckUtils]: 22: Hoare triple {10981#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10981#(<= main_~i~1 5)} is VALID [2018-11-14 18:54:58,320 INFO L273 TraceCheckUtils]: 23: Hoare triple {10981#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10982#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:58,321 INFO L273 TraceCheckUtils]: 24: Hoare triple {10982#(<= main_~i~1 6)} assume true; {10982#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:58,321 INFO L273 TraceCheckUtils]: 25: Hoare triple {10982#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10982#(<= main_~i~1 6)} is VALID [2018-11-14 18:54:58,322 INFO L273 TraceCheckUtils]: 26: Hoare triple {10982#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10983#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:58,322 INFO L273 TraceCheckUtils]: 27: Hoare triple {10983#(<= main_~i~1 7)} assume true; {10983#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:58,323 INFO L273 TraceCheckUtils]: 28: Hoare triple {10983#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10983#(<= main_~i~1 7)} is VALID [2018-11-14 18:54:58,324 INFO L273 TraceCheckUtils]: 29: Hoare triple {10983#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10984#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:58,324 INFO L273 TraceCheckUtils]: 30: Hoare triple {10984#(<= main_~i~1 8)} assume true; {10984#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:58,325 INFO L273 TraceCheckUtils]: 31: Hoare triple {10984#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10984#(<= main_~i~1 8)} is VALID [2018-11-14 18:54:58,326 INFO L273 TraceCheckUtils]: 32: Hoare triple {10984#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10985#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:58,326 INFO L273 TraceCheckUtils]: 33: Hoare triple {10985#(<= main_~i~1 9)} assume true; {10985#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:58,327 INFO L273 TraceCheckUtils]: 34: Hoare triple {10985#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10985#(<= main_~i~1 9)} is VALID [2018-11-14 18:54:58,327 INFO L273 TraceCheckUtils]: 35: Hoare triple {10985#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10986#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:58,328 INFO L273 TraceCheckUtils]: 36: Hoare triple {10986#(<= main_~i~1 10)} assume true; {10986#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:58,328 INFO L273 TraceCheckUtils]: 37: Hoare triple {10986#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10986#(<= main_~i~1 10)} is VALID [2018-11-14 18:54:58,329 INFO L273 TraceCheckUtils]: 38: Hoare triple {10986#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10987#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:58,330 INFO L273 TraceCheckUtils]: 39: Hoare triple {10987#(<= main_~i~1 11)} assume true; {10987#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:58,330 INFO L273 TraceCheckUtils]: 40: Hoare triple {10987#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10987#(<= main_~i~1 11)} is VALID [2018-11-14 18:54:58,331 INFO L273 TraceCheckUtils]: 41: Hoare triple {10987#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10988#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:58,331 INFO L273 TraceCheckUtils]: 42: Hoare triple {10988#(<= main_~i~1 12)} assume true; {10988#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:58,332 INFO L273 TraceCheckUtils]: 43: Hoare triple {10988#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10988#(<= main_~i~1 12)} is VALID [2018-11-14 18:54:58,333 INFO L273 TraceCheckUtils]: 44: Hoare triple {10988#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10989#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:58,333 INFO L273 TraceCheckUtils]: 45: Hoare triple {10989#(<= main_~i~1 13)} assume true; {10989#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:58,334 INFO L273 TraceCheckUtils]: 46: Hoare triple {10989#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10989#(<= main_~i~1 13)} is VALID [2018-11-14 18:54:58,335 INFO L273 TraceCheckUtils]: 47: Hoare triple {10989#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10990#(<= main_~i~1 14)} is VALID [2018-11-14 18:54:58,335 INFO L273 TraceCheckUtils]: 48: Hoare triple {10990#(<= main_~i~1 14)} assume true; {10990#(<= main_~i~1 14)} is VALID [2018-11-14 18:54:58,336 INFO L273 TraceCheckUtils]: 49: Hoare triple {10990#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10990#(<= main_~i~1 14)} is VALID [2018-11-14 18:54:58,336 INFO L273 TraceCheckUtils]: 50: Hoare triple {10990#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10991#(<= main_~i~1 15)} is VALID [2018-11-14 18:54:58,337 INFO L273 TraceCheckUtils]: 51: Hoare triple {10991#(<= main_~i~1 15)} assume true; {10991#(<= main_~i~1 15)} is VALID [2018-11-14 18:54:58,337 INFO L273 TraceCheckUtils]: 52: Hoare triple {10991#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10991#(<= main_~i~1 15)} is VALID [2018-11-14 18:54:58,338 INFO L273 TraceCheckUtils]: 53: Hoare triple {10991#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10992#(<= main_~i~1 16)} is VALID [2018-11-14 18:54:58,339 INFO L273 TraceCheckUtils]: 54: Hoare triple {10992#(<= main_~i~1 16)} assume true; {10992#(<= main_~i~1 16)} is VALID [2018-11-14 18:54:58,339 INFO L273 TraceCheckUtils]: 55: Hoare triple {10992#(<= main_~i~1 16)} assume !(~i~1 < 10000); {10975#false} is VALID [2018-11-14 18:54:58,340 INFO L256 TraceCheckUtils]: 56: Hoare triple {10975#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 18:54:58,340 INFO L273 TraceCheckUtils]: 57: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 18:54:58,340 INFO L273 TraceCheckUtils]: 58: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,340 INFO L273 TraceCheckUtils]: 59: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,340 INFO L273 TraceCheckUtils]: 60: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,341 INFO L273 TraceCheckUtils]: 61: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,341 INFO L273 TraceCheckUtils]: 62: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,341 INFO L273 TraceCheckUtils]: 63: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,341 INFO L273 TraceCheckUtils]: 64: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,341 INFO L273 TraceCheckUtils]: 65: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,342 INFO L273 TraceCheckUtils]: 66: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,342 INFO L273 TraceCheckUtils]: 67: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,342 INFO L273 TraceCheckUtils]: 68: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,342 INFO L273 TraceCheckUtils]: 69: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,342 INFO L273 TraceCheckUtils]: 70: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,343 INFO L273 TraceCheckUtils]: 71: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,343 INFO L273 TraceCheckUtils]: 72: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,343 INFO L273 TraceCheckUtils]: 73: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,343 INFO L273 TraceCheckUtils]: 74: Hoare triple {10974#true} assume !(~i~0 < 10000); {10974#true} is VALID [2018-11-14 18:54:58,343 INFO L273 TraceCheckUtils]: 75: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 18:54:58,343 INFO L273 TraceCheckUtils]: 76: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,344 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {10974#true} {10975#false} #73#return; {10975#false} is VALID [2018-11-14 18:54:58,344 INFO L273 TraceCheckUtils]: 78: Hoare triple {10975#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10975#false} is VALID [2018-11-14 18:54:58,344 INFO L256 TraceCheckUtils]: 79: Hoare triple {10975#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 18:54:58,344 INFO L273 TraceCheckUtils]: 80: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 18:54:58,344 INFO L273 TraceCheckUtils]: 81: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,344 INFO L273 TraceCheckUtils]: 82: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,344 INFO L273 TraceCheckUtils]: 83: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,344 INFO L273 TraceCheckUtils]: 84: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,345 INFO L273 TraceCheckUtils]: 85: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,345 INFO L273 TraceCheckUtils]: 86: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,345 INFO L273 TraceCheckUtils]: 87: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,345 INFO L273 TraceCheckUtils]: 88: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,345 INFO L273 TraceCheckUtils]: 89: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,345 INFO L273 TraceCheckUtils]: 90: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,345 INFO L273 TraceCheckUtils]: 91: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,345 INFO L273 TraceCheckUtils]: 92: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,345 INFO L273 TraceCheckUtils]: 93: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,346 INFO L273 TraceCheckUtils]: 94: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,346 INFO L273 TraceCheckUtils]: 95: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,346 INFO L273 TraceCheckUtils]: 96: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,346 INFO L273 TraceCheckUtils]: 97: Hoare triple {10974#true} assume !(~i~0 < 10000); {10974#true} is VALID [2018-11-14 18:54:58,346 INFO L273 TraceCheckUtils]: 98: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 18:54:58,346 INFO L273 TraceCheckUtils]: 99: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,346 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {10974#true} {10975#false} #75#return; {10975#false} is VALID [2018-11-14 18:54:58,346 INFO L273 TraceCheckUtils]: 101: Hoare triple {10975#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10975#false} is VALID [2018-11-14 18:54:58,346 INFO L273 TraceCheckUtils]: 102: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 18:54:58,347 INFO L273 TraceCheckUtils]: 103: Hoare triple {10975#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 18:54:58,347 INFO L273 TraceCheckUtils]: 104: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 18:54:58,347 INFO L273 TraceCheckUtils]: 105: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 18:54:58,347 INFO L273 TraceCheckUtils]: 106: Hoare triple {10975#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 18:54:58,347 INFO L273 TraceCheckUtils]: 107: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 18:54:58,347 INFO L273 TraceCheckUtils]: 108: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 18:54:58,347 INFO L273 TraceCheckUtils]: 109: Hoare triple {10975#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 18:54:58,347 INFO L273 TraceCheckUtils]: 110: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 18:54:58,348 INFO L273 TraceCheckUtils]: 111: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 18:54:58,348 INFO L273 TraceCheckUtils]: 112: Hoare triple {10975#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 18:54:58,348 INFO L273 TraceCheckUtils]: 113: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 18:54:58,348 INFO L273 TraceCheckUtils]: 114: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 18:54:58,348 INFO L273 TraceCheckUtils]: 115: Hoare triple {10975#false} assume !(~i~2 < 9999); {10975#false} is VALID [2018-11-14 18:54:58,348 INFO L273 TraceCheckUtils]: 116: Hoare triple {10975#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {10975#false} is VALID [2018-11-14 18:54:58,348 INFO L256 TraceCheckUtils]: 117: Hoare triple {10975#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 18:54:58,348 INFO L273 TraceCheckUtils]: 118: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 18:54:58,348 INFO L273 TraceCheckUtils]: 119: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,349 INFO L273 TraceCheckUtils]: 120: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,349 INFO L273 TraceCheckUtils]: 121: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,349 INFO L273 TraceCheckUtils]: 122: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,349 INFO L273 TraceCheckUtils]: 123: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,349 INFO L273 TraceCheckUtils]: 124: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,349 INFO L273 TraceCheckUtils]: 125: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,349 INFO L273 TraceCheckUtils]: 126: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,349 INFO L273 TraceCheckUtils]: 127: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,349 INFO L273 TraceCheckUtils]: 128: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,350 INFO L273 TraceCheckUtils]: 129: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,350 INFO L273 TraceCheckUtils]: 130: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,350 INFO L273 TraceCheckUtils]: 131: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,350 INFO L273 TraceCheckUtils]: 132: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,350 INFO L273 TraceCheckUtils]: 133: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,350 INFO L273 TraceCheckUtils]: 134: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,350 INFO L273 TraceCheckUtils]: 135: Hoare triple {10974#true} assume !(~i~0 < 10000); {10974#true} is VALID [2018-11-14 18:54:58,350 INFO L273 TraceCheckUtils]: 136: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 18:54:58,350 INFO L273 TraceCheckUtils]: 137: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,351 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {10974#true} {10975#false} #77#return; {10975#false} is VALID [2018-11-14 18:54:58,351 INFO L273 TraceCheckUtils]: 139: Hoare triple {10975#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10975#false} is VALID [2018-11-14 18:54:58,351 INFO L273 TraceCheckUtils]: 140: Hoare triple {10975#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10975#false} is VALID [2018-11-14 18:54:58,351 INFO L273 TraceCheckUtils]: 141: Hoare triple {10975#false} assume !false; {10975#false} is VALID [2018-11-14 18:54:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2018-11-14 18:54:58,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:58,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:58,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:54:58,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:54:58,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:58,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:58,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {10974#true} call ULTIMATE.init(); {10974#true} is VALID [2018-11-14 18:54:58,696 INFO L273 TraceCheckUtils]: 1: Hoare triple {10974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10974#true} is VALID [2018-11-14 18:54:58,696 INFO L273 TraceCheckUtils]: 2: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10974#true} {10974#true} #69#return; {10974#true} is VALID [2018-11-14 18:54:58,697 INFO L256 TraceCheckUtils]: 4: Hoare triple {10974#true} call #t~ret13 := main(); {10974#true} is VALID [2018-11-14 18:54:58,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {10974#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10974#true} is VALID [2018-11-14 18:54:58,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,697 INFO L273 TraceCheckUtils]: 7: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,698 INFO L273 TraceCheckUtils]: 9: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,698 INFO L273 TraceCheckUtils]: 10: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,698 INFO L273 TraceCheckUtils]: 12: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,698 INFO L273 TraceCheckUtils]: 13: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,698 INFO L273 TraceCheckUtils]: 14: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,698 INFO L273 TraceCheckUtils]: 15: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,698 INFO L273 TraceCheckUtils]: 16: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,699 INFO L273 TraceCheckUtils]: 17: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,699 INFO L273 TraceCheckUtils]: 18: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,699 INFO L273 TraceCheckUtils]: 19: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,699 INFO L273 TraceCheckUtils]: 20: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,699 INFO L273 TraceCheckUtils]: 21: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,699 INFO L273 TraceCheckUtils]: 22: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,699 INFO L273 TraceCheckUtils]: 23: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,699 INFO L273 TraceCheckUtils]: 24: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,699 INFO L273 TraceCheckUtils]: 25: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,700 INFO L273 TraceCheckUtils]: 26: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,700 INFO L273 TraceCheckUtils]: 27: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,700 INFO L273 TraceCheckUtils]: 28: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,700 INFO L273 TraceCheckUtils]: 29: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,700 INFO L273 TraceCheckUtils]: 30: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,700 INFO L273 TraceCheckUtils]: 31: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,700 INFO L273 TraceCheckUtils]: 32: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,700 INFO L273 TraceCheckUtils]: 33: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,700 INFO L273 TraceCheckUtils]: 34: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,701 INFO L273 TraceCheckUtils]: 35: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,701 INFO L273 TraceCheckUtils]: 36: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,701 INFO L273 TraceCheckUtils]: 37: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,701 INFO L273 TraceCheckUtils]: 38: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,701 INFO L273 TraceCheckUtils]: 39: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,701 INFO L273 TraceCheckUtils]: 40: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,701 INFO L273 TraceCheckUtils]: 41: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,701 INFO L273 TraceCheckUtils]: 42: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,701 INFO L273 TraceCheckUtils]: 43: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,702 INFO L273 TraceCheckUtils]: 44: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,702 INFO L273 TraceCheckUtils]: 45: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,702 INFO L273 TraceCheckUtils]: 46: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,702 INFO L273 TraceCheckUtils]: 47: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,702 INFO L273 TraceCheckUtils]: 48: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,702 INFO L273 TraceCheckUtils]: 49: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,702 INFO L273 TraceCheckUtils]: 50: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,702 INFO L273 TraceCheckUtils]: 51: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,703 INFO L273 TraceCheckUtils]: 52: Hoare triple {10974#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:54:58,703 INFO L273 TraceCheckUtils]: 53: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:54:58,703 INFO L273 TraceCheckUtils]: 54: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,703 INFO L273 TraceCheckUtils]: 55: Hoare triple {10974#true} assume !(~i~1 < 10000); {10974#true} is VALID [2018-11-14 18:54:58,703 INFO L256 TraceCheckUtils]: 56: Hoare triple {10974#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 18:54:58,703 INFO L273 TraceCheckUtils]: 57: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 18:54:58,703 INFO L273 TraceCheckUtils]: 58: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,703 INFO L273 TraceCheckUtils]: 59: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,703 INFO L273 TraceCheckUtils]: 60: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,704 INFO L273 TraceCheckUtils]: 61: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,704 INFO L273 TraceCheckUtils]: 62: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,704 INFO L273 TraceCheckUtils]: 63: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,704 INFO L273 TraceCheckUtils]: 64: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,704 INFO L273 TraceCheckUtils]: 65: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,704 INFO L273 TraceCheckUtils]: 66: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,704 INFO L273 TraceCheckUtils]: 67: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,704 INFO L273 TraceCheckUtils]: 68: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,704 INFO L273 TraceCheckUtils]: 69: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,705 INFO L273 TraceCheckUtils]: 70: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,705 INFO L273 TraceCheckUtils]: 71: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,705 INFO L273 TraceCheckUtils]: 72: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,705 INFO L273 TraceCheckUtils]: 73: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,706 INFO L273 TraceCheckUtils]: 74: Hoare triple {10974#true} assume !(~i~0 < 10000); {10974#true} is VALID [2018-11-14 18:54:58,706 INFO L273 TraceCheckUtils]: 75: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 18:54:58,706 INFO L273 TraceCheckUtils]: 76: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,706 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {10974#true} {10974#true} #73#return; {10974#true} is VALID [2018-11-14 18:54:58,706 INFO L273 TraceCheckUtils]: 78: Hoare triple {10974#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10974#true} is VALID [2018-11-14 18:54:58,706 INFO L256 TraceCheckUtils]: 79: Hoare triple {10974#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 18:54:58,706 INFO L273 TraceCheckUtils]: 80: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 18:54:58,706 INFO L273 TraceCheckUtils]: 81: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,706 INFO L273 TraceCheckUtils]: 82: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,707 INFO L273 TraceCheckUtils]: 83: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,707 INFO L273 TraceCheckUtils]: 84: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,707 INFO L273 TraceCheckUtils]: 85: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,707 INFO L273 TraceCheckUtils]: 86: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,707 INFO L273 TraceCheckUtils]: 87: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,707 INFO L273 TraceCheckUtils]: 88: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,707 INFO L273 TraceCheckUtils]: 89: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,707 INFO L273 TraceCheckUtils]: 90: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,707 INFO L273 TraceCheckUtils]: 91: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,708 INFO L273 TraceCheckUtils]: 92: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,708 INFO L273 TraceCheckUtils]: 93: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,708 INFO L273 TraceCheckUtils]: 94: Hoare triple {10974#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:54:58,708 INFO L273 TraceCheckUtils]: 95: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:54:58,708 INFO L273 TraceCheckUtils]: 96: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,708 INFO L273 TraceCheckUtils]: 97: Hoare triple {10974#true} assume !(~i~0 < 10000); {10974#true} is VALID [2018-11-14 18:54:58,709 INFO L273 TraceCheckUtils]: 98: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 18:54:58,709 INFO L273 TraceCheckUtils]: 99: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,709 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {10974#true} {10974#true} #75#return; {10974#true} is VALID [2018-11-14 18:54:58,709 INFO L273 TraceCheckUtils]: 101: Hoare triple {10974#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10974#true} is VALID [2018-11-14 18:54:58,709 INFO L273 TraceCheckUtils]: 102: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,709 INFO L273 TraceCheckUtils]: 103: Hoare triple {10974#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 18:54:58,710 INFO L273 TraceCheckUtils]: 104: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 18:54:58,710 INFO L273 TraceCheckUtils]: 105: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,710 INFO L273 TraceCheckUtils]: 106: Hoare triple {10974#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 18:54:58,710 INFO L273 TraceCheckUtils]: 107: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 18:54:58,710 INFO L273 TraceCheckUtils]: 108: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,711 INFO L273 TraceCheckUtils]: 109: Hoare triple {10974#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 18:54:58,711 INFO L273 TraceCheckUtils]: 110: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 18:54:58,711 INFO L273 TraceCheckUtils]: 111: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,711 INFO L273 TraceCheckUtils]: 112: Hoare triple {10974#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 18:54:58,711 INFO L273 TraceCheckUtils]: 113: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 18:54:58,711 INFO L273 TraceCheckUtils]: 114: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:54:58,712 INFO L273 TraceCheckUtils]: 115: Hoare triple {10974#true} assume !(~i~2 < 9999); {10974#true} is VALID [2018-11-14 18:54:58,712 INFO L273 TraceCheckUtils]: 116: Hoare triple {10974#true} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {10974#true} is VALID [2018-11-14 18:54:58,712 INFO L256 TraceCheckUtils]: 117: Hoare triple {10974#true} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 18:54:58,725 INFO L273 TraceCheckUtils]: 118: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11350#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:58,734 INFO L273 TraceCheckUtils]: 119: Hoare triple {11350#(<= bAnd_~i~0 1)} assume true; {11350#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:58,748 INFO L273 TraceCheckUtils]: 120: Hoare triple {11350#(<= bAnd_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11350#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:58,757 INFO L273 TraceCheckUtils]: 121: Hoare triple {11350#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11360#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:54:58,766 INFO L273 TraceCheckUtils]: 122: Hoare triple {11360#(<= bAnd_~i~0 2)} assume true; {11360#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:54:58,778 INFO L273 TraceCheckUtils]: 123: Hoare triple {11360#(<= bAnd_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11360#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:54:58,792 INFO L273 TraceCheckUtils]: 124: Hoare triple {11360#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11370#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:54:58,801 INFO L273 TraceCheckUtils]: 125: Hoare triple {11370#(<= bAnd_~i~0 3)} assume true; {11370#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:54:58,815 INFO L273 TraceCheckUtils]: 126: Hoare triple {11370#(<= bAnd_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11370#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:54:58,824 INFO L273 TraceCheckUtils]: 127: Hoare triple {11370#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11380#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:54:58,842 INFO L273 TraceCheckUtils]: 128: Hoare triple {11380#(<= bAnd_~i~0 4)} assume true; {11380#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:54:58,851 INFO L273 TraceCheckUtils]: 129: Hoare triple {11380#(<= bAnd_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11380#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:54:58,863 INFO L273 TraceCheckUtils]: 130: Hoare triple {11380#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11390#(<= bAnd_~i~0 5)} is VALID [2018-11-14 18:54:58,876 INFO L273 TraceCheckUtils]: 131: Hoare triple {11390#(<= bAnd_~i~0 5)} assume true; {11390#(<= bAnd_~i~0 5)} is VALID [2018-11-14 18:54:58,891 INFO L273 TraceCheckUtils]: 132: Hoare triple {11390#(<= bAnd_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11390#(<= bAnd_~i~0 5)} is VALID [2018-11-14 18:54:58,906 INFO L273 TraceCheckUtils]: 133: Hoare triple {11390#(<= bAnd_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11400#(<= bAnd_~i~0 6)} is VALID [2018-11-14 18:54:58,915 INFO L273 TraceCheckUtils]: 134: Hoare triple {11400#(<= bAnd_~i~0 6)} assume true; {11400#(<= bAnd_~i~0 6)} is VALID [2018-11-14 18:54:58,927 INFO L273 TraceCheckUtils]: 135: Hoare triple {11400#(<= bAnd_~i~0 6)} assume !(~i~0 < 10000); {10975#false} is VALID [2018-11-14 18:54:58,928 INFO L273 TraceCheckUtils]: 136: Hoare triple {10975#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10975#false} is VALID [2018-11-14 18:54:58,928 INFO L273 TraceCheckUtils]: 137: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 18:54:58,928 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {10975#false} {10974#true} #77#return; {10975#false} is VALID [2018-11-14 18:54:58,928 INFO L273 TraceCheckUtils]: 139: Hoare triple {10975#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10975#false} is VALID [2018-11-14 18:54:58,928 INFO L273 TraceCheckUtils]: 140: Hoare triple {10975#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10975#false} is VALID [2018-11-14 18:54:58,929 INFO L273 TraceCheckUtils]: 141: Hoare triple {10975#false} assume !false; {10975#false} is VALID [2018-11-14 18:54:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 200 proven. 40 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2018-11-14 18:54:58,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:58,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 8] total 25 [2018-11-14 18:54:58,963 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 142 [2018-11-14 18:54:58,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:58,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 18:54:59,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:59,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 18:54:59,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 18:54:59,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:54:59,074 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 25 states. [2018-11-14 18:55:00,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:00,110 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-11-14 18:55:00,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 18:55:00,111 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 142 [2018-11-14 18:55:00,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:55:00,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:55:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-14 18:55:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:55:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-14 18:55:00,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 130 transitions. [2018-11-14 18:55:00,237 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-14 18:55:00,239 INFO L225 Difference]: With dead ends: 154 [2018-11-14 18:55:00,240 INFO L226 Difference]: Without dead ends: 109 [2018-11-14 18:55:00,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:55:00,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-14 18:55:00,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-11-14 18:55:00,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:55:00,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 107 states. [2018-11-14 18:55:00,269 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 107 states. [2018-11-14 18:55:00,269 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 107 states. [2018-11-14 18:55:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:00,272 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 18:55:00,272 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 18:55:00,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:00,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:00,273 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 109 states. [2018-11-14 18:55:00,273 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 109 states. [2018-11-14 18:55:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:00,275 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 18:55:00,276 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 18:55:00,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:00,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:00,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:55:00,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:55:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 18:55:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-14 18:55:00,279 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 142 [2018-11-14 18:55:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:55:00,279 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-14 18:55:00,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 18:55:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-14 18:55:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-14 18:55:00,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:55:00,281 INFO L375 BasicCegarLoop]: trace histogram [21, 18, 18, 18, 17, 17, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:55:00,281 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:55:00,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:55:00,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1450365401, now seen corresponding path program 17 times [2018-11-14 18:55:00,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:55:00,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:55:00,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:00,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:55:00,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:01,187 INFO L256 TraceCheckUtils]: 0: Hoare triple {11994#true} call ULTIMATE.init(); {11994#true} is VALID [2018-11-14 18:55:01,188 INFO L273 TraceCheckUtils]: 1: Hoare triple {11994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11994#true} is VALID [2018-11-14 18:55:01,188 INFO L273 TraceCheckUtils]: 2: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,188 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11994#true} {11994#true} #69#return; {11994#true} is VALID [2018-11-14 18:55:01,188 INFO L256 TraceCheckUtils]: 4: Hoare triple {11994#true} call #t~ret13 := main(); {11994#true} is VALID [2018-11-14 18:55:01,188 INFO L273 TraceCheckUtils]: 5: Hoare triple {11994#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11996#(= main_~i~1 0)} is VALID [2018-11-14 18:55:01,189 INFO L273 TraceCheckUtils]: 6: Hoare triple {11996#(= main_~i~1 0)} assume true; {11996#(= main_~i~1 0)} is VALID [2018-11-14 18:55:01,189 INFO L273 TraceCheckUtils]: 7: Hoare triple {11996#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11996#(= main_~i~1 0)} is VALID [2018-11-14 18:55:01,189 INFO L273 TraceCheckUtils]: 8: Hoare triple {11996#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11997#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:01,190 INFO L273 TraceCheckUtils]: 9: Hoare triple {11997#(<= main_~i~1 1)} assume true; {11997#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:01,190 INFO L273 TraceCheckUtils]: 10: Hoare triple {11997#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11997#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:01,191 INFO L273 TraceCheckUtils]: 11: Hoare triple {11997#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11998#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:01,192 INFO L273 TraceCheckUtils]: 12: Hoare triple {11998#(<= main_~i~1 2)} assume true; {11998#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:01,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {11998#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11998#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:01,193 INFO L273 TraceCheckUtils]: 14: Hoare triple {11998#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11999#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:01,193 INFO L273 TraceCheckUtils]: 15: Hoare triple {11999#(<= main_~i~1 3)} assume true; {11999#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:01,194 INFO L273 TraceCheckUtils]: 16: Hoare triple {11999#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11999#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:01,195 INFO L273 TraceCheckUtils]: 17: Hoare triple {11999#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12000#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:01,195 INFO L273 TraceCheckUtils]: 18: Hoare triple {12000#(<= main_~i~1 4)} assume true; {12000#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:01,196 INFO L273 TraceCheckUtils]: 19: Hoare triple {12000#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12000#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:01,196 INFO L273 TraceCheckUtils]: 20: Hoare triple {12000#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12001#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:01,198 INFO L273 TraceCheckUtils]: 21: Hoare triple {12001#(<= main_~i~1 5)} assume true; {12001#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:01,198 INFO L273 TraceCheckUtils]: 22: Hoare triple {12001#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12001#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:01,199 INFO L273 TraceCheckUtils]: 23: Hoare triple {12001#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12002#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:01,199 INFO L273 TraceCheckUtils]: 24: Hoare triple {12002#(<= main_~i~1 6)} assume true; {12002#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:01,200 INFO L273 TraceCheckUtils]: 25: Hoare triple {12002#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12002#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:01,201 INFO L273 TraceCheckUtils]: 26: Hoare triple {12002#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12003#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:01,201 INFO L273 TraceCheckUtils]: 27: Hoare triple {12003#(<= main_~i~1 7)} assume true; {12003#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:01,202 INFO L273 TraceCheckUtils]: 28: Hoare triple {12003#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12003#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:01,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {12003#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12004#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:01,203 INFO L273 TraceCheckUtils]: 30: Hoare triple {12004#(<= main_~i~1 8)} assume true; {12004#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:01,203 INFO L273 TraceCheckUtils]: 31: Hoare triple {12004#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12004#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:01,204 INFO L273 TraceCheckUtils]: 32: Hoare triple {12004#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12005#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:01,205 INFO L273 TraceCheckUtils]: 33: Hoare triple {12005#(<= main_~i~1 9)} assume true; {12005#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:01,205 INFO L273 TraceCheckUtils]: 34: Hoare triple {12005#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12005#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:01,206 INFO L273 TraceCheckUtils]: 35: Hoare triple {12005#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12006#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:01,206 INFO L273 TraceCheckUtils]: 36: Hoare triple {12006#(<= main_~i~1 10)} assume true; {12006#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:01,207 INFO L273 TraceCheckUtils]: 37: Hoare triple {12006#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12006#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:01,208 INFO L273 TraceCheckUtils]: 38: Hoare triple {12006#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12007#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:01,208 INFO L273 TraceCheckUtils]: 39: Hoare triple {12007#(<= main_~i~1 11)} assume true; {12007#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:01,209 INFO L273 TraceCheckUtils]: 40: Hoare triple {12007#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12007#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:01,209 INFO L273 TraceCheckUtils]: 41: Hoare triple {12007#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12008#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:01,210 INFO L273 TraceCheckUtils]: 42: Hoare triple {12008#(<= main_~i~1 12)} assume true; {12008#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:01,210 INFO L273 TraceCheckUtils]: 43: Hoare triple {12008#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12008#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:01,211 INFO L273 TraceCheckUtils]: 44: Hoare triple {12008#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12009#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:01,212 INFO L273 TraceCheckUtils]: 45: Hoare triple {12009#(<= main_~i~1 13)} assume true; {12009#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:01,212 INFO L273 TraceCheckUtils]: 46: Hoare triple {12009#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12009#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:01,213 INFO L273 TraceCheckUtils]: 47: Hoare triple {12009#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12010#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:01,213 INFO L273 TraceCheckUtils]: 48: Hoare triple {12010#(<= main_~i~1 14)} assume true; {12010#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:01,214 INFO L273 TraceCheckUtils]: 49: Hoare triple {12010#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12010#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:01,215 INFO L273 TraceCheckUtils]: 50: Hoare triple {12010#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12011#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:01,215 INFO L273 TraceCheckUtils]: 51: Hoare triple {12011#(<= main_~i~1 15)} assume true; {12011#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:01,216 INFO L273 TraceCheckUtils]: 52: Hoare triple {12011#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12011#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:01,216 INFO L273 TraceCheckUtils]: 53: Hoare triple {12011#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12012#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:01,217 INFO L273 TraceCheckUtils]: 54: Hoare triple {12012#(<= main_~i~1 16)} assume true; {12012#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:01,217 INFO L273 TraceCheckUtils]: 55: Hoare triple {12012#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12012#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:01,218 INFO L273 TraceCheckUtils]: 56: Hoare triple {12012#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12013#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:01,219 INFO L273 TraceCheckUtils]: 57: Hoare triple {12013#(<= main_~i~1 17)} assume true; {12013#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:01,219 INFO L273 TraceCheckUtils]: 58: Hoare triple {12013#(<= main_~i~1 17)} assume !(~i~1 < 10000); {11995#false} is VALID [2018-11-14 18:55:01,220 INFO L256 TraceCheckUtils]: 59: Hoare triple {11995#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 18:55:01,220 INFO L273 TraceCheckUtils]: 60: Hoare triple {11994#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11994#true} is VALID [2018-11-14 18:55:01,220 INFO L273 TraceCheckUtils]: 61: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,220 INFO L273 TraceCheckUtils]: 62: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,220 INFO L273 TraceCheckUtils]: 63: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,221 INFO L273 TraceCheckUtils]: 64: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,221 INFO L273 TraceCheckUtils]: 65: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,221 INFO L273 TraceCheckUtils]: 66: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,221 INFO L273 TraceCheckUtils]: 67: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,221 INFO L273 TraceCheckUtils]: 68: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,221 INFO L273 TraceCheckUtils]: 69: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,222 INFO L273 TraceCheckUtils]: 70: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,222 INFO L273 TraceCheckUtils]: 71: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,222 INFO L273 TraceCheckUtils]: 72: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,222 INFO L273 TraceCheckUtils]: 73: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,222 INFO L273 TraceCheckUtils]: 74: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,223 INFO L273 TraceCheckUtils]: 75: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,223 INFO L273 TraceCheckUtils]: 76: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,223 INFO L273 TraceCheckUtils]: 77: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,223 INFO L273 TraceCheckUtils]: 78: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,223 INFO L273 TraceCheckUtils]: 79: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,223 INFO L273 TraceCheckUtils]: 80: Hoare triple {11994#true} assume !(~i~0 < 10000); {11994#true} is VALID [2018-11-14 18:55:01,223 INFO L273 TraceCheckUtils]: 81: Hoare triple {11994#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11994#true} is VALID [2018-11-14 18:55:01,224 INFO L273 TraceCheckUtils]: 82: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,224 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {11994#true} {11995#false} #73#return; {11995#false} is VALID [2018-11-14 18:55:01,224 INFO L273 TraceCheckUtils]: 84: Hoare triple {11995#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {11995#false} is VALID [2018-11-14 18:55:01,224 INFO L256 TraceCheckUtils]: 85: Hoare triple {11995#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 18:55:01,224 INFO L273 TraceCheckUtils]: 86: Hoare triple {11994#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11994#true} is VALID [2018-11-14 18:55:01,224 INFO L273 TraceCheckUtils]: 87: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,224 INFO L273 TraceCheckUtils]: 88: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,224 INFO L273 TraceCheckUtils]: 89: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,224 INFO L273 TraceCheckUtils]: 90: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,225 INFO L273 TraceCheckUtils]: 91: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,225 INFO L273 TraceCheckUtils]: 92: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,225 INFO L273 TraceCheckUtils]: 93: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,225 INFO L273 TraceCheckUtils]: 94: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,225 INFO L273 TraceCheckUtils]: 95: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,225 INFO L273 TraceCheckUtils]: 96: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,225 INFO L273 TraceCheckUtils]: 97: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,225 INFO L273 TraceCheckUtils]: 98: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,225 INFO L273 TraceCheckUtils]: 99: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,226 INFO L273 TraceCheckUtils]: 100: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,226 INFO L273 TraceCheckUtils]: 101: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,226 INFO L273 TraceCheckUtils]: 102: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,226 INFO L273 TraceCheckUtils]: 103: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,226 INFO L273 TraceCheckUtils]: 104: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,226 INFO L273 TraceCheckUtils]: 105: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,226 INFO L273 TraceCheckUtils]: 106: Hoare triple {11994#true} assume !(~i~0 < 10000); {11994#true} is VALID [2018-11-14 18:55:01,226 INFO L273 TraceCheckUtils]: 107: Hoare triple {11994#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11994#true} is VALID [2018-11-14 18:55:01,226 INFO L273 TraceCheckUtils]: 108: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,226 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {11994#true} {11995#false} #75#return; {11995#false} is VALID [2018-11-14 18:55:01,227 INFO L273 TraceCheckUtils]: 110: Hoare triple {11995#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11995#false} is VALID [2018-11-14 18:55:01,227 INFO L273 TraceCheckUtils]: 111: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:01,227 INFO L273 TraceCheckUtils]: 112: Hoare triple {11995#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:55:01,227 INFO L273 TraceCheckUtils]: 113: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:55:01,227 INFO L273 TraceCheckUtils]: 114: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:01,227 INFO L273 TraceCheckUtils]: 115: Hoare triple {11995#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:55:01,227 INFO L273 TraceCheckUtils]: 116: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:55:01,227 INFO L273 TraceCheckUtils]: 117: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:01,227 INFO L273 TraceCheckUtils]: 118: Hoare triple {11995#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:55:01,228 INFO L273 TraceCheckUtils]: 119: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:55:01,228 INFO L273 TraceCheckUtils]: 120: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:01,228 INFO L273 TraceCheckUtils]: 121: Hoare triple {11995#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:55:01,228 INFO L273 TraceCheckUtils]: 122: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:55:01,228 INFO L273 TraceCheckUtils]: 123: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:01,228 INFO L273 TraceCheckUtils]: 124: Hoare triple {11995#false} assume !(~i~2 < 9999); {11995#false} is VALID [2018-11-14 18:55:01,228 INFO L273 TraceCheckUtils]: 125: Hoare triple {11995#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {11995#false} is VALID [2018-11-14 18:55:01,228 INFO L256 TraceCheckUtils]: 126: Hoare triple {11995#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 18:55:01,228 INFO L273 TraceCheckUtils]: 127: Hoare triple {11994#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11994#true} is VALID [2018-11-14 18:55:01,229 INFO L273 TraceCheckUtils]: 128: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,229 INFO L273 TraceCheckUtils]: 129: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,229 INFO L273 TraceCheckUtils]: 130: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,229 INFO L273 TraceCheckUtils]: 131: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,229 INFO L273 TraceCheckUtils]: 132: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,229 INFO L273 TraceCheckUtils]: 133: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,229 INFO L273 TraceCheckUtils]: 134: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,229 INFO L273 TraceCheckUtils]: 135: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,229 INFO L273 TraceCheckUtils]: 136: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,229 INFO L273 TraceCheckUtils]: 137: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,230 INFO L273 TraceCheckUtils]: 138: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,230 INFO L273 TraceCheckUtils]: 139: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,230 INFO L273 TraceCheckUtils]: 140: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,230 INFO L273 TraceCheckUtils]: 141: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,230 INFO L273 TraceCheckUtils]: 142: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,230 INFO L273 TraceCheckUtils]: 143: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,230 INFO L273 TraceCheckUtils]: 144: Hoare triple {11994#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:55:01,230 INFO L273 TraceCheckUtils]: 145: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:55:01,230 INFO L273 TraceCheckUtils]: 146: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,231 INFO L273 TraceCheckUtils]: 147: Hoare triple {11994#true} assume !(~i~0 < 10000); {11994#true} is VALID [2018-11-14 18:55:01,231 INFO L273 TraceCheckUtils]: 148: Hoare triple {11994#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11994#true} is VALID [2018-11-14 18:55:01,231 INFO L273 TraceCheckUtils]: 149: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:01,231 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {11994#true} {11995#false} #77#return; {11995#false} is VALID [2018-11-14 18:55:01,231 INFO L273 TraceCheckUtils]: 151: Hoare triple {11995#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11995#false} is VALID [2018-11-14 18:55:01,231 INFO L273 TraceCheckUtils]: 152: Hoare triple {11995#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11995#false} is VALID [2018-11-14 18:55:01,231 INFO L273 TraceCheckUtils]: 153: Hoare triple {11995#false} assume !false; {11995#false} is VALID [2018-11-14 18:55:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2018-11-14 18:55:01,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:55:01,245 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-14 18:55:01,256 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:55:01,933 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-14 18:55:01,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:55:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:01,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:55:02,191 INFO L256 TraceCheckUtils]: 0: Hoare triple {11994#true} call ULTIMATE.init(); {11994#true} is VALID [2018-11-14 18:55:02,191 INFO L273 TraceCheckUtils]: 1: Hoare triple {11994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11994#true} is VALID [2018-11-14 18:55:02,191 INFO L273 TraceCheckUtils]: 2: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11994#true} {11994#true} #69#return; {11994#true} is VALID [2018-11-14 18:55:02,192 INFO L256 TraceCheckUtils]: 4: Hoare triple {11994#true} call #t~ret13 := main(); {11994#true} is VALID [2018-11-14 18:55:02,192 INFO L273 TraceCheckUtils]: 5: Hoare triple {11994#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11994#true} is VALID [2018-11-14 18:55:02,192 INFO L273 TraceCheckUtils]: 6: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,192 INFO L273 TraceCheckUtils]: 8: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,193 INFO L273 TraceCheckUtils]: 9: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,193 INFO L273 TraceCheckUtils]: 10: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,193 INFO L273 TraceCheckUtils]: 11: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,193 INFO L273 TraceCheckUtils]: 12: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,193 INFO L273 TraceCheckUtils]: 13: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,194 INFO L273 TraceCheckUtils]: 14: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,194 INFO L273 TraceCheckUtils]: 15: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,194 INFO L273 TraceCheckUtils]: 16: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,194 INFO L273 TraceCheckUtils]: 17: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,194 INFO L273 TraceCheckUtils]: 18: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,194 INFO L273 TraceCheckUtils]: 19: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,195 INFO L273 TraceCheckUtils]: 21: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,195 INFO L273 TraceCheckUtils]: 22: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,195 INFO L273 TraceCheckUtils]: 23: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,195 INFO L273 TraceCheckUtils]: 24: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,195 INFO L273 TraceCheckUtils]: 25: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,196 INFO L273 TraceCheckUtils]: 26: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,196 INFO L273 TraceCheckUtils]: 27: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,196 INFO L273 TraceCheckUtils]: 28: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,196 INFO L273 TraceCheckUtils]: 29: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,196 INFO L273 TraceCheckUtils]: 30: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,196 INFO L273 TraceCheckUtils]: 31: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,197 INFO L273 TraceCheckUtils]: 32: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,197 INFO L273 TraceCheckUtils]: 33: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,197 INFO L273 TraceCheckUtils]: 34: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,197 INFO L273 TraceCheckUtils]: 35: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,197 INFO L273 TraceCheckUtils]: 36: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,197 INFO L273 TraceCheckUtils]: 37: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,198 INFO L273 TraceCheckUtils]: 38: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,198 INFO L273 TraceCheckUtils]: 39: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,198 INFO L273 TraceCheckUtils]: 40: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,198 INFO L273 TraceCheckUtils]: 41: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,198 INFO L273 TraceCheckUtils]: 42: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,198 INFO L273 TraceCheckUtils]: 43: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,199 INFO L273 TraceCheckUtils]: 44: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,199 INFO L273 TraceCheckUtils]: 45: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,199 INFO L273 TraceCheckUtils]: 46: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,199 INFO L273 TraceCheckUtils]: 47: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,199 INFO L273 TraceCheckUtils]: 48: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,199 INFO L273 TraceCheckUtils]: 49: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,200 INFO L273 TraceCheckUtils]: 50: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,200 INFO L273 TraceCheckUtils]: 51: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,200 INFO L273 TraceCheckUtils]: 52: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,200 INFO L273 TraceCheckUtils]: 53: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,200 INFO L273 TraceCheckUtils]: 54: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,200 INFO L273 TraceCheckUtils]: 55: Hoare triple {11994#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:55:02,200 INFO L273 TraceCheckUtils]: 56: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:55:02,201 INFO L273 TraceCheckUtils]: 57: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:55:02,201 INFO L273 TraceCheckUtils]: 58: Hoare triple {11994#true} assume !(~i~1 < 10000); {11994#true} is VALID [2018-11-14 18:55:02,201 INFO L256 TraceCheckUtils]: 59: Hoare triple {11994#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 18:55:02,216 INFO L273 TraceCheckUtils]: 60: Hoare triple {11994#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12197#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:55:02,225 INFO L273 TraceCheckUtils]: 61: Hoare triple {12197#(<= bAnd_~i~0 1)} assume true; {12197#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:55:02,238 INFO L273 TraceCheckUtils]: 62: Hoare triple {12197#(<= bAnd_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12197#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:55:02,240 INFO L273 TraceCheckUtils]: 63: Hoare triple {12197#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12207#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:55:02,242 INFO L273 TraceCheckUtils]: 64: Hoare triple {12207#(<= bAnd_~i~0 2)} assume true; {12207#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:55:02,242 INFO L273 TraceCheckUtils]: 65: Hoare triple {12207#(<= bAnd_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12207#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:55:02,244 INFO L273 TraceCheckUtils]: 66: Hoare triple {12207#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12217#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:55:02,244 INFO L273 TraceCheckUtils]: 67: Hoare triple {12217#(<= bAnd_~i~0 3)} assume true; {12217#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:55:02,244 INFO L273 TraceCheckUtils]: 68: Hoare triple {12217#(<= bAnd_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12217#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:55:02,245 INFO L273 TraceCheckUtils]: 69: Hoare triple {12217#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12227#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:55:02,245 INFO L273 TraceCheckUtils]: 70: Hoare triple {12227#(<= bAnd_~i~0 4)} assume true; {12227#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:55:02,245 INFO L273 TraceCheckUtils]: 71: Hoare triple {12227#(<= bAnd_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12227#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:55:02,246 INFO L273 TraceCheckUtils]: 72: Hoare triple {12227#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12237#(<= bAnd_~i~0 5)} is VALID [2018-11-14 18:55:02,246 INFO L273 TraceCheckUtils]: 73: Hoare triple {12237#(<= bAnd_~i~0 5)} assume true; {12237#(<= bAnd_~i~0 5)} is VALID [2018-11-14 18:55:02,251 INFO L273 TraceCheckUtils]: 74: Hoare triple {12237#(<= bAnd_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12237#(<= bAnd_~i~0 5)} is VALID [2018-11-14 18:55:02,251 INFO L273 TraceCheckUtils]: 75: Hoare triple {12237#(<= bAnd_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12247#(<= bAnd_~i~0 6)} is VALID [2018-11-14 18:55:02,252 INFO L273 TraceCheckUtils]: 76: Hoare triple {12247#(<= bAnd_~i~0 6)} assume true; {12247#(<= bAnd_~i~0 6)} is VALID [2018-11-14 18:55:02,252 INFO L273 TraceCheckUtils]: 77: Hoare triple {12247#(<= bAnd_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12247#(<= bAnd_~i~0 6)} is VALID [2018-11-14 18:55:02,252 INFO L273 TraceCheckUtils]: 78: Hoare triple {12247#(<= bAnd_~i~0 6)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12257#(<= bAnd_~i~0 7)} is VALID [2018-11-14 18:55:02,253 INFO L273 TraceCheckUtils]: 79: Hoare triple {12257#(<= bAnd_~i~0 7)} assume true; {12257#(<= bAnd_~i~0 7)} is VALID [2018-11-14 18:55:02,253 INFO L273 TraceCheckUtils]: 80: Hoare triple {12257#(<= bAnd_~i~0 7)} assume !(~i~0 < 10000); {11995#false} is VALID [2018-11-14 18:55:02,253 INFO L273 TraceCheckUtils]: 81: Hoare triple {11995#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11995#false} is VALID [2018-11-14 18:55:02,253 INFO L273 TraceCheckUtils]: 82: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,254 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {11995#false} {11994#true} #73#return; {11995#false} is VALID [2018-11-14 18:55:02,254 INFO L273 TraceCheckUtils]: 84: Hoare triple {11995#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {11995#false} is VALID [2018-11-14 18:55:02,254 INFO L256 TraceCheckUtils]: 85: Hoare triple {11995#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {11995#false} is VALID [2018-11-14 18:55:02,254 INFO L273 TraceCheckUtils]: 86: Hoare triple {11995#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11995#false} is VALID [2018-11-14 18:55:02,254 INFO L273 TraceCheckUtils]: 87: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,255 INFO L273 TraceCheckUtils]: 88: Hoare triple {11995#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:55:02,255 INFO L273 TraceCheckUtils]: 89: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:55:02,255 INFO L273 TraceCheckUtils]: 90: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,255 INFO L273 TraceCheckUtils]: 91: Hoare triple {11995#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:55:02,255 INFO L273 TraceCheckUtils]: 92: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:55:02,255 INFO L273 TraceCheckUtils]: 93: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,256 INFO L273 TraceCheckUtils]: 94: Hoare triple {11995#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:55:02,256 INFO L273 TraceCheckUtils]: 95: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:55:02,256 INFO L273 TraceCheckUtils]: 96: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,256 INFO L273 TraceCheckUtils]: 97: Hoare triple {11995#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:55:02,256 INFO L273 TraceCheckUtils]: 98: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:55:02,257 INFO L273 TraceCheckUtils]: 99: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,257 INFO L273 TraceCheckUtils]: 100: Hoare triple {11995#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:55:02,257 INFO L273 TraceCheckUtils]: 101: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:55:02,257 INFO L273 TraceCheckUtils]: 102: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,257 INFO L273 TraceCheckUtils]: 103: Hoare triple {11995#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:55:02,257 INFO L273 TraceCheckUtils]: 104: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:55:02,257 INFO L273 TraceCheckUtils]: 105: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,258 INFO L273 TraceCheckUtils]: 106: Hoare triple {11995#false} assume !(~i~0 < 10000); {11995#false} is VALID [2018-11-14 18:55:02,258 INFO L273 TraceCheckUtils]: 107: Hoare triple {11995#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11995#false} is VALID [2018-11-14 18:55:02,258 INFO L273 TraceCheckUtils]: 108: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,258 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {11995#false} {11995#false} #75#return; {11995#false} is VALID [2018-11-14 18:55:02,258 INFO L273 TraceCheckUtils]: 110: Hoare triple {11995#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11995#false} is VALID [2018-11-14 18:55:02,258 INFO L273 TraceCheckUtils]: 111: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,258 INFO L273 TraceCheckUtils]: 112: Hoare triple {11995#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:55:02,258 INFO L273 TraceCheckUtils]: 113: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:55:02,258 INFO L273 TraceCheckUtils]: 114: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,259 INFO L273 TraceCheckUtils]: 115: Hoare triple {11995#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:55:02,259 INFO L273 TraceCheckUtils]: 116: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:55:02,259 INFO L273 TraceCheckUtils]: 117: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,259 INFO L273 TraceCheckUtils]: 118: Hoare triple {11995#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:55:02,259 INFO L273 TraceCheckUtils]: 119: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:55:02,259 INFO L273 TraceCheckUtils]: 120: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,259 INFO L273 TraceCheckUtils]: 121: Hoare triple {11995#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:55:02,259 INFO L273 TraceCheckUtils]: 122: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:55:02,259 INFO L273 TraceCheckUtils]: 123: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,259 INFO L273 TraceCheckUtils]: 124: Hoare triple {11995#false} assume !(~i~2 < 9999); {11995#false} is VALID [2018-11-14 18:55:02,260 INFO L273 TraceCheckUtils]: 125: Hoare triple {11995#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {11995#false} is VALID [2018-11-14 18:55:02,260 INFO L256 TraceCheckUtils]: 126: Hoare triple {11995#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {11995#false} is VALID [2018-11-14 18:55:02,260 INFO L273 TraceCheckUtils]: 127: Hoare triple {11995#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11995#false} is VALID [2018-11-14 18:55:02,260 INFO L273 TraceCheckUtils]: 128: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,260 INFO L273 TraceCheckUtils]: 129: Hoare triple {11995#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:55:02,260 INFO L273 TraceCheckUtils]: 130: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:55:02,260 INFO L273 TraceCheckUtils]: 131: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,260 INFO L273 TraceCheckUtils]: 132: Hoare triple {11995#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:55:02,260 INFO L273 TraceCheckUtils]: 133: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:55:02,261 INFO L273 TraceCheckUtils]: 134: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,261 INFO L273 TraceCheckUtils]: 135: Hoare triple {11995#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:55:02,261 INFO L273 TraceCheckUtils]: 136: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:55:02,261 INFO L273 TraceCheckUtils]: 137: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,261 INFO L273 TraceCheckUtils]: 138: Hoare triple {11995#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:55:02,261 INFO L273 TraceCheckUtils]: 139: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:55:02,261 INFO L273 TraceCheckUtils]: 140: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,261 INFO L273 TraceCheckUtils]: 141: Hoare triple {11995#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:55:02,261 INFO L273 TraceCheckUtils]: 142: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:55:02,262 INFO L273 TraceCheckUtils]: 143: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,262 INFO L273 TraceCheckUtils]: 144: Hoare triple {11995#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:55:02,262 INFO L273 TraceCheckUtils]: 145: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:55:02,262 INFO L273 TraceCheckUtils]: 146: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,262 INFO L273 TraceCheckUtils]: 147: Hoare triple {11995#false} assume !(~i~0 < 10000); {11995#false} is VALID [2018-11-14 18:55:02,262 INFO L273 TraceCheckUtils]: 148: Hoare triple {11995#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11995#false} is VALID [2018-11-14 18:55:02,262 INFO L273 TraceCheckUtils]: 149: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:55:02,262 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {11995#false} {11995#false} #77#return; {11995#false} is VALID [2018-11-14 18:55:02,262 INFO L273 TraceCheckUtils]: 151: Hoare triple {11995#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11995#false} is VALID [2018-11-14 18:55:02,262 INFO L273 TraceCheckUtils]: 152: Hoare triple {11995#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11995#false} is VALID [2018-11-14 18:55:02,263 INFO L273 TraceCheckUtils]: 153: Hoare triple {11995#false} assume !false; {11995#false} is VALID [2018-11-14 18:55:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 270 proven. 57 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2018-11-14 18:55:02,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:55:02,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-14 18:55:02,295 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2018-11-14 18:55:02,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:55:02,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 18:55:02,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:02,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 18:55:02,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 18:55:02,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-14 18:55:02,408 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 27 states. [2018-11-14 18:55:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:03,237 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2018-11-14 18:55:03,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 18:55:03,237 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2018-11-14 18:55:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:55:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:55:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2018-11-14 18:55:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:55:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2018-11-14 18:55:03,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 136 transitions. [2018-11-14 18:55:03,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:03,421 INFO L225 Difference]: With dead ends: 163 [2018-11-14 18:55:03,422 INFO L226 Difference]: Without dead ends: 115 [2018-11-14 18:55:03,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-14 18:55:03,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-14 18:55:03,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-11-14 18:55:03,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:55:03,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 113 states. [2018-11-14 18:55:03,466 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 113 states. [2018-11-14 18:55:03,466 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 113 states. [2018-11-14 18:55:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:03,468 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-14 18:55:03,468 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-14 18:55:03,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:03,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:03,468 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 115 states. [2018-11-14 18:55:03,469 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 115 states. [2018-11-14 18:55:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:03,471 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-14 18:55:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-14 18:55:03,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:03,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:03,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:55:03,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:55:03,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-14 18:55:03,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-11-14 18:55:03,474 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 154 [2018-11-14 18:55:03,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:55:03,475 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-11-14 18:55:03,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 18:55:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-14 18:55:03,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-14 18:55:03,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:55:03,476 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 19, 18, 18, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:55:03,476 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:55:03,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:55:03,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1920636699, now seen corresponding path program 18 times [2018-11-14 18:55:03,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:55:03,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:55:03,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:03,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:55:03,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:03,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {13084#true} call ULTIMATE.init(); {13084#true} is VALID [2018-11-14 18:55:03,981 INFO L273 TraceCheckUtils]: 1: Hoare triple {13084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13084#true} is VALID [2018-11-14 18:55:03,981 INFO L273 TraceCheckUtils]: 2: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:03,981 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13084#true} {13084#true} #69#return; {13084#true} is VALID [2018-11-14 18:55:03,982 INFO L256 TraceCheckUtils]: 4: Hoare triple {13084#true} call #t~ret13 := main(); {13084#true} is VALID [2018-11-14 18:55:03,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {13084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13086#(= main_~i~1 0)} is VALID [2018-11-14 18:55:03,983 INFO L273 TraceCheckUtils]: 6: Hoare triple {13086#(= main_~i~1 0)} assume true; {13086#(= main_~i~1 0)} is VALID [2018-11-14 18:55:03,983 INFO L273 TraceCheckUtils]: 7: Hoare triple {13086#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13086#(= main_~i~1 0)} is VALID [2018-11-14 18:55:03,984 INFO L273 TraceCheckUtils]: 8: Hoare triple {13086#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13087#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:03,984 INFO L273 TraceCheckUtils]: 9: Hoare triple {13087#(<= main_~i~1 1)} assume true; {13087#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:03,985 INFO L273 TraceCheckUtils]: 10: Hoare triple {13087#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13087#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:03,986 INFO L273 TraceCheckUtils]: 11: Hoare triple {13087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13088#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:03,986 INFO L273 TraceCheckUtils]: 12: Hoare triple {13088#(<= main_~i~1 2)} assume true; {13088#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:03,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {13088#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13088#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:03,987 INFO L273 TraceCheckUtils]: 14: Hoare triple {13088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13089#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:03,988 INFO L273 TraceCheckUtils]: 15: Hoare triple {13089#(<= main_~i~1 3)} assume true; {13089#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:03,988 INFO L273 TraceCheckUtils]: 16: Hoare triple {13089#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13089#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:03,989 INFO L273 TraceCheckUtils]: 17: Hoare triple {13089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13090#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:03,990 INFO L273 TraceCheckUtils]: 18: Hoare triple {13090#(<= main_~i~1 4)} assume true; {13090#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:03,990 INFO L273 TraceCheckUtils]: 19: Hoare triple {13090#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13090#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:03,991 INFO L273 TraceCheckUtils]: 20: Hoare triple {13090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13091#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:03,991 INFO L273 TraceCheckUtils]: 21: Hoare triple {13091#(<= main_~i~1 5)} assume true; {13091#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:03,992 INFO L273 TraceCheckUtils]: 22: Hoare triple {13091#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13091#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:03,993 INFO L273 TraceCheckUtils]: 23: Hoare triple {13091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13092#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:03,993 INFO L273 TraceCheckUtils]: 24: Hoare triple {13092#(<= main_~i~1 6)} assume true; {13092#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:03,994 INFO L273 TraceCheckUtils]: 25: Hoare triple {13092#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13092#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:03,994 INFO L273 TraceCheckUtils]: 26: Hoare triple {13092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13093#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:03,995 INFO L273 TraceCheckUtils]: 27: Hoare triple {13093#(<= main_~i~1 7)} assume true; {13093#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:03,995 INFO L273 TraceCheckUtils]: 28: Hoare triple {13093#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13093#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:03,996 INFO L273 TraceCheckUtils]: 29: Hoare triple {13093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13094#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:03,997 INFO L273 TraceCheckUtils]: 30: Hoare triple {13094#(<= main_~i~1 8)} assume true; {13094#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:03,997 INFO L273 TraceCheckUtils]: 31: Hoare triple {13094#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13094#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:03,998 INFO L273 TraceCheckUtils]: 32: Hoare triple {13094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13095#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:03,998 INFO L273 TraceCheckUtils]: 33: Hoare triple {13095#(<= main_~i~1 9)} assume true; {13095#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:03,999 INFO L273 TraceCheckUtils]: 34: Hoare triple {13095#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13095#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:04,000 INFO L273 TraceCheckUtils]: 35: Hoare triple {13095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13096#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:04,000 INFO L273 TraceCheckUtils]: 36: Hoare triple {13096#(<= main_~i~1 10)} assume true; {13096#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:04,001 INFO L273 TraceCheckUtils]: 37: Hoare triple {13096#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13096#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:04,001 INFO L273 TraceCheckUtils]: 38: Hoare triple {13096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13097#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:04,002 INFO L273 TraceCheckUtils]: 39: Hoare triple {13097#(<= main_~i~1 11)} assume true; {13097#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:04,002 INFO L273 TraceCheckUtils]: 40: Hoare triple {13097#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13097#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:04,003 INFO L273 TraceCheckUtils]: 41: Hoare triple {13097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13098#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:04,004 INFO L273 TraceCheckUtils]: 42: Hoare triple {13098#(<= main_~i~1 12)} assume true; {13098#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:04,007 INFO L273 TraceCheckUtils]: 43: Hoare triple {13098#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13098#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:04,008 INFO L273 TraceCheckUtils]: 44: Hoare triple {13098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13099#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:04,008 INFO L273 TraceCheckUtils]: 45: Hoare triple {13099#(<= main_~i~1 13)} assume true; {13099#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:04,008 INFO L273 TraceCheckUtils]: 46: Hoare triple {13099#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13099#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:04,009 INFO L273 TraceCheckUtils]: 47: Hoare triple {13099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13100#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:04,009 INFO L273 TraceCheckUtils]: 48: Hoare triple {13100#(<= main_~i~1 14)} assume true; {13100#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:04,009 INFO L273 TraceCheckUtils]: 49: Hoare triple {13100#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13100#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:04,010 INFO L273 TraceCheckUtils]: 50: Hoare triple {13100#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13101#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:04,010 INFO L273 TraceCheckUtils]: 51: Hoare triple {13101#(<= main_~i~1 15)} assume true; {13101#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:04,010 INFO L273 TraceCheckUtils]: 52: Hoare triple {13101#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13101#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:04,011 INFO L273 TraceCheckUtils]: 53: Hoare triple {13101#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13102#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:04,011 INFO L273 TraceCheckUtils]: 54: Hoare triple {13102#(<= main_~i~1 16)} assume true; {13102#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:04,012 INFO L273 TraceCheckUtils]: 55: Hoare triple {13102#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13102#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:04,013 INFO L273 TraceCheckUtils]: 56: Hoare triple {13102#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13103#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:04,013 INFO L273 TraceCheckUtils]: 57: Hoare triple {13103#(<= main_~i~1 17)} assume true; {13103#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:04,014 INFO L273 TraceCheckUtils]: 58: Hoare triple {13103#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13103#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:04,014 INFO L273 TraceCheckUtils]: 59: Hoare triple {13103#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13104#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:04,015 INFO L273 TraceCheckUtils]: 60: Hoare triple {13104#(<= main_~i~1 18)} assume true; {13104#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:04,016 INFO L273 TraceCheckUtils]: 61: Hoare triple {13104#(<= main_~i~1 18)} assume !(~i~1 < 10000); {13085#false} is VALID [2018-11-14 18:55:04,016 INFO L256 TraceCheckUtils]: 62: Hoare triple {13085#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 18:55:04,016 INFO L273 TraceCheckUtils]: 63: Hoare triple {13084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 18:55:04,016 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,016 INFO L273 TraceCheckUtils]: 65: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,017 INFO L273 TraceCheckUtils]: 66: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,017 INFO L273 TraceCheckUtils]: 67: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,017 INFO L273 TraceCheckUtils]: 68: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,017 INFO L273 TraceCheckUtils]: 69: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,017 INFO L273 TraceCheckUtils]: 70: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,017 INFO L273 TraceCheckUtils]: 71: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,018 INFO L273 TraceCheckUtils]: 72: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,018 INFO L273 TraceCheckUtils]: 73: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,018 INFO L273 TraceCheckUtils]: 74: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,018 INFO L273 TraceCheckUtils]: 75: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,018 INFO L273 TraceCheckUtils]: 76: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,019 INFO L273 TraceCheckUtils]: 77: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,019 INFO L273 TraceCheckUtils]: 78: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,019 INFO L273 TraceCheckUtils]: 79: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,019 INFO L273 TraceCheckUtils]: 80: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,019 INFO L273 TraceCheckUtils]: 81: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,020 INFO L273 TraceCheckUtils]: 82: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,020 INFO L273 TraceCheckUtils]: 83: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,020 INFO L273 TraceCheckUtils]: 84: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,020 INFO L273 TraceCheckUtils]: 85: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,020 INFO L273 TraceCheckUtils]: 86: Hoare triple {13084#true} assume !(~i~0 < 10000); {13084#true} is VALID [2018-11-14 18:55:04,020 INFO L273 TraceCheckUtils]: 87: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 18:55:04,021 INFO L273 TraceCheckUtils]: 88: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,021 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {13084#true} {13085#false} #73#return; {13085#false} is VALID [2018-11-14 18:55:04,021 INFO L273 TraceCheckUtils]: 90: Hoare triple {13085#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {13085#false} is VALID [2018-11-14 18:55:04,021 INFO L256 TraceCheckUtils]: 91: Hoare triple {13085#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 18:55:04,021 INFO L273 TraceCheckUtils]: 92: Hoare triple {13084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 18:55:04,021 INFO L273 TraceCheckUtils]: 93: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,021 INFO L273 TraceCheckUtils]: 94: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,021 INFO L273 TraceCheckUtils]: 95: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,021 INFO L273 TraceCheckUtils]: 96: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,022 INFO L273 TraceCheckUtils]: 97: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,022 INFO L273 TraceCheckUtils]: 98: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,022 INFO L273 TraceCheckUtils]: 99: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,022 INFO L273 TraceCheckUtils]: 100: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,022 INFO L273 TraceCheckUtils]: 101: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,022 INFO L273 TraceCheckUtils]: 102: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,022 INFO L273 TraceCheckUtils]: 103: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,022 INFO L273 TraceCheckUtils]: 104: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,022 INFO L273 TraceCheckUtils]: 105: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,022 INFO L273 TraceCheckUtils]: 106: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,023 INFO L273 TraceCheckUtils]: 107: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,023 INFO L273 TraceCheckUtils]: 108: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,023 INFO L273 TraceCheckUtils]: 109: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,023 INFO L273 TraceCheckUtils]: 110: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,023 INFO L273 TraceCheckUtils]: 111: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,023 INFO L273 TraceCheckUtils]: 112: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,023 INFO L273 TraceCheckUtils]: 113: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,023 INFO L273 TraceCheckUtils]: 114: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,023 INFO L273 TraceCheckUtils]: 115: Hoare triple {13084#true} assume !(~i~0 < 10000); {13084#true} is VALID [2018-11-14 18:55:04,024 INFO L273 TraceCheckUtils]: 116: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 18:55:04,024 INFO L273 TraceCheckUtils]: 117: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,024 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {13084#true} {13085#false} #75#return; {13085#false} is VALID [2018-11-14 18:55:04,024 INFO L273 TraceCheckUtils]: 119: Hoare triple {13085#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13085#false} is VALID [2018-11-14 18:55:04,024 INFO L273 TraceCheckUtils]: 120: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:55:04,024 INFO L273 TraceCheckUtils]: 121: Hoare triple {13085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 18:55:04,024 INFO L273 TraceCheckUtils]: 122: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 18:55:04,024 INFO L273 TraceCheckUtils]: 123: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:55:04,024 INFO L273 TraceCheckUtils]: 124: Hoare triple {13085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 18:55:04,024 INFO L273 TraceCheckUtils]: 125: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 18:55:04,025 INFO L273 TraceCheckUtils]: 126: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:55:04,025 INFO L273 TraceCheckUtils]: 127: Hoare triple {13085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 18:55:04,025 INFO L273 TraceCheckUtils]: 128: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 18:55:04,025 INFO L273 TraceCheckUtils]: 129: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:55:04,025 INFO L273 TraceCheckUtils]: 130: Hoare triple {13085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 18:55:04,025 INFO L273 TraceCheckUtils]: 131: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 18:55:04,025 INFO L273 TraceCheckUtils]: 132: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:55:04,025 INFO L273 TraceCheckUtils]: 133: Hoare triple {13085#false} assume !(~i~2 < 9999); {13085#false} is VALID [2018-11-14 18:55:04,026 INFO L273 TraceCheckUtils]: 134: Hoare triple {13085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {13085#false} is VALID [2018-11-14 18:55:04,026 INFO L256 TraceCheckUtils]: 135: Hoare triple {13085#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 18:55:04,026 INFO L273 TraceCheckUtils]: 136: Hoare triple {13084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 18:55:04,026 INFO L273 TraceCheckUtils]: 137: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,026 INFO L273 TraceCheckUtils]: 138: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,026 INFO L273 TraceCheckUtils]: 139: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,027 INFO L273 TraceCheckUtils]: 140: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,027 INFO L273 TraceCheckUtils]: 141: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,027 INFO L273 TraceCheckUtils]: 142: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,027 INFO L273 TraceCheckUtils]: 143: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,027 INFO L273 TraceCheckUtils]: 144: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,027 INFO L273 TraceCheckUtils]: 145: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,027 INFO L273 TraceCheckUtils]: 146: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,028 INFO L273 TraceCheckUtils]: 147: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,028 INFO L273 TraceCheckUtils]: 148: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,028 INFO L273 TraceCheckUtils]: 149: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,028 INFO L273 TraceCheckUtils]: 150: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,028 INFO L273 TraceCheckUtils]: 151: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,028 INFO L273 TraceCheckUtils]: 152: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,029 INFO L273 TraceCheckUtils]: 153: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,029 INFO L273 TraceCheckUtils]: 154: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,029 INFO L273 TraceCheckUtils]: 155: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,029 INFO L273 TraceCheckUtils]: 156: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,029 INFO L273 TraceCheckUtils]: 157: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,029 INFO L273 TraceCheckUtils]: 158: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,030 INFO L273 TraceCheckUtils]: 159: Hoare triple {13084#true} assume !(~i~0 < 10000); {13084#true} is VALID [2018-11-14 18:55:04,030 INFO L273 TraceCheckUtils]: 160: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 18:55:04,030 INFO L273 TraceCheckUtils]: 161: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,030 INFO L268 TraceCheckUtils]: 162: Hoare quadruple {13084#true} {13085#false} #77#return; {13085#false} is VALID [2018-11-14 18:55:04,030 INFO L273 TraceCheckUtils]: 163: Hoare triple {13085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13085#false} is VALID [2018-11-14 18:55:04,030 INFO L273 TraceCheckUtils]: 164: Hoare triple {13085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13085#false} is VALID [2018-11-14 18:55:04,030 INFO L273 TraceCheckUtils]: 165: Hoare triple {13085#false} assume !false; {13085#false} is VALID [2018-11-14 18:55:04,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-11-14 18:55:04,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:55:04,044 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-14 18:55:04,053 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:55:04,386 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-14 18:55:04,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:55:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:04,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:55:04,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {13084#true} call ULTIMATE.init(); {13084#true} is VALID [2018-11-14 18:55:04,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {13084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13084#true} is VALID [2018-11-14 18:55:04,662 INFO L273 TraceCheckUtils]: 2: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,662 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13084#true} {13084#true} #69#return; {13084#true} is VALID [2018-11-14 18:55:04,663 INFO L256 TraceCheckUtils]: 4: Hoare triple {13084#true} call #t~ret13 := main(); {13084#true} is VALID [2018-11-14 18:55:04,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {13084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13084#true} is VALID [2018-11-14 18:55:04,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,664 INFO L273 TraceCheckUtils]: 10: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,664 INFO L273 TraceCheckUtils]: 11: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,664 INFO L273 TraceCheckUtils]: 12: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,664 INFO L273 TraceCheckUtils]: 13: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,665 INFO L273 TraceCheckUtils]: 16: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,665 INFO L273 TraceCheckUtils]: 17: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,665 INFO L273 TraceCheckUtils]: 20: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,665 INFO L273 TraceCheckUtils]: 22: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,666 INFO L273 TraceCheckUtils]: 23: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,666 INFO L273 TraceCheckUtils]: 24: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,666 INFO L273 TraceCheckUtils]: 28: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,666 INFO L273 TraceCheckUtils]: 29: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,666 INFO L273 TraceCheckUtils]: 30: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,667 INFO L273 TraceCheckUtils]: 31: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,667 INFO L273 TraceCheckUtils]: 32: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,667 INFO L273 TraceCheckUtils]: 33: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,667 INFO L273 TraceCheckUtils]: 34: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,667 INFO L273 TraceCheckUtils]: 35: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,667 INFO L273 TraceCheckUtils]: 36: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,667 INFO L273 TraceCheckUtils]: 37: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,667 INFO L273 TraceCheckUtils]: 38: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,668 INFO L273 TraceCheckUtils]: 39: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,668 INFO L273 TraceCheckUtils]: 40: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,668 INFO L273 TraceCheckUtils]: 41: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,668 INFO L273 TraceCheckUtils]: 42: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,668 INFO L273 TraceCheckUtils]: 43: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,668 INFO L273 TraceCheckUtils]: 44: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,669 INFO L273 TraceCheckUtils]: 45: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,669 INFO L273 TraceCheckUtils]: 46: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,669 INFO L273 TraceCheckUtils]: 47: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,669 INFO L273 TraceCheckUtils]: 48: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,669 INFO L273 TraceCheckUtils]: 49: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,669 INFO L273 TraceCheckUtils]: 50: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,669 INFO L273 TraceCheckUtils]: 51: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,670 INFO L273 TraceCheckUtils]: 52: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,670 INFO L273 TraceCheckUtils]: 53: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,670 INFO L273 TraceCheckUtils]: 54: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,670 INFO L273 TraceCheckUtils]: 55: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:55:04,670 INFO L273 TraceCheckUtils]: 56: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:55:04,670 INFO L273 TraceCheckUtils]: 57: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,671 INFO L273 TraceCheckUtils]: 58: Hoare triple {13084#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13282#(< main_~i~1 10000)} is VALID [2018-11-14 18:55:04,671 INFO L273 TraceCheckUtils]: 59: Hoare triple {13282#(< main_~i~1 10000)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13286#(<= main_~i~1 10000)} is VALID [2018-11-14 18:55:04,672 INFO L273 TraceCheckUtils]: 60: Hoare triple {13286#(<= main_~i~1 10000)} assume true; {13286#(<= main_~i~1 10000)} is VALID [2018-11-14 18:55:04,672 INFO L273 TraceCheckUtils]: 61: Hoare triple {13286#(<= main_~i~1 10000)} assume !(~i~1 < 10000); {13084#true} is VALID [2018-11-14 18:55:04,672 INFO L256 TraceCheckUtils]: 62: Hoare triple {13084#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 18:55:04,672 INFO L273 TraceCheckUtils]: 63: Hoare triple {13084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 18:55:04,672 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,672 INFO L273 TraceCheckUtils]: 65: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,672 INFO L273 TraceCheckUtils]: 66: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,672 INFO L273 TraceCheckUtils]: 67: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,673 INFO L273 TraceCheckUtils]: 68: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,673 INFO L273 TraceCheckUtils]: 69: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,673 INFO L273 TraceCheckUtils]: 70: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,673 INFO L273 TraceCheckUtils]: 71: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,673 INFO L273 TraceCheckUtils]: 72: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,673 INFO L273 TraceCheckUtils]: 73: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,673 INFO L273 TraceCheckUtils]: 74: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,673 INFO L273 TraceCheckUtils]: 75: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,673 INFO L273 TraceCheckUtils]: 76: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,674 INFO L273 TraceCheckUtils]: 77: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,674 INFO L273 TraceCheckUtils]: 78: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,674 INFO L273 TraceCheckUtils]: 79: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,674 INFO L273 TraceCheckUtils]: 80: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,674 INFO L273 TraceCheckUtils]: 81: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,674 INFO L273 TraceCheckUtils]: 82: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,674 INFO L273 TraceCheckUtils]: 83: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,674 INFO L273 TraceCheckUtils]: 84: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,674 INFO L273 TraceCheckUtils]: 85: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,674 INFO L273 TraceCheckUtils]: 86: Hoare triple {13084#true} assume !(~i~0 < 10000); {13084#true} is VALID [2018-11-14 18:55:04,675 INFO L273 TraceCheckUtils]: 87: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 18:55:04,675 INFO L273 TraceCheckUtils]: 88: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,675 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {13084#true} {13084#true} #73#return; {13084#true} is VALID [2018-11-14 18:55:04,675 INFO L273 TraceCheckUtils]: 90: Hoare triple {13084#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {13084#true} is VALID [2018-11-14 18:55:04,675 INFO L256 TraceCheckUtils]: 91: Hoare triple {13084#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 18:55:04,675 INFO L273 TraceCheckUtils]: 92: Hoare triple {13084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 18:55:04,675 INFO L273 TraceCheckUtils]: 93: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,675 INFO L273 TraceCheckUtils]: 94: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,675 INFO L273 TraceCheckUtils]: 95: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,676 INFO L273 TraceCheckUtils]: 96: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,676 INFO L273 TraceCheckUtils]: 97: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,676 INFO L273 TraceCheckUtils]: 98: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,676 INFO L273 TraceCheckUtils]: 99: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,676 INFO L273 TraceCheckUtils]: 100: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,676 INFO L273 TraceCheckUtils]: 101: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,676 INFO L273 TraceCheckUtils]: 102: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,676 INFO L273 TraceCheckUtils]: 103: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,676 INFO L273 TraceCheckUtils]: 104: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,676 INFO L273 TraceCheckUtils]: 105: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,677 INFO L273 TraceCheckUtils]: 106: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,677 INFO L273 TraceCheckUtils]: 107: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,677 INFO L273 TraceCheckUtils]: 108: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,677 INFO L273 TraceCheckUtils]: 109: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,677 INFO L273 TraceCheckUtils]: 110: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,677 INFO L273 TraceCheckUtils]: 111: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,677 INFO L273 TraceCheckUtils]: 112: Hoare triple {13084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:55:04,677 INFO L273 TraceCheckUtils]: 113: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:55:04,677 INFO L273 TraceCheckUtils]: 114: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,678 INFO L273 TraceCheckUtils]: 115: Hoare triple {13084#true} assume !(~i~0 < 10000); {13084#true} is VALID [2018-11-14 18:55:04,678 INFO L273 TraceCheckUtils]: 116: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 18:55:04,678 INFO L273 TraceCheckUtils]: 117: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:55:04,678 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {13084#true} {13084#true} #75#return; {13084#true} is VALID [2018-11-14 18:55:04,679 INFO L273 TraceCheckUtils]: 119: Hoare triple {13084#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13467#(<= main_~i~2 0)} is VALID [2018-11-14 18:55:04,679 INFO L273 TraceCheckUtils]: 120: Hoare triple {13467#(<= main_~i~2 0)} assume true; {13467#(<= main_~i~2 0)} is VALID [2018-11-14 18:55:04,679 INFO L273 TraceCheckUtils]: 121: Hoare triple {13467#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13467#(<= main_~i~2 0)} is VALID [2018-11-14 18:55:04,680 INFO L273 TraceCheckUtils]: 122: Hoare triple {13467#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13477#(<= main_~i~2 1)} is VALID [2018-11-14 18:55:04,680 INFO L273 TraceCheckUtils]: 123: Hoare triple {13477#(<= main_~i~2 1)} assume true; {13477#(<= main_~i~2 1)} is VALID [2018-11-14 18:55:04,680 INFO L273 TraceCheckUtils]: 124: Hoare triple {13477#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13477#(<= main_~i~2 1)} is VALID [2018-11-14 18:55:04,681 INFO L273 TraceCheckUtils]: 125: Hoare triple {13477#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13487#(<= main_~i~2 2)} is VALID [2018-11-14 18:55:04,681 INFO L273 TraceCheckUtils]: 126: Hoare triple {13487#(<= main_~i~2 2)} assume true; {13487#(<= main_~i~2 2)} is VALID [2018-11-14 18:55:04,681 INFO L273 TraceCheckUtils]: 127: Hoare triple {13487#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13487#(<= main_~i~2 2)} is VALID [2018-11-14 18:55:04,682 INFO L273 TraceCheckUtils]: 128: Hoare triple {13487#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13497#(<= main_~i~2 3)} is VALID [2018-11-14 18:55:04,682 INFO L273 TraceCheckUtils]: 129: Hoare triple {13497#(<= main_~i~2 3)} assume true; {13497#(<= main_~i~2 3)} is VALID [2018-11-14 18:55:04,683 INFO L273 TraceCheckUtils]: 130: Hoare triple {13497#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13497#(<= main_~i~2 3)} is VALID [2018-11-14 18:55:04,684 INFO L273 TraceCheckUtils]: 131: Hoare triple {13497#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13507#(<= main_~i~2 4)} is VALID [2018-11-14 18:55:04,684 INFO L273 TraceCheckUtils]: 132: Hoare triple {13507#(<= main_~i~2 4)} assume true; {13507#(<= main_~i~2 4)} is VALID [2018-11-14 18:55:04,685 INFO L273 TraceCheckUtils]: 133: Hoare triple {13507#(<= main_~i~2 4)} assume !(~i~2 < 9999); {13085#false} is VALID [2018-11-14 18:55:04,685 INFO L273 TraceCheckUtils]: 134: Hoare triple {13085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {13085#false} is VALID [2018-11-14 18:55:04,685 INFO L256 TraceCheckUtils]: 135: Hoare triple {13085#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {13085#false} is VALID [2018-11-14 18:55:04,685 INFO L273 TraceCheckUtils]: 136: Hoare triple {13085#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13085#false} is VALID [2018-11-14 18:55:04,686 INFO L273 TraceCheckUtils]: 137: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:55:04,686 INFO L273 TraceCheckUtils]: 138: Hoare triple {13085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 18:55:04,686 INFO L273 TraceCheckUtils]: 139: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 18:55:04,686 INFO L273 TraceCheckUtils]: 140: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:55:04,686 INFO L273 TraceCheckUtils]: 141: Hoare triple {13085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 18:55:04,687 INFO L273 TraceCheckUtils]: 142: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 18:55:04,687 INFO L273 TraceCheckUtils]: 143: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:55:04,687 INFO L273 TraceCheckUtils]: 144: Hoare triple {13085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 18:55:04,687 INFO L273 TraceCheckUtils]: 145: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 18:55:04,687 INFO L273 TraceCheckUtils]: 146: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:55:04,688 INFO L273 TraceCheckUtils]: 147: Hoare triple {13085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 18:55:04,688 INFO L273 TraceCheckUtils]: 148: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 18:55:04,688 INFO L273 TraceCheckUtils]: 149: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:55:04,688 INFO L273 TraceCheckUtils]: 150: Hoare triple {13085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 18:55:04,688 INFO L273 TraceCheckUtils]: 151: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 18:55:04,688 INFO L273 TraceCheckUtils]: 152: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:55:04,689 INFO L273 TraceCheckUtils]: 153: Hoare triple {13085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 18:55:04,689 INFO L273 TraceCheckUtils]: 154: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 18:55:04,689 INFO L273 TraceCheckUtils]: 155: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:55:04,689 INFO L273 TraceCheckUtils]: 156: Hoare triple {13085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 18:55:04,689 INFO L273 TraceCheckUtils]: 157: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 18:55:04,690 INFO L273 TraceCheckUtils]: 158: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:55:04,690 INFO L273 TraceCheckUtils]: 159: Hoare triple {13085#false} assume !(~i~0 < 10000); {13085#false} is VALID [2018-11-14 18:55:04,690 INFO L273 TraceCheckUtils]: 160: Hoare triple {13085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13085#false} is VALID [2018-11-14 18:55:04,690 INFO L273 TraceCheckUtils]: 161: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:55:04,690 INFO L268 TraceCheckUtils]: 162: Hoare quadruple {13085#false} {13085#false} #77#return; {13085#false} is VALID [2018-11-14 18:55:04,690 INFO L273 TraceCheckUtils]: 163: Hoare triple {13085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13085#false} is VALID [2018-11-14 18:55:04,690 INFO L273 TraceCheckUtils]: 164: Hoare triple {13085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13085#false} is VALID [2018-11-14 18:55:04,690 INFO L273 TraceCheckUtils]: 165: Hoare triple {13085#false} assume !false; {13085#false} is VALID [2018-11-14 18:55:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 415 proven. 26 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2018-11-14 18:55:04,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:55:04,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 28 [2018-11-14 18:55:04,722 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 166 [2018-11-14 18:55:04,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:55:04,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 18:55:04,852 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-14 18:55:04,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 18:55:04,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 18:55:04,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=483, Unknown=0, NotChecked=0, Total=756 [2018-11-14 18:55:04,853 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 28 states. [2018-11-14 18:55:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:05,591 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2018-11-14 18:55:05,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 18:55:05,592 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 166 [2018-11-14 18:55:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:55:05,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:55:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 133 transitions. [2018-11-14 18:55:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:55:05,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 133 transitions. [2018-11-14 18:55:05,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 133 transitions. [2018-11-14 18:55:05,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:05,753 INFO L225 Difference]: With dead ends: 174 [2018-11-14 18:55:05,754 INFO L226 Difference]: Without dead ends: 123 [2018-11-14 18:55:05,755 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=313, Invalid=743, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 18:55:05,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-14 18:55:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-11-14 18:55:05,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:55:05,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 122 states. [2018-11-14 18:55:05,816 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 122 states. [2018-11-14 18:55:05,816 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 122 states. [2018-11-14 18:55:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:05,819 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-14 18:55:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-14 18:55:05,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:05,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:05,820 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 123 states. [2018-11-14 18:55:05,820 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 123 states. [2018-11-14 18:55:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:05,823 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-14 18:55:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-14 18:55:05,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:05,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:05,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:55:05,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:55:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 18:55:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-11-14 18:55:05,826 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 166 [2018-11-14 18:55:05,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:55:05,827 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-11-14 18:55:05,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 18:55:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-11-14 18:55:05,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-14 18:55:05,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:55:05,829 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 21, 20, 20, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:55:05,829 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:55:05,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:55:05,830 INFO L82 PathProgramCache]: Analyzing trace with hash 862428551, now seen corresponding path program 19 times [2018-11-14 18:55:05,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:55:05,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:55:05,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:05,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:55:05,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:06,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {14264#true} call ULTIMATE.init(); {14264#true} is VALID [2018-11-14 18:55:06,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {14264#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14264#true} is VALID [2018-11-14 18:55:06,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,792 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14264#true} {14264#true} #69#return; {14264#true} is VALID [2018-11-14 18:55:06,792 INFO L256 TraceCheckUtils]: 4: Hoare triple {14264#true} call #t~ret13 := main(); {14264#true} is VALID [2018-11-14 18:55:06,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {14264#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14266#(= main_~i~1 0)} is VALID [2018-11-14 18:55:06,793 INFO L273 TraceCheckUtils]: 6: Hoare triple {14266#(= main_~i~1 0)} assume true; {14266#(= main_~i~1 0)} is VALID [2018-11-14 18:55:06,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {14266#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14266#(= main_~i~1 0)} is VALID [2018-11-14 18:55:06,794 INFO L273 TraceCheckUtils]: 8: Hoare triple {14266#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14267#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:06,795 INFO L273 TraceCheckUtils]: 9: Hoare triple {14267#(<= main_~i~1 1)} assume true; {14267#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:06,795 INFO L273 TraceCheckUtils]: 10: Hoare triple {14267#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14267#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:06,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {14267#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14268#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:06,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {14268#(<= main_~i~1 2)} assume true; {14268#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:06,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {14268#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14268#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:06,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {14268#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14269#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:06,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {14269#(<= main_~i~1 3)} assume true; {14269#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:06,799 INFO L273 TraceCheckUtils]: 16: Hoare triple {14269#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14269#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:06,800 INFO L273 TraceCheckUtils]: 17: Hoare triple {14269#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14270#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:06,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {14270#(<= main_~i~1 4)} assume true; {14270#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:06,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {14270#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14270#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:06,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {14270#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14271#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:06,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {14271#(<= main_~i~1 5)} assume true; {14271#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:06,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {14271#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14271#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:06,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {14271#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14272#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:06,804 INFO L273 TraceCheckUtils]: 24: Hoare triple {14272#(<= main_~i~1 6)} assume true; {14272#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:06,804 INFO L273 TraceCheckUtils]: 25: Hoare triple {14272#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14272#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:06,805 INFO L273 TraceCheckUtils]: 26: Hoare triple {14272#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14273#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:06,805 INFO L273 TraceCheckUtils]: 27: Hoare triple {14273#(<= main_~i~1 7)} assume true; {14273#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:06,806 INFO L273 TraceCheckUtils]: 28: Hoare triple {14273#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14273#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:06,807 INFO L273 TraceCheckUtils]: 29: Hoare triple {14273#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14274#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:06,807 INFO L273 TraceCheckUtils]: 30: Hoare triple {14274#(<= main_~i~1 8)} assume true; {14274#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:06,808 INFO L273 TraceCheckUtils]: 31: Hoare triple {14274#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14274#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:06,808 INFO L273 TraceCheckUtils]: 32: Hoare triple {14274#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14275#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:06,809 INFO L273 TraceCheckUtils]: 33: Hoare triple {14275#(<= main_~i~1 9)} assume true; {14275#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:06,809 INFO L273 TraceCheckUtils]: 34: Hoare triple {14275#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14275#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:06,810 INFO L273 TraceCheckUtils]: 35: Hoare triple {14275#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14276#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:06,811 INFO L273 TraceCheckUtils]: 36: Hoare triple {14276#(<= main_~i~1 10)} assume true; {14276#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:06,811 INFO L273 TraceCheckUtils]: 37: Hoare triple {14276#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14276#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:06,812 INFO L273 TraceCheckUtils]: 38: Hoare triple {14276#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14277#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:06,812 INFO L273 TraceCheckUtils]: 39: Hoare triple {14277#(<= main_~i~1 11)} assume true; {14277#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:06,813 INFO L273 TraceCheckUtils]: 40: Hoare triple {14277#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14277#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:06,814 INFO L273 TraceCheckUtils]: 41: Hoare triple {14277#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14278#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:06,814 INFO L273 TraceCheckUtils]: 42: Hoare triple {14278#(<= main_~i~1 12)} assume true; {14278#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:06,815 INFO L273 TraceCheckUtils]: 43: Hoare triple {14278#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14278#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:06,815 INFO L273 TraceCheckUtils]: 44: Hoare triple {14278#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14279#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:06,816 INFO L273 TraceCheckUtils]: 45: Hoare triple {14279#(<= main_~i~1 13)} assume true; {14279#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:06,816 INFO L273 TraceCheckUtils]: 46: Hoare triple {14279#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14279#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:06,817 INFO L273 TraceCheckUtils]: 47: Hoare triple {14279#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14280#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:06,818 INFO L273 TraceCheckUtils]: 48: Hoare triple {14280#(<= main_~i~1 14)} assume true; {14280#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:06,818 INFO L273 TraceCheckUtils]: 49: Hoare triple {14280#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14280#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:06,823 INFO L273 TraceCheckUtils]: 50: Hoare triple {14280#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14281#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:06,823 INFO L273 TraceCheckUtils]: 51: Hoare triple {14281#(<= main_~i~1 15)} assume true; {14281#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:06,824 INFO L273 TraceCheckUtils]: 52: Hoare triple {14281#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14281#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:06,824 INFO L273 TraceCheckUtils]: 53: Hoare triple {14281#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14282#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:06,824 INFO L273 TraceCheckUtils]: 54: Hoare triple {14282#(<= main_~i~1 16)} assume true; {14282#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:06,825 INFO L273 TraceCheckUtils]: 55: Hoare triple {14282#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14282#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:06,825 INFO L273 TraceCheckUtils]: 56: Hoare triple {14282#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14283#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:06,826 INFO L273 TraceCheckUtils]: 57: Hoare triple {14283#(<= main_~i~1 17)} assume true; {14283#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:06,826 INFO L273 TraceCheckUtils]: 58: Hoare triple {14283#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14283#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:06,826 INFO L273 TraceCheckUtils]: 59: Hoare triple {14283#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14284#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:06,827 INFO L273 TraceCheckUtils]: 60: Hoare triple {14284#(<= main_~i~1 18)} assume true; {14284#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:06,827 INFO L273 TraceCheckUtils]: 61: Hoare triple {14284#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14284#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:06,828 INFO L273 TraceCheckUtils]: 62: Hoare triple {14284#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14285#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:06,828 INFO L273 TraceCheckUtils]: 63: Hoare triple {14285#(<= main_~i~1 19)} assume true; {14285#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:06,829 INFO L273 TraceCheckUtils]: 64: Hoare triple {14285#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14285#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:06,829 INFO L273 TraceCheckUtils]: 65: Hoare triple {14285#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14286#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:06,830 INFO L273 TraceCheckUtils]: 66: Hoare triple {14286#(<= main_~i~1 20)} assume true; {14286#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:06,831 INFO L273 TraceCheckUtils]: 67: Hoare triple {14286#(<= main_~i~1 20)} assume !(~i~1 < 10000); {14265#false} is VALID [2018-11-14 18:55:06,831 INFO L256 TraceCheckUtils]: 68: Hoare triple {14265#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {14264#true} is VALID [2018-11-14 18:55:06,831 INFO L273 TraceCheckUtils]: 69: Hoare triple {14264#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14264#true} is VALID [2018-11-14 18:55:06,831 INFO L273 TraceCheckUtils]: 70: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,831 INFO L273 TraceCheckUtils]: 71: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,832 INFO L273 TraceCheckUtils]: 72: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,832 INFO L273 TraceCheckUtils]: 73: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,832 INFO L273 TraceCheckUtils]: 74: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,832 INFO L273 TraceCheckUtils]: 75: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,832 INFO L273 TraceCheckUtils]: 76: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,833 INFO L273 TraceCheckUtils]: 77: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,833 INFO L273 TraceCheckUtils]: 78: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,833 INFO L273 TraceCheckUtils]: 79: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,833 INFO L273 TraceCheckUtils]: 80: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,833 INFO L273 TraceCheckUtils]: 81: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,834 INFO L273 TraceCheckUtils]: 82: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,834 INFO L273 TraceCheckUtils]: 83: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,834 INFO L273 TraceCheckUtils]: 84: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,834 INFO L273 TraceCheckUtils]: 85: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,834 INFO L273 TraceCheckUtils]: 86: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,834 INFO L273 TraceCheckUtils]: 87: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,834 INFO L273 TraceCheckUtils]: 88: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,834 INFO L273 TraceCheckUtils]: 89: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,834 INFO L273 TraceCheckUtils]: 90: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,835 INFO L273 TraceCheckUtils]: 91: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,835 INFO L273 TraceCheckUtils]: 92: Hoare triple {14264#true} assume !(~i~0 < 10000); {14264#true} is VALID [2018-11-14 18:55:06,835 INFO L273 TraceCheckUtils]: 93: Hoare triple {14264#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14264#true} is VALID [2018-11-14 18:55:06,835 INFO L273 TraceCheckUtils]: 94: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,835 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {14264#true} {14265#false} #73#return; {14265#false} is VALID [2018-11-14 18:55:06,835 INFO L273 TraceCheckUtils]: 96: Hoare triple {14265#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {14265#false} is VALID [2018-11-14 18:55:06,835 INFO L256 TraceCheckUtils]: 97: Hoare triple {14265#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {14264#true} is VALID [2018-11-14 18:55:06,835 INFO L273 TraceCheckUtils]: 98: Hoare triple {14264#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14264#true} is VALID [2018-11-14 18:55:06,835 INFO L273 TraceCheckUtils]: 99: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,836 INFO L273 TraceCheckUtils]: 100: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,836 INFO L273 TraceCheckUtils]: 101: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,836 INFO L273 TraceCheckUtils]: 102: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,836 INFO L273 TraceCheckUtils]: 103: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,836 INFO L273 TraceCheckUtils]: 104: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,836 INFO L273 TraceCheckUtils]: 105: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,836 INFO L273 TraceCheckUtils]: 106: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,836 INFO L273 TraceCheckUtils]: 107: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,836 INFO L273 TraceCheckUtils]: 108: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,836 INFO L273 TraceCheckUtils]: 109: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,837 INFO L273 TraceCheckUtils]: 110: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,837 INFO L273 TraceCheckUtils]: 111: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,837 INFO L273 TraceCheckUtils]: 112: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,837 INFO L273 TraceCheckUtils]: 113: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,837 INFO L273 TraceCheckUtils]: 114: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,837 INFO L273 TraceCheckUtils]: 115: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,837 INFO L273 TraceCheckUtils]: 116: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,837 INFO L273 TraceCheckUtils]: 117: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,837 INFO L273 TraceCheckUtils]: 118: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,838 INFO L273 TraceCheckUtils]: 119: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,838 INFO L273 TraceCheckUtils]: 120: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,838 INFO L273 TraceCheckUtils]: 121: Hoare triple {14264#true} assume !(~i~0 < 10000); {14264#true} is VALID [2018-11-14 18:55:06,838 INFO L273 TraceCheckUtils]: 122: Hoare triple {14264#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14264#true} is VALID [2018-11-14 18:55:06,838 INFO L273 TraceCheckUtils]: 123: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,838 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {14264#true} {14265#false} #75#return; {14265#false} is VALID [2018-11-14 18:55:06,838 INFO L273 TraceCheckUtils]: 125: Hoare triple {14265#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {14265#false} is VALID [2018-11-14 18:55:06,838 INFO L273 TraceCheckUtils]: 126: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:06,838 INFO L273 TraceCheckUtils]: 127: Hoare triple {14265#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14265#false} is VALID [2018-11-14 18:55:06,839 INFO L273 TraceCheckUtils]: 128: Hoare triple {14265#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14265#false} is VALID [2018-11-14 18:55:06,839 INFO L273 TraceCheckUtils]: 129: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:06,839 INFO L273 TraceCheckUtils]: 130: Hoare triple {14265#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14265#false} is VALID [2018-11-14 18:55:06,839 INFO L273 TraceCheckUtils]: 131: Hoare triple {14265#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14265#false} is VALID [2018-11-14 18:55:06,839 INFO L273 TraceCheckUtils]: 132: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:06,839 INFO L273 TraceCheckUtils]: 133: Hoare triple {14265#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14265#false} is VALID [2018-11-14 18:55:06,839 INFO L273 TraceCheckUtils]: 134: Hoare triple {14265#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14265#false} is VALID [2018-11-14 18:55:06,839 INFO L273 TraceCheckUtils]: 135: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:06,839 INFO L273 TraceCheckUtils]: 136: Hoare triple {14265#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14265#false} is VALID [2018-11-14 18:55:06,839 INFO L273 TraceCheckUtils]: 137: Hoare triple {14265#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14265#false} is VALID [2018-11-14 18:55:06,840 INFO L273 TraceCheckUtils]: 138: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:06,840 INFO L273 TraceCheckUtils]: 139: Hoare triple {14265#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14265#false} is VALID [2018-11-14 18:55:06,840 INFO L273 TraceCheckUtils]: 140: Hoare triple {14265#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14265#false} is VALID [2018-11-14 18:55:06,840 INFO L273 TraceCheckUtils]: 141: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:06,840 INFO L273 TraceCheckUtils]: 142: Hoare triple {14265#false} assume !(~i~2 < 9999); {14265#false} is VALID [2018-11-14 18:55:06,840 INFO L273 TraceCheckUtils]: 143: Hoare triple {14265#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {14265#false} is VALID [2018-11-14 18:55:06,840 INFO L256 TraceCheckUtils]: 144: Hoare triple {14265#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {14264#true} is VALID [2018-11-14 18:55:06,840 INFO L273 TraceCheckUtils]: 145: Hoare triple {14264#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14264#true} is VALID [2018-11-14 18:55:06,840 INFO L273 TraceCheckUtils]: 146: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,841 INFO L273 TraceCheckUtils]: 147: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,841 INFO L273 TraceCheckUtils]: 148: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,841 INFO L273 TraceCheckUtils]: 149: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,841 INFO L273 TraceCheckUtils]: 150: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,841 INFO L273 TraceCheckUtils]: 151: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,841 INFO L273 TraceCheckUtils]: 152: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,841 INFO L273 TraceCheckUtils]: 153: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,841 INFO L273 TraceCheckUtils]: 154: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,841 INFO L273 TraceCheckUtils]: 155: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,841 INFO L273 TraceCheckUtils]: 156: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,842 INFO L273 TraceCheckUtils]: 157: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,842 INFO L273 TraceCheckUtils]: 158: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,842 INFO L273 TraceCheckUtils]: 159: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,842 INFO L273 TraceCheckUtils]: 160: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,842 INFO L273 TraceCheckUtils]: 161: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,842 INFO L273 TraceCheckUtils]: 162: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,842 INFO L273 TraceCheckUtils]: 163: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,842 INFO L273 TraceCheckUtils]: 164: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,842 INFO L273 TraceCheckUtils]: 165: Hoare triple {14264#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14264#true} is VALID [2018-11-14 18:55:06,843 INFO L273 TraceCheckUtils]: 166: Hoare triple {14264#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14264#true} is VALID [2018-11-14 18:55:06,843 INFO L273 TraceCheckUtils]: 167: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,843 INFO L273 TraceCheckUtils]: 168: Hoare triple {14264#true} assume !(~i~0 < 10000); {14264#true} is VALID [2018-11-14 18:55:06,843 INFO L273 TraceCheckUtils]: 169: Hoare triple {14264#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14264#true} is VALID [2018-11-14 18:55:06,843 INFO L273 TraceCheckUtils]: 170: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:06,843 INFO L268 TraceCheckUtils]: 171: Hoare quadruple {14264#true} {14265#false} #77#return; {14265#false} is VALID [2018-11-14 18:55:06,843 INFO L273 TraceCheckUtils]: 172: Hoare triple {14265#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14265#false} is VALID [2018-11-14 18:55:06,843 INFO L273 TraceCheckUtils]: 173: Hoare triple {14265#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14265#false} is VALID [2018-11-14 18:55:06,843 INFO L273 TraceCheckUtils]: 174: Hoare triple {14265#false} assume !false; {14265#false} is VALID [2018-11-14 18:55:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 18:55:06,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:55:06,858 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 18:55:06,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:55:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:06,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:55:07,317 INFO L256 TraceCheckUtils]: 0: Hoare triple {14264#true} call ULTIMATE.init(); {14264#true} is VALID [2018-11-14 18:55:07,317 INFO L273 TraceCheckUtils]: 1: Hoare triple {14264#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14264#true} is VALID [2018-11-14 18:55:07,317 INFO L273 TraceCheckUtils]: 2: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 18:55:07,318 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14264#true} {14264#true} #69#return; {14264#true} is VALID [2018-11-14 18:55:07,318 INFO L256 TraceCheckUtils]: 4: Hoare triple {14264#true} call #t~ret13 := main(); {14264#true} is VALID [2018-11-14 18:55:07,319 INFO L273 TraceCheckUtils]: 5: Hoare triple {14264#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14305#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:07,319 INFO L273 TraceCheckUtils]: 6: Hoare triple {14305#(<= main_~i~1 0)} assume true; {14305#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:07,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {14305#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14305#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:07,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {14305#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14267#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:07,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {14267#(<= main_~i~1 1)} assume true; {14267#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:07,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {14267#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14267#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:07,321 INFO L273 TraceCheckUtils]: 11: Hoare triple {14267#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14268#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:07,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {14268#(<= main_~i~1 2)} assume true; {14268#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:07,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {14268#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14268#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:07,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {14268#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14269#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:07,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {14269#(<= main_~i~1 3)} assume true; {14269#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:07,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {14269#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14269#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:07,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {14269#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14270#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:07,325 INFO L273 TraceCheckUtils]: 18: Hoare triple {14270#(<= main_~i~1 4)} assume true; {14270#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:07,325 INFO L273 TraceCheckUtils]: 19: Hoare triple {14270#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14270#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:07,326 INFO L273 TraceCheckUtils]: 20: Hoare triple {14270#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14271#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:07,327 INFO L273 TraceCheckUtils]: 21: Hoare triple {14271#(<= main_~i~1 5)} assume true; {14271#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:07,327 INFO L273 TraceCheckUtils]: 22: Hoare triple {14271#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14271#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:07,328 INFO L273 TraceCheckUtils]: 23: Hoare triple {14271#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14272#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:07,328 INFO L273 TraceCheckUtils]: 24: Hoare triple {14272#(<= main_~i~1 6)} assume true; {14272#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:07,329 INFO L273 TraceCheckUtils]: 25: Hoare triple {14272#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14272#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:07,330 INFO L273 TraceCheckUtils]: 26: Hoare triple {14272#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14273#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:07,330 INFO L273 TraceCheckUtils]: 27: Hoare triple {14273#(<= main_~i~1 7)} assume true; {14273#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:07,331 INFO L273 TraceCheckUtils]: 28: Hoare triple {14273#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14273#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:07,331 INFO L273 TraceCheckUtils]: 29: Hoare triple {14273#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14274#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:07,332 INFO L273 TraceCheckUtils]: 30: Hoare triple {14274#(<= main_~i~1 8)} assume true; {14274#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:07,333 INFO L273 TraceCheckUtils]: 31: Hoare triple {14274#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14274#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:07,333 INFO L273 TraceCheckUtils]: 32: Hoare triple {14274#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14275#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:07,334 INFO L273 TraceCheckUtils]: 33: Hoare triple {14275#(<= main_~i~1 9)} assume true; {14275#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:07,334 INFO L273 TraceCheckUtils]: 34: Hoare triple {14275#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14275#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:07,335 INFO L273 TraceCheckUtils]: 35: Hoare triple {14275#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14276#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:07,335 INFO L273 TraceCheckUtils]: 36: Hoare triple {14276#(<= main_~i~1 10)} assume true; {14276#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:07,336 INFO L273 TraceCheckUtils]: 37: Hoare triple {14276#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14276#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:07,337 INFO L273 TraceCheckUtils]: 38: Hoare triple {14276#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14277#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:07,337 INFO L273 TraceCheckUtils]: 39: Hoare triple {14277#(<= main_~i~1 11)} assume true; {14277#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:07,338 INFO L273 TraceCheckUtils]: 40: Hoare triple {14277#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14277#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:07,338 INFO L273 TraceCheckUtils]: 41: Hoare triple {14277#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14278#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:07,339 INFO L273 TraceCheckUtils]: 42: Hoare triple {14278#(<= main_~i~1 12)} assume true; {14278#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:07,339 INFO L273 TraceCheckUtils]: 43: Hoare triple {14278#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14278#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:07,340 INFO L273 TraceCheckUtils]: 44: Hoare triple {14278#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14279#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:07,341 INFO L273 TraceCheckUtils]: 45: Hoare triple {14279#(<= main_~i~1 13)} assume true; {14279#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:07,341 INFO L273 TraceCheckUtils]: 46: Hoare triple {14279#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14279#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:07,342 INFO L273 TraceCheckUtils]: 47: Hoare triple {14279#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14280#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:07,342 INFO L273 TraceCheckUtils]: 48: Hoare triple {14280#(<= main_~i~1 14)} assume true; {14280#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:07,343 INFO L273 TraceCheckUtils]: 49: Hoare triple {14280#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14280#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:07,344 INFO L273 TraceCheckUtils]: 50: Hoare triple {14280#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14281#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:07,344 INFO L273 TraceCheckUtils]: 51: Hoare triple {14281#(<= main_~i~1 15)} assume true; {14281#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:07,345 INFO L273 TraceCheckUtils]: 52: Hoare triple {14281#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14281#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:07,345 INFO L273 TraceCheckUtils]: 53: Hoare triple {14281#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14282#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:07,346 INFO L273 TraceCheckUtils]: 54: Hoare triple {14282#(<= main_~i~1 16)} assume true; {14282#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:07,346 INFO L273 TraceCheckUtils]: 55: Hoare triple {14282#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14282#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:07,347 INFO L273 TraceCheckUtils]: 56: Hoare triple {14282#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14283#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:07,348 INFO L273 TraceCheckUtils]: 57: Hoare triple {14283#(<= main_~i~1 17)} assume true; {14283#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:07,348 INFO L273 TraceCheckUtils]: 58: Hoare triple {14283#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14283#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:07,349 INFO L273 TraceCheckUtils]: 59: Hoare triple {14283#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14284#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:07,349 INFO L273 TraceCheckUtils]: 60: Hoare triple {14284#(<= main_~i~1 18)} assume true; {14284#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:07,350 INFO L273 TraceCheckUtils]: 61: Hoare triple {14284#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14284#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:07,351 INFO L273 TraceCheckUtils]: 62: Hoare triple {14284#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14285#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:07,351 INFO L273 TraceCheckUtils]: 63: Hoare triple {14285#(<= main_~i~1 19)} assume true; {14285#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:07,352 INFO L273 TraceCheckUtils]: 64: Hoare triple {14285#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14285#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:07,352 INFO L273 TraceCheckUtils]: 65: Hoare triple {14285#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14286#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:07,353 INFO L273 TraceCheckUtils]: 66: Hoare triple {14286#(<= main_~i~1 20)} assume true; {14286#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:07,354 INFO L273 TraceCheckUtils]: 67: Hoare triple {14286#(<= main_~i~1 20)} assume !(~i~1 < 10000); {14265#false} is VALID [2018-11-14 18:55:07,354 INFO L256 TraceCheckUtils]: 68: Hoare triple {14265#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {14265#false} is VALID [2018-11-14 18:55:07,354 INFO L273 TraceCheckUtils]: 69: Hoare triple {14265#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14265#false} is VALID [2018-11-14 18:55:07,354 INFO L273 TraceCheckUtils]: 70: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,354 INFO L273 TraceCheckUtils]: 71: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,355 INFO L273 TraceCheckUtils]: 72: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,355 INFO L273 TraceCheckUtils]: 73: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,355 INFO L273 TraceCheckUtils]: 74: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,355 INFO L273 TraceCheckUtils]: 75: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,355 INFO L273 TraceCheckUtils]: 76: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,355 INFO L273 TraceCheckUtils]: 77: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,356 INFO L273 TraceCheckUtils]: 78: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,356 INFO L273 TraceCheckUtils]: 79: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,356 INFO L273 TraceCheckUtils]: 80: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,356 INFO L273 TraceCheckUtils]: 81: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,356 INFO L273 TraceCheckUtils]: 82: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,357 INFO L273 TraceCheckUtils]: 83: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,357 INFO L273 TraceCheckUtils]: 84: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,357 INFO L273 TraceCheckUtils]: 85: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,357 INFO L273 TraceCheckUtils]: 86: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,357 INFO L273 TraceCheckUtils]: 87: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,357 INFO L273 TraceCheckUtils]: 88: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,357 INFO L273 TraceCheckUtils]: 89: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,357 INFO L273 TraceCheckUtils]: 90: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,358 INFO L273 TraceCheckUtils]: 91: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,358 INFO L273 TraceCheckUtils]: 92: Hoare triple {14265#false} assume !(~i~0 < 10000); {14265#false} is VALID [2018-11-14 18:55:07,358 INFO L273 TraceCheckUtils]: 93: Hoare triple {14265#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14265#false} is VALID [2018-11-14 18:55:07,358 INFO L273 TraceCheckUtils]: 94: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,358 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {14265#false} {14265#false} #73#return; {14265#false} is VALID [2018-11-14 18:55:07,358 INFO L273 TraceCheckUtils]: 96: Hoare triple {14265#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {14265#false} is VALID [2018-11-14 18:55:07,358 INFO L256 TraceCheckUtils]: 97: Hoare triple {14265#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {14265#false} is VALID [2018-11-14 18:55:07,358 INFO L273 TraceCheckUtils]: 98: Hoare triple {14265#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14265#false} is VALID [2018-11-14 18:55:07,358 INFO L273 TraceCheckUtils]: 99: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,358 INFO L273 TraceCheckUtils]: 100: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,359 INFO L273 TraceCheckUtils]: 101: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,359 INFO L273 TraceCheckUtils]: 102: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,359 INFO L273 TraceCheckUtils]: 103: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,359 INFO L273 TraceCheckUtils]: 104: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,359 INFO L273 TraceCheckUtils]: 105: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,359 INFO L273 TraceCheckUtils]: 106: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,359 INFO L273 TraceCheckUtils]: 107: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,359 INFO L273 TraceCheckUtils]: 108: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,359 INFO L273 TraceCheckUtils]: 109: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,360 INFO L273 TraceCheckUtils]: 110: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,360 INFO L273 TraceCheckUtils]: 111: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,360 INFO L273 TraceCheckUtils]: 112: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,360 INFO L273 TraceCheckUtils]: 113: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,360 INFO L273 TraceCheckUtils]: 114: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,360 INFO L273 TraceCheckUtils]: 115: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,360 INFO L273 TraceCheckUtils]: 116: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,360 INFO L273 TraceCheckUtils]: 117: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,360 INFO L273 TraceCheckUtils]: 118: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,360 INFO L273 TraceCheckUtils]: 119: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,361 INFO L273 TraceCheckUtils]: 120: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,361 INFO L273 TraceCheckUtils]: 121: Hoare triple {14265#false} assume !(~i~0 < 10000); {14265#false} is VALID [2018-11-14 18:55:07,361 INFO L273 TraceCheckUtils]: 122: Hoare triple {14265#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14265#false} is VALID [2018-11-14 18:55:07,361 INFO L273 TraceCheckUtils]: 123: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,361 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {14265#false} {14265#false} #75#return; {14265#false} is VALID [2018-11-14 18:55:07,361 INFO L273 TraceCheckUtils]: 125: Hoare triple {14265#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {14265#false} is VALID [2018-11-14 18:55:07,361 INFO L273 TraceCheckUtils]: 126: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,361 INFO L273 TraceCheckUtils]: 127: Hoare triple {14265#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14265#false} is VALID [2018-11-14 18:55:07,361 INFO L273 TraceCheckUtils]: 128: Hoare triple {14265#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14265#false} is VALID [2018-11-14 18:55:07,362 INFO L273 TraceCheckUtils]: 129: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,362 INFO L273 TraceCheckUtils]: 130: Hoare triple {14265#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14265#false} is VALID [2018-11-14 18:55:07,362 INFO L273 TraceCheckUtils]: 131: Hoare triple {14265#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14265#false} is VALID [2018-11-14 18:55:07,362 INFO L273 TraceCheckUtils]: 132: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,362 INFO L273 TraceCheckUtils]: 133: Hoare triple {14265#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14265#false} is VALID [2018-11-14 18:55:07,362 INFO L273 TraceCheckUtils]: 134: Hoare triple {14265#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14265#false} is VALID [2018-11-14 18:55:07,362 INFO L273 TraceCheckUtils]: 135: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,362 INFO L273 TraceCheckUtils]: 136: Hoare triple {14265#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14265#false} is VALID [2018-11-14 18:55:07,362 INFO L273 TraceCheckUtils]: 137: Hoare triple {14265#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14265#false} is VALID [2018-11-14 18:55:07,363 INFO L273 TraceCheckUtils]: 138: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,363 INFO L273 TraceCheckUtils]: 139: Hoare triple {14265#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14265#false} is VALID [2018-11-14 18:55:07,363 INFO L273 TraceCheckUtils]: 140: Hoare triple {14265#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14265#false} is VALID [2018-11-14 18:55:07,363 INFO L273 TraceCheckUtils]: 141: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,363 INFO L273 TraceCheckUtils]: 142: Hoare triple {14265#false} assume !(~i~2 < 9999); {14265#false} is VALID [2018-11-14 18:55:07,363 INFO L273 TraceCheckUtils]: 143: Hoare triple {14265#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {14265#false} is VALID [2018-11-14 18:55:07,363 INFO L256 TraceCheckUtils]: 144: Hoare triple {14265#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {14265#false} is VALID [2018-11-14 18:55:07,363 INFO L273 TraceCheckUtils]: 145: Hoare triple {14265#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14265#false} is VALID [2018-11-14 18:55:07,363 INFO L273 TraceCheckUtils]: 146: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,364 INFO L273 TraceCheckUtils]: 147: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,364 INFO L273 TraceCheckUtils]: 148: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,364 INFO L273 TraceCheckUtils]: 149: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,364 INFO L273 TraceCheckUtils]: 150: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,364 INFO L273 TraceCheckUtils]: 151: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,364 INFO L273 TraceCheckUtils]: 152: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,364 INFO L273 TraceCheckUtils]: 153: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,365 INFO L273 TraceCheckUtils]: 154: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,365 INFO L273 TraceCheckUtils]: 155: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,365 INFO L273 TraceCheckUtils]: 156: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,365 INFO L273 TraceCheckUtils]: 157: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,365 INFO L273 TraceCheckUtils]: 158: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,365 INFO L273 TraceCheckUtils]: 159: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,365 INFO L273 TraceCheckUtils]: 160: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,365 INFO L273 TraceCheckUtils]: 161: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,365 INFO L273 TraceCheckUtils]: 162: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,365 INFO L273 TraceCheckUtils]: 163: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,366 INFO L273 TraceCheckUtils]: 164: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,366 INFO L273 TraceCheckUtils]: 165: Hoare triple {14265#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14265#false} is VALID [2018-11-14 18:55:07,366 INFO L273 TraceCheckUtils]: 166: Hoare triple {14265#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14265#false} is VALID [2018-11-14 18:55:07,366 INFO L273 TraceCheckUtils]: 167: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,366 INFO L273 TraceCheckUtils]: 168: Hoare triple {14265#false} assume !(~i~0 < 10000); {14265#false} is VALID [2018-11-14 18:55:07,366 INFO L273 TraceCheckUtils]: 169: Hoare triple {14265#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14265#false} is VALID [2018-11-14 18:55:07,366 INFO L273 TraceCheckUtils]: 170: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 18:55:07,366 INFO L268 TraceCheckUtils]: 171: Hoare quadruple {14265#false} {14265#false} #77#return; {14265#false} is VALID [2018-11-14 18:55:07,366 INFO L273 TraceCheckUtils]: 172: Hoare triple {14265#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14265#false} is VALID [2018-11-14 18:55:07,367 INFO L273 TraceCheckUtils]: 173: Hoare triple {14265#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14265#false} is VALID [2018-11-14 18:55:07,367 INFO L273 TraceCheckUtils]: 174: Hoare triple {14265#false} assume !false; {14265#false} is VALID [2018-11-14 18:55:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 18:55:07,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:55:07,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-14 18:55:07,403 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-14 18:55:07,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:55:07,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 18:55:07,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:07,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 18:55:07,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 18:55:07,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:55:07,502 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 24 states. [2018-11-14 18:55:08,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:08,429 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-14 18:55:08,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 18:55:08,429 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-14 18:55:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:55:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:55:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 120 transitions. [2018-11-14 18:55:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:55:08,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 120 transitions. [2018-11-14 18:55:08,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 120 transitions. [2018-11-14 18:55:08,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:08,645 INFO L225 Difference]: With dead ends: 180 [2018-11-14 18:55:08,645 INFO L226 Difference]: Without dead ends: 126 [2018-11-14 18:55:08,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:55:08,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-14 18:55:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-14 18:55:08,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:55:08,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-14 18:55:08,686 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-14 18:55:08,686 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-14 18:55:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:08,689 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-14 18:55:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-14 18:55:08,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:08,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:08,690 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-14 18:55:08,690 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-14 18:55:08,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:08,692 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-14 18:55:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-14 18:55:08,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:08,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:08,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:55:08,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:55:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-14 18:55:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-14 18:55:08,695 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 175 [2018-11-14 18:55:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:55:08,696 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-14 18:55:08,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 18:55:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-14 18:55:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-14 18:55:08,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:55:08,697 INFO L375 BasicCegarLoop]: trace histogram [24, 22, 21, 21, 21, 21, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:55:08,697 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:55:08,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:55:08,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1950415411, now seen corresponding path program 20 times [2018-11-14 18:55:08,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:55:08,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:55:08,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:08,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:55:08,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:09,127 INFO L256 TraceCheckUtils]: 0: Hoare triple {15475#true} call ULTIMATE.init(); {15475#true} is VALID [2018-11-14 18:55:09,127 INFO L273 TraceCheckUtils]: 1: Hoare triple {15475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15475#true} is VALID [2018-11-14 18:55:09,127 INFO L273 TraceCheckUtils]: 2: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,127 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15475#true} {15475#true} #69#return; {15475#true} is VALID [2018-11-14 18:55:09,128 INFO L256 TraceCheckUtils]: 4: Hoare triple {15475#true} call #t~ret13 := main(); {15475#true} is VALID [2018-11-14 18:55:09,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {15475#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15477#(= main_~i~1 0)} is VALID [2018-11-14 18:55:09,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {15477#(= main_~i~1 0)} assume true; {15477#(= main_~i~1 0)} is VALID [2018-11-14 18:55:09,129 INFO L273 TraceCheckUtils]: 7: Hoare triple {15477#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15477#(= main_~i~1 0)} is VALID [2018-11-14 18:55:09,130 INFO L273 TraceCheckUtils]: 8: Hoare triple {15477#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15478#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:09,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {15478#(<= main_~i~1 1)} assume true; {15478#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:09,130 INFO L273 TraceCheckUtils]: 10: Hoare triple {15478#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15478#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:09,131 INFO L273 TraceCheckUtils]: 11: Hoare triple {15478#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15479#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:09,131 INFO L273 TraceCheckUtils]: 12: Hoare triple {15479#(<= main_~i~1 2)} assume true; {15479#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:09,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {15479#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15479#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:09,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {15479#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15480#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:09,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {15480#(<= main_~i~1 3)} assume true; {15480#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:09,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {15480#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15480#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:09,133 INFO L273 TraceCheckUtils]: 17: Hoare triple {15480#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15481#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:09,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {15481#(<= main_~i~1 4)} assume true; {15481#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:09,134 INFO L273 TraceCheckUtils]: 19: Hoare triple {15481#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15481#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:09,135 INFO L273 TraceCheckUtils]: 20: Hoare triple {15481#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15482#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:09,136 INFO L273 TraceCheckUtils]: 21: Hoare triple {15482#(<= main_~i~1 5)} assume true; {15482#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:09,136 INFO L273 TraceCheckUtils]: 22: Hoare triple {15482#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15482#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:09,137 INFO L273 TraceCheckUtils]: 23: Hoare triple {15482#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15483#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:09,138 INFO L273 TraceCheckUtils]: 24: Hoare triple {15483#(<= main_~i~1 6)} assume true; {15483#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:09,138 INFO L273 TraceCheckUtils]: 25: Hoare triple {15483#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15483#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:09,139 INFO L273 TraceCheckUtils]: 26: Hoare triple {15483#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15484#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:09,139 INFO L273 TraceCheckUtils]: 27: Hoare triple {15484#(<= main_~i~1 7)} assume true; {15484#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:09,143 INFO L273 TraceCheckUtils]: 28: Hoare triple {15484#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15484#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:09,144 INFO L273 TraceCheckUtils]: 29: Hoare triple {15484#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15485#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:09,144 INFO L273 TraceCheckUtils]: 30: Hoare triple {15485#(<= main_~i~1 8)} assume true; {15485#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:09,145 INFO L273 TraceCheckUtils]: 31: Hoare triple {15485#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15485#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:09,145 INFO L273 TraceCheckUtils]: 32: Hoare triple {15485#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15486#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:09,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {15486#(<= main_~i~1 9)} assume true; {15486#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:09,146 INFO L273 TraceCheckUtils]: 34: Hoare triple {15486#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15486#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:09,146 INFO L273 TraceCheckUtils]: 35: Hoare triple {15486#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15487#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:09,147 INFO L273 TraceCheckUtils]: 36: Hoare triple {15487#(<= main_~i~1 10)} assume true; {15487#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:09,147 INFO L273 TraceCheckUtils]: 37: Hoare triple {15487#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15487#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:09,147 INFO L273 TraceCheckUtils]: 38: Hoare triple {15487#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15488#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:09,148 INFO L273 TraceCheckUtils]: 39: Hoare triple {15488#(<= main_~i~1 11)} assume true; {15488#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:09,148 INFO L273 TraceCheckUtils]: 40: Hoare triple {15488#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15488#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:09,149 INFO L273 TraceCheckUtils]: 41: Hoare triple {15488#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15489#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:09,150 INFO L273 TraceCheckUtils]: 42: Hoare triple {15489#(<= main_~i~1 12)} assume true; {15489#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:09,150 INFO L273 TraceCheckUtils]: 43: Hoare triple {15489#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15489#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:09,151 INFO L273 TraceCheckUtils]: 44: Hoare triple {15489#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15490#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:09,151 INFO L273 TraceCheckUtils]: 45: Hoare triple {15490#(<= main_~i~1 13)} assume true; {15490#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:09,152 INFO L273 TraceCheckUtils]: 46: Hoare triple {15490#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15490#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:09,153 INFO L273 TraceCheckUtils]: 47: Hoare triple {15490#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15491#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:09,153 INFO L273 TraceCheckUtils]: 48: Hoare triple {15491#(<= main_~i~1 14)} assume true; {15491#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:09,154 INFO L273 TraceCheckUtils]: 49: Hoare triple {15491#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15491#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:09,154 INFO L273 TraceCheckUtils]: 50: Hoare triple {15491#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15492#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:09,155 INFO L273 TraceCheckUtils]: 51: Hoare triple {15492#(<= main_~i~1 15)} assume true; {15492#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:09,155 INFO L273 TraceCheckUtils]: 52: Hoare triple {15492#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15492#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:09,156 INFO L273 TraceCheckUtils]: 53: Hoare triple {15492#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15493#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:09,157 INFO L273 TraceCheckUtils]: 54: Hoare triple {15493#(<= main_~i~1 16)} assume true; {15493#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:09,157 INFO L273 TraceCheckUtils]: 55: Hoare triple {15493#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15493#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:09,158 INFO L273 TraceCheckUtils]: 56: Hoare triple {15493#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15494#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:09,158 INFO L273 TraceCheckUtils]: 57: Hoare triple {15494#(<= main_~i~1 17)} assume true; {15494#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:09,159 INFO L273 TraceCheckUtils]: 58: Hoare triple {15494#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15494#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:09,160 INFO L273 TraceCheckUtils]: 59: Hoare triple {15494#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15495#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:09,160 INFO L273 TraceCheckUtils]: 60: Hoare triple {15495#(<= main_~i~1 18)} assume true; {15495#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:09,161 INFO L273 TraceCheckUtils]: 61: Hoare triple {15495#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15495#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:09,161 INFO L273 TraceCheckUtils]: 62: Hoare triple {15495#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15496#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:09,162 INFO L273 TraceCheckUtils]: 63: Hoare triple {15496#(<= main_~i~1 19)} assume true; {15496#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:09,162 INFO L273 TraceCheckUtils]: 64: Hoare triple {15496#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15496#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:09,163 INFO L273 TraceCheckUtils]: 65: Hoare triple {15496#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15497#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:09,164 INFO L273 TraceCheckUtils]: 66: Hoare triple {15497#(<= main_~i~1 20)} assume true; {15497#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:09,164 INFO L273 TraceCheckUtils]: 67: Hoare triple {15497#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15497#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:09,165 INFO L273 TraceCheckUtils]: 68: Hoare triple {15497#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15498#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:09,165 INFO L273 TraceCheckUtils]: 69: Hoare triple {15498#(<= main_~i~1 21)} assume true; {15498#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:09,166 INFO L273 TraceCheckUtils]: 70: Hoare triple {15498#(<= main_~i~1 21)} assume !(~i~1 < 10000); {15476#false} is VALID [2018-11-14 18:55:09,166 INFO L256 TraceCheckUtils]: 71: Hoare triple {15476#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {15475#true} is VALID [2018-11-14 18:55:09,166 INFO L273 TraceCheckUtils]: 72: Hoare triple {15475#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15475#true} is VALID [2018-11-14 18:55:09,167 INFO L273 TraceCheckUtils]: 73: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,167 INFO L273 TraceCheckUtils]: 74: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,167 INFO L273 TraceCheckUtils]: 75: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,167 INFO L273 TraceCheckUtils]: 76: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,167 INFO L273 TraceCheckUtils]: 77: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,168 INFO L273 TraceCheckUtils]: 78: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,168 INFO L273 TraceCheckUtils]: 79: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,168 INFO L273 TraceCheckUtils]: 80: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,168 INFO L273 TraceCheckUtils]: 81: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,168 INFO L273 TraceCheckUtils]: 82: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,168 INFO L273 TraceCheckUtils]: 83: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,169 INFO L273 TraceCheckUtils]: 84: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,169 INFO L273 TraceCheckUtils]: 85: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,169 INFO L273 TraceCheckUtils]: 86: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,169 INFO L273 TraceCheckUtils]: 87: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,169 INFO L273 TraceCheckUtils]: 88: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,169 INFO L273 TraceCheckUtils]: 89: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,169 INFO L273 TraceCheckUtils]: 90: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,169 INFO L273 TraceCheckUtils]: 91: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,169 INFO L273 TraceCheckUtils]: 92: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,169 INFO L273 TraceCheckUtils]: 93: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,170 INFO L273 TraceCheckUtils]: 94: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,170 INFO L273 TraceCheckUtils]: 95: Hoare triple {15475#true} assume !(~i~0 < 10000); {15475#true} is VALID [2018-11-14 18:55:09,170 INFO L273 TraceCheckUtils]: 96: Hoare triple {15475#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15475#true} is VALID [2018-11-14 18:55:09,170 INFO L273 TraceCheckUtils]: 97: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,170 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {15475#true} {15476#false} #73#return; {15476#false} is VALID [2018-11-14 18:55:09,170 INFO L273 TraceCheckUtils]: 99: Hoare triple {15476#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {15476#false} is VALID [2018-11-14 18:55:09,170 INFO L256 TraceCheckUtils]: 100: Hoare triple {15476#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {15475#true} is VALID [2018-11-14 18:55:09,170 INFO L273 TraceCheckUtils]: 101: Hoare triple {15475#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15475#true} is VALID [2018-11-14 18:55:09,170 INFO L273 TraceCheckUtils]: 102: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,171 INFO L273 TraceCheckUtils]: 103: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,171 INFO L273 TraceCheckUtils]: 104: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,171 INFO L273 TraceCheckUtils]: 105: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,171 INFO L273 TraceCheckUtils]: 106: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,171 INFO L273 TraceCheckUtils]: 107: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,171 INFO L273 TraceCheckUtils]: 108: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,171 INFO L273 TraceCheckUtils]: 109: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,171 INFO L273 TraceCheckUtils]: 110: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,171 INFO L273 TraceCheckUtils]: 111: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,171 INFO L273 TraceCheckUtils]: 112: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,172 INFO L273 TraceCheckUtils]: 113: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,172 INFO L273 TraceCheckUtils]: 114: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,172 INFO L273 TraceCheckUtils]: 115: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,172 INFO L273 TraceCheckUtils]: 116: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,172 INFO L273 TraceCheckUtils]: 117: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,172 INFO L273 TraceCheckUtils]: 118: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,172 INFO L273 TraceCheckUtils]: 119: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,172 INFO L273 TraceCheckUtils]: 120: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,172 INFO L273 TraceCheckUtils]: 121: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,173 INFO L273 TraceCheckUtils]: 122: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,173 INFO L273 TraceCheckUtils]: 123: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,173 INFO L273 TraceCheckUtils]: 124: Hoare triple {15475#true} assume !(~i~0 < 10000); {15475#true} is VALID [2018-11-14 18:55:09,173 INFO L273 TraceCheckUtils]: 125: Hoare triple {15475#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15475#true} is VALID [2018-11-14 18:55:09,173 INFO L273 TraceCheckUtils]: 126: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,173 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {15475#true} {15476#false} #75#return; {15476#false} is VALID [2018-11-14 18:55:09,173 INFO L273 TraceCheckUtils]: 128: Hoare triple {15476#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {15476#false} is VALID [2018-11-14 18:55:09,173 INFO L273 TraceCheckUtils]: 129: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,173 INFO L273 TraceCheckUtils]: 130: Hoare triple {15476#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15476#false} is VALID [2018-11-14 18:55:09,173 INFO L273 TraceCheckUtils]: 131: Hoare triple {15476#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15476#false} is VALID [2018-11-14 18:55:09,174 INFO L273 TraceCheckUtils]: 132: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,174 INFO L273 TraceCheckUtils]: 133: Hoare triple {15476#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15476#false} is VALID [2018-11-14 18:55:09,174 INFO L273 TraceCheckUtils]: 134: Hoare triple {15476#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15476#false} is VALID [2018-11-14 18:55:09,174 INFO L273 TraceCheckUtils]: 135: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,174 INFO L273 TraceCheckUtils]: 136: Hoare triple {15476#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15476#false} is VALID [2018-11-14 18:55:09,174 INFO L273 TraceCheckUtils]: 137: Hoare triple {15476#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15476#false} is VALID [2018-11-14 18:55:09,174 INFO L273 TraceCheckUtils]: 138: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,174 INFO L273 TraceCheckUtils]: 139: Hoare triple {15476#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15476#false} is VALID [2018-11-14 18:55:09,174 INFO L273 TraceCheckUtils]: 140: Hoare triple {15476#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15476#false} is VALID [2018-11-14 18:55:09,175 INFO L273 TraceCheckUtils]: 141: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,175 INFO L273 TraceCheckUtils]: 142: Hoare triple {15476#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15476#false} is VALID [2018-11-14 18:55:09,175 INFO L273 TraceCheckUtils]: 143: Hoare triple {15476#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15476#false} is VALID [2018-11-14 18:55:09,175 INFO L273 TraceCheckUtils]: 144: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,175 INFO L273 TraceCheckUtils]: 145: Hoare triple {15476#false} assume !(~i~2 < 9999); {15476#false} is VALID [2018-11-14 18:55:09,175 INFO L273 TraceCheckUtils]: 146: Hoare triple {15476#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {15476#false} is VALID [2018-11-14 18:55:09,175 INFO L256 TraceCheckUtils]: 147: Hoare triple {15476#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {15475#true} is VALID [2018-11-14 18:55:09,175 INFO L273 TraceCheckUtils]: 148: Hoare triple {15475#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15475#true} is VALID [2018-11-14 18:55:09,175 INFO L273 TraceCheckUtils]: 149: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,175 INFO L273 TraceCheckUtils]: 150: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,176 INFO L273 TraceCheckUtils]: 151: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,176 INFO L273 TraceCheckUtils]: 152: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,176 INFO L273 TraceCheckUtils]: 153: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,176 INFO L273 TraceCheckUtils]: 154: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,176 INFO L273 TraceCheckUtils]: 155: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,176 INFO L273 TraceCheckUtils]: 156: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,176 INFO L273 TraceCheckUtils]: 157: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,176 INFO L273 TraceCheckUtils]: 158: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,176 INFO L273 TraceCheckUtils]: 159: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,177 INFO L273 TraceCheckUtils]: 160: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,177 INFO L273 TraceCheckUtils]: 161: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,177 INFO L273 TraceCheckUtils]: 162: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,177 INFO L273 TraceCheckUtils]: 163: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,177 INFO L273 TraceCheckUtils]: 164: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,177 INFO L273 TraceCheckUtils]: 165: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,177 INFO L273 TraceCheckUtils]: 166: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,177 INFO L273 TraceCheckUtils]: 167: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,177 INFO L273 TraceCheckUtils]: 168: Hoare triple {15475#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15475#true} is VALID [2018-11-14 18:55:09,178 INFO L273 TraceCheckUtils]: 169: Hoare triple {15475#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15475#true} is VALID [2018-11-14 18:55:09,178 INFO L273 TraceCheckUtils]: 170: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,178 INFO L273 TraceCheckUtils]: 171: Hoare triple {15475#true} assume !(~i~0 < 10000); {15475#true} is VALID [2018-11-14 18:55:09,178 INFO L273 TraceCheckUtils]: 172: Hoare triple {15475#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15475#true} is VALID [2018-11-14 18:55:09,178 INFO L273 TraceCheckUtils]: 173: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,178 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {15475#true} {15476#false} #77#return; {15476#false} is VALID [2018-11-14 18:55:09,178 INFO L273 TraceCheckUtils]: 175: Hoare triple {15476#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15476#false} is VALID [2018-11-14 18:55:09,178 INFO L273 TraceCheckUtils]: 176: Hoare triple {15476#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15476#false} is VALID [2018-11-14 18:55:09,178 INFO L273 TraceCheckUtils]: 177: Hoare triple {15476#false} assume !false; {15476#false} is VALID [2018-11-14 18:55:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 18:55:09,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:55:09,193 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-14 18:55:09,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:55:09,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:55:09,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:55:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:09,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:55:09,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {15475#true} call ULTIMATE.init(); {15475#true} is VALID [2018-11-14 18:55:09,603 INFO L273 TraceCheckUtils]: 1: Hoare triple {15475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15475#true} is VALID [2018-11-14 18:55:09,603 INFO L273 TraceCheckUtils]: 2: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 18:55:09,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15475#true} {15475#true} #69#return; {15475#true} is VALID [2018-11-14 18:55:09,603 INFO L256 TraceCheckUtils]: 4: Hoare triple {15475#true} call #t~ret13 := main(); {15475#true} is VALID [2018-11-14 18:55:09,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {15475#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15517#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:09,605 INFO L273 TraceCheckUtils]: 6: Hoare triple {15517#(<= main_~i~1 0)} assume true; {15517#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:09,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {15517#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15517#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:09,606 INFO L273 TraceCheckUtils]: 8: Hoare triple {15517#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15478#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:09,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {15478#(<= main_~i~1 1)} assume true; {15478#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:09,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {15478#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15478#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:09,607 INFO L273 TraceCheckUtils]: 11: Hoare triple {15478#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15479#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:09,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {15479#(<= main_~i~1 2)} assume true; {15479#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:09,608 INFO L273 TraceCheckUtils]: 13: Hoare triple {15479#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15479#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:09,608 INFO L273 TraceCheckUtils]: 14: Hoare triple {15479#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15480#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:09,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {15480#(<= main_~i~1 3)} assume true; {15480#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:09,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {15480#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15480#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:09,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {15480#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15481#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:09,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {15481#(<= main_~i~1 4)} assume true; {15481#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:09,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {15481#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15481#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:09,612 INFO L273 TraceCheckUtils]: 20: Hoare triple {15481#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15482#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:09,612 INFO L273 TraceCheckUtils]: 21: Hoare triple {15482#(<= main_~i~1 5)} assume true; {15482#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:09,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {15482#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15482#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:09,614 INFO L273 TraceCheckUtils]: 23: Hoare triple {15482#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15483#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:09,614 INFO L273 TraceCheckUtils]: 24: Hoare triple {15483#(<= main_~i~1 6)} assume true; {15483#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:09,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {15483#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15483#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:09,615 INFO L273 TraceCheckUtils]: 26: Hoare triple {15483#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15484#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:09,616 INFO L273 TraceCheckUtils]: 27: Hoare triple {15484#(<= main_~i~1 7)} assume true; {15484#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:09,616 INFO L273 TraceCheckUtils]: 28: Hoare triple {15484#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15484#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:09,617 INFO L273 TraceCheckUtils]: 29: Hoare triple {15484#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15485#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:09,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {15485#(<= main_~i~1 8)} assume true; {15485#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:09,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {15485#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15485#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:09,619 INFO L273 TraceCheckUtils]: 32: Hoare triple {15485#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15486#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:09,619 INFO L273 TraceCheckUtils]: 33: Hoare triple {15486#(<= main_~i~1 9)} assume true; {15486#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:09,620 INFO L273 TraceCheckUtils]: 34: Hoare triple {15486#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15486#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:09,621 INFO L273 TraceCheckUtils]: 35: Hoare triple {15486#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15487#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:09,621 INFO L273 TraceCheckUtils]: 36: Hoare triple {15487#(<= main_~i~1 10)} assume true; {15487#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:09,622 INFO L273 TraceCheckUtils]: 37: Hoare triple {15487#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15487#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:09,622 INFO L273 TraceCheckUtils]: 38: Hoare triple {15487#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15488#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:09,623 INFO L273 TraceCheckUtils]: 39: Hoare triple {15488#(<= main_~i~1 11)} assume true; {15488#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:09,623 INFO L273 TraceCheckUtils]: 40: Hoare triple {15488#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15488#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:09,624 INFO L273 TraceCheckUtils]: 41: Hoare triple {15488#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15489#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:09,625 INFO L273 TraceCheckUtils]: 42: Hoare triple {15489#(<= main_~i~1 12)} assume true; {15489#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:09,625 INFO L273 TraceCheckUtils]: 43: Hoare triple {15489#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15489#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:09,626 INFO L273 TraceCheckUtils]: 44: Hoare triple {15489#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15490#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:09,626 INFO L273 TraceCheckUtils]: 45: Hoare triple {15490#(<= main_~i~1 13)} assume true; {15490#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:09,627 INFO L273 TraceCheckUtils]: 46: Hoare triple {15490#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15490#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:09,628 INFO L273 TraceCheckUtils]: 47: Hoare triple {15490#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15491#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:09,628 INFO L273 TraceCheckUtils]: 48: Hoare triple {15491#(<= main_~i~1 14)} assume true; {15491#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:09,629 INFO L273 TraceCheckUtils]: 49: Hoare triple {15491#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15491#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:09,629 INFO L273 TraceCheckUtils]: 50: Hoare triple {15491#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15492#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:09,630 INFO L273 TraceCheckUtils]: 51: Hoare triple {15492#(<= main_~i~1 15)} assume true; {15492#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:09,630 INFO L273 TraceCheckUtils]: 52: Hoare triple {15492#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15492#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:09,631 INFO L273 TraceCheckUtils]: 53: Hoare triple {15492#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15493#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:09,632 INFO L273 TraceCheckUtils]: 54: Hoare triple {15493#(<= main_~i~1 16)} assume true; {15493#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:09,632 INFO L273 TraceCheckUtils]: 55: Hoare triple {15493#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15493#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:09,652 INFO L273 TraceCheckUtils]: 56: Hoare triple {15493#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15494#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:09,667 INFO L273 TraceCheckUtils]: 57: Hoare triple {15494#(<= main_~i~1 17)} assume true; {15494#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:09,676 INFO L273 TraceCheckUtils]: 58: Hoare triple {15494#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15494#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:09,676 INFO L273 TraceCheckUtils]: 59: Hoare triple {15494#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15495#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:09,677 INFO L273 TraceCheckUtils]: 60: Hoare triple {15495#(<= main_~i~1 18)} assume true; {15495#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:09,677 INFO L273 TraceCheckUtils]: 61: Hoare triple {15495#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15495#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:09,678 INFO L273 TraceCheckUtils]: 62: Hoare triple {15495#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15496#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:09,678 INFO L273 TraceCheckUtils]: 63: Hoare triple {15496#(<= main_~i~1 19)} assume true; {15496#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:09,678 INFO L273 TraceCheckUtils]: 64: Hoare triple {15496#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15496#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:09,679 INFO L273 TraceCheckUtils]: 65: Hoare triple {15496#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15497#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:09,679 INFO L273 TraceCheckUtils]: 66: Hoare triple {15497#(<= main_~i~1 20)} assume true; {15497#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:09,679 INFO L273 TraceCheckUtils]: 67: Hoare triple {15497#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15497#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:09,680 INFO L273 TraceCheckUtils]: 68: Hoare triple {15497#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15498#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:09,680 INFO L273 TraceCheckUtils]: 69: Hoare triple {15498#(<= main_~i~1 21)} assume true; {15498#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:09,681 INFO L273 TraceCheckUtils]: 70: Hoare triple {15498#(<= main_~i~1 21)} assume !(~i~1 < 10000); {15476#false} is VALID [2018-11-14 18:55:09,681 INFO L256 TraceCheckUtils]: 71: Hoare triple {15476#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {15476#false} is VALID [2018-11-14 18:55:09,681 INFO L273 TraceCheckUtils]: 72: Hoare triple {15476#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15476#false} is VALID [2018-11-14 18:55:09,682 INFO L273 TraceCheckUtils]: 73: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,682 INFO L273 TraceCheckUtils]: 74: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,682 INFO L273 TraceCheckUtils]: 75: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,682 INFO L273 TraceCheckUtils]: 76: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,682 INFO L273 TraceCheckUtils]: 77: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,683 INFO L273 TraceCheckUtils]: 78: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,683 INFO L273 TraceCheckUtils]: 79: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,683 INFO L273 TraceCheckUtils]: 80: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,683 INFO L273 TraceCheckUtils]: 81: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,683 INFO L273 TraceCheckUtils]: 82: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,683 INFO L273 TraceCheckUtils]: 83: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,684 INFO L273 TraceCheckUtils]: 84: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,684 INFO L273 TraceCheckUtils]: 85: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,684 INFO L273 TraceCheckUtils]: 86: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,684 INFO L273 TraceCheckUtils]: 87: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,684 INFO L273 TraceCheckUtils]: 88: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,684 INFO L273 TraceCheckUtils]: 89: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,684 INFO L273 TraceCheckUtils]: 90: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,685 INFO L273 TraceCheckUtils]: 91: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,685 INFO L273 TraceCheckUtils]: 92: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,685 INFO L273 TraceCheckUtils]: 93: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,685 INFO L273 TraceCheckUtils]: 94: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,685 INFO L273 TraceCheckUtils]: 95: Hoare triple {15476#false} assume !(~i~0 < 10000); {15476#false} is VALID [2018-11-14 18:55:09,685 INFO L273 TraceCheckUtils]: 96: Hoare triple {15476#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15476#false} is VALID [2018-11-14 18:55:09,685 INFO L273 TraceCheckUtils]: 97: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,685 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {15476#false} {15476#false} #73#return; {15476#false} is VALID [2018-11-14 18:55:09,685 INFO L273 TraceCheckUtils]: 99: Hoare triple {15476#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {15476#false} is VALID [2018-11-14 18:55:09,686 INFO L256 TraceCheckUtils]: 100: Hoare triple {15476#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {15476#false} is VALID [2018-11-14 18:55:09,686 INFO L273 TraceCheckUtils]: 101: Hoare triple {15476#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15476#false} is VALID [2018-11-14 18:55:09,686 INFO L273 TraceCheckUtils]: 102: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,686 INFO L273 TraceCheckUtils]: 103: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,686 INFO L273 TraceCheckUtils]: 104: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,686 INFO L273 TraceCheckUtils]: 105: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,686 INFO L273 TraceCheckUtils]: 106: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,686 INFO L273 TraceCheckUtils]: 107: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,686 INFO L273 TraceCheckUtils]: 108: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,686 INFO L273 TraceCheckUtils]: 109: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,687 INFO L273 TraceCheckUtils]: 110: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,687 INFO L273 TraceCheckUtils]: 111: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,687 INFO L273 TraceCheckUtils]: 112: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,687 INFO L273 TraceCheckUtils]: 113: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,687 INFO L273 TraceCheckUtils]: 114: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,687 INFO L273 TraceCheckUtils]: 115: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,687 INFO L273 TraceCheckUtils]: 116: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,687 INFO L273 TraceCheckUtils]: 117: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,687 INFO L273 TraceCheckUtils]: 118: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,687 INFO L273 TraceCheckUtils]: 119: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,688 INFO L273 TraceCheckUtils]: 120: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,688 INFO L273 TraceCheckUtils]: 121: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,688 INFO L273 TraceCheckUtils]: 122: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,688 INFO L273 TraceCheckUtils]: 123: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,688 INFO L273 TraceCheckUtils]: 124: Hoare triple {15476#false} assume !(~i~0 < 10000); {15476#false} is VALID [2018-11-14 18:55:09,688 INFO L273 TraceCheckUtils]: 125: Hoare triple {15476#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15476#false} is VALID [2018-11-14 18:55:09,688 INFO L273 TraceCheckUtils]: 126: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,688 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {15476#false} {15476#false} #75#return; {15476#false} is VALID [2018-11-14 18:55:09,688 INFO L273 TraceCheckUtils]: 128: Hoare triple {15476#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {15476#false} is VALID [2018-11-14 18:55:09,689 INFO L273 TraceCheckUtils]: 129: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,689 INFO L273 TraceCheckUtils]: 130: Hoare triple {15476#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15476#false} is VALID [2018-11-14 18:55:09,689 INFO L273 TraceCheckUtils]: 131: Hoare triple {15476#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15476#false} is VALID [2018-11-14 18:55:09,689 INFO L273 TraceCheckUtils]: 132: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,689 INFO L273 TraceCheckUtils]: 133: Hoare triple {15476#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15476#false} is VALID [2018-11-14 18:55:09,689 INFO L273 TraceCheckUtils]: 134: Hoare triple {15476#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15476#false} is VALID [2018-11-14 18:55:09,689 INFO L273 TraceCheckUtils]: 135: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,689 INFO L273 TraceCheckUtils]: 136: Hoare triple {15476#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15476#false} is VALID [2018-11-14 18:55:09,689 INFO L273 TraceCheckUtils]: 137: Hoare triple {15476#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15476#false} is VALID [2018-11-14 18:55:09,689 INFO L273 TraceCheckUtils]: 138: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,690 INFO L273 TraceCheckUtils]: 139: Hoare triple {15476#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15476#false} is VALID [2018-11-14 18:55:09,690 INFO L273 TraceCheckUtils]: 140: Hoare triple {15476#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15476#false} is VALID [2018-11-14 18:55:09,690 INFO L273 TraceCheckUtils]: 141: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,690 INFO L273 TraceCheckUtils]: 142: Hoare triple {15476#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15476#false} is VALID [2018-11-14 18:55:09,690 INFO L273 TraceCheckUtils]: 143: Hoare triple {15476#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15476#false} is VALID [2018-11-14 18:55:09,690 INFO L273 TraceCheckUtils]: 144: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,690 INFO L273 TraceCheckUtils]: 145: Hoare triple {15476#false} assume !(~i~2 < 9999); {15476#false} is VALID [2018-11-14 18:55:09,690 INFO L273 TraceCheckUtils]: 146: Hoare triple {15476#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {15476#false} is VALID [2018-11-14 18:55:09,690 INFO L256 TraceCheckUtils]: 147: Hoare triple {15476#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {15476#false} is VALID [2018-11-14 18:55:09,691 INFO L273 TraceCheckUtils]: 148: Hoare triple {15476#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15476#false} is VALID [2018-11-14 18:55:09,691 INFO L273 TraceCheckUtils]: 149: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,691 INFO L273 TraceCheckUtils]: 150: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,691 INFO L273 TraceCheckUtils]: 151: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,691 INFO L273 TraceCheckUtils]: 152: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,691 INFO L273 TraceCheckUtils]: 153: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,691 INFO L273 TraceCheckUtils]: 154: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,691 INFO L273 TraceCheckUtils]: 155: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,691 INFO L273 TraceCheckUtils]: 156: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,691 INFO L273 TraceCheckUtils]: 157: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,692 INFO L273 TraceCheckUtils]: 158: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,692 INFO L273 TraceCheckUtils]: 159: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,692 INFO L273 TraceCheckUtils]: 160: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,692 INFO L273 TraceCheckUtils]: 161: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,692 INFO L273 TraceCheckUtils]: 162: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,692 INFO L273 TraceCheckUtils]: 163: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,692 INFO L273 TraceCheckUtils]: 164: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,692 INFO L273 TraceCheckUtils]: 165: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,692 INFO L273 TraceCheckUtils]: 166: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,692 INFO L273 TraceCheckUtils]: 167: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,693 INFO L273 TraceCheckUtils]: 168: Hoare triple {15476#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15476#false} is VALID [2018-11-14 18:55:09,693 INFO L273 TraceCheckUtils]: 169: Hoare triple {15476#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15476#false} is VALID [2018-11-14 18:55:09,693 INFO L273 TraceCheckUtils]: 170: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,693 INFO L273 TraceCheckUtils]: 171: Hoare triple {15476#false} assume !(~i~0 < 10000); {15476#false} is VALID [2018-11-14 18:55:09,693 INFO L273 TraceCheckUtils]: 172: Hoare triple {15476#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15476#false} is VALID [2018-11-14 18:55:09,693 INFO L273 TraceCheckUtils]: 173: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 18:55:09,693 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {15476#false} {15476#false} #77#return; {15476#false} is VALID [2018-11-14 18:55:09,693 INFO L273 TraceCheckUtils]: 175: Hoare triple {15476#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15476#false} is VALID [2018-11-14 18:55:09,693 INFO L273 TraceCheckUtils]: 176: Hoare triple {15476#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15476#false} is VALID [2018-11-14 18:55:09,694 INFO L273 TraceCheckUtils]: 177: Hoare triple {15476#false} assume !false; {15476#false} is VALID [2018-11-14 18:55:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 18:55:09,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:55:09,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-14 18:55:09,730 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 178 [2018-11-14 18:55:09,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:55:09,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 18:55:09,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:09,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 18:55:09,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 18:55:09,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:55:09,833 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 25 states. [2018-11-14 18:55:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:10,520 INFO L93 Difference]: Finished difference Result 183 states and 191 transitions. [2018-11-14 18:55:10,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 18:55:10,520 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 178 [2018-11-14 18:55:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:55:10,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:55:10,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 123 transitions. [2018-11-14 18:55:10,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:55:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 123 transitions. [2018-11-14 18:55:10,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 123 transitions. [2018-11-14 18:55:10,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:10,644 INFO L225 Difference]: With dead ends: 183 [2018-11-14 18:55:10,644 INFO L226 Difference]: Without dead ends: 129 [2018-11-14 18:55:10,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 178 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-14 18:55:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-14 18:55:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-11-14 18:55:10,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:55:10,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 128 states. [2018-11-14 18:55:10,705 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 128 states. [2018-11-14 18:55:10,705 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 128 states. [2018-11-14 18:55:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:10,707 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-11-14 18:55:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2018-11-14 18:55:10,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:10,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:10,708 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 129 states. [2018-11-14 18:55:10,709 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 129 states. [2018-11-14 18:55:10,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:10,711 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-11-14 18:55:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2018-11-14 18:55:10,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:10,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:10,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:55:10,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:55:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-14 18:55:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2018-11-14 18:55:10,714 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 178 [2018-11-14 18:55:10,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:55:10,714 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2018-11-14 18:55:10,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 18:55:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-14 18:55:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-14 18:55:10,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:55:10,716 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 22, 22, 21, 21, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:55:10,716 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:55:10,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:55:10,717 INFO L82 PathProgramCache]: Analyzing trace with hash -277975097, now seen corresponding path program 21 times [2018-11-14 18:55:10,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:55:10,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:55:10,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:10,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:55:10,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:11,383 INFO L256 TraceCheckUtils]: 0: Hoare triple {16710#true} call ULTIMATE.init(); {16710#true} is VALID [2018-11-14 18:55:11,384 INFO L273 TraceCheckUtils]: 1: Hoare triple {16710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16710#true} is VALID [2018-11-14 18:55:11,384 INFO L273 TraceCheckUtils]: 2: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16710#true} {16710#true} #69#return; {16710#true} is VALID [2018-11-14 18:55:11,385 INFO L256 TraceCheckUtils]: 4: Hoare triple {16710#true} call #t~ret13 := main(); {16710#true} is VALID [2018-11-14 18:55:11,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {16710#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16712#(= main_~i~1 0)} is VALID [2018-11-14 18:55:11,386 INFO L273 TraceCheckUtils]: 6: Hoare triple {16712#(= main_~i~1 0)} assume true; {16712#(= main_~i~1 0)} is VALID [2018-11-14 18:55:11,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {16712#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16712#(= main_~i~1 0)} is VALID [2018-11-14 18:55:11,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {16712#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16713#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:11,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {16713#(<= main_~i~1 1)} assume true; {16713#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:11,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {16713#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16713#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:11,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {16713#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16714#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:11,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {16714#(<= main_~i~1 2)} assume true; {16714#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:11,388 INFO L273 TraceCheckUtils]: 13: Hoare triple {16714#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16714#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:11,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {16714#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16715#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:11,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {16715#(<= main_~i~1 3)} assume true; {16715#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:11,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {16715#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16715#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:11,390 INFO L273 TraceCheckUtils]: 17: Hoare triple {16715#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16716#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:11,391 INFO L273 TraceCheckUtils]: 18: Hoare triple {16716#(<= main_~i~1 4)} assume true; {16716#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:11,391 INFO L273 TraceCheckUtils]: 19: Hoare triple {16716#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16716#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:11,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {16716#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16717#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:11,392 INFO L273 TraceCheckUtils]: 21: Hoare triple {16717#(<= main_~i~1 5)} assume true; {16717#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:11,393 INFO L273 TraceCheckUtils]: 22: Hoare triple {16717#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16717#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:11,394 INFO L273 TraceCheckUtils]: 23: Hoare triple {16717#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16718#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:11,394 INFO L273 TraceCheckUtils]: 24: Hoare triple {16718#(<= main_~i~1 6)} assume true; {16718#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:11,395 INFO L273 TraceCheckUtils]: 25: Hoare triple {16718#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16718#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:11,395 INFO L273 TraceCheckUtils]: 26: Hoare triple {16718#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16719#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:11,396 INFO L273 TraceCheckUtils]: 27: Hoare triple {16719#(<= main_~i~1 7)} assume true; {16719#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:11,396 INFO L273 TraceCheckUtils]: 28: Hoare triple {16719#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16719#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:11,397 INFO L273 TraceCheckUtils]: 29: Hoare triple {16719#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16720#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:11,398 INFO L273 TraceCheckUtils]: 30: Hoare triple {16720#(<= main_~i~1 8)} assume true; {16720#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:11,398 INFO L273 TraceCheckUtils]: 31: Hoare triple {16720#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16720#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:11,399 INFO L273 TraceCheckUtils]: 32: Hoare triple {16720#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16721#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:11,399 INFO L273 TraceCheckUtils]: 33: Hoare triple {16721#(<= main_~i~1 9)} assume true; {16721#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:11,400 INFO L273 TraceCheckUtils]: 34: Hoare triple {16721#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16721#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:11,401 INFO L273 TraceCheckUtils]: 35: Hoare triple {16721#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16722#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:11,401 INFO L273 TraceCheckUtils]: 36: Hoare triple {16722#(<= main_~i~1 10)} assume true; {16722#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:11,402 INFO L273 TraceCheckUtils]: 37: Hoare triple {16722#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16722#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:11,402 INFO L273 TraceCheckUtils]: 38: Hoare triple {16722#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16723#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:11,403 INFO L273 TraceCheckUtils]: 39: Hoare triple {16723#(<= main_~i~1 11)} assume true; {16723#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:11,403 INFO L273 TraceCheckUtils]: 40: Hoare triple {16723#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16723#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:11,404 INFO L273 TraceCheckUtils]: 41: Hoare triple {16723#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16724#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:11,404 INFO L273 TraceCheckUtils]: 42: Hoare triple {16724#(<= main_~i~1 12)} assume true; {16724#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:11,405 INFO L273 TraceCheckUtils]: 43: Hoare triple {16724#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16724#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:11,406 INFO L273 TraceCheckUtils]: 44: Hoare triple {16724#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16725#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:11,406 INFO L273 TraceCheckUtils]: 45: Hoare triple {16725#(<= main_~i~1 13)} assume true; {16725#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:11,407 INFO L273 TraceCheckUtils]: 46: Hoare triple {16725#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16725#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:11,407 INFO L273 TraceCheckUtils]: 47: Hoare triple {16725#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16726#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:11,408 INFO L273 TraceCheckUtils]: 48: Hoare triple {16726#(<= main_~i~1 14)} assume true; {16726#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:11,408 INFO L273 TraceCheckUtils]: 49: Hoare triple {16726#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16726#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:11,409 INFO L273 TraceCheckUtils]: 50: Hoare triple {16726#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16727#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:11,410 INFO L273 TraceCheckUtils]: 51: Hoare triple {16727#(<= main_~i~1 15)} assume true; {16727#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:11,410 INFO L273 TraceCheckUtils]: 52: Hoare triple {16727#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16727#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:11,411 INFO L273 TraceCheckUtils]: 53: Hoare triple {16727#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16728#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:11,411 INFO L273 TraceCheckUtils]: 54: Hoare triple {16728#(<= main_~i~1 16)} assume true; {16728#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:11,412 INFO L273 TraceCheckUtils]: 55: Hoare triple {16728#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16728#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:11,413 INFO L273 TraceCheckUtils]: 56: Hoare triple {16728#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16729#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:11,413 INFO L273 TraceCheckUtils]: 57: Hoare triple {16729#(<= main_~i~1 17)} assume true; {16729#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:11,414 INFO L273 TraceCheckUtils]: 58: Hoare triple {16729#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16729#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:11,414 INFO L273 TraceCheckUtils]: 59: Hoare triple {16729#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16730#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:11,415 INFO L273 TraceCheckUtils]: 60: Hoare triple {16730#(<= main_~i~1 18)} assume true; {16730#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:11,415 INFO L273 TraceCheckUtils]: 61: Hoare triple {16730#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16730#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:11,416 INFO L273 TraceCheckUtils]: 62: Hoare triple {16730#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16731#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:11,417 INFO L273 TraceCheckUtils]: 63: Hoare triple {16731#(<= main_~i~1 19)} assume true; {16731#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:11,417 INFO L273 TraceCheckUtils]: 64: Hoare triple {16731#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16731#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:11,418 INFO L273 TraceCheckUtils]: 65: Hoare triple {16731#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16732#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:11,418 INFO L273 TraceCheckUtils]: 66: Hoare triple {16732#(<= main_~i~1 20)} assume true; {16732#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:11,419 INFO L273 TraceCheckUtils]: 67: Hoare triple {16732#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16732#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:11,420 INFO L273 TraceCheckUtils]: 68: Hoare triple {16732#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16733#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:11,420 INFO L273 TraceCheckUtils]: 69: Hoare triple {16733#(<= main_~i~1 21)} assume true; {16733#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:11,421 INFO L273 TraceCheckUtils]: 70: Hoare triple {16733#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16733#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:11,421 INFO L273 TraceCheckUtils]: 71: Hoare triple {16733#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16734#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:11,422 INFO L273 TraceCheckUtils]: 72: Hoare triple {16734#(<= main_~i~1 22)} assume true; {16734#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:11,422 INFO L273 TraceCheckUtils]: 73: Hoare triple {16734#(<= main_~i~1 22)} assume !(~i~1 < 10000); {16711#false} is VALID [2018-11-14 18:55:11,423 INFO L256 TraceCheckUtils]: 74: Hoare triple {16711#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {16710#true} is VALID [2018-11-14 18:55:11,423 INFO L273 TraceCheckUtils]: 75: Hoare triple {16710#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16710#true} is VALID [2018-11-14 18:55:11,423 INFO L273 TraceCheckUtils]: 76: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,423 INFO L273 TraceCheckUtils]: 77: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,423 INFO L273 TraceCheckUtils]: 78: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,424 INFO L273 TraceCheckUtils]: 79: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,424 INFO L273 TraceCheckUtils]: 80: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,424 INFO L273 TraceCheckUtils]: 81: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,424 INFO L273 TraceCheckUtils]: 82: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,424 INFO L273 TraceCheckUtils]: 83: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,424 INFO L273 TraceCheckUtils]: 84: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,425 INFO L273 TraceCheckUtils]: 85: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,425 INFO L273 TraceCheckUtils]: 86: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,425 INFO L273 TraceCheckUtils]: 87: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,425 INFO L273 TraceCheckUtils]: 88: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,425 INFO L273 TraceCheckUtils]: 89: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,426 INFO L273 TraceCheckUtils]: 90: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,426 INFO L273 TraceCheckUtils]: 91: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,426 INFO L273 TraceCheckUtils]: 92: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,426 INFO L273 TraceCheckUtils]: 93: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,426 INFO L273 TraceCheckUtils]: 94: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,426 INFO L273 TraceCheckUtils]: 95: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,426 INFO L273 TraceCheckUtils]: 96: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,426 INFO L273 TraceCheckUtils]: 97: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,426 INFO L273 TraceCheckUtils]: 98: Hoare triple {16710#true} assume !(~i~0 < 10000); {16710#true} is VALID [2018-11-14 18:55:11,426 INFO L273 TraceCheckUtils]: 99: Hoare triple {16710#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16710#true} is VALID [2018-11-14 18:55:11,427 INFO L273 TraceCheckUtils]: 100: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,427 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16710#true} {16711#false} #73#return; {16711#false} is VALID [2018-11-14 18:55:11,427 INFO L273 TraceCheckUtils]: 102: Hoare triple {16711#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {16711#false} is VALID [2018-11-14 18:55:11,427 INFO L256 TraceCheckUtils]: 103: Hoare triple {16711#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {16710#true} is VALID [2018-11-14 18:55:11,427 INFO L273 TraceCheckUtils]: 104: Hoare triple {16710#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16710#true} is VALID [2018-11-14 18:55:11,427 INFO L273 TraceCheckUtils]: 105: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,427 INFO L273 TraceCheckUtils]: 106: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,427 INFO L273 TraceCheckUtils]: 107: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,427 INFO L273 TraceCheckUtils]: 108: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,428 INFO L273 TraceCheckUtils]: 109: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,428 INFO L273 TraceCheckUtils]: 110: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,428 INFO L273 TraceCheckUtils]: 111: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,428 INFO L273 TraceCheckUtils]: 112: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,428 INFO L273 TraceCheckUtils]: 113: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,428 INFO L273 TraceCheckUtils]: 114: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,428 INFO L273 TraceCheckUtils]: 115: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,428 INFO L273 TraceCheckUtils]: 116: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,428 INFO L273 TraceCheckUtils]: 117: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,428 INFO L273 TraceCheckUtils]: 118: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,429 INFO L273 TraceCheckUtils]: 119: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,429 INFO L273 TraceCheckUtils]: 120: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,429 INFO L273 TraceCheckUtils]: 121: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,429 INFO L273 TraceCheckUtils]: 122: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,429 INFO L273 TraceCheckUtils]: 123: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,429 INFO L273 TraceCheckUtils]: 124: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,429 INFO L273 TraceCheckUtils]: 125: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,429 INFO L273 TraceCheckUtils]: 126: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,429 INFO L273 TraceCheckUtils]: 127: Hoare triple {16710#true} assume !(~i~0 < 10000); {16710#true} is VALID [2018-11-14 18:55:11,429 INFO L273 TraceCheckUtils]: 128: Hoare triple {16710#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16710#true} is VALID [2018-11-14 18:55:11,430 INFO L273 TraceCheckUtils]: 129: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,430 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {16710#true} {16711#false} #75#return; {16711#false} is VALID [2018-11-14 18:55:11,430 INFO L273 TraceCheckUtils]: 131: Hoare triple {16711#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {16711#false} is VALID [2018-11-14 18:55:11,430 INFO L273 TraceCheckUtils]: 132: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 18:55:11,430 INFO L273 TraceCheckUtils]: 133: Hoare triple {16711#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16711#false} is VALID [2018-11-14 18:55:11,430 INFO L273 TraceCheckUtils]: 134: Hoare triple {16711#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16711#false} is VALID [2018-11-14 18:55:11,431 INFO L273 TraceCheckUtils]: 135: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 18:55:11,431 INFO L273 TraceCheckUtils]: 136: Hoare triple {16711#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16711#false} is VALID [2018-11-14 18:55:11,431 INFO L273 TraceCheckUtils]: 137: Hoare triple {16711#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16711#false} is VALID [2018-11-14 18:55:11,431 INFO L273 TraceCheckUtils]: 138: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 18:55:11,431 INFO L273 TraceCheckUtils]: 139: Hoare triple {16711#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16711#false} is VALID [2018-11-14 18:55:11,431 INFO L273 TraceCheckUtils]: 140: Hoare triple {16711#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16711#false} is VALID [2018-11-14 18:55:11,432 INFO L273 TraceCheckUtils]: 141: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 18:55:11,432 INFO L273 TraceCheckUtils]: 142: Hoare triple {16711#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16711#false} is VALID [2018-11-14 18:55:11,432 INFO L273 TraceCheckUtils]: 143: Hoare triple {16711#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16711#false} is VALID [2018-11-14 18:55:11,432 INFO L273 TraceCheckUtils]: 144: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 18:55:11,432 INFO L273 TraceCheckUtils]: 145: Hoare triple {16711#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16711#false} is VALID [2018-11-14 18:55:11,432 INFO L273 TraceCheckUtils]: 146: Hoare triple {16711#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16711#false} is VALID [2018-11-14 18:55:11,433 INFO L273 TraceCheckUtils]: 147: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 18:55:11,433 INFO L273 TraceCheckUtils]: 148: Hoare triple {16711#false} assume !(~i~2 < 9999); {16711#false} is VALID [2018-11-14 18:55:11,433 INFO L273 TraceCheckUtils]: 149: Hoare triple {16711#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {16711#false} is VALID [2018-11-14 18:55:11,433 INFO L256 TraceCheckUtils]: 150: Hoare triple {16711#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {16710#true} is VALID [2018-11-14 18:55:11,433 INFO L273 TraceCheckUtils]: 151: Hoare triple {16710#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16710#true} is VALID [2018-11-14 18:55:11,433 INFO L273 TraceCheckUtils]: 152: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,434 INFO L273 TraceCheckUtils]: 153: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,434 INFO L273 TraceCheckUtils]: 154: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,434 INFO L273 TraceCheckUtils]: 155: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,434 INFO L273 TraceCheckUtils]: 156: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,434 INFO L273 TraceCheckUtils]: 157: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,434 INFO L273 TraceCheckUtils]: 158: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,434 INFO L273 TraceCheckUtils]: 159: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,435 INFO L273 TraceCheckUtils]: 160: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,435 INFO L273 TraceCheckUtils]: 161: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,435 INFO L273 TraceCheckUtils]: 162: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,435 INFO L273 TraceCheckUtils]: 163: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,435 INFO L273 TraceCheckUtils]: 164: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,435 INFO L273 TraceCheckUtils]: 165: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,436 INFO L273 TraceCheckUtils]: 166: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,436 INFO L273 TraceCheckUtils]: 167: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,436 INFO L273 TraceCheckUtils]: 168: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,436 INFO L273 TraceCheckUtils]: 169: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,436 INFO L273 TraceCheckUtils]: 170: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,436 INFO L273 TraceCheckUtils]: 171: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,436 INFO L273 TraceCheckUtils]: 172: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,437 INFO L273 TraceCheckUtils]: 173: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,437 INFO L273 TraceCheckUtils]: 174: Hoare triple {16710#true} assume !(~i~0 < 10000); {16710#true} is VALID [2018-11-14 18:55:11,437 INFO L273 TraceCheckUtils]: 175: Hoare triple {16710#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16710#true} is VALID [2018-11-14 18:55:11,437 INFO L273 TraceCheckUtils]: 176: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,437 INFO L268 TraceCheckUtils]: 177: Hoare quadruple {16710#true} {16711#false} #77#return; {16711#false} is VALID [2018-11-14 18:55:11,437 INFO L273 TraceCheckUtils]: 178: Hoare triple {16711#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16711#false} is VALID [2018-11-14 18:55:11,438 INFO L273 TraceCheckUtils]: 179: Hoare triple {16711#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16711#false} is VALID [2018-11-14 18:55:11,438 INFO L273 TraceCheckUtils]: 180: Hoare triple {16711#false} assume !false; {16711#false} is VALID [2018-11-14 18:55:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 18:55:11,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:55:11,458 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-14 18:55:11,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:55:11,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-14 18:55:11,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:55:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:11,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:55:11,886 INFO L256 TraceCheckUtils]: 0: Hoare triple {16710#true} call ULTIMATE.init(); {16710#true} is VALID [2018-11-14 18:55:11,886 INFO L273 TraceCheckUtils]: 1: Hoare triple {16710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16710#true} is VALID [2018-11-14 18:55:11,886 INFO L273 TraceCheckUtils]: 2: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,887 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16710#true} {16710#true} #69#return; {16710#true} is VALID [2018-11-14 18:55:11,887 INFO L256 TraceCheckUtils]: 4: Hoare triple {16710#true} call #t~ret13 := main(); {16710#true} is VALID [2018-11-14 18:55:11,887 INFO L273 TraceCheckUtils]: 5: Hoare triple {16710#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16710#true} is VALID [2018-11-14 18:55:11,887 INFO L273 TraceCheckUtils]: 6: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,887 INFO L273 TraceCheckUtils]: 8: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,888 INFO L273 TraceCheckUtils]: 9: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,888 INFO L273 TraceCheckUtils]: 10: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,888 INFO L273 TraceCheckUtils]: 13: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,888 INFO L273 TraceCheckUtils]: 14: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,889 INFO L273 TraceCheckUtils]: 19: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,889 INFO L273 TraceCheckUtils]: 21: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,889 INFO L273 TraceCheckUtils]: 22: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,889 INFO L273 TraceCheckUtils]: 23: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,889 INFO L273 TraceCheckUtils]: 24: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,889 INFO L273 TraceCheckUtils]: 25: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,889 INFO L273 TraceCheckUtils]: 26: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,889 INFO L273 TraceCheckUtils]: 27: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,890 INFO L273 TraceCheckUtils]: 28: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,890 INFO L273 TraceCheckUtils]: 29: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,890 INFO L273 TraceCheckUtils]: 30: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,890 INFO L273 TraceCheckUtils]: 31: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,890 INFO L273 TraceCheckUtils]: 32: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,890 INFO L273 TraceCheckUtils]: 33: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,890 INFO L273 TraceCheckUtils]: 34: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,890 INFO L273 TraceCheckUtils]: 35: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,891 INFO L273 TraceCheckUtils]: 36: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,891 INFO L273 TraceCheckUtils]: 37: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,891 INFO L273 TraceCheckUtils]: 38: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,891 INFO L273 TraceCheckUtils]: 39: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,891 INFO L273 TraceCheckUtils]: 40: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,891 INFO L273 TraceCheckUtils]: 41: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,891 INFO L273 TraceCheckUtils]: 42: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,892 INFO L273 TraceCheckUtils]: 43: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,892 INFO L273 TraceCheckUtils]: 44: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,892 INFO L273 TraceCheckUtils]: 45: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,892 INFO L273 TraceCheckUtils]: 46: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,892 INFO L273 TraceCheckUtils]: 47: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,892 INFO L273 TraceCheckUtils]: 48: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,892 INFO L273 TraceCheckUtils]: 49: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,893 INFO L273 TraceCheckUtils]: 50: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,893 INFO L273 TraceCheckUtils]: 51: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,893 INFO L273 TraceCheckUtils]: 52: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,893 INFO L273 TraceCheckUtils]: 53: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,893 INFO L273 TraceCheckUtils]: 54: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,893 INFO L273 TraceCheckUtils]: 55: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,893 INFO L273 TraceCheckUtils]: 56: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,894 INFO L273 TraceCheckUtils]: 57: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,894 INFO L273 TraceCheckUtils]: 58: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,894 INFO L273 TraceCheckUtils]: 59: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,894 INFO L273 TraceCheckUtils]: 60: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,894 INFO L273 TraceCheckUtils]: 61: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,894 INFO L273 TraceCheckUtils]: 62: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,894 INFO L273 TraceCheckUtils]: 63: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,895 INFO L273 TraceCheckUtils]: 64: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,895 INFO L273 TraceCheckUtils]: 65: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,895 INFO L273 TraceCheckUtils]: 66: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,895 INFO L273 TraceCheckUtils]: 67: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,914 INFO L273 TraceCheckUtils]: 68: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,914 INFO L273 TraceCheckUtils]: 69: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,915 INFO L273 TraceCheckUtils]: 70: Hoare triple {16710#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16710#true} is VALID [2018-11-14 18:55:11,915 INFO L273 TraceCheckUtils]: 71: Hoare triple {16710#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16710#true} is VALID [2018-11-14 18:55:11,915 INFO L273 TraceCheckUtils]: 72: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,915 INFO L273 TraceCheckUtils]: 73: Hoare triple {16710#true} assume !(~i~1 < 10000); {16710#true} is VALID [2018-11-14 18:55:11,915 INFO L256 TraceCheckUtils]: 74: Hoare triple {16710#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {16710#true} is VALID [2018-11-14 18:55:11,915 INFO L273 TraceCheckUtils]: 75: Hoare triple {16710#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16710#true} is VALID [2018-11-14 18:55:11,915 INFO L273 TraceCheckUtils]: 76: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,916 INFO L273 TraceCheckUtils]: 77: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,916 INFO L273 TraceCheckUtils]: 78: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,916 INFO L273 TraceCheckUtils]: 79: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,916 INFO L273 TraceCheckUtils]: 80: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,916 INFO L273 TraceCheckUtils]: 81: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,916 INFO L273 TraceCheckUtils]: 82: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,916 INFO L273 TraceCheckUtils]: 83: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,917 INFO L273 TraceCheckUtils]: 84: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,917 INFO L273 TraceCheckUtils]: 85: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,917 INFO L273 TraceCheckUtils]: 86: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,917 INFO L273 TraceCheckUtils]: 87: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,917 INFO L273 TraceCheckUtils]: 88: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,917 INFO L273 TraceCheckUtils]: 89: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,917 INFO L273 TraceCheckUtils]: 90: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,918 INFO L273 TraceCheckUtils]: 91: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,918 INFO L273 TraceCheckUtils]: 92: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,918 INFO L273 TraceCheckUtils]: 93: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,918 INFO L273 TraceCheckUtils]: 94: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,918 INFO L273 TraceCheckUtils]: 95: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,918 INFO L273 TraceCheckUtils]: 96: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,918 INFO L273 TraceCheckUtils]: 97: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,919 INFO L273 TraceCheckUtils]: 98: Hoare triple {16710#true} assume !(~i~0 < 10000); {16710#true} is VALID [2018-11-14 18:55:11,919 INFO L273 TraceCheckUtils]: 99: Hoare triple {16710#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16710#true} is VALID [2018-11-14 18:55:11,919 INFO L273 TraceCheckUtils]: 100: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,919 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16710#true} {16710#true} #73#return; {16710#true} is VALID [2018-11-14 18:55:11,919 INFO L273 TraceCheckUtils]: 102: Hoare triple {16710#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {16710#true} is VALID [2018-11-14 18:55:11,919 INFO L256 TraceCheckUtils]: 103: Hoare triple {16710#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {16710#true} is VALID [2018-11-14 18:55:11,919 INFO L273 TraceCheckUtils]: 104: Hoare triple {16710#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16710#true} is VALID [2018-11-14 18:55:11,919 INFO L273 TraceCheckUtils]: 105: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,919 INFO L273 TraceCheckUtils]: 106: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,920 INFO L273 TraceCheckUtils]: 107: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,920 INFO L273 TraceCheckUtils]: 108: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,920 INFO L273 TraceCheckUtils]: 109: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,920 INFO L273 TraceCheckUtils]: 110: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,920 INFO L273 TraceCheckUtils]: 111: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,920 INFO L273 TraceCheckUtils]: 112: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,920 INFO L273 TraceCheckUtils]: 113: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,920 INFO L273 TraceCheckUtils]: 114: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,920 INFO L273 TraceCheckUtils]: 115: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,920 INFO L273 TraceCheckUtils]: 116: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,921 INFO L273 TraceCheckUtils]: 117: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,921 INFO L273 TraceCheckUtils]: 118: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,921 INFO L273 TraceCheckUtils]: 119: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,921 INFO L273 TraceCheckUtils]: 120: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,921 INFO L273 TraceCheckUtils]: 121: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,921 INFO L273 TraceCheckUtils]: 122: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,921 INFO L273 TraceCheckUtils]: 123: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,921 INFO L273 TraceCheckUtils]: 124: Hoare triple {16710#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16710#true} is VALID [2018-11-14 18:55:11,921 INFO L273 TraceCheckUtils]: 125: Hoare triple {16710#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16710#true} is VALID [2018-11-14 18:55:11,921 INFO L273 TraceCheckUtils]: 126: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,922 INFO L273 TraceCheckUtils]: 127: Hoare triple {16710#true} assume !(~i~0 < 10000); {16710#true} is VALID [2018-11-14 18:55:11,922 INFO L273 TraceCheckUtils]: 128: Hoare triple {16710#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16710#true} is VALID [2018-11-14 18:55:11,922 INFO L273 TraceCheckUtils]: 129: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 18:55:11,922 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {16710#true} {16710#true} #75#return; {16710#true} is VALID [2018-11-14 18:55:11,924 INFO L273 TraceCheckUtils]: 131: Hoare triple {16710#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17131#(<= main_~i~2 0)} is VALID [2018-11-14 18:55:11,925 INFO L273 TraceCheckUtils]: 132: Hoare triple {17131#(<= main_~i~2 0)} assume true; {17131#(<= main_~i~2 0)} is VALID [2018-11-14 18:55:11,926 INFO L273 TraceCheckUtils]: 133: Hoare triple {17131#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17131#(<= main_~i~2 0)} is VALID [2018-11-14 18:55:11,928 INFO L273 TraceCheckUtils]: 134: Hoare triple {17131#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17141#(<= main_~i~2 1)} is VALID [2018-11-14 18:55:11,928 INFO L273 TraceCheckUtils]: 135: Hoare triple {17141#(<= main_~i~2 1)} assume true; {17141#(<= main_~i~2 1)} is VALID [2018-11-14 18:55:11,930 INFO L273 TraceCheckUtils]: 136: Hoare triple {17141#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17141#(<= main_~i~2 1)} is VALID [2018-11-14 18:55:11,930 INFO L273 TraceCheckUtils]: 137: Hoare triple {17141#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17151#(<= main_~i~2 2)} is VALID [2018-11-14 18:55:11,932 INFO L273 TraceCheckUtils]: 138: Hoare triple {17151#(<= main_~i~2 2)} assume true; {17151#(<= main_~i~2 2)} is VALID [2018-11-14 18:55:11,932 INFO L273 TraceCheckUtils]: 139: Hoare triple {17151#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17151#(<= main_~i~2 2)} is VALID [2018-11-14 18:55:11,934 INFO L273 TraceCheckUtils]: 140: Hoare triple {17151#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17161#(<= main_~i~2 3)} is VALID [2018-11-14 18:55:11,934 INFO L273 TraceCheckUtils]: 141: Hoare triple {17161#(<= main_~i~2 3)} assume true; {17161#(<= main_~i~2 3)} is VALID [2018-11-14 18:55:11,936 INFO L273 TraceCheckUtils]: 142: Hoare triple {17161#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17161#(<= main_~i~2 3)} is VALID [2018-11-14 18:55:11,936 INFO L273 TraceCheckUtils]: 143: Hoare triple {17161#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17171#(<= main_~i~2 4)} is VALID [2018-11-14 18:55:11,938 INFO L273 TraceCheckUtils]: 144: Hoare triple {17171#(<= main_~i~2 4)} assume true; {17171#(<= main_~i~2 4)} is VALID [2018-11-14 18:55:11,938 INFO L273 TraceCheckUtils]: 145: Hoare triple {17171#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17171#(<= main_~i~2 4)} is VALID [2018-11-14 18:55:11,941 INFO L273 TraceCheckUtils]: 146: Hoare triple {17171#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17181#(<= main_~i~2 5)} is VALID [2018-11-14 18:55:11,941 INFO L273 TraceCheckUtils]: 147: Hoare triple {17181#(<= main_~i~2 5)} assume true; {17181#(<= main_~i~2 5)} is VALID [2018-11-14 18:55:11,943 INFO L273 TraceCheckUtils]: 148: Hoare triple {17181#(<= main_~i~2 5)} assume !(~i~2 < 9999); {16711#false} is VALID [2018-11-14 18:55:11,943 INFO L273 TraceCheckUtils]: 149: Hoare triple {16711#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {16711#false} is VALID [2018-11-14 18:55:11,943 INFO L256 TraceCheckUtils]: 150: Hoare triple {16711#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {16711#false} is VALID [2018-11-14 18:55:11,943 INFO L273 TraceCheckUtils]: 151: Hoare triple {16711#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16711#false} is VALID [2018-11-14 18:55:11,943 INFO L273 TraceCheckUtils]: 152: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 18:55:11,943 INFO L273 TraceCheckUtils]: 153: Hoare triple {16711#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16711#false} is VALID [2018-11-14 18:55:11,943 INFO L273 TraceCheckUtils]: 154: Hoare triple {16711#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16711#false} is VALID [2018-11-14 18:55:11,943 INFO L273 TraceCheckUtils]: 155: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 18:55:11,944 INFO L273 TraceCheckUtils]: 156: Hoare triple {16711#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16711#false} is VALID [2018-11-14 18:55:11,944 INFO L273 TraceCheckUtils]: 157: Hoare triple {16711#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16711#false} is VALID [2018-11-14 18:55:11,944 INFO L273 TraceCheckUtils]: 158: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 18:55:11,944 INFO L273 TraceCheckUtils]: 159: Hoare triple {16711#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16711#false} is VALID [2018-11-14 18:55:11,944 INFO L273 TraceCheckUtils]: 160: Hoare triple {16711#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16711#false} is VALID [2018-11-14 18:55:11,944 INFO L273 TraceCheckUtils]: 161: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 18:55:11,944 INFO L273 TraceCheckUtils]: 162: Hoare triple {16711#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16711#false} is VALID [2018-11-14 18:55:11,944 INFO L273 TraceCheckUtils]: 163: Hoare triple {16711#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16711#false} is VALID [2018-11-14 18:55:11,944 INFO L273 TraceCheckUtils]: 164: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 18:55:11,944 INFO L273 TraceCheckUtils]: 165: Hoare triple {16711#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16711#false} is VALID [2018-11-14 18:55:11,945 INFO L273 TraceCheckUtils]: 166: Hoare triple {16711#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16711#false} is VALID [2018-11-14 18:55:11,945 INFO L273 TraceCheckUtils]: 167: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 18:55:11,945 INFO L273 TraceCheckUtils]: 168: Hoare triple {16711#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16711#false} is VALID [2018-11-14 18:55:11,945 INFO L273 TraceCheckUtils]: 169: Hoare triple {16711#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16711#false} is VALID [2018-11-14 18:55:11,945 INFO L273 TraceCheckUtils]: 170: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 18:55:11,945 INFO L273 TraceCheckUtils]: 171: Hoare triple {16711#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16711#false} is VALID [2018-11-14 18:55:11,945 INFO L273 TraceCheckUtils]: 172: Hoare triple {16711#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16711#false} is VALID [2018-11-14 18:55:11,945 INFO L273 TraceCheckUtils]: 173: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 18:55:11,945 INFO L273 TraceCheckUtils]: 174: Hoare triple {16711#false} assume !(~i~0 < 10000); {16711#false} is VALID [2018-11-14 18:55:11,945 INFO L273 TraceCheckUtils]: 175: Hoare triple {16711#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16711#false} is VALID [2018-11-14 18:55:11,946 INFO L273 TraceCheckUtils]: 176: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 18:55:11,946 INFO L268 TraceCheckUtils]: 177: Hoare quadruple {16711#false} {16711#false} #77#return; {16711#false} is VALID [2018-11-14 18:55:11,946 INFO L273 TraceCheckUtils]: 178: Hoare triple {16711#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16711#false} is VALID [2018-11-14 18:55:11,946 INFO L273 TraceCheckUtils]: 179: Hoare triple {16711#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16711#false} is VALID [2018-11-14 18:55:11,946 INFO L273 TraceCheckUtils]: 180: Hoare triple {16711#false} assume !false; {16711#false} is VALID [2018-11-14 18:55:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 362 proven. 40 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2018-11-14 18:55:11,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:55:11,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 8] total 31 [2018-11-14 18:55:11,981 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 181 [2018-11-14 18:55:11,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:55:11,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 18:55:12,105 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-14 18:55:12,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 18:55:12,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 18:55:12,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2018-11-14 18:55:12,107 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand 31 states. [2018-11-14 18:55:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:13,654 INFO L93 Difference]: Finished difference Result 190 states and 199 transitions. [2018-11-14 18:55:13,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 18:55:13,654 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 181 [2018-11-14 18:55:13,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:55:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:55:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 145 transitions. [2018-11-14 18:55:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:55:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 145 transitions. [2018-11-14 18:55:13,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 145 transitions. [2018-11-14 18:55:13,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:13,792 INFO L225 Difference]: With dead ends: 190 [2018-11-14 18:55:13,792 INFO L226 Difference]: Without dead ends: 136 [2018-11-14 18:55:13,793 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2018-11-14 18:55:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-14 18:55:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-11-14 18:55:13,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:55:13,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 134 states. [2018-11-14 18:55:13,844 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 134 states. [2018-11-14 18:55:13,844 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 134 states. [2018-11-14 18:55:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:13,847 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2018-11-14 18:55:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2018-11-14 18:55:13,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:13,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:13,847 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 136 states. [2018-11-14 18:55:13,848 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 136 states. [2018-11-14 18:55:13,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:13,850 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2018-11-14 18:55:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2018-11-14 18:55:13,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:13,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:13,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:55:13,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:55:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-14 18:55:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2018-11-14 18:55:13,853 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 181 [2018-11-14 18:55:13,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:55:13,854 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2018-11-14 18:55:13,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 18:55:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2018-11-14 18:55:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-14 18:55:13,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:55:13,855 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 21, 21, 7, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:55:13,856 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:55:13,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:55:13,856 INFO L82 PathProgramCache]: Analyzing trace with hash 644913055, now seen corresponding path program 22 times [2018-11-14 18:55:13,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:55:13,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:55:13,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:13,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:55:13,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:14,771 INFO L256 TraceCheckUtils]: 0: Hoare triple {17991#true} call ULTIMATE.init(); {17991#true} is VALID [2018-11-14 18:55:14,771 INFO L273 TraceCheckUtils]: 1: Hoare triple {17991#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17991#true} is VALID [2018-11-14 18:55:14,772 INFO L273 TraceCheckUtils]: 2: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,772 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17991#true} {17991#true} #69#return; {17991#true} is VALID [2018-11-14 18:55:14,772 INFO L256 TraceCheckUtils]: 4: Hoare triple {17991#true} call #t~ret13 := main(); {17991#true} is VALID [2018-11-14 18:55:14,772 INFO L273 TraceCheckUtils]: 5: Hoare triple {17991#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17993#(= main_~i~1 0)} is VALID [2018-11-14 18:55:14,773 INFO L273 TraceCheckUtils]: 6: Hoare triple {17993#(= main_~i~1 0)} assume true; {17993#(= main_~i~1 0)} is VALID [2018-11-14 18:55:14,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {17993#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17993#(= main_~i~1 0)} is VALID [2018-11-14 18:55:14,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {17993#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17994#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:14,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {17994#(<= main_~i~1 1)} assume true; {17994#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:14,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {17994#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17994#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:14,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {17994#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17995#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:14,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {17995#(<= main_~i~1 2)} assume true; {17995#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:14,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {17995#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17995#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:14,776 INFO L273 TraceCheckUtils]: 14: Hoare triple {17995#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17996#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:14,777 INFO L273 TraceCheckUtils]: 15: Hoare triple {17996#(<= main_~i~1 3)} assume true; {17996#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:14,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {17996#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17996#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:14,778 INFO L273 TraceCheckUtils]: 17: Hoare triple {17996#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17997#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:14,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {17997#(<= main_~i~1 4)} assume true; {17997#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:14,779 INFO L273 TraceCheckUtils]: 19: Hoare triple {17997#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17997#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:14,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {17997#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17998#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:14,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {17998#(<= main_~i~1 5)} assume true; {17998#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:14,781 INFO L273 TraceCheckUtils]: 22: Hoare triple {17998#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17998#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:14,781 INFO L273 TraceCheckUtils]: 23: Hoare triple {17998#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17999#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:14,782 INFO L273 TraceCheckUtils]: 24: Hoare triple {17999#(<= main_~i~1 6)} assume true; {17999#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:14,782 INFO L273 TraceCheckUtils]: 25: Hoare triple {17999#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17999#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:14,783 INFO L273 TraceCheckUtils]: 26: Hoare triple {17999#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18000#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:14,784 INFO L273 TraceCheckUtils]: 27: Hoare triple {18000#(<= main_~i~1 7)} assume true; {18000#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:14,784 INFO L273 TraceCheckUtils]: 28: Hoare triple {18000#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18000#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:14,785 INFO L273 TraceCheckUtils]: 29: Hoare triple {18000#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18001#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:14,785 INFO L273 TraceCheckUtils]: 30: Hoare triple {18001#(<= main_~i~1 8)} assume true; {18001#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:14,786 INFO L273 TraceCheckUtils]: 31: Hoare triple {18001#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18001#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:14,787 INFO L273 TraceCheckUtils]: 32: Hoare triple {18001#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18002#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:14,787 INFO L273 TraceCheckUtils]: 33: Hoare triple {18002#(<= main_~i~1 9)} assume true; {18002#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:14,788 INFO L273 TraceCheckUtils]: 34: Hoare triple {18002#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18002#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:14,788 INFO L273 TraceCheckUtils]: 35: Hoare triple {18002#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18003#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:14,789 INFO L273 TraceCheckUtils]: 36: Hoare triple {18003#(<= main_~i~1 10)} assume true; {18003#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:14,789 INFO L273 TraceCheckUtils]: 37: Hoare triple {18003#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18003#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:14,790 INFO L273 TraceCheckUtils]: 38: Hoare triple {18003#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18004#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:14,791 INFO L273 TraceCheckUtils]: 39: Hoare triple {18004#(<= main_~i~1 11)} assume true; {18004#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:14,791 INFO L273 TraceCheckUtils]: 40: Hoare triple {18004#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18004#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:14,792 INFO L273 TraceCheckUtils]: 41: Hoare triple {18004#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18005#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:14,792 INFO L273 TraceCheckUtils]: 42: Hoare triple {18005#(<= main_~i~1 12)} assume true; {18005#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:14,793 INFO L273 TraceCheckUtils]: 43: Hoare triple {18005#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18005#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:14,794 INFO L273 TraceCheckUtils]: 44: Hoare triple {18005#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18006#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:14,794 INFO L273 TraceCheckUtils]: 45: Hoare triple {18006#(<= main_~i~1 13)} assume true; {18006#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:14,795 INFO L273 TraceCheckUtils]: 46: Hoare triple {18006#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18006#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:14,795 INFO L273 TraceCheckUtils]: 47: Hoare triple {18006#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18007#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:14,796 INFO L273 TraceCheckUtils]: 48: Hoare triple {18007#(<= main_~i~1 14)} assume true; {18007#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:14,796 INFO L273 TraceCheckUtils]: 49: Hoare triple {18007#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18007#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:14,797 INFO L273 TraceCheckUtils]: 50: Hoare triple {18007#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18008#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:14,798 INFO L273 TraceCheckUtils]: 51: Hoare triple {18008#(<= main_~i~1 15)} assume true; {18008#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:14,798 INFO L273 TraceCheckUtils]: 52: Hoare triple {18008#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18008#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:14,799 INFO L273 TraceCheckUtils]: 53: Hoare triple {18008#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18009#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:14,799 INFO L273 TraceCheckUtils]: 54: Hoare triple {18009#(<= main_~i~1 16)} assume true; {18009#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:14,800 INFO L273 TraceCheckUtils]: 55: Hoare triple {18009#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18009#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:14,800 INFO L273 TraceCheckUtils]: 56: Hoare triple {18009#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18010#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:14,801 INFO L273 TraceCheckUtils]: 57: Hoare triple {18010#(<= main_~i~1 17)} assume true; {18010#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:14,801 INFO L273 TraceCheckUtils]: 58: Hoare triple {18010#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18010#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:14,802 INFO L273 TraceCheckUtils]: 59: Hoare triple {18010#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18011#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:14,803 INFO L273 TraceCheckUtils]: 60: Hoare triple {18011#(<= main_~i~1 18)} assume true; {18011#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:14,803 INFO L273 TraceCheckUtils]: 61: Hoare triple {18011#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18011#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:14,804 INFO L273 TraceCheckUtils]: 62: Hoare triple {18011#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18012#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:14,804 INFO L273 TraceCheckUtils]: 63: Hoare triple {18012#(<= main_~i~1 19)} assume true; {18012#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:14,805 INFO L273 TraceCheckUtils]: 64: Hoare triple {18012#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18012#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:14,806 INFO L273 TraceCheckUtils]: 65: Hoare triple {18012#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18013#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:14,806 INFO L273 TraceCheckUtils]: 66: Hoare triple {18013#(<= main_~i~1 20)} assume true; {18013#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:14,807 INFO L273 TraceCheckUtils]: 67: Hoare triple {18013#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18013#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:14,807 INFO L273 TraceCheckUtils]: 68: Hoare triple {18013#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18014#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:14,808 INFO L273 TraceCheckUtils]: 69: Hoare triple {18014#(<= main_~i~1 21)} assume true; {18014#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:14,808 INFO L273 TraceCheckUtils]: 70: Hoare triple {18014#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18014#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:14,809 INFO L273 TraceCheckUtils]: 71: Hoare triple {18014#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18015#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:14,810 INFO L273 TraceCheckUtils]: 72: Hoare triple {18015#(<= main_~i~1 22)} assume true; {18015#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:14,810 INFO L273 TraceCheckUtils]: 73: Hoare triple {18015#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18015#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:14,811 INFO L273 TraceCheckUtils]: 74: Hoare triple {18015#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18016#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:14,811 INFO L273 TraceCheckUtils]: 75: Hoare triple {18016#(<= main_~i~1 23)} assume true; {18016#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:14,812 INFO L273 TraceCheckUtils]: 76: Hoare triple {18016#(<= main_~i~1 23)} assume !(~i~1 < 10000); {17992#false} is VALID [2018-11-14 18:55:14,812 INFO L256 TraceCheckUtils]: 77: Hoare triple {17992#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {17991#true} is VALID [2018-11-14 18:55:14,812 INFO L273 TraceCheckUtils]: 78: Hoare triple {17991#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17991#true} is VALID [2018-11-14 18:55:14,813 INFO L273 TraceCheckUtils]: 79: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,813 INFO L273 TraceCheckUtils]: 80: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,813 INFO L273 TraceCheckUtils]: 81: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,813 INFO L273 TraceCheckUtils]: 82: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,813 INFO L273 TraceCheckUtils]: 83: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,813 INFO L273 TraceCheckUtils]: 84: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,814 INFO L273 TraceCheckUtils]: 85: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,814 INFO L273 TraceCheckUtils]: 86: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,814 INFO L273 TraceCheckUtils]: 87: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,814 INFO L273 TraceCheckUtils]: 88: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,814 INFO L273 TraceCheckUtils]: 89: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,815 INFO L273 TraceCheckUtils]: 90: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,815 INFO L273 TraceCheckUtils]: 91: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,815 INFO L273 TraceCheckUtils]: 92: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,815 INFO L273 TraceCheckUtils]: 93: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,815 INFO L273 TraceCheckUtils]: 94: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,815 INFO L273 TraceCheckUtils]: 95: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,816 INFO L273 TraceCheckUtils]: 96: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,816 INFO L273 TraceCheckUtils]: 97: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,816 INFO L273 TraceCheckUtils]: 98: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,816 INFO L273 TraceCheckUtils]: 99: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,816 INFO L273 TraceCheckUtils]: 100: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,817 INFO L273 TraceCheckUtils]: 101: Hoare triple {17991#true} assume !(~i~0 < 10000); {17991#true} is VALID [2018-11-14 18:55:14,817 INFO L273 TraceCheckUtils]: 102: Hoare triple {17991#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17991#true} is VALID [2018-11-14 18:55:14,817 INFO L273 TraceCheckUtils]: 103: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,817 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {17991#true} {17992#false} #73#return; {17992#false} is VALID [2018-11-14 18:55:14,817 INFO L273 TraceCheckUtils]: 105: Hoare triple {17992#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {17992#false} is VALID [2018-11-14 18:55:14,817 INFO L256 TraceCheckUtils]: 106: Hoare triple {17992#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {17991#true} is VALID [2018-11-14 18:55:14,817 INFO L273 TraceCheckUtils]: 107: Hoare triple {17991#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17991#true} is VALID [2018-11-14 18:55:14,817 INFO L273 TraceCheckUtils]: 108: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,818 INFO L273 TraceCheckUtils]: 109: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,818 INFO L273 TraceCheckUtils]: 110: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,818 INFO L273 TraceCheckUtils]: 111: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,818 INFO L273 TraceCheckUtils]: 112: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,818 INFO L273 TraceCheckUtils]: 113: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,818 INFO L273 TraceCheckUtils]: 114: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,818 INFO L273 TraceCheckUtils]: 115: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,818 INFO L273 TraceCheckUtils]: 116: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,818 INFO L273 TraceCheckUtils]: 117: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,818 INFO L273 TraceCheckUtils]: 118: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,819 INFO L273 TraceCheckUtils]: 119: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,819 INFO L273 TraceCheckUtils]: 120: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,819 INFO L273 TraceCheckUtils]: 121: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,819 INFO L273 TraceCheckUtils]: 122: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,819 INFO L273 TraceCheckUtils]: 123: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,819 INFO L273 TraceCheckUtils]: 124: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,819 INFO L273 TraceCheckUtils]: 125: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,819 INFO L273 TraceCheckUtils]: 126: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,819 INFO L273 TraceCheckUtils]: 127: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,819 INFO L273 TraceCheckUtils]: 128: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,820 INFO L273 TraceCheckUtils]: 129: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,820 INFO L273 TraceCheckUtils]: 130: Hoare triple {17991#true} assume !(~i~0 < 10000); {17991#true} is VALID [2018-11-14 18:55:14,820 INFO L273 TraceCheckUtils]: 131: Hoare triple {17991#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17991#true} is VALID [2018-11-14 18:55:14,820 INFO L273 TraceCheckUtils]: 132: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,820 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {17991#true} {17992#false} #75#return; {17992#false} is VALID [2018-11-14 18:55:14,820 INFO L273 TraceCheckUtils]: 134: Hoare triple {17992#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17992#false} is VALID [2018-11-14 18:55:14,820 INFO L273 TraceCheckUtils]: 135: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:14,820 INFO L273 TraceCheckUtils]: 136: Hoare triple {17992#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17992#false} is VALID [2018-11-14 18:55:14,820 INFO L273 TraceCheckUtils]: 137: Hoare triple {17992#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17992#false} is VALID [2018-11-14 18:55:14,821 INFO L273 TraceCheckUtils]: 138: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:14,821 INFO L273 TraceCheckUtils]: 139: Hoare triple {17992#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17992#false} is VALID [2018-11-14 18:55:14,821 INFO L273 TraceCheckUtils]: 140: Hoare triple {17992#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17992#false} is VALID [2018-11-14 18:55:14,821 INFO L273 TraceCheckUtils]: 141: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:14,821 INFO L273 TraceCheckUtils]: 142: Hoare triple {17992#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17992#false} is VALID [2018-11-14 18:55:14,821 INFO L273 TraceCheckUtils]: 143: Hoare triple {17992#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17992#false} is VALID [2018-11-14 18:55:14,821 INFO L273 TraceCheckUtils]: 144: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:14,821 INFO L273 TraceCheckUtils]: 145: Hoare triple {17992#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17992#false} is VALID [2018-11-14 18:55:14,821 INFO L273 TraceCheckUtils]: 146: Hoare triple {17992#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17992#false} is VALID [2018-11-14 18:55:14,821 INFO L273 TraceCheckUtils]: 147: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:14,822 INFO L273 TraceCheckUtils]: 148: Hoare triple {17992#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17992#false} is VALID [2018-11-14 18:55:14,822 INFO L273 TraceCheckUtils]: 149: Hoare triple {17992#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17992#false} is VALID [2018-11-14 18:55:14,822 INFO L273 TraceCheckUtils]: 150: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:14,822 INFO L273 TraceCheckUtils]: 151: Hoare triple {17992#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17992#false} is VALID [2018-11-14 18:55:14,822 INFO L273 TraceCheckUtils]: 152: Hoare triple {17992#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17992#false} is VALID [2018-11-14 18:55:14,822 INFO L273 TraceCheckUtils]: 153: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:14,822 INFO L273 TraceCheckUtils]: 154: Hoare triple {17992#false} assume !(~i~2 < 9999); {17992#false} is VALID [2018-11-14 18:55:14,822 INFO L273 TraceCheckUtils]: 155: Hoare triple {17992#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {17992#false} is VALID [2018-11-14 18:55:14,822 INFO L256 TraceCheckUtils]: 156: Hoare triple {17992#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {17991#true} is VALID [2018-11-14 18:55:14,822 INFO L273 TraceCheckUtils]: 157: Hoare triple {17991#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17991#true} is VALID [2018-11-14 18:55:14,823 INFO L273 TraceCheckUtils]: 158: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,823 INFO L273 TraceCheckUtils]: 159: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,823 INFO L273 TraceCheckUtils]: 160: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,823 INFO L273 TraceCheckUtils]: 161: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,823 INFO L273 TraceCheckUtils]: 162: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,823 INFO L273 TraceCheckUtils]: 163: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,823 INFO L273 TraceCheckUtils]: 164: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,823 INFO L273 TraceCheckUtils]: 165: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,823 INFO L273 TraceCheckUtils]: 166: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,823 INFO L273 TraceCheckUtils]: 167: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,824 INFO L273 TraceCheckUtils]: 168: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,824 INFO L273 TraceCheckUtils]: 169: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,824 INFO L273 TraceCheckUtils]: 170: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,824 INFO L273 TraceCheckUtils]: 171: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,824 INFO L273 TraceCheckUtils]: 172: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,824 INFO L273 TraceCheckUtils]: 173: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,824 INFO L273 TraceCheckUtils]: 174: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,824 INFO L273 TraceCheckUtils]: 175: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,824 INFO L273 TraceCheckUtils]: 176: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,825 INFO L273 TraceCheckUtils]: 177: Hoare triple {17991#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17991#true} is VALID [2018-11-14 18:55:14,825 INFO L273 TraceCheckUtils]: 178: Hoare triple {17991#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17991#true} is VALID [2018-11-14 18:55:14,825 INFO L273 TraceCheckUtils]: 179: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,825 INFO L273 TraceCheckUtils]: 180: Hoare triple {17991#true} assume !(~i~0 < 10000); {17991#true} is VALID [2018-11-14 18:55:14,825 INFO L273 TraceCheckUtils]: 181: Hoare triple {17991#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17991#true} is VALID [2018-11-14 18:55:14,825 INFO L273 TraceCheckUtils]: 182: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:14,825 INFO L268 TraceCheckUtils]: 183: Hoare quadruple {17991#true} {17992#false} #77#return; {17992#false} is VALID [2018-11-14 18:55:14,825 INFO L273 TraceCheckUtils]: 184: Hoare triple {17992#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17992#false} is VALID [2018-11-14 18:55:14,825 INFO L273 TraceCheckUtils]: 185: Hoare triple {17992#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17992#false} is VALID [2018-11-14 18:55:14,825 INFO L273 TraceCheckUtils]: 186: Hoare triple {17992#false} assume !false; {17992#false} is VALID [2018-11-14 18:55:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-14 18:55:14,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:55:14,842 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-14 18:55:14,850 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:55:14,918 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:55:14,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:55:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:14,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:55:16,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {17991#true} call ULTIMATE.init(); {17991#true} is VALID [2018-11-14 18:55:16,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {17991#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17991#true} is VALID [2018-11-14 18:55:16,020 INFO L273 TraceCheckUtils]: 2: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 18:55:16,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17991#true} {17991#true} #69#return; {17991#true} is VALID [2018-11-14 18:55:16,021 INFO L256 TraceCheckUtils]: 4: Hoare triple {17991#true} call #t~ret13 := main(); {17991#true} is VALID [2018-11-14 18:55:16,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {17991#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {18035#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:16,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {18035#(<= main_~i~1 0)} assume true; {18035#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:16,022 INFO L273 TraceCheckUtils]: 7: Hoare triple {18035#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18035#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:16,023 INFO L273 TraceCheckUtils]: 8: Hoare triple {18035#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17994#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:16,023 INFO L273 TraceCheckUtils]: 9: Hoare triple {17994#(<= main_~i~1 1)} assume true; {17994#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:16,023 INFO L273 TraceCheckUtils]: 10: Hoare triple {17994#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17994#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:16,024 INFO L273 TraceCheckUtils]: 11: Hoare triple {17994#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17995#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:16,024 INFO L273 TraceCheckUtils]: 12: Hoare triple {17995#(<= main_~i~1 2)} assume true; {17995#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:16,025 INFO L273 TraceCheckUtils]: 13: Hoare triple {17995#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17995#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:16,025 INFO L273 TraceCheckUtils]: 14: Hoare triple {17995#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17996#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:16,026 INFO L273 TraceCheckUtils]: 15: Hoare triple {17996#(<= main_~i~1 3)} assume true; {17996#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:16,026 INFO L273 TraceCheckUtils]: 16: Hoare triple {17996#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17996#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:16,027 INFO L273 TraceCheckUtils]: 17: Hoare triple {17996#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17997#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:16,028 INFO L273 TraceCheckUtils]: 18: Hoare triple {17997#(<= main_~i~1 4)} assume true; {17997#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:16,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {17997#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17997#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:16,029 INFO L273 TraceCheckUtils]: 20: Hoare triple {17997#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17998#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:16,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {17998#(<= main_~i~1 5)} assume true; {17998#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:16,030 INFO L273 TraceCheckUtils]: 22: Hoare triple {17998#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17998#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:16,031 INFO L273 TraceCheckUtils]: 23: Hoare triple {17998#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17999#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:16,031 INFO L273 TraceCheckUtils]: 24: Hoare triple {17999#(<= main_~i~1 6)} assume true; {17999#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:16,032 INFO L273 TraceCheckUtils]: 25: Hoare triple {17999#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17999#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:16,032 INFO L273 TraceCheckUtils]: 26: Hoare triple {17999#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18000#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:16,033 INFO L273 TraceCheckUtils]: 27: Hoare triple {18000#(<= main_~i~1 7)} assume true; {18000#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:16,033 INFO L273 TraceCheckUtils]: 28: Hoare triple {18000#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18000#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:16,034 INFO L273 TraceCheckUtils]: 29: Hoare triple {18000#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18001#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:16,035 INFO L273 TraceCheckUtils]: 30: Hoare triple {18001#(<= main_~i~1 8)} assume true; {18001#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:16,035 INFO L273 TraceCheckUtils]: 31: Hoare triple {18001#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18001#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:16,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {18001#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18002#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:16,036 INFO L273 TraceCheckUtils]: 33: Hoare triple {18002#(<= main_~i~1 9)} assume true; {18002#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:16,037 INFO L273 TraceCheckUtils]: 34: Hoare triple {18002#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18002#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:16,038 INFO L273 TraceCheckUtils]: 35: Hoare triple {18002#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18003#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:16,038 INFO L273 TraceCheckUtils]: 36: Hoare triple {18003#(<= main_~i~1 10)} assume true; {18003#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:16,039 INFO L273 TraceCheckUtils]: 37: Hoare triple {18003#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18003#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:16,039 INFO L273 TraceCheckUtils]: 38: Hoare triple {18003#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18004#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:16,040 INFO L273 TraceCheckUtils]: 39: Hoare triple {18004#(<= main_~i~1 11)} assume true; {18004#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:16,040 INFO L273 TraceCheckUtils]: 40: Hoare triple {18004#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18004#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:16,041 INFO L273 TraceCheckUtils]: 41: Hoare triple {18004#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18005#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:16,042 INFO L273 TraceCheckUtils]: 42: Hoare triple {18005#(<= main_~i~1 12)} assume true; {18005#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:16,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {18005#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18005#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:16,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {18005#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18006#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:16,043 INFO L273 TraceCheckUtils]: 45: Hoare triple {18006#(<= main_~i~1 13)} assume true; {18006#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:16,044 INFO L273 TraceCheckUtils]: 46: Hoare triple {18006#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18006#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:16,044 INFO L273 TraceCheckUtils]: 47: Hoare triple {18006#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18007#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:16,045 INFO L273 TraceCheckUtils]: 48: Hoare triple {18007#(<= main_~i~1 14)} assume true; {18007#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:16,045 INFO L273 TraceCheckUtils]: 49: Hoare triple {18007#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18007#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:16,046 INFO L273 TraceCheckUtils]: 50: Hoare triple {18007#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18008#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:16,047 INFO L273 TraceCheckUtils]: 51: Hoare triple {18008#(<= main_~i~1 15)} assume true; {18008#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:16,047 INFO L273 TraceCheckUtils]: 52: Hoare triple {18008#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18008#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:16,048 INFO L273 TraceCheckUtils]: 53: Hoare triple {18008#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18009#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:16,048 INFO L273 TraceCheckUtils]: 54: Hoare triple {18009#(<= main_~i~1 16)} assume true; {18009#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:16,049 INFO L273 TraceCheckUtils]: 55: Hoare triple {18009#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18009#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:16,050 INFO L273 TraceCheckUtils]: 56: Hoare triple {18009#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18010#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:16,050 INFO L273 TraceCheckUtils]: 57: Hoare triple {18010#(<= main_~i~1 17)} assume true; {18010#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:16,051 INFO L273 TraceCheckUtils]: 58: Hoare triple {18010#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18010#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:16,051 INFO L273 TraceCheckUtils]: 59: Hoare triple {18010#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18011#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:16,052 INFO L273 TraceCheckUtils]: 60: Hoare triple {18011#(<= main_~i~1 18)} assume true; {18011#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:16,052 INFO L273 TraceCheckUtils]: 61: Hoare triple {18011#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18011#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:16,053 INFO L273 TraceCheckUtils]: 62: Hoare triple {18011#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18012#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:16,054 INFO L273 TraceCheckUtils]: 63: Hoare triple {18012#(<= main_~i~1 19)} assume true; {18012#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:16,054 INFO L273 TraceCheckUtils]: 64: Hoare triple {18012#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18012#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:16,055 INFO L273 TraceCheckUtils]: 65: Hoare triple {18012#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18013#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:16,055 INFO L273 TraceCheckUtils]: 66: Hoare triple {18013#(<= main_~i~1 20)} assume true; {18013#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:16,056 INFO L273 TraceCheckUtils]: 67: Hoare triple {18013#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18013#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:16,057 INFO L273 TraceCheckUtils]: 68: Hoare triple {18013#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18014#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:16,057 INFO L273 TraceCheckUtils]: 69: Hoare triple {18014#(<= main_~i~1 21)} assume true; {18014#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:16,058 INFO L273 TraceCheckUtils]: 70: Hoare triple {18014#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18014#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:16,058 INFO L273 TraceCheckUtils]: 71: Hoare triple {18014#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18015#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:16,059 INFO L273 TraceCheckUtils]: 72: Hoare triple {18015#(<= main_~i~1 22)} assume true; {18015#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:16,059 INFO L273 TraceCheckUtils]: 73: Hoare triple {18015#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {18015#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:16,060 INFO L273 TraceCheckUtils]: 74: Hoare triple {18015#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {18016#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:16,061 INFO L273 TraceCheckUtils]: 75: Hoare triple {18016#(<= main_~i~1 23)} assume true; {18016#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:16,061 INFO L273 TraceCheckUtils]: 76: Hoare triple {18016#(<= main_~i~1 23)} assume !(~i~1 < 10000); {17992#false} is VALID [2018-11-14 18:55:16,061 INFO L256 TraceCheckUtils]: 77: Hoare triple {17992#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {17992#false} is VALID [2018-11-14 18:55:16,062 INFO L273 TraceCheckUtils]: 78: Hoare triple {17992#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17992#false} is VALID [2018-11-14 18:55:16,062 INFO L273 TraceCheckUtils]: 79: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,062 INFO L273 TraceCheckUtils]: 80: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,062 INFO L273 TraceCheckUtils]: 81: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,062 INFO L273 TraceCheckUtils]: 82: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,063 INFO L273 TraceCheckUtils]: 83: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,063 INFO L273 TraceCheckUtils]: 84: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,063 INFO L273 TraceCheckUtils]: 85: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,063 INFO L273 TraceCheckUtils]: 86: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,063 INFO L273 TraceCheckUtils]: 87: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,063 INFO L273 TraceCheckUtils]: 88: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,063 INFO L273 TraceCheckUtils]: 89: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,064 INFO L273 TraceCheckUtils]: 90: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,064 INFO L273 TraceCheckUtils]: 91: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,064 INFO L273 TraceCheckUtils]: 92: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,064 INFO L273 TraceCheckUtils]: 93: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,064 INFO L273 TraceCheckUtils]: 94: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,064 INFO L273 TraceCheckUtils]: 95: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,064 INFO L273 TraceCheckUtils]: 96: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,064 INFO L273 TraceCheckUtils]: 97: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,064 INFO L273 TraceCheckUtils]: 98: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,064 INFO L273 TraceCheckUtils]: 99: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,065 INFO L273 TraceCheckUtils]: 100: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,065 INFO L273 TraceCheckUtils]: 101: Hoare triple {17992#false} assume !(~i~0 < 10000); {17992#false} is VALID [2018-11-14 18:55:16,065 INFO L273 TraceCheckUtils]: 102: Hoare triple {17992#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17992#false} is VALID [2018-11-14 18:55:16,065 INFO L273 TraceCheckUtils]: 103: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,065 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {17992#false} {17992#false} #73#return; {17992#false} is VALID [2018-11-14 18:55:16,065 INFO L273 TraceCheckUtils]: 105: Hoare triple {17992#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {17992#false} is VALID [2018-11-14 18:55:16,065 INFO L256 TraceCheckUtils]: 106: Hoare triple {17992#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {17992#false} is VALID [2018-11-14 18:55:16,065 INFO L273 TraceCheckUtils]: 107: Hoare triple {17992#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17992#false} is VALID [2018-11-14 18:55:16,066 INFO L273 TraceCheckUtils]: 108: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,066 INFO L273 TraceCheckUtils]: 109: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,066 INFO L273 TraceCheckUtils]: 110: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,066 INFO L273 TraceCheckUtils]: 111: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,066 INFO L273 TraceCheckUtils]: 112: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,066 INFO L273 TraceCheckUtils]: 113: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,066 INFO L273 TraceCheckUtils]: 114: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,067 INFO L273 TraceCheckUtils]: 115: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,067 INFO L273 TraceCheckUtils]: 116: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,067 INFO L273 TraceCheckUtils]: 117: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,067 INFO L273 TraceCheckUtils]: 118: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,067 INFO L273 TraceCheckUtils]: 119: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,067 INFO L273 TraceCheckUtils]: 120: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,068 INFO L273 TraceCheckUtils]: 121: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,068 INFO L273 TraceCheckUtils]: 122: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,068 INFO L273 TraceCheckUtils]: 123: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,068 INFO L273 TraceCheckUtils]: 124: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,068 INFO L273 TraceCheckUtils]: 125: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,068 INFO L273 TraceCheckUtils]: 126: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,068 INFO L273 TraceCheckUtils]: 127: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,068 INFO L273 TraceCheckUtils]: 128: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,068 INFO L273 TraceCheckUtils]: 129: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,069 INFO L273 TraceCheckUtils]: 130: Hoare triple {17992#false} assume !(~i~0 < 10000); {17992#false} is VALID [2018-11-14 18:55:16,069 INFO L273 TraceCheckUtils]: 131: Hoare triple {17992#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17992#false} is VALID [2018-11-14 18:55:16,069 INFO L273 TraceCheckUtils]: 132: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,069 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {17992#false} {17992#false} #75#return; {17992#false} is VALID [2018-11-14 18:55:16,069 INFO L273 TraceCheckUtils]: 134: Hoare triple {17992#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17992#false} is VALID [2018-11-14 18:55:16,069 INFO L273 TraceCheckUtils]: 135: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,069 INFO L273 TraceCheckUtils]: 136: Hoare triple {17992#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17992#false} is VALID [2018-11-14 18:55:16,069 INFO L273 TraceCheckUtils]: 137: Hoare triple {17992#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17992#false} is VALID [2018-11-14 18:55:16,070 INFO L273 TraceCheckUtils]: 138: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,070 INFO L273 TraceCheckUtils]: 139: Hoare triple {17992#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17992#false} is VALID [2018-11-14 18:55:16,070 INFO L273 TraceCheckUtils]: 140: Hoare triple {17992#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17992#false} is VALID [2018-11-14 18:55:16,070 INFO L273 TraceCheckUtils]: 141: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,070 INFO L273 TraceCheckUtils]: 142: Hoare triple {17992#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17992#false} is VALID [2018-11-14 18:55:16,070 INFO L273 TraceCheckUtils]: 143: Hoare triple {17992#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17992#false} is VALID [2018-11-14 18:55:16,070 INFO L273 TraceCheckUtils]: 144: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,070 INFO L273 TraceCheckUtils]: 145: Hoare triple {17992#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17992#false} is VALID [2018-11-14 18:55:16,070 INFO L273 TraceCheckUtils]: 146: Hoare triple {17992#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17992#false} is VALID [2018-11-14 18:55:16,071 INFO L273 TraceCheckUtils]: 147: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,071 INFO L273 TraceCheckUtils]: 148: Hoare triple {17992#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17992#false} is VALID [2018-11-14 18:55:16,071 INFO L273 TraceCheckUtils]: 149: Hoare triple {17992#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17992#false} is VALID [2018-11-14 18:55:16,071 INFO L273 TraceCheckUtils]: 150: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,071 INFO L273 TraceCheckUtils]: 151: Hoare triple {17992#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17992#false} is VALID [2018-11-14 18:55:16,071 INFO L273 TraceCheckUtils]: 152: Hoare triple {17992#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17992#false} is VALID [2018-11-14 18:55:16,071 INFO L273 TraceCheckUtils]: 153: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,071 INFO L273 TraceCheckUtils]: 154: Hoare triple {17992#false} assume !(~i~2 < 9999); {17992#false} is VALID [2018-11-14 18:55:16,072 INFO L273 TraceCheckUtils]: 155: Hoare triple {17992#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {17992#false} is VALID [2018-11-14 18:55:16,072 INFO L256 TraceCheckUtils]: 156: Hoare triple {17992#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {17992#false} is VALID [2018-11-14 18:55:16,072 INFO L273 TraceCheckUtils]: 157: Hoare triple {17992#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17992#false} is VALID [2018-11-14 18:55:16,072 INFO L273 TraceCheckUtils]: 158: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,072 INFO L273 TraceCheckUtils]: 159: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,072 INFO L273 TraceCheckUtils]: 160: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,072 INFO L273 TraceCheckUtils]: 161: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,075 INFO L273 TraceCheckUtils]: 162: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,075 INFO L273 TraceCheckUtils]: 163: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,075 INFO L273 TraceCheckUtils]: 164: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,075 INFO L273 TraceCheckUtils]: 165: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,076 INFO L273 TraceCheckUtils]: 166: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,076 INFO L273 TraceCheckUtils]: 167: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,076 INFO L273 TraceCheckUtils]: 168: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,076 INFO L273 TraceCheckUtils]: 169: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,077 INFO L273 TraceCheckUtils]: 170: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,077 INFO L273 TraceCheckUtils]: 171: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,077 INFO L273 TraceCheckUtils]: 172: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,077 INFO L273 TraceCheckUtils]: 173: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,077 INFO L273 TraceCheckUtils]: 174: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,077 INFO L273 TraceCheckUtils]: 175: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,078 INFO L273 TraceCheckUtils]: 176: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,078 INFO L273 TraceCheckUtils]: 177: Hoare triple {17992#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17992#false} is VALID [2018-11-14 18:55:16,078 INFO L273 TraceCheckUtils]: 178: Hoare triple {17992#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17992#false} is VALID [2018-11-14 18:55:16,078 INFO L273 TraceCheckUtils]: 179: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,078 INFO L273 TraceCheckUtils]: 180: Hoare triple {17992#false} assume !(~i~0 < 10000); {17992#false} is VALID [2018-11-14 18:55:16,078 INFO L273 TraceCheckUtils]: 181: Hoare triple {17992#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17992#false} is VALID [2018-11-14 18:55:16,079 INFO L273 TraceCheckUtils]: 182: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 18:55:16,079 INFO L268 TraceCheckUtils]: 183: Hoare quadruple {17992#false} {17992#false} #77#return; {17992#false} is VALID [2018-11-14 18:55:16,079 INFO L273 TraceCheckUtils]: 184: Hoare triple {17992#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17992#false} is VALID [2018-11-14 18:55:16,079 INFO L273 TraceCheckUtils]: 185: Hoare triple {17992#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17992#false} is VALID [2018-11-14 18:55:16,079 INFO L273 TraceCheckUtils]: 186: Hoare triple {17992#false} assume !false; {17992#false} is VALID [2018-11-14 18:55:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-14 18:55:16,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:55:16,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-14 18:55:16,133 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 187 [2018-11-14 18:55:16,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:55:16,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 18:55:16,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:16,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 18:55:16,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 18:55:16,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 18:55:16,298 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand 27 states. [2018-11-14 18:55:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:17,413 INFO L93 Difference]: Finished difference Result 195 states and 203 transitions. [2018-11-14 18:55:17,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 18:55:17,413 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 187 [2018-11-14 18:55:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:55:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:55:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 129 transitions. [2018-11-14 18:55:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:55:17,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 129 transitions. [2018-11-14 18:55:17,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 129 transitions. [2018-11-14 18:55:17,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:17,534 INFO L225 Difference]: With dead ends: 195 [2018-11-14 18:55:17,535 INFO L226 Difference]: Without dead ends: 138 [2018-11-14 18:55:17,536 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 18:55:17,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-14 18:55:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-11-14 18:55:17,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:55:17,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 137 states. [2018-11-14 18:55:17,577 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 137 states. [2018-11-14 18:55:17,577 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 137 states. [2018-11-14 18:55:17,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:17,579 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-11-14 18:55:17,579 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2018-11-14 18:55:17,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:17,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:17,580 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 138 states. [2018-11-14 18:55:17,580 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 138 states. [2018-11-14 18:55:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:17,583 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-11-14 18:55:17,583 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2018-11-14 18:55:17,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:17,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:17,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:55:17,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:55:17,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-14 18:55:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-11-14 18:55:17,586 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 187 [2018-11-14 18:55:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:55:17,587 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-11-14 18:55:17,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 18:55:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-14 18:55:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-14 18:55:17,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:55:17,588 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 21, 21, 7, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:55:17,588 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:55:17,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:55:17,589 INFO L82 PathProgramCache]: Analyzing trace with hash 650102501, now seen corresponding path program 23 times [2018-11-14 18:55:17,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:55:17,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:55:17,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:17,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:55:17,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:18,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {19301#true} call ULTIMATE.init(); {19301#true} is VALID [2018-11-14 18:55:18,709 INFO L273 TraceCheckUtils]: 1: Hoare triple {19301#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19301#true} is VALID [2018-11-14 18:55:18,709 INFO L273 TraceCheckUtils]: 2: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,710 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19301#true} {19301#true} #69#return; {19301#true} is VALID [2018-11-14 18:55:18,710 INFO L256 TraceCheckUtils]: 4: Hoare triple {19301#true} call #t~ret13 := main(); {19301#true} is VALID [2018-11-14 18:55:18,710 INFO L273 TraceCheckUtils]: 5: Hoare triple {19301#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19303#(= main_~i~1 0)} is VALID [2018-11-14 18:55:18,711 INFO L273 TraceCheckUtils]: 6: Hoare triple {19303#(= main_~i~1 0)} assume true; {19303#(= main_~i~1 0)} is VALID [2018-11-14 18:55:18,711 INFO L273 TraceCheckUtils]: 7: Hoare triple {19303#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19303#(= main_~i~1 0)} is VALID [2018-11-14 18:55:18,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {19303#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19304#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:18,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {19304#(<= main_~i~1 1)} assume true; {19304#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:18,712 INFO L273 TraceCheckUtils]: 10: Hoare triple {19304#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19304#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:18,713 INFO L273 TraceCheckUtils]: 11: Hoare triple {19304#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19305#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:18,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {19305#(<= main_~i~1 2)} assume true; {19305#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:18,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {19305#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19305#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:18,714 INFO L273 TraceCheckUtils]: 14: Hoare triple {19305#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19306#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:18,715 INFO L273 TraceCheckUtils]: 15: Hoare triple {19306#(<= main_~i~1 3)} assume true; {19306#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:18,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {19306#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19306#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:18,716 INFO L273 TraceCheckUtils]: 17: Hoare triple {19306#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19307#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:18,716 INFO L273 TraceCheckUtils]: 18: Hoare triple {19307#(<= main_~i~1 4)} assume true; {19307#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:18,717 INFO L273 TraceCheckUtils]: 19: Hoare triple {19307#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19307#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:18,718 INFO L273 TraceCheckUtils]: 20: Hoare triple {19307#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19308#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:18,718 INFO L273 TraceCheckUtils]: 21: Hoare triple {19308#(<= main_~i~1 5)} assume true; {19308#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:18,719 INFO L273 TraceCheckUtils]: 22: Hoare triple {19308#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19308#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:18,719 INFO L273 TraceCheckUtils]: 23: Hoare triple {19308#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19309#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:18,720 INFO L273 TraceCheckUtils]: 24: Hoare triple {19309#(<= main_~i~1 6)} assume true; {19309#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:18,720 INFO L273 TraceCheckUtils]: 25: Hoare triple {19309#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19309#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:18,721 INFO L273 TraceCheckUtils]: 26: Hoare triple {19309#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19310#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:18,722 INFO L273 TraceCheckUtils]: 27: Hoare triple {19310#(<= main_~i~1 7)} assume true; {19310#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:18,722 INFO L273 TraceCheckUtils]: 28: Hoare triple {19310#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19310#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:18,723 INFO L273 TraceCheckUtils]: 29: Hoare triple {19310#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19311#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:18,723 INFO L273 TraceCheckUtils]: 30: Hoare triple {19311#(<= main_~i~1 8)} assume true; {19311#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:18,724 INFO L273 TraceCheckUtils]: 31: Hoare triple {19311#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19311#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:18,725 INFO L273 TraceCheckUtils]: 32: Hoare triple {19311#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19312#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:18,725 INFO L273 TraceCheckUtils]: 33: Hoare triple {19312#(<= main_~i~1 9)} assume true; {19312#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:18,726 INFO L273 TraceCheckUtils]: 34: Hoare triple {19312#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19312#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:18,726 INFO L273 TraceCheckUtils]: 35: Hoare triple {19312#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19313#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:18,727 INFO L273 TraceCheckUtils]: 36: Hoare triple {19313#(<= main_~i~1 10)} assume true; {19313#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:18,727 INFO L273 TraceCheckUtils]: 37: Hoare triple {19313#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19313#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:18,728 INFO L273 TraceCheckUtils]: 38: Hoare triple {19313#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19314#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:18,728 INFO L273 TraceCheckUtils]: 39: Hoare triple {19314#(<= main_~i~1 11)} assume true; {19314#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:18,729 INFO L273 TraceCheckUtils]: 40: Hoare triple {19314#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19314#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:18,730 INFO L273 TraceCheckUtils]: 41: Hoare triple {19314#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19315#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:18,730 INFO L273 TraceCheckUtils]: 42: Hoare triple {19315#(<= main_~i~1 12)} assume true; {19315#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:18,731 INFO L273 TraceCheckUtils]: 43: Hoare triple {19315#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19315#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:18,731 INFO L273 TraceCheckUtils]: 44: Hoare triple {19315#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19316#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:18,732 INFO L273 TraceCheckUtils]: 45: Hoare triple {19316#(<= main_~i~1 13)} assume true; {19316#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:18,732 INFO L273 TraceCheckUtils]: 46: Hoare triple {19316#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19316#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:18,733 INFO L273 TraceCheckUtils]: 47: Hoare triple {19316#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19317#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:18,734 INFO L273 TraceCheckUtils]: 48: Hoare triple {19317#(<= main_~i~1 14)} assume true; {19317#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:18,734 INFO L273 TraceCheckUtils]: 49: Hoare triple {19317#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19317#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:18,735 INFO L273 TraceCheckUtils]: 50: Hoare triple {19317#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19318#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:18,735 INFO L273 TraceCheckUtils]: 51: Hoare triple {19318#(<= main_~i~1 15)} assume true; {19318#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:18,736 INFO L273 TraceCheckUtils]: 52: Hoare triple {19318#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19318#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:18,737 INFO L273 TraceCheckUtils]: 53: Hoare triple {19318#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19319#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:18,737 INFO L273 TraceCheckUtils]: 54: Hoare triple {19319#(<= main_~i~1 16)} assume true; {19319#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:18,738 INFO L273 TraceCheckUtils]: 55: Hoare triple {19319#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19319#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:18,738 INFO L273 TraceCheckUtils]: 56: Hoare triple {19319#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19320#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:18,739 INFO L273 TraceCheckUtils]: 57: Hoare triple {19320#(<= main_~i~1 17)} assume true; {19320#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:18,739 INFO L273 TraceCheckUtils]: 58: Hoare triple {19320#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19320#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:18,740 INFO L273 TraceCheckUtils]: 59: Hoare triple {19320#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19321#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:18,741 INFO L273 TraceCheckUtils]: 60: Hoare triple {19321#(<= main_~i~1 18)} assume true; {19321#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:18,741 INFO L273 TraceCheckUtils]: 61: Hoare triple {19321#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19321#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:18,742 INFO L273 TraceCheckUtils]: 62: Hoare triple {19321#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19322#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:18,742 INFO L273 TraceCheckUtils]: 63: Hoare triple {19322#(<= main_~i~1 19)} assume true; {19322#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:18,743 INFO L273 TraceCheckUtils]: 64: Hoare triple {19322#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19322#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:18,743 INFO L273 TraceCheckUtils]: 65: Hoare triple {19322#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19323#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:18,744 INFO L273 TraceCheckUtils]: 66: Hoare triple {19323#(<= main_~i~1 20)} assume true; {19323#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:18,744 INFO L273 TraceCheckUtils]: 67: Hoare triple {19323#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19323#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:18,745 INFO L273 TraceCheckUtils]: 68: Hoare triple {19323#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19324#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:18,746 INFO L273 TraceCheckUtils]: 69: Hoare triple {19324#(<= main_~i~1 21)} assume true; {19324#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:18,746 INFO L273 TraceCheckUtils]: 70: Hoare triple {19324#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19324#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:18,747 INFO L273 TraceCheckUtils]: 71: Hoare triple {19324#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19325#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:18,747 INFO L273 TraceCheckUtils]: 72: Hoare triple {19325#(<= main_~i~1 22)} assume true; {19325#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:18,748 INFO L273 TraceCheckUtils]: 73: Hoare triple {19325#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19325#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:18,749 INFO L273 TraceCheckUtils]: 74: Hoare triple {19325#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19326#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:18,749 INFO L273 TraceCheckUtils]: 75: Hoare triple {19326#(<= main_~i~1 23)} assume true; {19326#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:18,750 INFO L273 TraceCheckUtils]: 76: Hoare triple {19326#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19326#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:18,750 INFO L273 TraceCheckUtils]: 77: Hoare triple {19326#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19327#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:18,751 INFO L273 TraceCheckUtils]: 78: Hoare triple {19327#(<= main_~i~1 24)} assume true; {19327#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:18,752 INFO L273 TraceCheckUtils]: 79: Hoare triple {19327#(<= main_~i~1 24)} assume !(~i~1 < 10000); {19302#false} is VALID [2018-11-14 18:55:18,752 INFO L256 TraceCheckUtils]: 80: Hoare triple {19302#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {19301#true} is VALID [2018-11-14 18:55:18,752 INFO L273 TraceCheckUtils]: 81: Hoare triple {19301#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19301#true} is VALID [2018-11-14 18:55:18,752 INFO L273 TraceCheckUtils]: 82: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,752 INFO L273 TraceCheckUtils]: 83: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,752 INFO L273 TraceCheckUtils]: 84: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,753 INFO L273 TraceCheckUtils]: 85: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,753 INFO L273 TraceCheckUtils]: 86: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,753 INFO L273 TraceCheckUtils]: 87: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,753 INFO L273 TraceCheckUtils]: 88: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,753 INFO L273 TraceCheckUtils]: 89: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,754 INFO L273 TraceCheckUtils]: 90: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,754 INFO L273 TraceCheckUtils]: 91: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,754 INFO L273 TraceCheckUtils]: 92: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,754 INFO L273 TraceCheckUtils]: 93: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,754 INFO L273 TraceCheckUtils]: 94: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,754 INFO L273 TraceCheckUtils]: 95: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,755 INFO L273 TraceCheckUtils]: 96: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,755 INFO L273 TraceCheckUtils]: 97: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,755 INFO L273 TraceCheckUtils]: 98: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,755 INFO L273 TraceCheckUtils]: 99: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,755 INFO L273 TraceCheckUtils]: 100: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,755 INFO L273 TraceCheckUtils]: 101: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,756 INFO L273 TraceCheckUtils]: 102: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,756 INFO L273 TraceCheckUtils]: 103: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,756 INFO L273 TraceCheckUtils]: 104: Hoare triple {19301#true} assume !(~i~0 < 10000); {19301#true} is VALID [2018-11-14 18:55:18,756 INFO L273 TraceCheckUtils]: 105: Hoare triple {19301#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19301#true} is VALID [2018-11-14 18:55:18,756 INFO L273 TraceCheckUtils]: 106: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,756 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {19301#true} {19302#false} #73#return; {19302#false} is VALID [2018-11-14 18:55:18,757 INFO L273 TraceCheckUtils]: 108: Hoare triple {19302#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {19302#false} is VALID [2018-11-14 18:55:18,757 INFO L256 TraceCheckUtils]: 109: Hoare triple {19302#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {19301#true} is VALID [2018-11-14 18:55:18,757 INFO L273 TraceCheckUtils]: 110: Hoare triple {19301#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19301#true} is VALID [2018-11-14 18:55:18,757 INFO L273 TraceCheckUtils]: 111: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,757 INFO L273 TraceCheckUtils]: 112: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,757 INFO L273 TraceCheckUtils]: 113: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,757 INFO L273 TraceCheckUtils]: 114: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,757 INFO L273 TraceCheckUtils]: 115: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,758 INFO L273 TraceCheckUtils]: 116: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,758 INFO L273 TraceCheckUtils]: 117: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,758 INFO L273 TraceCheckUtils]: 118: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,758 INFO L273 TraceCheckUtils]: 119: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,758 INFO L273 TraceCheckUtils]: 120: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,758 INFO L273 TraceCheckUtils]: 121: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,758 INFO L273 TraceCheckUtils]: 122: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,759 INFO L273 TraceCheckUtils]: 123: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,759 INFO L273 TraceCheckUtils]: 124: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,759 INFO L273 TraceCheckUtils]: 125: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,759 INFO L273 TraceCheckUtils]: 126: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,759 INFO L273 TraceCheckUtils]: 127: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,759 INFO L273 TraceCheckUtils]: 128: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,759 INFO L273 TraceCheckUtils]: 129: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,759 INFO L273 TraceCheckUtils]: 130: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,759 INFO L273 TraceCheckUtils]: 131: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,759 INFO L273 TraceCheckUtils]: 132: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,760 INFO L273 TraceCheckUtils]: 133: Hoare triple {19301#true} assume !(~i~0 < 10000); {19301#true} is VALID [2018-11-14 18:55:18,760 INFO L273 TraceCheckUtils]: 134: Hoare triple {19301#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19301#true} is VALID [2018-11-14 18:55:18,760 INFO L273 TraceCheckUtils]: 135: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,760 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {19301#true} {19302#false} #75#return; {19302#false} is VALID [2018-11-14 18:55:18,760 INFO L273 TraceCheckUtils]: 137: Hoare triple {19302#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19302#false} is VALID [2018-11-14 18:55:18,760 INFO L273 TraceCheckUtils]: 138: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:18,760 INFO L273 TraceCheckUtils]: 139: Hoare triple {19302#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19302#false} is VALID [2018-11-14 18:55:18,760 INFO L273 TraceCheckUtils]: 140: Hoare triple {19302#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19302#false} is VALID [2018-11-14 18:55:18,760 INFO L273 TraceCheckUtils]: 141: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:18,760 INFO L273 TraceCheckUtils]: 142: Hoare triple {19302#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19302#false} is VALID [2018-11-14 18:55:18,761 INFO L273 TraceCheckUtils]: 143: Hoare triple {19302#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19302#false} is VALID [2018-11-14 18:55:18,761 INFO L273 TraceCheckUtils]: 144: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:18,761 INFO L273 TraceCheckUtils]: 145: Hoare triple {19302#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19302#false} is VALID [2018-11-14 18:55:18,761 INFO L273 TraceCheckUtils]: 146: Hoare triple {19302#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19302#false} is VALID [2018-11-14 18:55:18,761 INFO L273 TraceCheckUtils]: 147: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:18,761 INFO L273 TraceCheckUtils]: 148: Hoare triple {19302#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19302#false} is VALID [2018-11-14 18:55:18,761 INFO L273 TraceCheckUtils]: 149: Hoare triple {19302#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19302#false} is VALID [2018-11-14 18:55:18,761 INFO L273 TraceCheckUtils]: 150: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:18,761 INFO L273 TraceCheckUtils]: 151: Hoare triple {19302#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19302#false} is VALID [2018-11-14 18:55:18,761 INFO L273 TraceCheckUtils]: 152: Hoare triple {19302#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19302#false} is VALID [2018-11-14 18:55:18,762 INFO L273 TraceCheckUtils]: 153: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:18,762 INFO L273 TraceCheckUtils]: 154: Hoare triple {19302#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19302#false} is VALID [2018-11-14 18:55:18,762 INFO L273 TraceCheckUtils]: 155: Hoare triple {19302#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19302#false} is VALID [2018-11-14 18:55:18,762 INFO L273 TraceCheckUtils]: 156: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:18,762 INFO L273 TraceCheckUtils]: 157: Hoare triple {19302#false} assume !(~i~2 < 9999); {19302#false} is VALID [2018-11-14 18:55:18,762 INFO L273 TraceCheckUtils]: 158: Hoare triple {19302#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {19302#false} is VALID [2018-11-14 18:55:18,762 INFO L256 TraceCheckUtils]: 159: Hoare triple {19302#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {19301#true} is VALID [2018-11-14 18:55:18,762 INFO L273 TraceCheckUtils]: 160: Hoare triple {19301#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19301#true} is VALID [2018-11-14 18:55:18,762 INFO L273 TraceCheckUtils]: 161: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,762 INFO L273 TraceCheckUtils]: 162: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,763 INFO L273 TraceCheckUtils]: 163: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,763 INFO L273 TraceCheckUtils]: 164: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,763 INFO L273 TraceCheckUtils]: 165: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,763 INFO L273 TraceCheckUtils]: 166: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,763 INFO L273 TraceCheckUtils]: 167: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,763 INFO L273 TraceCheckUtils]: 168: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,763 INFO L273 TraceCheckUtils]: 169: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,763 INFO L273 TraceCheckUtils]: 170: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,763 INFO L273 TraceCheckUtils]: 171: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,764 INFO L273 TraceCheckUtils]: 172: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,764 INFO L273 TraceCheckUtils]: 173: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,764 INFO L273 TraceCheckUtils]: 174: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,764 INFO L273 TraceCheckUtils]: 175: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,764 INFO L273 TraceCheckUtils]: 176: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,764 INFO L273 TraceCheckUtils]: 177: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,764 INFO L273 TraceCheckUtils]: 178: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,764 INFO L273 TraceCheckUtils]: 179: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,764 INFO L273 TraceCheckUtils]: 180: Hoare triple {19301#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19301#true} is VALID [2018-11-14 18:55:18,764 INFO L273 TraceCheckUtils]: 181: Hoare triple {19301#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19301#true} is VALID [2018-11-14 18:55:18,765 INFO L273 TraceCheckUtils]: 182: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,765 INFO L273 TraceCheckUtils]: 183: Hoare triple {19301#true} assume !(~i~0 < 10000); {19301#true} is VALID [2018-11-14 18:55:18,765 INFO L273 TraceCheckUtils]: 184: Hoare triple {19301#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19301#true} is VALID [2018-11-14 18:55:18,765 INFO L273 TraceCheckUtils]: 185: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:18,765 INFO L268 TraceCheckUtils]: 186: Hoare quadruple {19301#true} {19302#false} #77#return; {19302#false} is VALID [2018-11-14 18:55:18,765 INFO L273 TraceCheckUtils]: 187: Hoare triple {19302#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19302#false} is VALID [2018-11-14 18:55:18,765 INFO L273 TraceCheckUtils]: 188: Hoare triple {19302#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19302#false} is VALID [2018-11-14 18:55:18,765 INFO L273 TraceCheckUtils]: 189: Hoare triple {19302#false} assume !false; {19302#false} is VALID [2018-11-14 18:55:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-14 18:55:18,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:55:18,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 18:55:18,791 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:55:27,905 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-14 18:55:27,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:55:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:27,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:55:28,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {19301#true} call ULTIMATE.init(); {19301#true} is VALID [2018-11-14 18:55:28,232 INFO L273 TraceCheckUtils]: 1: Hoare triple {19301#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19301#true} is VALID [2018-11-14 18:55:28,232 INFO L273 TraceCheckUtils]: 2: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,232 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19301#true} {19301#true} #69#return; {19301#true} is VALID [2018-11-14 18:55:28,232 INFO L256 TraceCheckUtils]: 4: Hoare triple {19301#true} call #t~ret13 := main(); {19301#true} is VALID [2018-11-14 18:55:28,232 INFO L273 TraceCheckUtils]: 5: Hoare triple {19301#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19301#true} is VALID [2018-11-14 18:55:28,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,233 INFO L273 TraceCheckUtils]: 9: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,233 INFO L273 TraceCheckUtils]: 11: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,233 INFO L273 TraceCheckUtils]: 12: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,234 INFO L273 TraceCheckUtils]: 13: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,234 INFO L273 TraceCheckUtils]: 16: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,234 INFO L273 TraceCheckUtils]: 17: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,234 INFO L273 TraceCheckUtils]: 18: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,234 INFO L273 TraceCheckUtils]: 19: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,234 INFO L273 TraceCheckUtils]: 20: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,234 INFO L273 TraceCheckUtils]: 21: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,234 INFO L273 TraceCheckUtils]: 22: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,235 INFO L273 TraceCheckUtils]: 23: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,235 INFO L273 TraceCheckUtils]: 24: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,235 INFO L273 TraceCheckUtils]: 25: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,235 INFO L273 TraceCheckUtils]: 26: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,235 INFO L273 TraceCheckUtils]: 27: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,235 INFO L273 TraceCheckUtils]: 28: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,235 INFO L273 TraceCheckUtils]: 29: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,235 INFO L273 TraceCheckUtils]: 30: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,235 INFO L273 TraceCheckUtils]: 31: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,236 INFO L273 TraceCheckUtils]: 32: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,236 INFO L273 TraceCheckUtils]: 33: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,236 INFO L273 TraceCheckUtils]: 34: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,236 INFO L273 TraceCheckUtils]: 35: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,236 INFO L273 TraceCheckUtils]: 36: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,236 INFO L273 TraceCheckUtils]: 37: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,236 INFO L273 TraceCheckUtils]: 38: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,236 INFO L273 TraceCheckUtils]: 39: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,236 INFO L273 TraceCheckUtils]: 40: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,237 INFO L273 TraceCheckUtils]: 41: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,237 INFO L273 TraceCheckUtils]: 42: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,237 INFO L273 TraceCheckUtils]: 43: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,237 INFO L273 TraceCheckUtils]: 44: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,237 INFO L273 TraceCheckUtils]: 45: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,237 INFO L273 TraceCheckUtils]: 46: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,238 INFO L273 TraceCheckUtils]: 47: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,238 INFO L273 TraceCheckUtils]: 48: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,238 INFO L273 TraceCheckUtils]: 49: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,238 INFO L273 TraceCheckUtils]: 50: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,238 INFO L273 TraceCheckUtils]: 51: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,238 INFO L273 TraceCheckUtils]: 52: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,238 INFO L273 TraceCheckUtils]: 53: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,239 INFO L273 TraceCheckUtils]: 54: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,239 INFO L273 TraceCheckUtils]: 55: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,239 INFO L273 TraceCheckUtils]: 56: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,239 INFO L273 TraceCheckUtils]: 57: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,239 INFO L273 TraceCheckUtils]: 58: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,239 INFO L273 TraceCheckUtils]: 59: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,240 INFO L273 TraceCheckUtils]: 60: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,240 INFO L273 TraceCheckUtils]: 61: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,240 INFO L273 TraceCheckUtils]: 62: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,240 INFO L273 TraceCheckUtils]: 63: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,240 INFO L273 TraceCheckUtils]: 64: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,240 INFO L273 TraceCheckUtils]: 65: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,241 INFO L273 TraceCheckUtils]: 66: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,241 INFO L273 TraceCheckUtils]: 67: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,241 INFO L273 TraceCheckUtils]: 68: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,241 INFO L273 TraceCheckUtils]: 69: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,241 INFO L273 TraceCheckUtils]: 70: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,241 INFO L273 TraceCheckUtils]: 71: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,241 INFO L273 TraceCheckUtils]: 72: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,242 INFO L273 TraceCheckUtils]: 73: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,242 INFO L273 TraceCheckUtils]: 74: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,242 INFO L273 TraceCheckUtils]: 75: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,242 INFO L273 TraceCheckUtils]: 76: Hoare triple {19301#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19301#true} is VALID [2018-11-14 18:55:28,242 INFO L273 TraceCheckUtils]: 77: Hoare triple {19301#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19301#true} is VALID [2018-11-14 18:55:28,243 INFO L273 TraceCheckUtils]: 78: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 18:55:28,243 INFO L273 TraceCheckUtils]: 79: Hoare triple {19301#true} assume !(~i~1 < 10000); {19301#true} is VALID [2018-11-14 18:55:28,243 INFO L256 TraceCheckUtils]: 80: Hoare triple {19301#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {19301#true} is VALID [2018-11-14 18:55:28,257 INFO L273 TraceCheckUtils]: 81: Hoare triple {19301#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19574#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:55:28,266 INFO L273 TraceCheckUtils]: 82: Hoare triple {19574#(<= bAnd_~i~0 1)} assume true; {19574#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:55:28,280 INFO L273 TraceCheckUtils]: 83: Hoare triple {19574#(<= bAnd_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19574#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:55:28,289 INFO L273 TraceCheckUtils]: 84: Hoare triple {19574#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19584#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:55:28,303 INFO L273 TraceCheckUtils]: 85: Hoare triple {19584#(<= bAnd_~i~0 2)} assume true; {19584#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:55:28,308 INFO L273 TraceCheckUtils]: 86: Hoare triple {19584#(<= bAnd_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19584#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:55:28,313 INFO L273 TraceCheckUtils]: 87: Hoare triple {19584#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19594#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:55:28,313 INFO L273 TraceCheckUtils]: 88: Hoare triple {19594#(<= bAnd_~i~0 3)} assume true; {19594#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:55:28,314 INFO L273 TraceCheckUtils]: 89: Hoare triple {19594#(<= bAnd_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19594#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:55:28,314 INFO L273 TraceCheckUtils]: 90: Hoare triple {19594#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19604#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:55:28,314 INFO L273 TraceCheckUtils]: 91: Hoare triple {19604#(<= bAnd_~i~0 4)} assume true; {19604#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:55:28,315 INFO L273 TraceCheckUtils]: 92: Hoare triple {19604#(<= bAnd_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19604#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:55:28,315 INFO L273 TraceCheckUtils]: 93: Hoare triple {19604#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19614#(<= bAnd_~i~0 5)} is VALID [2018-11-14 18:55:28,315 INFO L273 TraceCheckUtils]: 94: Hoare triple {19614#(<= bAnd_~i~0 5)} assume true; {19614#(<= bAnd_~i~0 5)} is VALID [2018-11-14 18:55:28,316 INFO L273 TraceCheckUtils]: 95: Hoare triple {19614#(<= bAnd_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19614#(<= bAnd_~i~0 5)} is VALID [2018-11-14 18:55:28,317 INFO L273 TraceCheckUtils]: 96: Hoare triple {19614#(<= bAnd_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19624#(<= bAnd_~i~0 6)} is VALID [2018-11-14 18:55:28,317 INFO L273 TraceCheckUtils]: 97: Hoare triple {19624#(<= bAnd_~i~0 6)} assume true; {19624#(<= bAnd_~i~0 6)} is VALID [2018-11-14 18:55:28,318 INFO L273 TraceCheckUtils]: 98: Hoare triple {19624#(<= bAnd_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19624#(<= bAnd_~i~0 6)} is VALID [2018-11-14 18:55:28,318 INFO L273 TraceCheckUtils]: 99: Hoare triple {19624#(<= bAnd_~i~0 6)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19634#(<= bAnd_~i~0 7)} is VALID [2018-11-14 18:55:28,319 INFO L273 TraceCheckUtils]: 100: Hoare triple {19634#(<= bAnd_~i~0 7)} assume true; {19634#(<= bAnd_~i~0 7)} is VALID [2018-11-14 18:55:28,319 INFO L273 TraceCheckUtils]: 101: Hoare triple {19634#(<= bAnd_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19634#(<= bAnd_~i~0 7)} is VALID [2018-11-14 18:55:28,320 INFO L273 TraceCheckUtils]: 102: Hoare triple {19634#(<= bAnd_~i~0 7)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19644#(<= bAnd_~i~0 8)} is VALID [2018-11-14 18:55:28,321 INFO L273 TraceCheckUtils]: 103: Hoare triple {19644#(<= bAnd_~i~0 8)} assume true; {19644#(<= bAnd_~i~0 8)} is VALID [2018-11-14 18:55:28,321 INFO L273 TraceCheckUtils]: 104: Hoare triple {19644#(<= bAnd_~i~0 8)} assume !(~i~0 < 10000); {19302#false} is VALID [2018-11-14 18:55:28,321 INFO L273 TraceCheckUtils]: 105: Hoare triple {19302#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19302#false} is VALID [2018-11-14 18:55:28,322 INFO L273 TraceCheckUtils]: 106: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,322 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {19302#false} {19301#true} #73#return; {19302#false} is VALID [2018-11-14 18:55:28,322 INFO L273 TraceCheckUtils]: 108: Hoare triple {19302#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {19302#false} is VALID [2018-11-14 18:55:28,322 INFO L256 TraceCheckUtils]: 109: Hoare triple {19302#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {19302#false} is VALID [2018-11-14 18:55:28,322 INFO L273 TraceCheckUtils]: 110: Hoare triple {19302#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19302#false} is VALID [2018-11-14 18:55:28,323 INFO L273 TraceCheckUtils]: 111: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,323 INFO L273 TraceCheckUtils]: 112: Hoare triple {19302#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19302#false} is VALID [2018-11-14 18:55:28,323 INFO L273 TraceCheckUtils]: 113: Hoare triple {19302#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19302#false} is VALID [2018-11-14 18:55:28,323 INFO L273 TraceCheckUtils]: 114: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,323 INFO L273 TraceCheckUtils]: 115: Hoare triple {19302#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19302#false} is VALID [2018-11-14 18:55:28,323 INFO L273 TraceCheckUtils]: 116: Hoare triple {19302#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19302#false} is VALID [2018-11-14 18:55:28,324 INFO L273 TraceCheckUtils]: 117: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,324 INFO L273 TraceCheckUtils]: 118: Hoare triple {19302#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19302#false} is VALID [2018-11-14 18:55:28,324 INFO L273 TraceCheckUtils]: 119: Hoare triple {19302#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19302#false} is VALID [2018-11-14 18:55:28,324 INFO L273 TraceCheckUtils]: 120: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,324 INFO L273 TraceCheckUtils]: 121: Hoare triple {19302#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19302#false} is VALID [2018-11-14 18:55:28,324 INFO L273 TraceCheckUtils]: 122: Hoare triple {19302#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19302#false} is VALID [2018-11-14 18:55:28,324 INFO L273 TraceCheckUtils]: 123: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,324 INFO L273 TraceCheckUtils]: 124: Hoare triple {19302#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19302#false} is VALID [2018-11-14 18:55:28,324 INFO L273 TraceCheckUtils]: 125: Hoare triple {19302#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19302#false} is VALID [2018-11-14 18:55:28,324 INFO L273 TraceCheckUtils]: 126: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,325 INFO L273 TraceCheckUtils]: 127: Hoare triple {19302#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19302#false} is VALID [2018-11-14 18:55:28,325 INFO L273 TraceCheckUtils]: 128: Hoare triple {19302#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19302#false} is VALID [2018-11-14 18:55:28,325 INFO L273 TraceCheckUtils]: 129: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,325 INFO L273 TraceCheckUtils]: 130: Hoare triple {19302#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19302#false} is VALID [2018-11-14 18:55:28,325 INFO L273 TraceCheckUtils]: 131: Hoare triple {19302#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19302#false} is VALID [2018-11-14 18:55:28,325 INFO L273 TraceCheckUtils]: 132: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,325 INFO L273 TraceCheckUtils]: 133: Hoare triple {19302#false} assume !(~i~0 < 10000); {19302#false} is VALID [2018-11-14 18:55:28,325 INFO L273 TraceCheckUtils]: 134: Hoare triple {19302#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19302#false} is VALID [2018-11-14 18:55:28,325 INFO L273 TraceCheckUtils]: 135: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,326 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {19302#false} {19302#false} #75#return; {19302#false} is VALID [2018-11-14 18:55:28,326 INFO L273 TraceCheckUtils]: 137: Hoare triple {19302#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19302#false} is VALID [2018-11-14 18:55:28,326 INFO L273 TraceCheckUtils]: 138: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,326 INFO L273 TraceCheckUtils]: 139: Hoare triple {19302#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19302#false} is VALID [2018-11-14 18:55:28,326 INFO L273 TraceCheckUtils]: 140: Hoare triple {19302#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19302#false} is VALID [2018-11-14 18:55:28,326 INFO L273 TraceCheckUtils]: 141: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,326 INFO L273 TraceCheckUtils]: 142: Hoare triple {19302#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19302#false} is VALID [2018-11-14 18:55:28,326 INFO L273 TraceCheckUtils]: 143: Hoare triple {19302#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19302#false} is VALID [2018-11-14 18:55:28,326 INFO L273 TraceCheckUtils]: 144: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,326 INFO L273 TraceCheckUtils]: 145: Hoare triple {19302#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19302#false} is VALID [2018-11-14 18:55:28,327 INFO L273 TraceCheckUtils]: 146: Hoare triple {19302#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19302#false} is VALID [2018-11-14 18:55:28,327 INFO L273 TraceCheckUtils]: 147: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,327 INFO L273 TraceCheckUtils]: 148: Hoare triple {19302#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19302#false} is VALID [2018-11-14 18:55:28,327 INFO L273 TraceCheckUtils]: 149: Hoare triple {19302#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19302#false} is VALID [2018-11-14 18:55:28,327 INFO L273 TraceCheckUtils]: 150: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,327 INFO L273 TraceCheckUtils]: 151: Hoare triple {19302#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19302#false} is VALID [2018-11-14 18:55:28,327 INFO L273 TraceCheckUtils]: 152: Hoare triple {19302#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19302#false} is VALID [2018-11-14 18:55:28,327 INFO L273 TraceCheckUtils]: 153: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,327 INFO L273 TraceCheckUtils]: 154: Hoare triple {19302#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19302#false} is VALID [2018-11-14 18:55:28,327 INFO L273 TraceCheckUtils]: 155: Hoare triple {19302#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19302#false} is VALID [2018-11-14 18:55:28,328 INFO L273 TraceCheckUtils]: 156: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,328 INFO L273 TraceCheckUtils]: 157: Hoare triple {19302#false} assume !(~i~2 < 9999); {19302#false} is VALID [2018-11-14 18:55:28,328 INFO L273 TraceCheckUtils]: 158: Hoare triple {19302#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {19302#false} is VALID [2018-11-14 18:55:28,328 INFO L256 TraceCheckUtils]: 159: Hoare triple {19302#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {19302#false} is VALID [2018-11-14 18:55:28,328 INFO L273 TraceCheckUtils]: 160: Hoare triple {19302#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19302#false} is VALID [2018-11-14 18:55:28,328 INFO L273 TraceCheckUtils]: 161: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,328 INFO L273 TraceCheckUtils]: 162: Hoare triple {19302#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19302#false} is VALID [2018-11-14 18:55:28,328 INFO L273 TraceCheckUtils]: 163: Hoare triple {19302#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19302#false} is VALID [2018-11-14 18:55:28,328 INFO L273 TraceCheckUtils]: 164: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,328 INFO L273 TraceCheckUtils]: 165: Hoare triple {19302#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19302#false} is VALID [2018-11-14 18:55:28,329 INFO L273 TraceCheckUtils]: 166: Hoare triple {19302#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19302#false} is VALID [2018-11-14 18:55:28,329 INFO L273 TraceCheckUtils]: 167: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,329 INFO L273 TraceCheckUtils]: 168: Hoare triple {19302#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19302#false} is VALID [2018-11-14 18:55:28,329 INFO L273 TraceCheckUtils]: 169: Hoare triple {19302#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19302#false} is VALID [2018-11-14 18:55:28,329 INFO L273 TraceCheckUtils]: 170: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,329 INFO L273 TraceCheckUtils]: 171: Hoare triple {19302#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19302#false} is VALID [2018-11-14 18:55:28,329 INFO L273 TraceCheckUtils]: 172: Hoare triple {19302#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19302#false} is VALID [2018-11-14 18:55:28,329 INFO L273 TraceCheckUtils]: 173: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,329 INFO L273 TraceCheckUtils]: 174: Hoare triple {19302#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19302#false} is VALID [2018-11-14 18:55:28,329 INFO L273 TraceCheckUtils]: 175: Hoare triple {19302#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19302#false} is VALID [2018-11-14 18:55:28,330 INFO L273 TraceCheckUtils]: 176: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,330 INFO L273 TraceCheckUtils]: 177: Hoare triple {19302#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19302#false} is VALID [2018-11-14 18:55:28,330 INFO L273 TraceCheckUtils]: 178: Hoare triple {19302#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19302#false} is VALID [2018-11-14 18:55:28,330 INFO L273 TraceCheckUtils]: 179: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,330 INFO L273 TraceCheckUtils]: 180: Hoare triple {19302#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19302#false} is VALID [2018-11-14 18:55:28,330 INFO L273 TraceCheckUtils]: 181: Hoare triple {19302#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19302#false} is VALID [2018-11-14 18:55:28,330 INFO L273 TraceCheckUtils]: 182: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,330 INFO L273 TraceCheckUtils]: 183: Hoare triple {19302#false} assume !(~i~0 < 10000); {19302#false} is VALID [2018-11-14 18:55:28,330 INFO L273 TraceCheckUtils]: 184: Hoare triple {19302#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19302#false} is VALID [2018-11-14 18:55:28,331 INFO L273 TraceCheckUtils]: 185: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 18:55:28,331 INFO L268 TraceCheckUtils]: 186: Hoare quadruple {19302#false} {19302#false} #77#return; {19302#false} is VALID [2018-11-14 18:55:28,331 INFO L273 TraceCheckUtils]: 187: Hoare triple {19302#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19302#false} is VALID [2018-11-14 18:55:28,331 INFO L273 TraceCheckUtils]: 188: Hoare triple {19302#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19302#false} is VALID [2018-11-14 18:55:28,331 INFO L273 TraceCheckUtils]: 189: Hoare triple {19302#false} assume !false; {19302#false} is VALID [2018-11-14 18:55:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 356 proven. 77 refuted. 0 times theorem prover too weak. 1274 trivial. 0 not checked. [2018-11-14 18:55:28,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:55:28,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 10] total 35 [2018-11-14 18:55:28,369 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 190 [2018-11-14 18:55:28,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:55:28,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-14 18:55:28,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:28,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-14 18:55:28,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-14 18:55:28,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 18:55:28,757 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 35 states. [2018-11-14 18:55:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:30,372 INFO L93 Difference]: Finished difference Result 202 states and 214 transitions. [2018-11-14 18:55:30,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 18:55:30,372 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 190 [2018-11-14 18:55:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:55:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:55:30,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 160 transitions. [2018-11-14 18:55:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:55:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 160 transitions. [2018-11-14 18:55:30,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 160 transitions. [2018-11-14 18:55:30,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:30,522 INFO L225 Difference]: With dead ends: 202 [2018-11-14 18:55:30,523 INFO L226 Difference]: Without dead ends: 145 [2018-11-14 18:55:30,523 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 18:55:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-14 18:55:30,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-14 18:55:30,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:55:30,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-14 18:55:30,576 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-14 18:55:30,576 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-14 18:55:30,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:30,579 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-14 18:55:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-14 18:55:30,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:30,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:30,580 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-14 18:55:30,580 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-14 18:55:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:30,583 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-14 18:55:30,583 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-14 18:55:30,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:30,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:30,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:55:30,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:55:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-14 18:55:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-11-14 18:55:30,586 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 190 [2018-11-14 18:55:30,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:55:30,586 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-11-14 18:55:30,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-14 18:55:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-14 18:55:30,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-14 18:55:30,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:55:30,588 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 25, 25, 24, 24, 7, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:55:30,588 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:55:30,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:55:30,589 INFO L82 PathProgramCache]: Analyzing trace with hash 309486297, now seen corresponding path program 24 times [2018-11-14 18:55:30,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:55:30,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:55:30,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:30,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:55:30,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:32,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {20659#true} call ULTIMATE.init(); {20659#true} is VALID [2018-11-14 18:55:32,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {20659#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20659#true} is VALID [2018-11-14 18:55:32,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20659#true} {20659#true} #69#return; {20659#true} is VALID [2018-11-14 18:55:32,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {20659#true} call #t~ret13 := main(); {20659#true} is VALID [2018-11-14 18:55:32,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {20659#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20661#(= main_~i~1 0)} is VALID [2018-11-14 18:55:32,174 INFO L273 TraceCheckUtils]: 6: Hoare triple {20661#(= main_~i~1 0)} assume true; {20661#(= main_~i~1 0)} is VALID [2018-11-14 18:55:32,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {20661#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20661#(= main_~i~1 0)} is VALID [2018-11-14 18:55:32,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {20661#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20662#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:32,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {20662#(<= main_~i~1 1)} assume true; {20662#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:32,176 INFO L273 TraceCheckUtils]: 10: Hoare triple {20662#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20662#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:32,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {20662#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20663#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:32,177 INFO L273 TraceCheckUtils]: 12: Hoare triple {20663#(<= main_~i~1 2)} assume true; {20663#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:32,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {20663#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20663#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:32,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {20663#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20664#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:32,178 INFO L273 TraceCheckUtils]: 15: Hoare triple {20664#(<= main_~i~1 3)} assume true; {20664#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:32,179 INFO L273 TraceCheckUtils]: 16: Hoare triple {20664#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20664#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:32,179 INFO L273 TraceCheckUtils]: 17: Hoare triple {20664#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20665#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:32,180 INFO L273 TraceCheckUtils]: 18: Hoare triple {20665#(<= main_~i~1 4)} assume true; {20665#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:32,180 INFO L273 TraceCheckUtils]: 19: Hoare triple {20665#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20665#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:32,181 INFO L273 TraceCheckUtils]: 20: Hoare triple {20665#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20666#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:32,182 INFO L273 TraceCheckUtils]: 21: Hoare triple {20666#(<= main_~i~1 5)} assume true; {20666#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:32,182 INFO L273 TraceCheckUtils]: 22: Hoare triple {20666#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20666#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:32,183 INFO L273 TraceCheckUtils]: 23: Hoare triple {20666#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20667#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:32,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {20667#(<= main_~i~1 6)} assume true; {20667#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:32,184 INFO L273 TraceCheckUtils]: 25: Hoare triple {20667#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20667#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:32,185 INFO L273 TraceCheckUtils]: 26: Hoare triple {20667#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20668#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:32,185 INFO L273 TraceCheckUtils]: 27: Hoare triple {20668#(<= main_~i~1 7)} assume true; {20668#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:32,186 INFO L273 TraceCheckUtils]: 28: Hoare triple {20668#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20668#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:32,186 INFO L273 TraceCheckUtils]: 29: Hoare triple {20668#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20669#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:32,187 INFO L273 TraceCheckUtils]: 30: Hoare triple {20669#(<= main_~i~1 8)} assume true; {20669#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:32,187 INFO L273 TraceCheckUtils]: 31: Hoare triple {20669#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20669#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:32,188 INFO L273 TraceCheckUtils]: 32: Hoare triple {20669#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20670#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:32,189 INFO L273 TraceCheckUtils]: 33: Hoare triple {20670#(<= main_~i~1 9)} assume true; {20670#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:32,189 INFO L273 TraceCheckUtils]: 34: Hoare triple {20670#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20670#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:32,190 INFO L273 TraceCheckUtils]: 35: Hoare triple {20670#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20671#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:32,190 INFO L273 TraceCheckUtils]: 36: Hoare triple {20671#(<= main_~i~1 10)} assume true; {20671#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:32,191 INFO L273 TraceCheckUtils]: 37: Hoare triple {20671#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20671#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:32,192 INFO L273 TraceCheckUtils]: 38: Hoare triple {20671#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20672#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:32,192 INFO L273 TraceCheckUtils]: 39: Hoare triple {20672#(<= main_~i~1 11)} assume true; {20672#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:32,193 INFO L273 TraceCheckUtils]: 40: Hoare triple {20672#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20672#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:32,193 INFO L273 TraceCheckUtils]: 41: Hoare triple {20672#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20673#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:32,194 INFO L273 TraceCheckUtils]: 42: Hoare triple {20673#(<= main_~i~1 12)} assume true; {20673#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:32,194 INFO L273 TraceCheckUtils]: 43: Hoare triple {20673#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20673#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:32,195 INFO L273 TraceCheckUtils]: 44: Hoare triple {20673#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20674#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:32,196 INFO L273 TraceCheckUtils]: 45: Hoare triple {20674#(<= main_~i~1 13)} assume true; {20674#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:32,196 INFO L273 TraceCheckUtils]: 46: Hoare triple {20674#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20674#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:32,197 INFO L273 TraceCheckUtils]: 47: Hoare triple {20674#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20675#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:32,197 INFO L273 TraceCheckUtils]: 48: Hoare triple {20675#(<= main_~i~1 14)} assume true; {20675#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:32,198 INFO L273 TraceCheckUtils]: 49: Hoare triple {20675#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20675#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:32,198 INFO L273 TraceCheckUtils]: 50: Hoare triple {20675#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20676#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:32,199 INFO L273 TraceCheckUtils]: 51: Hoare triple {20676#(<= main_~i~1 15)} assume true; {20676#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:32,200 INFO L273 TraceCheckUtils]: 52: Hoare triple {20676#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20676#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:32,200 INFO L273 TraceCheckUtils]: 53: Hoare triple {20676#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20677#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:32,201 INFO L273 TraceCheckUtils]: 54: Hoare triple {20677#(<= main_~i~1 16)} assume true; {20677#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:32,201 INFO L273 TraceCheckUtils]: 55: Hoare triple {20677#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20677#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:32,203 INFO L273 TraceCheckUtils]: 56: Hoare triple {20677#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20678#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:32,203 INFO L273 TraceCheckUtils]: 57: Hoare triple {20678#(<= main_~i~1 17)} assume true; {20678#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:32,204 INFO L273 TraceCheckUtils]: 58: Hoare triple {20678#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20678#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:32,205 INFO L273 TraceCheckUtils]: 59: Hoare triple {20678#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20679#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:32,205 INFO L273 TraceCheckUtils]: 60: Hoare triple {20679#(<= main_~i~1 18)} assume true; {20679#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:32,205 INFO L273 TraceCheckUtils]: 61: Hoare triple {20679#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20679#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:32,206 INFO L273 TraceCheckUtils]: 62: Hoare triple {20679#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20680#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:32,206 INFO L273 TraceCheckUtils]: 63: Hoare triple {20680#(<= main_~i~1 19)} assume true; {20680#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:32,206 INFO L273 TraceCheckUtils]: 64: Hoare triple {20680#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20680#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:32,207 INFO L273 TraceCheckUtils]: 65: Hoare triple {20680#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20681#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:32,207 INFO L273 TraceCheckUtils]: 66: Hoare triple {20681#(<= main_~i~1 20)} assume true; {20681#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:32,207 INFO L273 TraceCheckUtils]: 67: Hoare triple {20681#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20681#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:32,208 INFO L273 TraceCheckUtils]: 68: Hoare triple {20681#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20682#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:32,208 INFO L273 TraceCheckUtils]: 69: Hoare triple {20682#(<= main_~i~1 21)} assume true; {20682#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:32,209 INFO L273 TraceCheckUtils]: 70: Hoare triple {20682#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20682#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:32,210 INFO L273 TraceCheckUtils]: 71: Hoare triple {20682#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20683#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:32,210 INFO L273 TraceCheckUtils]: 72: Hoare triple {20683#(<= main_~i~1 22)} assume true; {20683#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:32,211 INFO L273 TraceCheckUtils]: 73: Hoare triple {20683#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20683#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:32,211 INFO L273 TraceCheckUtils]: 74: Hoare triple {20683#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20684#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:32,212 INFO L273 TraceCheckUtils]: 75: Hoare triple {20684#(<= main_~i~1 23)} assume true; {20684#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:32,212 INFO L273 TraceCheckUtils]: 76: Hoare triple {20684#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20684#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:32,213 INFO L273 TraceCheckUtils]: 77: Hoare triple {20684#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20685#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:32,214 INFO L273 TraceCheckUtils]: 78: Hoare triple {20685#(<= main_~i~1 24)} assume true; {20685#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:32,214 INFO L273 TraceCheckUtils]: 79: Hoare triple {20685#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20685#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:32,215 INFO L273 TraceCheckUtils]: 80: Hoare triple {20685#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20686#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:32,215 INFO L273 TraceCheckUtils]: 81: Hoare triple {20686#(<= main_~i~1 25)} assume true; {20686#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:32,216 INFO L273 TraceCheckUtils]: 82: Hoare triple {20686#(<= main_~i~1 25)} assume !(~i~1 < 10000); {20660#false} is VALID [2018-11-14 18:55:32,216 INFO L256 TraceCheckUtils]: 83: Hoare triple {20660#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {20659#true} is VALID [2018-11-14 18:55:32,216 INFO L273 TraceCheckUtils]: 84: Hoare triple {20659#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20659#true} is VALID [2018-11-14 18:55:32,217 INFO L273 TraceCheckUtils]: 85: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,217 INFO L273 TraceCheckUtils]: 86: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,217 INFO L273 TraceCheckUtils]: 87: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,217 INFO L273 TraceCheckUtils]: 88: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,217 INFO L273 TraceCheckUtils]: 89: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,217 INFO L273 TraceCheckUtils]: 90: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,218 INFO L273 TraceCheckUtils]: 91: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,218 INFO L273 TraceCheckUtils]: 92: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,218 INFO L273 TraceCheckUtils]: 93: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,218 INFO L273 TraceCheckUtils]: 94: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,218 INFO L273 TraceCheckUtils]: 95: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,219 INFO L273 TraceCheckUtils]: 96: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,219 INFO L273 TraceCheckUtils]: 97: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,219 INFO L273 TraceCheckUtils]: 98: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,219 INFO L273 TraceCheckUtils]: 99: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,219 INFO L273 TraceCheckUtils]: 100: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,219 INFO L273 TraceCheckUtils]: 101: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,219 INFO L273 TraceCheckUtils]: 102: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,219 INFO L273 TraceCheckUtils]: 103: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,219 INFO L273 TraceCheckUtils]: 104: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,220 INFO L273 TraceCheckUtils]: 105: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,220 INFO L273 TraceCheckUtils]: 106: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,220 INFO L273 TraceCheckUtils]: 107: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,220 INFO L273 TraceCheckUtils]: 108: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,220 INFO L273 TraceCheckUtils]: 109: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,220 INFO L273 TraceCheckUtils]: 110: Hoare triple {20659#true} assume !(~i~0 < 10000); {20659#true} is VALID [2018-11-14 18:55:32,220 INFO L273 TraceCheckUtils]: 111: Hoare triple {20659#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20659#true} is VALID [2018-11-14 18:55:32,220 INFO L273 TraceCheckUtils]: 112: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,220 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {20659#true} {20660#false} #73#return; {20660#false} is VALID [2018-11-14 18:55:32,220 INFO L273 TraceCheckUtils]: 114: Hoare triple {20660#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {20660#false} is VALID [2018-11-14 18:55:32,221 INFO L256 TraceCheckUtils]: 115: Hoare triple {20660#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {20659#true} is VALID [2018-11-14 18:55:32,221 INFO L273 TraceCheckUtils]: 116: Hoare triple {20659#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20659#true} is VALID [2018-11-14 18:55:32,221 INFO L273 TraceCheckUtils]: 117: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,221 INFO L273 TraceCheckUtils]: 118: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,221 INFO L273 TraceCheckUtils]: 119: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,221 INFO L273 TraceCheckUtils]: 120: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,221 INFO L273 TraceCheckUtils]: 121: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,221 INFO L273 TraceCheckUtils]: 122: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,221 INFO L273 TraceCheckUtils]: 123: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,222 INFO L273 TraceCheckUtils]: 124: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,222 INFO L273 TraceCheckUtils]: 125: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,222 INFO L273 TraceCheckUtils]: 126: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,222 INFO L273 TraceCheckUtils]: 127: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,222 INFO L273 TraceCheckUtils]: 128: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,222 INFO L273 TraceCheckUtils]: 129: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,222 INFO L273 TraceCheckUtils]: 130: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,222 INFO L273 TraceCheckUtils]: 131: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,222 INFO L273 TraceCheckUtils]: 132: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,222 INFO L273 TraceCheckUtils]: 133: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,223 INFO L273 TraceCheckUtils]: 134: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,223 INFO L273 TraceCheckUtils]: 135: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,223 INFO L273 TraceCheckUtils]: 136: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,223 INFO L273 TraceCheckUtils]: 137: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,223 INFO L273 TraceCheckUtils]: 138: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,223 INFO L273 TraceCheckUtils]: 139: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,223 INFO L273 TraceCheckUtils]: 140: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,223 INFO L273 TraceCheckUtils]: 141: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,223 INFO L273 TraceCheckUtils]: 142: Hoare triple {20659#true} assume !(~i~0 < 10000); {20659#true} is VALID [2018-11-14 18:55:32,223 INFO L273 TraceCheckUtils]: 143: Hoare triple {20659#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20659#true} is VALID [2018-11-14 18:55:32,224 INFO L273 TraceCheckUtils]: 144: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,224 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {20659#true} {20660#false} #75#return; {20660#false} is VALID [2018-11-14 18:55:32,224 INFO L273 TraceCheckUtils]: 146: Hoare triple {20660#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {20660#false} is VALID [2018-11-14 18:55:32,224 INFO L273 TraceCheckUtils]: 147: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:32,224 INFO L273 TraceCheckUtils]: 148: Hoare triple {20660#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20660#false} is VALID [2018-11-14 18:55:32,224 INFO L273 TraceCheckUtils]: 149: Hoare triple {20660#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20660#false} is VALID [2018-11-14 18:55:32,224 INFO L273 TraceCheckUtils]: 150: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:32,224 INFO L273 TraceCheckUtils]: 151: Hoare triple {20660#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20660#false} is VALID [2018-11-14 18:55:32,224 INFO L273 TraceCheckUtils]: 152: Hoare triple {20660#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20660#false} is VALID [2018-11-14 18:55:32,224 INFO L273 TraceCheckUtils]: 153: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:32,225 INFO L273 TraceCheckUtils]: 154: Hoare triple {20660#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20660#false} is VALID [2018-11-14 18:55:32,225 INFO L273 TraceCheckUtils]: 155: Hoare triple {20660#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20660#false} is VALID [2018-11-14 18:55:32,225 INFO L273 TraceCheckUtils]: 156: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:32,225 INFO L273 TraceCheckUtils]: 157: Hoare triple {20660#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20660#false} is VALID [2018-11-14 18:55:32,225 INFO L273 TraceCheckUtils]: 158: Hoare triple {20660#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20660#false} is VALID [2018-11-14 18:55:32,225 INFO L273 TraceCheckUtils]: 159: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:32,225 INFO L273 TraceCheckUtils]: 160: Hoare triple {20660#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20660#false} is VALID [2018-11-14 18:55:32,225 INFO L273 TraceCheckUtils]: 161: Hoare triple {20660#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20660#false} is VALID [2018-11-14 18:55:32,225 INFO L273 TraceCheckUtils]: 162: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:32,225 INFO L273 TraceCheckUtils]: 163: Hoare triple {20660#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20660#false} is VALID [2018-11-14 18:55:32,226 INFO L273 TraceCheckUtils]: 164: Hoare triple {20660#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20660#false} is VALID [2018-11-14 18:55:32,226 INFO L273 TraceCheckUtils]: 165: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:32,226 INFO L273 TraceCheckUtils]: 166: Hoare triple {20660#false} assume !(~i~2 < 9999); {20660#false} is VALID [2018-11-14 18:55:32,226 INFO L273 TraceCheckUtils]: 167: Hoare triple {20660#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {20660#false} is VALID [2018-11-14 18:55:32,226 INFO L256 TraceCheckUtils]: 168: Hoare triple {20660#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {20659#true} is VALID [2018-11-14 18:55:32,226 INFO L273 TraceCheckUtils]: 169: Hoare triple {20659#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20659#true} is VALID [2018-11-14 18:55:32,226 INFO L273 TraceCheckUtils]: 170: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,226 INFO L273 TraceCheckUtils]: 171: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,226 INFO L273 TraceCheckUtils]: 172: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,227 INFO L273 TraceCheckUtils]: 173: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,227 INFO L273 TraceCheckUtils]: 174: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,227 INFO L273 TraceCheckUtils]: 175: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,227 INFO L273 TraceCheckUtils]: 176: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,227 INFO L273 TraceCheckUtils]: 177: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,227 INFO L273 TraceCheckUtils]: 178: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,227 INFO L273 TraceCheckUtils]: 179: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,227 INFO L273 TraceCheckUtils]: 180: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,227 INFO L273 TraceCheckUtils]: 181: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,227 INFO L273 TraceCheckUtils]: 182: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,228 INFO L273 TraceCheckUtils]: 183: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,228 INFO L273 TraceCheckUtils]: 184: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,228 INFO L273 TraceCheckUtils]: 185: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,228 INFO L273 TraceCheckUtils]: 186: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,228 INFO L273 TraceCheckUtils]: 187: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,228 INFO L273 TraceCheckUtils]: 188: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,228 INFO L273 TraceCheckUtils]: 189: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,228 INFO L273 TraceCheckUtils]: 190: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,228 INFO L273 TraceCheckUtils]: 191: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,228 INFO L273 TraceCheckUtils]: 192: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:32,229 INFO L273 TraceCheckUtils]: 193: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:32,229 INFO L273 TraceCheckUtils]: 194: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,229 INFO L273 TraceCheckUtils]: 195: Hoare triple {20659#true} assume !(~i~0 < 10000); {20659#true} is VALID [2018-11-14 18:55:32,229 INFO L273 TraceCheckUtils]: 196: Hoare triple {20659#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20659#true} is VALID [2018-11-14 18:55:32,229 INFO L273 TraceCheckUtils]: 197: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:32,229 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {20659#true} {20660#false} #77#return; {20660#false} is VALID [2018-11-14 18:55:32,229 INFO L273 TraceCheckUtils]: 199: Hoare triple {20660#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20660#false} is VALID [2018-11-14 18:55:32,229 INFO L273 TraceCheckUtils]: 200: Hoare triple {20660#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20660#false} is VALID [2018-11-14 18:55:32,229 INFO L273 TraceCheckUtils]: 201: Hoare triple {20660#false} assume !false; {20660#false} is VALID [2018-11-14 18:55:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1997 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2018-11-14 18:55:32,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:55:32,249 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-14 18:55:32,257 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:55:33,510 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-14 18:55:33,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:55:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:33,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:55:33,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {20659#true} call ULTIMATE.init(); {20659#true} is VALID [2018-11-14 18:55:33,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {20659#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20659#true} is VALID [2018-11-14 18:55:33,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,919 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20659#true} {20659#true} #69#return; {20659#true} is VALID [2018-11-14 18:55:33,919 INFO L256 TraceCheckUtils]: 4: Hoare triple {20659#true} call #t~ret13 := main(); {20659#true} is VALID [2018-11-14 18:55:33,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {20659#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20659#true} is VALID [2018-11-14 18:55:33,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,919 INFO L273 TraceCheckUtils]: 8: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,920 INFO L273 TraceCheckUtils]: 9: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,920 INFO L273 TraceCheckUtils]: 10: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,920 INFO L273 TraceCheckUtils]: 11: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,921 INFO L273 TraceCheckUtils]: 16: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,921 INFO L273 TraceCheckUtils]: 17: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,921 INFO L273 TraceCheckUtils]: 19: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,921 INFO L273 TraceCheckUtils]: 21: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,921 INFO L273 TraceCheckUtils]: 22: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,922 INFO L273 TraceCheckUtils]: 23: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,922 INFO L273 TraceCheckUtils]: 24: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,922 INFO L273 TraceCheckUtils]: 25: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,922 INFO L273 TraceCheckUtils]: 26: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,922 INFO L273 TraceCheckUtils]: 27: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,922 INFO L273 TraceCheckUtils]: 28: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,922 INFO L273 TraceCheckUtils]: 29: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,922 INFO L273 TraceCheckUtils]: 30: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,922 INFO L273 TraceCheckUtils]: 31: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,922 INFO L273 TraceCheckUtils]: 32: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,923 INFO L273 TraceCheckUtils]: 33: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,923 INFO L273 TraceCheckUtils]: 34: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,923 INFO L273 TraceCheckUtils]: 35: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,923 INFO L273 TraceCheckUtils]: 36: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,923 INFO L273 TraceCheckUtils]: 37: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,923 INFO L273 TraceCheckUtils]: 38: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,923 INFO L273 TraceCheckUtils]: 39: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,923 INFO L273 TraceCheckUtils]: 40: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,923 INFO L273 TraceCheckUtils]: 41: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,924 INFO L273 TraceCheckUtils]: 42: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,924 INFO L273 TraceCheckUtils]: 43: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,924 INFO L273 TraceCheckUtils]: 44: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,924 INFO L273 TraceCheckUtils]: 45: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,924 INFO L273 TraceCheckUtils]: 46: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,924 INFO L273 TraceCheckUtils]: 47: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,924 INFO L273 TraceCheckUtils]: 48: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,924 INFO L273 TraceCheckUtils]: 49: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,924 INFO L273 TraceCheckUtils]: 50: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,924 INFO L273 TraceCheckUtils]: 51: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,925 INFO L273 TraceCheckUtils]: 52: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,925 INFO L273 TraceCheckUtils]: 53: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,925 INFO L273 TraceCheckUtils]: 54: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,925 INFO L273 TraceCheckUtils]: 55: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,925 INFO L273 TraceCheckUtils]: 56: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,925 INFO L273 TraceCheckUtils]: 57: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,925 INFO L273 TraceCheckUtils]: 58: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,925 INFO L273 TraceCheckUtils]: 59: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,925 INFO L273 TraceCheckUtils]: 60: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,925 INFO L273 TraceCheckUtils]: 61: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,926 INFO L273 TraceCheckUtils]: 62: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,926 INFO L273 TraceCheckUtils]: 63: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,926 INFO L273 TraceCheckUtils]: 64: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,926 INFO L273 TraceCheckUtils]: 65: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,926 INFO L273 TraceCheckUtils]: 66: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,926 INFO L273 TraceCheckUtils]: 67: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,926 INFO L273 TraceCheckUtils]: 68: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,926 INFO L273 TraceCheckUtils]: 69: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,926 INFO L273 TraceCheckUtils]: 70: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,926 INFO L273 TraceCheckUtils]: 71: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,927 INFO L273 TraceCheckUtils]: 72: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,927 INFO L273 TraceCheckUtils]: 73: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,927 INFO L273 TraceCheckUtils]: 74: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,927 INFO L273 TraceCheckUtils]: 75: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,927 INFO L273 TraceCheckUtils]: 76: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20659#true} is VALID [2018-11-14 18:55:33,927 INFO L273 TraceCheckUtils]: 77: Hoare triple {20659#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20659#true} is VALID [2018-11-14 18:55:33,927 INFO L273 TraceCheckUtils]: 78: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,928 INFO L273 TraceCheckUtils]: 79: Hoare triple {20659#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20927#(< main_~i~1 10000)} is VALID [2018-11-14 18:55:33,928 INFO L273 TraceCheckUtils]: 80: Hoare triple {20927#(< main_~i~1 10000)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20931#(<= main_~i~1 10000)} is VALID [2018-11-14 18:55:33,928 INFO L273 TraceCheckUtils]: 81: Hoare triple {20931#(<= main_~i~1 10000)} assume true; {20931#(<= main_~i~1 10000)} is VALID [2018-11-14 18:55:33,929 INFO L273 TraceCheckUtils]: 82: Hoare triple {20931#(<= main_~i~1 10000)} assume !(~i~1 < 10000); {20659#true} is VALID [2018-11-14 18:55:33,929 INFO L256 TraceCheckUtils]: 83: Hoare triple {20659#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {20659#true} is VALID [2018-11-14 18:55:33,929 INFO L273 TraceCheckUtils]: 84: Hoare triple {20659#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20659#true} is VALID [2018-11-14 18:55:33,929 INFO L273 TraceCheckUtils]: 85: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,929 INFO L273 TraceCheckUtils]: 86: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,929 INFO L273 TraceCheckUtils]: 87: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,929 INFO L273 TraceCheckUtils]: 88: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,929 INFO L273 TraceCheckUtils]: 89: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,929 INFO L273 TraceCheckUtils]: 90: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,930 INFO L273 TraceCheckUtils]: 91: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,930 INFO L273 TraceCheckUtils]: 92: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,930 INFO L273 TraceCheckUtils]: 93: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,930 INFO L273 TraceCheckUtils]: 94: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,930 INFO L273 TraceCheckUtils]: 95: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,930 INFO L273 TraceCheckUtils]: 96: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,930 INFO L273 TraceCheckUtils]: 97: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,930 INFO L273 TraceCheckUtils]: 98: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,930 INFO L273 TraceCheckUtils]: 99: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,930 INFO L273 TraceCheckUtils]: 100: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,931 INFO L273 TraceCheckUtils]: 101: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,931 INFO L273 TraceCheckUtils]: 102: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,931 INFO L273 TraceCheckUtils]: 103: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,931 INFO L273 TraceCheckUtils]: 104: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,931 INFO L273 TraceCheckUtils]: 105: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,931 INFO L273 TraceCheckUtils]: 106: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,931 INFO L273 TraceCheckUtils]: 107: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,931 INFO L273 TraceCheckUtils]: 108: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,931 INFO L273 TraceCheckUtils]: 109: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,931 INFO L273 TraceCheckUtils]: 110: Hoare triple {20659#true} assume !(~i~0 < 10000); {20659#true} is VALID [2018-11-14 18:55:33,932 INFO L273 TraceCheckUtils]: 111: Hoare triple {20659#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20659#true} is VALID [2018-11-14 18:55:33,932 INFO L273 TraceCheckUtils]: 112: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,932 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {20659#true} {20659#true} #73#return; {20659#true} is VALID [2018-11-14 18:55:33,932 INFO L273 TraceCheckUtils]: 114: Hoare triple {20659#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {20659#true} is VALID [2018-11-14 18:55:33,932 INFO L256 TraceCheckUtils]: 115: Hoare triple {20659#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {20659#true} is VALID [2018-11-14 18:55:33,932 INFO L273 TraceCheckUtils]: 116: Hoare triple {20659#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20659#true} is VALID [2018-11-14 18:55:33,932 INFO L273 TraceCheckUtils]: 117: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,932 INFO L273 TraceCheckUtils]: 118: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,932 INFO L273 TraceCheckUtils]: 119: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,932 INFO L273 TraceCheckUtils]: 120: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,933 INFO L273 TraceCheckUtils]: 121: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,933 INFO L273 TraceCheckUtils]: 122: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,933 INFO L273 TraceCheckUtils]: 123: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,933 INFO L273 TraceCheckUtils]: 124: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,933 INFO L273 TraceCheckUtils]: 125: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,933 INFO L273 TraceCheckUtils]: 126: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,933 INFO L273 TraceCheckUtils]: 127: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,933 INFO L273 TraceCheckUtils]: 128: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,933 INFO L273 TraceCheckUtils]: 129: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,933 INFO L273 TraceCheckUtils]: 130: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,934 INFO L273 TraceCheckUtils]: 131: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,934 INFO L273 TraceCheckUtils]: 132: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,934 INFO L273 TraceCheckUtils]: 133: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,934 INFO L273 TraceCheckUtils]: 134: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,934 INFO L273 TraceCheckUtils]: 135: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,934 INFO L273 TraceCheckUtils]: 136: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,934 INFO L273 TraceCheckUtils]: 137: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,934 INFO L273 TraceCheckUtils]: 138: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,934 INFO L273 TraceCheckUtils]: 139: Hoare triple {20659#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20659#true} is VALID [2018-11-14 18:55:33,935 INFO L273 TraceCheckUtils]: 140: Hoare triple {20659#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20659#true} is VALID [2018-11-14 18:55:33,935 INFO L273 TraceCheckUtils]: 141: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,935 INFO L273 TraceCheckUtils]: 142: Hoare triple {20659#true} assume !(~i~0 < 10000); {20659#true} is VALID [2018-11-14 18:55:33,935 INFO L273 TraceCheckUtils]: 143: Hoare triple {20659#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20659#true} is VALID [2018-11-14 18:55:33,935 INFO L273 TraceCheckUtils]: 144: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 18:55:33,935 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {20659#true} {20659#true} #75#return; {20659#true} is VALID [2018-11-14 18:55:33,936 INFO L273 TraceCheckUtils]: 146: Hoare triple {20659#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {21130#(<= main_~i~2 0)} is VALID [2018-11-14 18:55:33,936 INFO L273 TraceCheckUtils]: 147: Hoare triple {21130#(<= main_~i~2 0)} assume true; {21130#(<= main_~i~2 0)} is VALID [2018-11-14 18:55:33,936 INFO L273 TraceCheckUtils]: 148: Hoare triple {21130#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21130#(<= main_~i~2 0)} is VALID [2018-11-14 18:55:33,937 INFO L273 TraceCheckUtils]: 149: Hoare triple {21130#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21140#(<= main_~i~2 1)} is VALID [2018-11-14 18:55:33,937 INFO L273 TraceCheckUtils]: 150: Hoare triple {21140#(<= main_~i~2 1)} assume true; {21140#(<= main_~i~2 1)} is VALID [2018-11-14 18:55:33,937 INFO L273 TraceCheckUtils]: 151: Hoare triple {21140#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21140#(<= main_~i~2 1)} is VALID [2018-11-14 18:55:33,938 INFO L273 TraceCheckUtils]: 152: Hoare triple {21140#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21150#(<= main_~i~2 2)} is VALID [2018-11-14 18:55:33,938 INFO L273 TraceCheckUtils]: 153: Hoare triple {21150#(<= main_~i~2 2)} assume true; {21150#(<= main_~i~2 2)} is VALID [2018-11-14 18:55:33,938 INFO L273 TraceCheckUtils]: 154: Hoare triple {21150#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21150#(<= main_~i~2 2)} is VALID [2018-11-14 18:55:33,939 INFO L273 TraceCheckUtils]: 155: Hoare triple {21150#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21160#(<= main_~i~2 3)} is VALID [2018-11-14 18:55:33,939 INFO L273 TraceCheckUtils]: 156: Hoare triple {21160#(<= main_~i~2 3)} assume true; {21160#(<= main_~i~2 3)} is VALID [2018-11-14 18:55:33,940 INFO L273 TraceCheckUtils]: 157: Hoare triple {21160#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21160#(<= main_~i~2 3)} is VALID [2018-11-14 18:55:33,940 INFO L273 TraceCheckUtils]: 158: Hoare triple {21160#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21170#(<= main_~i~2 4)} is VALID [2018-11-14 18:55:33,941 INFO L273 TraceCheckUtils]: 159: Hoare triple {21170#(<= main_~i~2 4)} assume true; {21170#(<= main_~i~2 4)} is VALID [2018-11-14 18:55:33,941 INFO L273 TraceCheckUtils]: 160: Hoare triple {21170#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21170#(<= main_~i~2 4)} is VALID [2018-11-14 18:55:33,942 INFO L273 TraceCheckUtils]: 161: Hoare triple {21170#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21180#(<= main_~i~2 5)} is VALID [2018-11-14 18:55:33,943 INFO L273 TraceCheckUtils]: 162: Hoare triple {21180#(<= main_~i~2 5)} assume true; {21180#(<= main_~i~2 5)} is VALID [2018-11-14 18:55:33,943 INFO L273 TraceCheckUtils]: 163: Hoare triple {21180#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21180#(<= main_~i~2 5)} is VALID [2018-11-14 18:55:33,944 INFO L273 TraceCheckUtils]: 164: Hoare triple {21180#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21190#(<= main_~i~2 6)} is VALID [2018-11-14 18:55:33,944 INFO L273 TraceCheckUtils]: 165: Hoare triple {21190#(<= main_~i~2 6)} assume true; {21190#(<= main_~i~2 6)} is VALID [2018-11-14 18:55:33,945 INFO L273 TraceCheckUtils]: 166: Hoare triple {21190#(<= main_~i~2 6)} assume !(~i~2 < 9999); {20660#false} is VALID [2018-11-14 18:55:33,945 INFO L273 TraceCheckUtils]: 167: Hoare triple {20660#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {20660#false} is VALID [2018-11-14 18:55:33,945 INFO L256 TraceCheckUtils]: 168: Hoare triple {20660#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {20660#false} is VALID [2018-11-14 18:55:33,946 INFO L273 TraceCheckUtils]: 169: Hoare triple {20660#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20660#false} is VALID [2018-11-14 18:55:33,946 INFO L273 TraceCheckUtils]: 170: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:33,946 INFO L273 TraceCheckUtils]: 171: Hoare triple {20660#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20660#false} is VALID [2018-11-14 18:55:33,946 INFO L273 TraceCheckUtils]: 172: Hoare triple {20660#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20660#false} is VALID [2018-11-14 18:55:33,946 INFO L273 TraceCheckUtils]: 173: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:33,946 INFO L273 TraceCheckUtils]: 174: Hoare triple {20660#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20660#false} is VALID [2018-11-14 18:55:33,947 INFO L273 TraceCheckUtils]: 175: Hoare triple {20660#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20660#false} is VALID [2018-11-14 18:55:33,947 INFO L273 TraceCheckUtils]: 176: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:33,947 INFO L273 TraceCheckUtils]: 177: Hoare triple {20660#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20660#false} is VALID [2018-11-14 18:55:33,947 INFO L273 TraceCheckUtils]: 178: Hoare triple {20660#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20660#false} is VALID [2018-11-14 18:55:33,947 INFO L273 TraceCheckUtils]: 179: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:33,947 INFO L273 TraceCheckUtils]: 180: Hoare triple {20660#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20660#false} is VALID [2018-11-14 18:55:33,947 INFO L273 TraceCheckUtils]: 181: Hoare triple {20660#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20660#false} is VALID [2018-11-14 18:55:33,947 INFO L273 TraceCheckUtils]: 182: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:33,948 INFO L273 TraceCheckUtils]: 183: Hoare triple {20660#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20660#false} is VALID [2018-11-14 18:55:33,948 INFO L273 TraceCheckUtils]: 184: Hoare triple {20660#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20660#false} is VALID [2018-11-14 18:55:33,948 INFO L273 TraceCheckUtils]: 185: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:33,948 INFO L273 TraceCheckUtils]: 186: Hoare triple {20660#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20660#false} is VALID [2018-11-14 18:55:33,948 INFO L273 TraceCheckUtils]: 187: Hoare triple {20660#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20660#false} is VALID [2018-11-14 18:55:33,948 INFO L273 TraceCheckUtils]: 188: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:33,948 INFO L273 TraceCheckUtils]: 189: Hoare triple {20660#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20660#false} is VALID [2018-11-14 18:55:33,948 INFO L273 TraceCheckUtils]: 190: Hoare triple {20660#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20660#false} is VALID [2018-11-14 18:55:33,948 INFO L273 TraceCheckUtils]: 191: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:33,948 INFO L273 TraceCheckUtils]: 192: Hoare triple {20660#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20660#false} is VALID [2018-11-14 18:55:33,949 INFO L273 TraceCheckUtils]: 193: Hoare triple {20660#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20660#false} is VALID [2018-11-14 18:55:33,949 INFO L273 TraceCheckUtils]: 194: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:33,949 INFO L273 TraceCheckUtils]: 195: Hoare triple {20660#false} assume !(~i~0 < 10000); {20660#false} is VALID [2018-11-14 18:55:33,949 INFO L273 TraceCheckUtils]: 196: Hoare triple {20660#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20660#false} is VALID [2018-11-14 18:55:33,949 INFO L273 TraceCheckUtils]: 197: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 18:55:33,949 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {20660#false} {20660#false} #77#return; {20660#false} is VALID [2018-11-14 18:55:33,949 INFO L273 TraceCheckUtils]: 199: Hoare triple {20660#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20660#false} is VALID [2018-11-14 18:55:33,949 INFO L273 TraceCheckUtils]: 200: Hoare triple {20660#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20660#false} is VALID [2018-11-14 18:55:33,949 INFO L273 TraceCheckUtils]: 201: Hoare triple {20660#false} assume !false; {20660#false} is VALID [2018-11-14 18:55:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1997 backedges. 534 proven. 57 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-11-14 18:55:33,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:55:33,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 11] total 37 [2018-11-14 18:55:33,988 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 202 [2018-11-14 18:55:33,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:55:33,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-14 18:55:34,124 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-14 18:55:34,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-14 18:55:34,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-14 18:55:34,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=862, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 18:55:34,126 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 37 states. [2018-11-14 18:55:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:35,051 INFO L93 Difference]: Finished difference Result 213 states and 223 transitions. [2018-11-14 18:55:35,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-14 18:55:35,051 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 202 [2018-11-14 18:55:35,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:55:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 18:55:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 160 transitions. [2018-11-14 18:55:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 18:55:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 160 transitions. [2018-11-14 18:55:35,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 160 transitions. [2018-11-14 18:55:35,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:35,207 INFO L225 Difference]: With dead ends: 213 [2018-11-14 18:55:35,207 INFO L226 Difference]: Without dead ends: 153 [2018-11-14 18:55:35,208 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=540, Invalid=1352, Unknown=0, NotChecked=0, Total=1892 [2018-11-14 18:55:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-14 18:55:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-11-14 18:55:35,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:55:35,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 152 states. [2018-11-14 18:55:35,319 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 152 states. [2018-11-14 18:55:35,319 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 152 states. [2018-11-14 18:55:35,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:35,322 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-14 18:55:35,322 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-14 18:55:35,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:35,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:35,323 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 153 states. [2018-11-14 18:55:35,323 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 153 states. [2018-11-14 18:55:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:35,326 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-14 18:55:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-14 18:55:35,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:35,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:35,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:55:35,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:55:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-14 18:55:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2018-11-14 18:55:35,330 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 202 [2018-11-14 18:55:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:55:35,330 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2018-11-14 18:55:35,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-14 18:55:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2018-11-14 18:55:35,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-14 18:55:35,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:55:35,332 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 24, 24, 8, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:55:35,332 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:55:35,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:55:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2120318193, now seen corresponding path program 25 times [2018-11-14 18:55:35,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:55:35,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:55:35,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:35,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:55:35,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:35,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {22112#true} call ULTIMATE.init(); {22112#true} is VALID [2018-11-14 18:55:35,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {22112#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22112#true} is VALID [2018-11-14 18:55:35,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,864 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22112#true} {22112#true} #69#return; {22112#true} is VALID [2018-11-14 18:55:35,864 INFO L256 TraceCheckUtils]: 4: Hoare triple {22112#true} call #t~ret13 := main(); {22112#true} is VALID [2018-11-14 18:55:35,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {22112#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22114#(= main_~i~1 0)} is VALID [2018-11-14 18:55:35,865 INFO L273 TraceCheckUtils]: 6: Hoare triple {22114#(= main_~i~1 0)} assume true; {22114#(= main_~i~1 0)} is VALID [2018-11-14 18:55:35,866 INFO L273 TraceCheckUtils]: 7: Hoare triple {22114#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22114#(= main_~i~1 0)} is VALID [2018-11-14 18:55:35,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {22114#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22115#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:35,867 INFO L273 TraceCheckUtils]: 9: Hoare triple {22115#(<= main_~i~1 1)} assume true; {22115#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:35,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {22115#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22115#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:35,868 INFO L273 TraceCheckUtils]: 11: Hoare triple {22115#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22116#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:35,869 INFO L273 TraceCheckUtils]: 12: Hoare triple {22116#(<= main_~i~1 2)} assume true; {22116#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:35,869 INFO L273 TraceCheckUtils]: 13: Hoare triple {22116#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22116#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:35,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {22116#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22117#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:35,870 INFO L273 TraceCheckUtils]: 15: Hoare triple {22117#(<= main_~i~1 3)} assume true; {22117#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:35,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {22117#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22117#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:35,872 INFO L273 TraceCheckUtils]: 17: Hoare triple {22117#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22118#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:35,872 INFO L273 TraceCheckUtils]: 18: Hoare triple {22118#(<= main_~i~1 4)} assume true; {22118#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:35,873 INFO L273 TraceCheckUtils]: 19: Hoare triple {22118#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22118#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:35,873 INFO L273 TraceCheckUtils]: 20: Hoare triple {22118#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22119#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:35,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {22119#(<= main_~i~1 5)} assume true; {22119#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:35,874 INFO L273 TraceCheckUtils]: 22: Hoare triple {22119#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22119#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:35,875 INFO L273 TraceCheckUtils]: 23: Hoare triple {22119#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22120#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:35,876 INFO L273 TraceCheckUtils]: 24: Hoare triple {22120#(<= main_~i~1 6)} assume true; {22120#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:35,876 INFO L273 TraceCheckUtils]: 25: Hoare triple {22120#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22120#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:35,877 INFO L273 TraceCheckUtils]: 26: Hoare triple {22120#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22121#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:35,877 INFO L273 TraceCheckUtils]: 27: Hoare triple {22121#(<= main_~i~1 7)} assume true; {22121#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:35,878 INFO L273 TraceCheckUtils]: 28: Hoare triple {22121#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22121#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:35,879 INFO L273 TraceCheckUtils]: 29: Hoare triple {22121#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22122#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:35,879 INFO L273 TraceCheckUtils]: 30: Hoare triple {22122#(<= main_~i~1 8)} assume true; {22122#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:35,880 INFO L273 TraceCheckUtils]: 31: Hoare triple {22122#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22122#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:35,880 INFO L273 TraceCheckUtils]: 32: Hoare triple {22122#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22123#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:35,881 INFO L273 TraceCheckUtils]: 33: Hoare triple {22123#(<= main_~i~1 9)} assume true; {22123#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:35,881 INFO L273 TraceCheckUtils]: 34: Hoare triple {22123#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22123#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:35,882 INFO L273 TraceCheckUtils]: 35: Hoare triple {22123#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22124#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:35,883 INFO L273 TraceCheckUtils]: 36: Hoare triple {22124#(<= main_~i~1 10)} assume true; {22124#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:35,883 INFO L273 TraceCheckUtils]: 37: Hoare triple {22124#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22124#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:35,884 INFO L273 TraceCheckUtils]: 38: Hoare triple {22124#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22125#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:35,884 INFO L273 TraceCheckUtils]: 39: Hoare triple {22125#(<= main_~i~1 11)} assume true; {22125#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:35,885 INFO L273 TraceCheckUtils]: 40: Hoare triple {22125#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22125#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:35,886 INFO L273 TraceCheckUtils]: 41: Hoare triple {22125#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22126#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:35,886 INFO L273 TraceCheckUtils]: 42: Hoare triple {22126#(<= main_~i~1 12)} assume true; {22126#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:35,887 INFO L273 TraceCheckUtils]: 43: Hoare triple {22126#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22126#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:35,887 INFO L273 TraceCheckUtils]: 44: Hoare triple {22126#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22127#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:35,888 INFO L273 TraceCheckUtils]: 45: Hoare triple {22127#(<= main_~i~1 13)} assume true; {22127#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:35,888 INFO L273 TraceCheckUtils]: 46: Hoare triple {22127#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22127#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:35,889 INFO L273 TraceCheckUtils]: 47: Hoare triple {22127#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22128#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:35,889 INFO L273 TraceCheckUtils]: 48: Hoare triple {22128#(<= main_~i~1 14)} assume true; {22128#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:35,890 INFO L273 TraceCheckUtils]: 49: Hoare triple {22128#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22128#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:35,891 INFO L273 TraceCheckUtils]: 50: Hoare triple {22128#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22129#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:35,891 INFO L273 TraceCheckUtils]: 51: Hoare triple {22129#(<= main_~i~1 15)} assume true; {22129#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:35,892 INFO L273 TraceCheckUtils]: 52: Hoare triple {22129#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22129#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:35,892 INFO L273 TraceCheckUtils]: 53: Hoare triple {22129#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22130#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:35,893 INFO L273 TraceCheckUtils]: 54: Hoare triple {22130#(<= main_~i~1 16)} assume true; {22130#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:35,893 INFO L273 TraceCheckUtils]: 55: Hoare triple {22130#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22130#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:35,894 INFO L273 TraceCheckUtils]: 56: Hoare triple {22130#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22131#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:35,895 INFO L273 TraceCheckUtils]: 57: Hoare triple {22131#(<= main_~i~1 17)} assume true; {22131#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:35,895 INFO L273 TraceCheckUtils]: 58: Hoare triple {22131#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22131#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:35,896 INFO L273 TraceCheckUtils]: 59: Hoare triple {22131#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22132#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:35,896 INFO L273 TraceCheckUtils]: 60: Hoare triple {22132#(<= main_~i~1 18)} assume true; {22132#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:35,897 INFO L273 TraceCheckUtils]: 61: Hoare triple {22132#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22132#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:35,898 INFO L273 TraceCheckUtils]: 62: Hoare triple {22132#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22133#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:35,898 INFO L273 TraceCheckUtils]: 63: Hoare triple {22133#(<= main_~i~1 19)} assume true; {22133#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:35,899 INFO L273 TraceCheckUtils]: 64: Hoare triple {22133#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22133#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:35,899 INFO L273 TraceCheckUtils]: 65: Hoare triple {22133#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22134#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:35,900 INFO L273 TraceCheckUtils]: 66: Hoare triple {22134#(<= main_~i~1 20)} assume true; {22134#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:35,900 INFO L273 TraceCheckUtils]: 67: Hoare triple {22134#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22134#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:35,901 INFO L273 TraceCheckUtils]: 68: Hoare triple {22134#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22135#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:35,902 INFO L273 TraceCheckUtils]: 69: Hoare triple {22135#(<= main_~i~1 21)} assume true; {22135#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:35,902 INFO L273 TraceCheckUtils]: 70: Hoare triple {22135#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22135#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:35,903 INFO L273 TraceCheckUtils]: 71: Hoare triple {22135#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22136#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:35,903 INFO L273 TraceCheckUtils]: 72: Hoare triple {22136#(<= main_~i~1 22)} assume true; {22136#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:35,904 INFO L273 TraceCheckUtils]: 73: Hoare triple {22136#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22136#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:35,904 INFO L273 TraceCheckUtils]: 74: Hoare triple {22136#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22137#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:35,905 INFO L273 TraceCheckUtils]: 75: Hoare triple {22137#(<= main_~i~1 23)} assume true; {22137#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:35,905 INFO L273 TraceCheckUtils]: 76: Hoare triple {22137#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22137#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:35,906 INFO L273 TraceCheckUtils]: 77: Hoare triple {22137#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22138#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:35,907 INFO L273 TraceCheckUtils]: 78: Hoare triple {22138#(<= main_~i~1 24)} assume true; {22138#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:35,907 INFO L273 TraceCheckUtils]: 79: Hoare triple {22138#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22138#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:35,908 INFO L273 TraceCheckUtils]: 80: Hoare triple {22138#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22139#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:35,908 INFO L273 TraceCheckUtils]: 81: Hoare triple {22139#(<= main_~i~1 25)} assume true; {22139#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:35,909 INFO L273 TraceCheckUtils]: 82: Hoare triple {22139#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22139#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:35,910 INFO L273 TraceCheckUtils]: 83: Hoare triple {22139#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22140#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:35,910 INFO L273 TraceCheckUtils]: 84: Hoare triple {22140#(<= main_~i~1 26)} assume true; {22140#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:35,911 INFO L273 TraceCheckUtils]: 85: Hoare triple {22140#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22140#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:35,911 INFO L273 TraceCheckUtils]: 86: Hoare triple {22140#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22141#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:35,912 INFO L273 TraceCheckUtils]: 87: Hoare triple {22141#(<= main_~i~1 27)} assume true; {22141#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:35,912 INFO L273 TraceCheckUtils]: 88: Hoare triple {22141#(<= main_~i~1 27)} assume !(~i~1 < 10000); {22113#false} is VALID [2018-11-14 18:55:35,913 INFO L256 TraceCheckUtils]: 89: Hoare triple {22113#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {22112#true} is VALID [2018-11-14 18:55:35,913 INFO L273 TraceCheckUtils]: 90: Hoare triple {22112#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22112#true} is VALID [2018-11-14 18:55:35,913 INFO L273 TraceCheckUtils]: 91: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,913 INFO L273 TraceCheckUtils]: 92: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,913 INFO L273 TraceCheckUtils]: 93: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,914 INFO L273 TraceCheckUtils]: 94: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,914 INFO L273 TraceCheckUtils]: 95: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,914 INFO L273 TraceCheckUtils]: 96: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,914 INFO L273 TraceCheckUtils]: 97: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,914 INFO L273 TraceCheckUtils]: 98: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,914 INFO L273 TraceCheckUtils]: 99: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,915 INFO L273 TraceCheckUtils]: 100: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,915 INFO L273 TraceCheckUtils]: 101: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,915 INFO L273 TraceCheckUtils]: 102: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,915 INFO L273 TraceCheckUtils]: 103: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,915 INFO L273 TraceCheckUtils]: 104: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,916 INFO L273 TraceCheckUtils]: 105: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,916 INFO L273 TraceCheckUtils]: 106: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,916 INFO L273 TraceCheckUtils]: 107: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,916 INFO L273 TraceCheckUtils]: 108: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,916 INFO L273 TraceCheckUtils]: 109: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,916 INFO L273 TraceCheckUtils]: 110: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,916 INFO L273 TraceCheckUtils]: 111: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,916 INFO L273 TraceCheckUtils]: 112: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,916 INFO L273 TraceCheckUtils]: 113: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,917 INFO L273 TraceCheckUtils]: 114: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,917 INFO L273 TraceCheckUtils]: 115: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,917 INFO L273 TraceCheckUtils]: 116: Hoare triple {22112#true} assume !(~i~0 < 10000); {22112#true} is VALID [2018-11-14 18:55:35,917 INFO L273 TraceCheckUtils]: 117: Hoare triple {22112#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22112#true} is VALID [2018-11-14 18:55:35,917 INFO L273 TraceCheckUtils]: 118: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,917 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22112#true} {22113#false} #73#return; {22113#false} is VALID [2018-11-14 18:55:35,917 INFO L273 TraceCheckUtils]: 120: Hoare triple {22113#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {22113#false} is VALID [2018-11-14 18:55:35,917 INFO L256 TraceCheckUtils]: 121: Hoare triple {22113#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {22112#true} is VALID [2018-11-14 18:55:35,917 INFO L273 TraceCheckUtils]: 122: Hoare triple {22112#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22112#true} is VALID [2018-11-14 18:55:35,917 INFO L273 TraceCheckUtils]: 123: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,918 INFO L273 TraceCheckUtils]: 124: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,918 INFO L273 TraceCheckUtils]: 125: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,918 INFO L273 TraceCheckUtils]: 126: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,918 INFO L273 TraceCheckUtils]: 127: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,918 INFO L273 TraceCheckUtils]: 128: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,918 INFO L273 TraceCheckUtils]: 129: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,918 INFO L273 TraceCheckUtils]: 130: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,918 INFO L273 TraceCheckUtils]: 131: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,918 INFO L273 TraceCheckUtils]: 132: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,918 INFO L273 TraceCheckUtils]: 133: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,919 INFO L273 TraceCheckUtils]: 134: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,919 INFO L273 TraceCheckUtils]: 135: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,919 INFO L273 TraceCheckUtils]: 136: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,919 INFO L273 TraceCheckUtils]: 137: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,919 INFO L273 TraceCheckUtils]: 138: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,919 INFO L273 TraceCheckUtils]: 139: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,919 INFO L273 TraceCheckUtils]: 140: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,919 INFO L273 TraceCheckUtils]: 141: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,919 INFO L273 TraceCheckUtils]: 142: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,919 INFO L273 TraceCheckUtils]: 143: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,920 INFO L273 TraceCheckUtils]: 144: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,920 INFO L273 TraceCheckUtils]: 145: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,920 INFO L273 TraceCheckUtils]: 146: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,920 INFO L273 TraceCheckUtils]: 147: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,920 INFO L273 TraceCheckUtils]: 148: Hoare triple {22112#true} assume !(~i~0 < 10000); {22112#true} is VALID [2018-11-14 18:55:35,920 INFO L273 TraceCheckUtils]: 149: Hoare triple {22112#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22112#true} is VALID [2018-11-14 18:55:35,920 INFO L273 TraceCheckUtils]: 150: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,920 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {22112#true} {22113#false} #75#return; {22113#false} is VALID [2018-11-14 18:55:35,920 INFO L273 TraceCheckUtils]: 152: Hoare triple {22113#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {22113#false} is VALID [2018-11-14 18:55:35,920 INFO L273 TraceCheckUtils]: 153: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:35,921 INFO L273 TraceCheckUtils]: 154: Hoare triple {22113#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22113#false} is VALID [2018-11-14 18:55:35,921 INFO L273 TraceCheckUtils]: 155: Hoare triple {22113#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22113#false} is VALID [2018-11-14 18:55:35,921 INFO L273 TraceCheckUtils]: 156: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:35,921 INFO L273 TraceCheckUtils]: 157: Hoare triple {22113#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22113#false} is VALID [2018-11-14 18:55:35,921 INFO L273 TraceCheckUtils]: 158: Hoare triple {22113#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22113#false} is VALID [2018-11-14 18:55:35,921 INFO L273 TraceCheckUtils]: 159: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:35,921 INFO L273 TraceCheckUtils]: 160: Hoare triple {22113#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22113#false} is VALID [2018-11-14 18:55:35,921 INFO L273 TraceCheckUtils]: 161: Hoare triple {22113#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22113#false} is VALID [2018-11-14 18:55:35,921 INFO L273 TraceCheckUtils]: 162: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:35,921 INFO L273 TraceCheckUtils]: 163: Hoare triple {22113#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22113#false} is VALID [2018-11-14 18:55:35,922 INFO L273 TraceCheckUtils]: 164: Hoare triple {22113#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22113#false} is VALID [2018-11-14 18:55:35,922 INFO L273 TraceCheckUtils]: 165: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:35,922 INFO L273 TraceCheckUtils]: 166: Hoare triple {22113#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22113#false} is VALID [2018-11-14 18:55:35,922 INFO L273 TraceCheckUtils]: 167: Hoare triple {22113#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22113#false} is VALID [2018-11-14 18:55:35,922 INFO L273 TraceCheckUtils]: 168: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:35,922 INFO L273 TraceCheckUtils]: 169: Hoare triple {22113#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22113#false} is VALID [2018-11-14 18:55:35,922 INFO L273 TraceCheckUtils]: 170: Hoare triple {22113#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22113#false} is VALID [2018-11-14 18:55:35,922 INFO L273 TraceCheckUtils]: 171: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:35,922 INFO L273 TraceCheckUtils]: 172: Hoare triple {22113#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22113#false} is VALID [2018-11-14 18:55:35,922 INFO L273 TraceCheckUtils]: 173: Hoare triple {22113#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22113#false} is VALID [2018-11-14 18:55:35,923 INFO L273 TraceCheckUtils]: 174: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:35,923 INFO L273 TraceCheckUtils]: 175: Hoare triple {22113#false} assume !(~i~2 < 9999); {22113#false} is VALID [2018-11-14 18:55:35,923 INFO L273 TraceCheckUtils]: 176: Hoare triple {22113#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {22113#false} is VALID [2018-11-14 18:55:35,923 INFO L256 TraceCheckUtils]: 177: Hoare triple {22113#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {22112#true} is VALID [2018-11-14 18:55:35,923 INFO L273 TraceCheckUtils]: 178: Hoare triple {22112#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22112#true} is VALID [2018-11-14 18:55:35,923 INFO L273 TraceCheckUtils]: 179: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,923 INFO L273 TraceCheckUtils]: 180: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,923 INFO L273 TraceCheckUtils]: 181: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,923 INFO L273 TraceCheckUtils]: 182: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,924 INFO L273 TraceCheckUtils]: 183: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,924 INFO L273 TraceCheckUtils]: 184: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,924 INFO L273 TraceCheckUtils]: 185: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,924 INFO L273 TraceCheckUtils]: 186: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,924 INFO L273 TraceCheckUtils]: 187: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,924 INFO L273 TraceCheckUtils]: 188: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,924 INFO L273 TraceCheckUtils]: 189: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,924 INFO L273 TraceCheckUtils]: 190: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,924 INFO L273 TraceCheckUtils]: 191: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,924 INFO L273 TraceCheckUtils]: 192: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,925 INFO L273 TraceCheckUtils]: 193: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,925 INFO L273 TraceCheckUtils]: 194: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,925 INFO L273 TraceCheckUtils]: 195: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,925 INFO L273 TraceCheckUtils]: 196: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,925 INFO L273 TraceCheckUtils]: 197: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,925 INFO L273 TraceCheckUtils]: 198: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,925 INFO L273 TraceCheckUtils]: 199: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,925 INFO L273 TraceCheckUtils]: 200: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,925 INFO L273 TraceCheckUtils]: 201: Hoare triple {22112#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22112#true} is VALID [2018-11-14 18:55:35,925 INFO L273 TraceCheckUtils]: 202: Hoare triple {22112#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22112#true} is VALID [2018-11-14 18:55:35,926 INFO L273 TraceCheckUtils]: 203: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,926 INFO L273 TraceCheckUtils]: 204: Hoare triple {22112#true} assume !(~i~0 < 10000); {22112#true} is VALID [2018-11-14 18:55:35,926 INFO L273 TraceCheckUtils]: 205: Hoare triple {22112#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22112#true} is VALID [2018-11-14 18:55:35,926 INFO L273 TraceCheckUtils]: 206: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:35,926 INFO L268 TraceCheckUtils]: 207: Hoare quadruple {22112#true} {22113#false} #77#return; {22113#false} is VALID [2018-11-14 18:55:35,926 INFO L273 TraceCheckUtils]: 208: Hoare triple {22113#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {22113#false} is VALID [2018-11-14 18:55:35,926 INFO L273 TraceCheckUtils]: 209: Hoare triple {22113#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {22113#false} is VALID [2018-11-14 18:55:35,926 INFO L273 TraceCheckUtils]: 210: Hoare triple {22113#false} assume !false; {22113#false} is VALID [2018-11-14 18:55:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2174 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 18:55:35,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:55:35,947 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-14 18:55:35,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:55:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:36,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:55:36,623 INFO L256 TraceCheckUtils]: 0: Hoare triple {22112#true} call ULTIMATE.init(); {22112#true} is VALID [2018-11-14 18:55:36,623 INFO L273 TraceCheckUtils]: 1: Hoare triple {22112#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22112#true} is VALID [2018-11-14 18:55:36,623 INFO L273 TraceCheckUtils]: 2: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 18:55:36,623 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22112#true} {22112#true} #69#return; {22112#true} is VALID [2018-11-14 18:55:36,624 INFO L256 TraceCheckUtils]: 4: Hoare triple {22112#true} call #t~ret13 := main(); {22112#true} is VALID [2018-11-14 18:55:36,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {22112#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22160#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:36,627 INFO L273 TraceCheckUtils]: 6: Hoare triple {22160#(<= main_~i~1 0)} assume true; {22160#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:36,629 INFO L273 TraceCheckUtils]: 7: Hoare triple {22160#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22160#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:36,629 INFO L273 TraceCheckUtils]: 8: Hoare triple {22160#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22115#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:36,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {22115#(<= main_~i~1 1)} assume true; {22115#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:36,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {22115#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22115#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:36,633 INFO L273 TraceCheckUtils]: 11: Hoare triple {22115#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22116#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:36,633 INFO L273 TraceCheckUtils]: 12: Hoare triple {22116#(<= main_~i~1 2)} assume true; {22116#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:36,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {22116#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22116#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:36,635 INFO L273 TraceCheckUtils]: 14: Hoare triple {22116#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22117#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:36,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {22117#(<= main_~i~1 3)} assume true; {22117#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:36,637 INFO L273 TraceCheckUtils]: 16: Hoare triple {22117#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22117#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:36,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {22117#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22118#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:36,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {22118#(<= main_~i~1 4)} assume true; {22118#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:36,646 INFO L273 TraceCheckUtils]: 19: Hoare triple {22118#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22118#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:36,648 INFO L273 TraceCheckUtils]: 20: Hoare triple {22118#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22119#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:36,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {22119#(<= main_~i~1 5)} assume true; {22119#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:36,651 INFO L273 TraceCheckUtils]: 22: Hoare triple {22119#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22119#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:36,651 INFO L273 TraceCheckUtils]: 23: Hoare triple {22119#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22120#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:36,653 INFO L273 TraceCheckUtils]: 24: Hoare triple {22120#(<= main_~i~1 6)} assume true; {22120#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:36,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {22120#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22120#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:36,656 INFO L273 TraceCheckUtils]: 26: Hoare triple {22120#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22121#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:36,656 INFO L273 TraceCheckUtils]: 27: Hoare triple {22121#(<= main_~i~1 7)} assume true; {22121#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:36,658 INFO L273 TraceCheckUtils]: 28: Hoare triple {22121#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22121#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:36,658 INFO L273 TraceCheckUtils]: 29: Hoare triple {22121#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22122#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:36,661 INFO L273 TraceCheckUtils]: 30: Hoare triple {22122#(<= main_~i~1 8)} assume true; {22122#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:36,661 INFO L273 TraceCheckUtils]: 31: Hoare triple {22122#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22122#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:36,663 INFO L273 TraceCheckUtils]: 32: Hoare triple {22122#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22123#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:36,663 INFO L273 TraceCheckUtils]: 33: Hoare triple {22123#(<= main_~i~1 9)} assume true; {22123#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:36,666 INFO L273 TraceCheckUtils]: 34: Hoare triple {22123#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22123#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:36,666 INFO L273 TraceCheckUtils]: 35: Hoare triple {22123#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22124#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:36,668 INFO L273 TraceCheckUtils]: 36: Hoare triple {22124#(<= main_~i~1 10)} assume true; {22124#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:36,668 INFO L273 TraceCheckUtils]: 37: Hoare triple {22124#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22124#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:36,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {22124#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22125#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:36,671 INFO L273 TraceCheckUtils]: 39: Hoare triple {22125#(<= main_~i~1 11)} assume true; {22125#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:36,673 INFO L273 TraceCheckUtils]: 40: Hoare triple {22125#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22125#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:36,673 INFO L273 TraceCheckUtils]: 41: Hoare triple {22125#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22126#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:36,675 INFO L273 TraceCheckUtils]: 42: Hoare triple {22126#(<= main_~i~1 12)} assume true; {22126#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:36,675 INFO L273 TraceCheckUtils]: 43: Hoare triple {22126#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22126#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:36,678 INFO L273 TraceCheckUtils]: 44: Hoare triple {22126#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22127#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:36,678 INFO L273 TraceCheckUtils]: 45: Hoare triple {22127#(<= main_~i~1 13)} assume true; {22127#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:36,680 INFO L273 TraceCheckUtils]: 46: Hoare triple {22127#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22127#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:36,680 INFO L273 TraceCheckUtils]: 47: Hoare triple {22127#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22128#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:36,682 INFO L273 TraceCheckUtils]: 48: Hoare triple {22128#(<= main_~i~1 14)} assume true; {22128#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:36,682 INFO L273 TraceCheckUtils]: 49: Hoare triple {22128#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22128#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:36,684 INFO L273 TraceCheckUtils]: 50: Hoare triple {22128#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22129#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:36,684 INFO L273 TraceCheckUtils]: 51: Hoare triple {22129#(<= main_~i~1 15)} assume true; {22129#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:36,687 INFO L273 TraceCheckUtils]: 52: Hoare triple {22129#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22129#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:36,687 INFO L273 TraceCheckUtils]: 53: Hoare triple {22129#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22130#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:36,689 INFO L273 TraceCheckUtils]: 54: Hoare triple {22130#(<= main_~i~1 16)} assume true; {22130#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:36,689 INFO L273 TraceCheckUtils]: 55: Hoare triple {22130#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22130#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:36,691 INFO L273 TraceCheckUtils]: 56: Hoare triple {22130#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22131#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:36,693 INFO L273 TraceCheckUtils]: 57: Hoare triple {22131#(<= main_~i~1 17)} assume true; {22131#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:36,693 INFO L273 TraceCheckUtils]: 58: Hoare triple {22131#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22131#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:36,695 INFO L273 TraceCheckUtils]: 59: Hoare triple {22131#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22132#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:36,695 INFO L273 TraceCheckUtils]: 60: Hoare triple {22132#(<= main_~i~1 18)} assume true; {22132#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:36,697 INFO L273 TraceCheckUtils]: 61: Hoare triple {22132#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22132#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:36,697 INFO L273 TraceCheckUtils]: 62: Hoare triple {22132#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22133#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:36,699 INFO L273 TraceCheckUtils]: 63: Hoare triple {22133#(<= main_~i~1 19)} assume true; {22133#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:36,701 INFO L273 TraceCheckUtils]: 64: Hoare triple {22133#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22133#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:36,701 INFO L273 TraceCheckUtils]: 65: Hoare triple {22133#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22134#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:36,704 INFO L273 TraceCheckUtils]: 66: Hoare triple {22134#(<= main_~i~1 20)} assume true; {22134#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:36,704 INFO L273 TraceCheckUtils]: 67: Hoare triple {22134#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22134#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:36,707 INFO L273 TraceCheckUtils]: 68: Hoare triple {22134#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22135#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:36,707 INFO L273 TraceCheckUtils]: 69: Hoare triple {22135#(<= main_~i~1 21)} assume true; {22135#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:36,709 INFO L273 TraceCheckUtils]: 70: Hoare triple {22135#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22135#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:36,711 INFO L273 TraceCheckUtils]: 71: Hoare triple {22135#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22136#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:36,711 INFO L273 TraceCheckUtils]: 72: Hoare triple {22136#(<= main_~i~1 22)} assume true; {22136#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:36,713 INFO L273 TraceCheckUtils]: 73: Hoare triple {22136#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22136#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:36,713 INFO L273 TraceCheckUtils]: 74: Hoare triple {22136#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22137#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:36,715 INFO L273 TraceCheckUtils]: 75: Hoare triple {22137#(<= main_~i~1 23)} assume true; {22137#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:36,715 INFO L273 TraceCheckUtils]: 76: Hoare triple {22137#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22137#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:36,717 INFO L273 TraceCheckUtils]: 77: Hoare triple {22137#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22138#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:36,717 INFO L273 TraceCheckUtils]: 78: Hoare triple {22138#(<= main_~i~1 24)} assume true; {22138#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:36,720 INFO L273 TraceCheckUtils]: 79: Hoare triple {22138#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22138#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:36,720 INFO L273 TraceCheckUtils]: 80: Hoare triple {22138#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22139#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:36,722 INFO L273 TraceCheckUtils]: 81: Hoare triple {22139#(<= main_~i~1 25)} assume true; {22139#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:36,722 INFO L273 TraceCheckUtils]: 82: Hoare triple {22139#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22139#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:36,724 INFO L273 TraceCheckUtils]: 83: Hoare triple {22139#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22140#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:36,727 INFO L273 TraceCheckUtils]: 84: Hoare triple {22140#(<= main_~i~1 26)} assume true; {22140#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:36,727 INFO L273 TraceCheckUtils]: 85: Hoare triple {22140#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22140#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:36,729 INFO L273 TraceCheckUtils]: 86: Hoare triple {22140#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22141#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:36,729 INFO L273 TraceCheckUtils]: 87: Hoare triple {22141#(<= main_~i~1 27)} assume true; {22141#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:36,731 INFO L273 TraceCheckUtils]: 88: Hoare triple {22141#(<= main_~i~1 27)} assume !(~i~1 < 10000); {22113#false} is VALID [2018-11-14 18:55:36,731 INFO L256 TraceCheckUtils]: 89: Hoare triple {22113#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {22113#false} is VALID [2018-11-14 18:55:36,731 INFO L273 TraceCheckUtils]: 90: Hoare triple {22113#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22113#false} is VALID [2018-11-14 18:55:36,731 INFO L273 TraceCheckUtils]: 91: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,731 INFO L273 TraceCheckUtils]: 92: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,731 INFO L273 TraceCheckUtils]: 93: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,731 INFO L273 TraceCheckUtils]: 94: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,731 INFO L273 TraceCheckUtils]: 95: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,731 INFO L273 TraceCheckUtils]: 96: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,732 INFO L273 TraceCheckUtils]: 97: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,732 INFO L273 TraceCheckUtils]: 98: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,732 INFO L273 TraceCheckUtils]: 99: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,732 INFO L273 TraceCheckUtils]: 100: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,732 INFO L273 TraceCheckUtils]: 101: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,732 INFO L273 TraceCheckUtils]: 102: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,732 INFO L273 TraceCheckUtils]: 103: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,732 INFO L273 TraceCheckUtils]: 104: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,732 INFO L273 TraceCheckUtils]: 105: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,732 INFO L273 TraceCheckUtils]: 106: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,733 INFO L273 TraceCheckUtils]: 107: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,733 INFO L273 TraceCheckUtils]: 108: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,733 INFO L273 TraceCheckUtils]: 109: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,733 INFO L273 TraceCheckUtils]: 110: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,733 INFO L273 TraceCheckUtils]: 111: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,733 INFO L273 TraceCheckUtils]: 112: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,733 INFO L273 TraceCheckUtils]: 113: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,733 INFO L273 TraceCheckUtils]: 114: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,733 INFO L273 TraceCheckUtils]: 115: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,733 INFO L273 TraceCheckUtils]: 116: Hoare triple {22113#false} assume !(~i~0 < 10000); {22113#false} is VALID [2018-11-14 18:55:36,734 INFO L273 TraceCheckUtils]: 117: Hoare triple {22113#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22113#false} is VALID [2018-11-14 18:55:36,734 INFO L273 TraceCheckUtils]: 118: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,734 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22113#false} {22113#false} #73#return; {22113#false} is VALID [2018-11-14 18:55:36,734 INFO L273 TraceCheckUtils]: 120: Hoare triple {22113#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {22113#false} is VALID [2018-11-14 18:55:36,734 INFO L256 TraceCheckUtils]: 121: Hoare triple {22113#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {22113#false} is VALID [2018-11-14 18:55:36,734 INFO L273 TraceCheckUtils]: 122: Hoare triple {22113#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22113#false} is VALID [2018-11-14 18:55:36,734 INFO L273 TraceCheckUtils]: 123: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,734 INFO L273 TraceCheckUtils]: 124: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,734 INFO L273 TraceCheckUtils]: 125: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,735 INFO L273 TraceCheckUtils]: 126: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,735 INFO L273 TraceCheckUtils]: 127: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,735 INFO L273 TraceCheckUtils]: 128: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,735 INFO L273 TraceCheckUtils]: 129: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,735 INFO L273 TraceCheckUtils]: 130: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,735 INFO L273 TraceCheckUtils]: 131: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,735 INFO L273 TraceCheckUtils]: 132: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,735 INFO L273 TraceCheckUtils]: 133: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,735 INFO L273 TraceCheckUtils]: 134: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,735 INFO L273 TraceCheckUtils]: 135: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,736 INFO L273 TraceCheckUtils]: 136: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,736 INFO L273 TraceCheckUtils]: 137: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,736 INFO L273 TraceCheckUtils]: 138: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,736 INFO L273 TraceCheckUtils]: 139: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,736 INFO L273 TraceCheckUtils]: 140: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,736 INFO L273 TraceCheckUtils]: 141: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,736 INFO L273 TraceCheckUtils]: 142: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,736 INFO L273 TraceCheckUtils]: 143: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,736 INFO L273 TraceCheckUtils]: 144: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,736 INFO L273 TraceCheckUtils]: 145: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,737 INFO L273 TraceCheckUtils]: 146: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,737 INFO L273 TraceCheckUtils]: 147: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,737 INFO L273 TraceCheckUtils]: 148: Hoare triple {22113#false} assume !(~i~0 < 10000); {22113#false} is VALID [2018-11-14 18:55:36,737 INFO L273 TraceCheckUtils]: 149: Hoare triple {22113#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22113#false} is VALID [2018-11-14 18:55:36,737 INFO L273 TraceCheckUtils]: 150: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,737 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {22113#false} {22113#false} #75#return; {22113#false} is VALID [2018-11-14 18:55:36,737 INFO L273 TraceCheckUtils]: 152: Hoare triple {22113#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {22113#false} is VALID [2018-11-14 18:55:36,738 INFO L273 TraceCheckUtils]: 153: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,738 INFO L273 TraceCheckUtils]: 154: Hoare triple {22113#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22113#false} is VALID [2018-11-14 18:55:36,738 INFO L273 TraceCheckUtils]: 155: Hoare triple {22113#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22113#false} is VALID [2018-11-14 18:55:36,738 INFO L273 TraceCheckUtils]: 156: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,738 INFO L273 TraceCheckUtils]: 157: Hoare triple {22113#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22113#false} is VALID [2018-11-14 18:55:36,738 INFO L273 TraceCheckUtils]: 158: Hoare triple {22113#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22113#false} is VALID [2018-11-14 18:55:36,739 INFO L273 TraceCheckUtils]: 159: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,739 INFO L273 TraceCheckUtils]: 160: Hoare triple {22113#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22113#false} is VALID [2018-11-14 18:55:36,739 INFO L273 TraceCheckUtils]: 161: Hoare triple {22113#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22113#false} is VALID [2018-11-14 18:55:36,739 INFO L273 TraceCheckUtils]: 162: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,739 INFO L273 TraceCheckUtils]: 163: Hoare triple {22113#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22113#false} is VALID [2018-11-14 18:55:36,739 INFO L273 TraceCheckUtils]: 164: Hoare triple {22113#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22113#false} is VALID [2018-11-14 18:55:36,739 INFO L273 TraceCheckUtils]: 165: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,740 INFO L273 TraceCheckUtils]: 166: Hoare triple {22113#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22113#false} is VALID [2018-11-14 18:55:36,740 INFO L273 TraceCheckUtils]: 167: Hoare triple {22113#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22113#false} is VALID [2018-11-14 18:55:36,740 INFO L273 TraceCheckUtils]: 168: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,740 INFO L273 TraceCheckUtils]: 169: Hoare triple {22113#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22113#false} is VALID [2018-11-14 18:55:36,740 INFO L273 TraceCheckUtils]: 170: Hoare triple {22113#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22113#false} is VALID [2018-11-14 18:55:36,740 INFO L273 TraceCheckUtils]: 171: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,740 INFO L273 TraceCheckUtils]: 172: Hoare triple {22113#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22113#false} is VALID [2018-11-14 18:55:36,741 INFO L273 TraceCheckUtils]: 173: Hoare triple {22113#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22113#false} is VALID [2018-11-14 18:55:36,741 INFO L273 TraceCheckUtils]: 174: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,741 INFO L273 TraceCheckUtils]: 175: Hoare triple {22113#false} assume !(~i~2 < 9999); {22113#false} is VALID [2018-11-14 18:55:36,741 INFO L273 TraceCheckUtils]: 176: Hoare triple {22113#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {22113#false} is VALID [2018-11-14 18:55:36,741 INFO L256 TraceCheckUtils]: 177: Hoare triple {22113#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {22113#false} is VALID [2018-11-14 18:55:36,741 INFO L273 TraceCheckUtils]: 178: Hoare triple {22113#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22113#false} is VALID [2018-11-14 18:55:36,742 INFO L273 TraceCheckUtils]: 179: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,742 INFO L273 TraceCheckUtils]: 180: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,742 INFO L273 TraceCheckUtils]: 181: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,742 INFO L273 TraceCheckUtils]: 182: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,742 INFO L273 TraceCheckUtils]: 183: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,742 INFO L273 TraceCheckUtils]: 184: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,742 INFO L273 TraceCheckUtils]: 185: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,743 INFO L273 TraceCheckUtils]: 186: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,743 INFO L273 TraceCheckUtils]: 187: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,743 INFO L273 TraceCheckUtils]: 188: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,743 INFO L273 TraceCheckUtils]: 189: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,743 INFO L273 TraceCheckUtils]: 190: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,743 INFO L273 TraceCheckUtils]: 191: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,743 INFO L273 TraceCheckUtils]: 192: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,744 INFO L273 TraceCheckUtils]: 193: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,744 INFO L273 TraceCheckUtils]: 194: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,744 INFO L273 TraceCheckUtils]: 195: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,744 INFO L273 TraceCheckUtils]: 196: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,744 INFO L273 TraceCheckUtils]: 197: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,744 INFO L273 TraceCheckUtils]: 198: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,744 INFO L273 TraceCheckUtils]: 199: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,745 INFO L273 TraceCheckUtils]: 200: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,745 INFO L273 TraceCheckUtils]: 201: Hoare triple {22113#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22113#false} is VALID [2018-11-14 18:55:36,745 INFO L273 TraceCheckUtils]: 202: Hoare triple {22113#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22113#false} is VALID [2018-11-14 18:55:36,745 INFO L273 TraceCheckUtils]: 203: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,745 INFO L273 TraceCheckUtils]: 204: Hoare triple {22113#false} assume !(~i~0 < 10000); {22113#false} is VALID [2018-11-14 18:55:36,745 INFO L273 TraceCheckUtils]: 205: Hoare triple {22113#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22113#false} is VALID [2018-11-14 18:55:36,745 INFO L273 TraceCheckUtils]: 206: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 18:55:36,746 INFO L268 TraceCheckUtils]: 207: Hoare quadruple {22113#false} {22113#false} #77#return; {22113#false} is VALID [2018-11-14 18:55:36,746 INFO L273 TraceCheckUtils]: 208: Hoare triple {22113#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {22113#false} is VALID [2018-11-14 18:55:36,746 INFO L273 TraceCheckUtils]: 209: Hoare triple {22113#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {22113#false} is VALID [2018-11-14 18:55:36,746 INFO L273 TraceCheckUtils]: 210: Hoare triple {22113#false} assume !false; {22113#false} is VALID [2018-11-14 18:55:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2174 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 18:55:36,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:55:36,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-14 18:55:36,794 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 211 [2018-11-14 18:55:36,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:55:36,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 18:55:36,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:36,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 18:55:36,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 18:55:36,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 18:55:36,944 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 31 states. [2018-11-14 18:55:37,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:37,878 INFO L93 Difference]: Finished difference Result 219 states and 227 transitions. [2018-11-14 18:55:37,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 18:55:37,878 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 211 [2018-11-14 18:55:37,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:55:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:55:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 141 transitions. [2018-11-14 18:55:37,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:55:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 141 transitions. [2018-11-14 18:55:37,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 141 transitions. [2018-11-14 18:55:38,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:38,014 INFO L225 Difference]: With dead ends: 219 [2018-11-14 18:55:38,014 INFO L226 Difference]: Without dead ends: 156 [2018-11-14 18:55:38,015 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 18:55:38,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-14 18:55:38,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-11-14 18:55:38,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:55:38,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 155 states. [2018-11-14 18:55:38,075 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 155 states. [2018-11-14 18:55:38,075 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 155 states. [2018-11-14 18:55:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:38,078 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2018-11-14 18:55:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2018-11-14 18:55:38,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:38,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:38,079 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 156 states. [2018-11-14 18:55:38,079 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 156 states. [2018-11-14 18:55:38,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:38,081 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2018-11-14 18:55:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2018-11-14 18:55:38,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:38,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:38,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:55:38,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:55:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-14 18:55:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2018-11-14 18:55:38,084 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 211 [2018-11-14 18:55:38,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:55:38,084 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2018-11-14 18:55:38,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 18:55:38,084 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2018-11-14 18:55:38,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-14 18:55:38,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:55:38,088 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 27, 24, 24, 8, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:55:38,088 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:55:38,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:55:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1212530773, now seen corresponding path program 26 times [2018-11-14 18:55:38,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:55:38,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:55:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:38,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:55:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:39,100 INFO L256 TraceCheckUtils]: 0: Hoare triple {23590#true} call ULTIMATE.init(); {23590#true} is VALID [2018-11-14 18:55:39,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {23590#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23590#true} is VALID [2018-11-14 18:55:39,100 INFO L273 TraceCheckUtils]: 2: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,100 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23590#true} {23590#true} #69#return; {23590#true} is VALID [2018-11-14 18:55:39,100 INFO L256 TraceCheckUtils]: 4: Hoare triple {23590#true} call #t~ret13 := main(); {23590#true} is VALID [2018-11-14 18:55:39,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {23590#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23592#(= main_~i~1 0)} is VALID [2018-11-14 18:55:39,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {23592#(= main_~i~1 0)} assume true; {23592#(= main_~i~1 0)} is VALID [2018-11-14 18:55:39,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {23592#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23592#(= main_~i~1 0)} is VALID [2018-11-14 18:55:39,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {23592#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23593#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:39,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {23593#(<= main_~i~1 1)} assume true; {23593#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:39,103 INFO L273 TraceCheckUtils]: 10: Hoare triple {23593#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23593#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:39,104 INFO L273 TraceCheckUtils]: 11: Hoare triple {23593#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23594#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:39,104 INFO L273 TraceCheckUtils]: 12: Hoare triple {23594#(<= main_~i~1 2)} assume true; {23594#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:39,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {23594#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23594#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:39,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {23594#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23595#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:39,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {23595#(<= main_~i~1 3)} assume true; {23595#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:39,106 INFO L273 TraceCheckUtils]: 16: Hoare triple {23595#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23595#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:39,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {23595#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23596#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:39,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {23596#(<= main_~i~1 4)} assume true; {23596#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:39,107 INFO L273 TraceCheckUtils]: 19: Hoare triple {23596#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23596#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:39,108 INFO L273 TraceCheckUtils]: 20: Hoare triple {23596#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23597#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:39,108 INFO L273 TraceCheckUtils]: 21: Hoare triple {23597#(<= main_~i~1 5)} assume true; {23597#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:39,109 INFO L273 TraceCheckUtils]: 22: Hoare triple {23597#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23597#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:39,110 INFO L273 TraceCheckUtils]: 23: Hoare triple {23597#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23598#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:39,110 INFO L273 TraceCheckUtils]: 24: Hoare triple {23598#(<= main_~i~1 6)} assume true; {23598#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:39,111 INFO L273 TraceCheckUtils]: 25: Hoare triple {23598#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23598#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:39,111 INFO L273 TraceCheckUtils]: 26: Hoare triple {23598#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23599#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:39,112 INFO L273 TraceCheckUtils]: 27: Hoare triple {23599#(<= main_~i~1 7)} assume true; {23599#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:39,112 INFO L273 TraceCheckUtils]: 28: Hoare triple {23599#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23599#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:39,113 INFO L273 TraceCheckUtils]: 29: Hoare triple {23599#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23600#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:39,114 INFO L273 TraceCheckUtils]: 30: Hoare triple {23600#(<= main_~i~1 8)} assume true; {23600#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:39,114 INFO L273 TraceCheckUtils]: 31: Hoare triple {23600#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23600#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:39,115 INFO L273 TraceCheckUtils]: 32: Hoare triple {23600#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23601#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:39,115 INFO L273 TraceCheckUtils]: 33: Hoare triple {23601#(<= main_~i~1 9)} assume true; {23601#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:39,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {23601#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23601#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:39,117 INFO L273 TraceCheckUtils]: 35: Hoare triple {23601#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23602#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:39,117 INFO L273 TraceCheckUtils]: 36: Hoare triple {23602#(<= main_~i~1 10)} assume true; {23602#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:39,118 INFO L273 TraceCheckUtils]: 37: Hoare triple {23602#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23602#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:39,118 INFO L273 TraceCheckUtils]: 38: Hoare triple {23602#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23603#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:39,119 INFO L273 TraceCheckUtils]: 39: Hoare triple {23603#(<= main_~i~1 11)} assume true; {23603#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:39,119 INFO L273 TraceCheckUtils]: 40: Hoare triple {23603#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23603#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:39,120 INFO L273 TraceCheckUtils]: 41: Hoare triple {23603#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23604#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:39,121 INFO L273 TraceCheckUtils]: 42: Hoare triple {23604#(<= main_~i~1 12)} assume true; {23604#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:39,121 INFO L273 TraceCheckUtils]: 43: Hoare triple {23604#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23604#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:39,122 INFO L273 TraceCheckUtils]: 44: Hoare triple {23604#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23605#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:39,122 INFO L273 TraceCheckUtils]: 45: Hoare triple {23605#(<= main_~i~1 13)} assume true; {23605#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:39,123 INFO L273 TraceCheckUtils]: 46: Hoare triple {23605#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23605#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:39,123 INFO L273 TraceCheckUtils]: 47: Hoare triple {23605#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23606#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:39,124 INFO L273 TraceCheckUtils]: 48: Hoare triple {23606#(<= main_~i~1 14)} assume true; {23606#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:39,124 INFO L273 TraceCheckUtils]: 49: Hoare triple {23606#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23606#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:39,125 INFO L273 TraceCheckUtils]: 50: Hoare triple {23606#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23607#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:39,126 INFO L273 TraceCheckUtils]: 51: Hoare triple {23607#(<= main_~i~1 15)} assume true; {23607#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:39,126 INFO L273 TraceCheckUtils]: 52: Hoare triple {23607#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23607#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:39,127 INFO L273 TraceCheckUtils]: 53: Hoare triple {23607#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23608#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:39,127 INFO L273 TraceCheckUtils]: 54: Hoare triple {23608#(<= main_~i~1 16)} assume true; {23608#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:39,128 INFO L273 TraceCheckUtils]: 55: Hoare triple {23608#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23608#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:39,129 INFO L273 TraceCheckUtils]: 56: Hoare triple {23608#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23609#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:39,129 INFO L273 TraceCheckUtils]: 57: Hoare triple {23609#(<= main_~i~1 17)} assume true; {23609#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:39,130 INFO L273 TraceCheckUtils]: 58: Hoare triple {23609#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23609#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:39,130 INFO L273 TraceCheckUtils]: 59: Hoare triple {23609#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23610#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:39,131 INFO L273 TraceCheckUtils]: 60: Hoare triple {23610#(<= main_~i~1 18)} assume true; {23610#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:39,131 INFO L273 TraceCheckUtils]: 61: Hoare triple {23610#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23610#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:39,132 INFO L273 TraceCheckUtils]: 62: Hoare triple {23610#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23611#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:39,133 INFO L273 TraceCheckUtils]: 63: Hoare triple {23611#(<= main_~i~1 19)} assume true; {23611#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:39,133 INFO L273 TraceCheckUtils]: 64: Hoare triple {23611#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23611#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:39,134 INFO L273 TraceCheckUtils]: 65: Hoare triple {23611#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23612#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:39,134 INFO L273 TraceCheckUtils]: 66: Hoare triple {23612#(<= main_~i~1 20)} assume true; {23612#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:39,135 INFO L273 TraceCheckUtils]: 67: Hoare triple {23612#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23612#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:39,136 INFO L273 TraceCheckUtils]: 68: Hoare triple {23612#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23613#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:39,136 INFO L273 TraceCheckUtils]: 69: Hoare triple {23613#(<= main_~i~1 21)} assume true; {23613#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:39,137 INFO L273 TraceCheckUtils]: 70: Hoare triple {23613#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23613#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:39,137 INFO L273 TraceCheckUtils]: 71: Hoare triple {23613#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23614#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:39,138 INFO L273 TraceCheckUtils]: 72: Hoare triple {23614#(<= main_~i~1 22)} assume true; {23614#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:39,138 INFO L273 TraceCheckUtils]: 73: Hoare triple {23614#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23614#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:39,139 INFO L273 TraceCheckUtils]: 74: Hoare triple {23614#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23615#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:39,139 INFO L273 TraceCheckUtils]: 75: Hoare triple {23615#(<= main_~i~1 23)} assume true; {23615#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:39,140 INFO L273 TraceCheckUtils]: 76: Hoare triple {23615#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23615#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:39,141 INFO L273 TraceCheckUtils]: 77: Hoare triple {23615#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23616#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:39,141 INFO L273 TraceCheckUtils]: 78: Hoare triple {23616#(<= main_~i~1 24)} assume true; {23616#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:39,142 INFO L273 TraceCheckUtils]: 79: Hoare triple {23616#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23616#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:39,142 INFO L273 TraceCheckUtils]: 80: Hoare triple {23616#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23617#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:39,143 INFO L273 TraceCheckUtils]: 81: Hoare triple {23617#(<= main_~i~1 25)} assume true; {23617#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:39,143 INFO L273 TraceCheckUtils]: 82: Hoare triple {23617#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23617#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:39,144 INFO L273 TraceCheckUtils]: 83: Hoare triple {23617#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23618#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:39,145 INFO L273 TraceCheckUtils]: 84: Hoare triple {23618#(<= main_~i~1 26)} assume true; {23618#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:39,145 INFO L273 TraceCheckUtils]: 85: Hoare triple {23618#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23618#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:39,146 INFO L273 TraceCheckUtils]: 86: Hoare triple {23618#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23619#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:39,146 INFO L273 TraceCheckUtils]: 87: Hoare triple {23619#(<= main_~i~1 27)} assume true; {23619#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:39,147 INFO L273 TraceCheckUtils]: 88: Hoare triple {23619#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23619#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:39,148 INFO L273 TraceCheckUtils]: 89: Hoare triple {23619#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23620#(<= main_~i~1 28)} is VALID [2018-11-14 18:55:39,148 INFO L273 TraceCheckUtils]: 90: Hoare triple {23620#(<= main_~i~1 28)} assume true; {23620#(<= main_~i~1 28)} is VALID [2018-11-14 18:55:39,149 INFO L273 TraceCheckUtils]: 91: Hoare triple {23620#(<= main_~i~1 28)} assume !(~i~1 < 10000); {23591#false} is VALID [2018-11-14 18:55:39,149 INFO L256 TraceCheckUtils]: 92: Hoare triple {23591#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {23590#true} is VALID [2018-11-14 18:55:39,149 INFO L273 TraceCheckUtils]: 93: Hoare triple {23590#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23590#true} is VALID [2018-11-14 18:55:39,149 INFO L273 TraceCheckUtils]: 94: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,149 INFO L273 TraceCheckUtils]: 95: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,150 INFO L273 TraceCheckUtils]: 96: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,150 INFO L273 TraceCheckUtils]: 97: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,150 INFO L273 TraceCheckUtils]: 98: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,150 INFO L273 TraceCheckUtils]: 99: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,150 INFO L273 TraceCheckUtils]: 100: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,151 INFO L273 TraceCheckUtils]: 101: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,151 INFO L273 TraceCheckUtils]: 102: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,151 INFO L273 TraceCheckUtils]: 103: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,151 INFO L273 TraceCheckUtils]: 104: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,151 INFO L273 TraceCheckUtils]: 105: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,151 INFO L273 TraceCheckUtils]: 106: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,152 INFO L273 TraceCheckUtils]: 107: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,152 INFO L273 TraceCheckUtils]: 108: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,152 INFO L273 TraceCheckUtils]: 109: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,152 INFO L273 TraceCheckUtils]: 110: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,152 INFO L273 TraceCheckUtils]: 111: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,152 INFO L273 TraceCheckUtils]: 112: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,152 INFO L273 TraceCheckUtils]: 113: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,152 INFO L273 TraceCheckUtils]: 114: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,153 INFO L273 TraceCheckUtils]: 115: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,153 INFO L273 TraceCheckUtils]: 116: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,153 INFO L273 TraceCheckUtils]: 117: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,153 INFO L273 TraceCheckUtils]: 118: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,153 INFO L273 TraceCheckUtils]: 119: Hoare triple {23590#true} assume !(~i~0 < 10000); {23590#true} is VALID [2018-11-14 18:55:39,153 INFO L273 TraceCheckUtils]: 120: Hoare triple {23590#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23590#true} is VALID [2018-11-14 18:55:39,153 INFO L273 TraceCheckUtils]: 121: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,153 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {23590#true} {23591#false} #73#return; {23591#false} is VALID [2018-11-14 18:55:39,153 INFO L273 TraceCheckUtils]: 123: Hoare triple {23591#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {23591#false} is VALID [2018-11-14 18:55:39,153 INFO L256 TraceCheckUtils]: 124: Hoare triple {23591#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {23590#true} is VALID [2018-11-14 18:55:39,154 INFO L273 TraceCheckUtils]: 125: Hoare triple {23590#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23590#true} is VALID [2018-11-14 18:55:39,154 INFO L273 TraceCheckUtils]: 126: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,154 INFO L273 TraceCheckUtils]: 127: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,154 INFO L273 TraceCheckUtils]: 128: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,154 INFO L273 TraceCheckUtils]: 129: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,154 INFO L273 TraceCheckUtils]: 130: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,154 INFO L273 TraceCheckUtils]: 131: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,154 INFO L273 TraceCheckUtils]: 132: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,154 INFO L273 TraceCheckUtils]: 133: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,154 INFO L273 TraceCheckUtils]: 134: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,155 INFO L273 TraceCheckUtils]: 135: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,155 INFO L273 TraceCheckUtils]: 136: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,155 INFO L273 TraceCheckUtils]: 137: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,155 INFO L273 TraceCheckUtils]: 138: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,155 INFO L273 TraceCheckUtils]: 139: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,155 INFO L273 TraceCheckUtils]: 140: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,155 INFO L273 TraceCheckUtils]: 141: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,155 INFO L273 TraceCheckUtils]: 142: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,155 INFO L273 TraceCheckUtils]: 143: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,155 INFO L273 TraceCheckUtils]: 144: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,156 INFO L273 TraceCheckUtils]: 145: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,156 INFO L273 TraceCheckUtils]: 146: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,156 INFO L273 TraceCheckUtils]: 147: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,156 INFO L273 TraceCheckUtils]: 148: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,156 INFO L273 TraceCheckUtils]: 149: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,156 INFO L273 TraceCheckUtils]: 150: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,156 INFO L273 TraceCheckUtils]: 151: Hoare triple {23590#true} assume !(~i~0 < 10000); {23590#true} is VALID [2018-11-14 18:55:39,156 INFO L273 TraceCheckUtils]: 152: Hoare triple {23590#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23590#true} is VALID [2018-11-14 18:55:39,156 INFO L273 TraceCheckUtils]: 153: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,156 INFO L268 TraceCheckUtils]: 154: Hoare quadruple {23590#true} {23591#false} #75#return; {23591#false} is VALID [2018-11-14 18:55:39,157 INFO L273 TraceCheckUtils]: 155: Hoare triple {23591#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23591#false} is VALID [2018-11-14 18:55:39,157 INFO L273 TraceCheckUtils]: 156: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,157 INFO L273 TraceCheckUtils]: 157: Hoare triple {23591#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23591#false} is VALID [2018-11-14 18:55:39,157 INFO L273 TraceCheckUtils]: 158: Hoare triple {23591#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23591#false} is VALID [2018-11-14 18:55:39,157 INFO L273 TraceCheckUtils]: 159: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,157 INFO L273 TraceCheckUtils]: 160: Hoare triple {23591#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23591#false} is VALID [2018-11-14 18:55:39,157 INFO L273 TraceCheckUtils]: 161: Hoare triple {23591#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23591#false} is VALID [2018-11-14 18:55:39,157 INFO L273 TraceCheckUtils]: 162: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,157 INFO L273 TraceCheckUtils]: 163: Hoare triple {23591#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23591#false} is VALID [2018-11-14 18:55:39,157 INFO L273 TraceCheckUtils]: 164: Hoare triple {23591#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23591#false} is VALID [2018-11-14 18:55:39,158 INFO L273 TraceCheckUtils]: 165: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,158 INFO L273 TraceCheckUtils]: 166: Hoare triple {23591#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23591#false} is VALID [2018-11-14 18:55:39,158 INFO L273 TraceCheckUtils]: 167: Hoare triple {23591#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23591#false} is VALID [2018-11-14 18:55:39,158 INFO L273 TraceCheckUtils]: 168: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,158 INFO L273 TraceCheckUtils]: 169: Hoare triple {23591#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23591#false} is VALID [2018-11-14 18:55:39,158 INFO L273 TraceCheckUtils]: 170: Hoare triple {23591#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23591#false} is VALID [2018-11-14 18:55:39,158 INFO L273 TraceCheckUtils]: 171: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,158 INFO L273 TraceCheckUtils]: 172: Hoare triple {23591#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23591#false} is VALID [2018-11-14 18:55:39,158 INFO L273 TraceCheckUtils]: 173: Hoare triple {23591#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23591#false} is VALID [2018-11-14 18:55:39,159 INFO L273 TraceCheckUtils]: 174: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,159 INFO L273 TraceCheckUtils]: 175: Hoare triple {23591#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23591#false} is VALID [2018-11-14 18:55:39,159 INFO L273 TraceCheckUtils]: 176: Hoare triple {23591#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23591#false} is VALID [2018-11-14 18:55:39,159 INFO L273 TraceCheckUtils]: 177: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,159 INFO L273 TraceCheckUtils]: 178: Hoare triple {23591#false} assume !(~i~2 < 9999); {23591#false} is VALID [2018-11-14 18:55:39,159 INFO L273 TraceCheckUtils]: 179: Hoare triple {23591#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {23591#false} is VALID [2018-11-14 18:55:39,159 INFO L256 TraceCheckUtils]: 180: Hoare triple {23591#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {23590#true} is VALID [2018-11-14 18:55:39,159 INFO L273 TraceCheckUtils]: 181: Hoare triple {23590#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23590#true} is VALID [2018-11-14 18:55:39,159 INFO L273 TraceCheckUtils]: 182: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,159 INFO L273 TraceCheckUtils]: 183: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,160 INFO L273 TraceCheckUtils]: 184: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,160 INFO L273 TraceCheckUtils]: 185: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,160 INFO L273 TraceCheckUtils]: 186: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,160 INFO L273 TraceCheckUtils]: 187: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,160 INFO L273 TraceCheckUtils]: 188: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,160 INFO L273 TraceCheckUtils]: 189: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,160 INFO L273 TraceCheckUtils]: 190: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,160 INFO L273 TraceCheckUtils]: 191: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,160 INFO L273 TraceCheckUtils]: 192: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,160 INFO L273 TraceCheckUtils]: 193: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,161 INFO L273 TraceCheckUtils]: 194: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,161 INFO L273 TraceCheckUtils]: 195: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,161 INFO L273 TraceCheckUtils]: 196: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,161 INFO L273 TraceCheckUtils]: 197: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,161 INFO L273 TraceCheckUtils]: 198: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,161 INFO L273 TraceCheckUtils]: 199: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,161 INFO L273 TraceCheckUtils]: 200: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,161 INFO L273 TraceCheckUtils]: 201: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,161 INFO L273 TraceCheckUtils]: 202: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,161 INFO L273 TraceCheckUtils]: 203: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,162 INFO L273 TraceCheckUtils]: 204: Hoare triple {23590#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23590#true} is VALID [2018-11-14 18:55:39,162 INFO L273 TraceCheckUtils]: 205: Hoare triple {23590#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23590#true} is VALID [2018-11-14 18:55:39,162 INFO L273 TraceCheckUtils]: 206: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,162 INFO L273 TraceCheckUtils]: 207: Hoare triple {23590#true} assume !(~i~0 < 10000); {23590#true} is VALID [2018-11-14 18:55:39,162 INFO L273 TraceCheckUtils]: 208: Hoare triple {23590#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23590#true} is VALID [2018-11-14 18:55:39,162 INFO L273 TraceCheckUtils]: 209: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,162 INFO L268 TraceCheckUtils]: 210: Hoare quadruple {23590#true} {23591#false} #77#return; {23591#false} is VALID [2018-11-14 18:55:39,162 INFO L273 TraceCheckUtils]: 211: Hoare triple {23591#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23591#false} is VALID [2018-11-14 18:55:39,162 INFO L273 TraceCheckUtils]: 212: Hoare triple {23591#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23591#false} is VALID [2018-11-14 18:55:39,163 INFO L273 TraceCheckUtils]: 213: Hoare triple {23591#false} assume !false; {23591#false} is VALID [2018-11-14 18:55:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2257 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 18:55:39,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:55:39,184 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-14 18:55:39,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:55:39,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:55:39,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:55:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:39,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:55:39,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {23590#true} call ULTIMATE.init(); {23590#true} is VALID [2018-11-14 18:55:39,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {23590#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23590#true} is VALID [2018-11-14 18:55:39,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 18:55:39,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23590#true} {23590#true} #69#return; {23590#true} is VALID [2018-11-14 18:55:39,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {23590#true} call #t~ret13 := main(); {23590#true} is VALID [2018-11-14 18:55:39,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {23590#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23639#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:39,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {23639#(<= main_~i~1 0)} assume true; {23639#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:39,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {23639#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23639#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:39,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {23639#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23593#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:39,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {23593#(<= main_~i~1 1)} assume true; {23593#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:39,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {23593#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23593#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:39,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {23593#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23594#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:39,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {23594#(<= main_~i~1 2)} assume true; {23594#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:39,877 INFO L273 TraceCheckUtils]: 13: Hoare triple {23594#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23594#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:39,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {23594#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23595#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:39,878 INFO L273 TraceCheckUtils]: 15: Hoare triple {23595#(<= main_~i~1 3)} assume true; {23595#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:39,878 INFO L273 TraceCheckUtils]: 16: Hoare triple {23595#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23595#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:39,879 INFO L273 TraceCheckUtils]: 17: Hoare triple {23595#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23596#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:39,879 INFO L273 TraceCheckUtils]: 18: Hoare triple {23596#(<= main_~i~1 4)} assume true; {23596#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:39,880 INFO L273 TraceCheckUtils]: 19: Hoare triple {23596#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23596#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:39,881 INFO L273 TraceCheckUtils]: 20: Hoare triple {23596#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23597#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:39,881 INFO L273 TraceCheckUtils]: 21: Hoare triple {23597#(<= main_~i~1 5)} assume true; {23597#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:39,882 INFO L273 TraceCheckUtils]: 22: Hoare triple {23597#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23597#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:39,882 INFO L273 TraceCheckUtils]: 23: Hoare triple {23597#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23598#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:39,883 INFO L273 TraceCheckUtils]: 24: Hoare triple {23598#(<= main_~i~1 6)} assume true; {23598#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:39,883 INFO L273 TraceCheckUtils]: 25: Hoare triple {23598#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23598#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:39,884 INFO L273 TraceCheckUtils]: 26: Hoare triple {23598#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23599#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:39,885 INFO L273 TraceCheckUtils]: 27: Hoare triple {23599#(<= main_~i~1 7)} assume true; {23599#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:39,885 INFO L273 TraceCheckUtils]: 28: Hoare triple {23599#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23599#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:39,886 INFO L273 TraceCheckUtils]: 29: Hoare triple {23599#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23600#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:39,886 INFO L273 TraceCheckUtils]: 30: Hoare triple {23600#(<= main_~i~1 8)} assume true; {23600#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:39,887 INFO L273 TraceCheckUtils]: 31: Hoare triple {23600#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23600#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:39,888 INFO L273 TraceCheckUtils]: 32: Hoare triple {23600#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23601#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:39,888 INFO L273 TraceCheckUtils]: 33: Hoare triple {23601#(<= main_~i~1 9)} assume true; {23601#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:39,889 INFO L273 TraceCheckUtils]: 34: Hoare triple {23601#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23601#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:39,889 INFO L273 TraceCheckUtils]: 35: Hoare triple {23601#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23602#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:39,890 INFO L273 TraceCheckUtils]: 36: Hoare triple {23602#(<= main_~i~1 10)} assume true; {23602#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:39,890 INFO L273 TraceCheckUtils]: 37: Hoare triple {23602#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23602#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:39,891 INFO L273 TraceCheckUtils]: 38: Hoare triple {23602#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23603#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:39,892 INFO L273 TraceCheckUtils]: 39: Hoare triple {23603#(<= main_~i~1 11)} assume true; {23603#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:39,892 INFO L273 TraceCheckUtils]: 40: Hoare triple {23603#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23603#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:39,893 INFO L273 TraceCheckUtils]: 41: Hoare triple {23603#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23604#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:39,893 INFO L273 TraceCheckUtils]: 42: Hoare triple {23604#(<= main_~i~1 12)} assume true; {23604#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:39,894 INFO L273 TraceCheckUtils]: 43: Hoare triple {23604#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23604#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:39,894 INFO L273 TraceCheckUtils]: 44: Hoare triple {23604#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23605#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:39,895 INFO L273 TraceCheckUtils]: 45: Hoare triple {23605#(<= main_~i~1 13)} assume true; {23605#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:39,895 INFO L273 TraceCheckUtils]: 46: Hoare triple {23605#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23605#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:39,896 INFO L273 TraceCheckUtils]: 47: Hoare triple {23605#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23606#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:39,897 INFO L273 TraceCheckUtils]: 48: Hoare triple {23606#(<= main_~i~1 14)} assume true; {23606#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:39,897 INFO L273 TraceCheckUtils]: 49: Hoare triple {23606#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23606#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:39,898 INFO L273 TraceCheckUtils]: 50: Hoare triple {23606#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23607#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:39,898 INFO L273 TraceCheckUtils]: 51: Hoare triple {23607#(<= main_~i~1 15)} assume true; {23607#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:39,899 INFO L273 TraceCheckUtils]: 52: Hoare triple {23607#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23607#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:39,900 INFO L273 TraceCheckUtils]: 53: Hoare triple {23607#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23608#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:39,900 INFO L273 TraceCheckUtils]: 54: Hoare triple {23608#(<= main_~i~1 16)} assume true; {23608#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:39,901 INFO L273 TraceCheckUtils]: 55: Hoare triple {23608#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23608#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:39,901 INFO L273 TraceCheckUtils]: 56: Hoare triple {23608#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23609#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:39,902 INFO L273 TraceCheckUtils]: 57: Hoare triple {23609#(<= main_~i~1 17)} assume true; {23609#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:39,902 INFO L273 TraceCheckUtils]: 58: Hoare triple {23609#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23609#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:39,903 INFO L273 TraceCheckUtils]: 59: Hoare triple {23609#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23610#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:39,904 INFO L273 TraceCheckUtils]: 60: Hoare triple {23610#(<= main_~i~1 18)} assume true; {23610#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:39,904 INFO L273 TraceCheckUtils]: 61: Hoare triple {23610#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23610#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:39,905 INFO L273 TraceCheckUtils]: 62: Hoare triple {23610#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23611#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:39,905 INFO L273 TraceCheckUtils]: 63: Hoare triple {23611#(<= main_~i~1 19)} assume true; {23611#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:39,906 INFO L273 TraceCheckUtils]: 64: Hoare triple {23611#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23611#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:39,907 INFO L273 TraceCheckUtils]: 65: Hoare triple {23611#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23612#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:39,907 INFO L273 TraceCheckUtils]: 66: Hoare triple {23612#(<= main_~i~1 20)} assume true; {23612#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:39,908 INFO L273 TraceCheckUtils]: 67: Hoare triple {23612#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23612#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:39,908 INFO L273 TraceCheckUtils]: 68: Hoare triple {23612#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23613#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:39,909 INFO L273 TraceCheckUtils]: 69: Hoare triple {23613#(<= main_~i~1 21)} assume true; {23613#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:39,909 INFO L273 TraceCheckUtils]: 70: Hoare triple {23613#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23613#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:39,910 INFO L273 TraceCheckUtils]: 71: Hoare triple {23613#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23614#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:39,911 INFO L273 TraceCheckUtils]: 72: Hoare triple {23614#(<= main_~i~1 22)} assume true; {23614#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:39,911 INFO L273 TraceCheckUtils]: 73: Hoare triple {23614#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23614#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:39,912 INFO L273 TraceCheckUtils]: 74: Hoare triple {23614#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23615#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:39,912 INFO L273 TraceCheckUtils]: 75: Hoare triple {23615#(<= main_~i~1 23)} assume true; {23615#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:39,913 INFO L273 TraceCheckUtils]: 76: Hoare triple {23615#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23615#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:39,913 INFO L273 TraceCheckUtils]: 77: Hoare triple {23615#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23616#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:39,914 INFO L273 TraceCheckUtils]: 78: Hoare triple {23616#(<= main_~i~1 24)} assume true; {23616#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:39,914 INFO L273 TraceCheckUtils]: 79: Hoare triple {23616#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23616#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:39,915 INFO L273 TraceCheckUtils]: 80: Hoare triple {23616#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23617#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:39,916 INFO L273 TraceCheckUtils]: 81: Hoare triple {23617#(<= main_~i~1 25)} assume true; {23617#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:39,916 INFO L273 TraceCheckUtils]: 82: Hoare triple {23617#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23617#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:39,917 INFO L273 TraceCheckUtils]: 83: Hoare triple {23617#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23618#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:39,917 INFO L273 TraceCheckUtils]: 84: Hoare triple {23618#(<= main_~i~1 26)} assume true; {23618#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:39,918 INFO L273 TraceCheckUtils]: 85: Hoare triple {23618#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23618#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:39,919 INFO L273 TraceCheckUtils]: 86: Hoare triple {23618#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23619#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:39,919 INFO L273 TraceCheckUtils]: 87: Hoare triple {23619#(<= main_~i~1 27)} assume true; {23619#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:39,920 INFO L273 TraceCheckUtils]: 88: Hoare triple {23619#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23619#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:39,920 INFO L273 TraceCheckUtils]: 89: Hoare triple {23619#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23620#(<= main_~i~1 28)} is VALID [2018-11-14 18:55:39,921 INFO L273 TraceCheckUtils]: 90: Hoare triple {23620#(<= main_~i~1 28)} assume true; {23620#(<= main_~i~1 28)} is VALID [2018-11-14 18:55:39,922 INFO L273 TraceCheckUtils]: 91: Hoare triple {23620#(<= main_~i~1 28)} assume !(~i~1 < 10000); {23591#false} is VALID [2018-11-14 18:55:39,922 INFO L256 TraceCheckUtils]: 92: Hoare triple {23591#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {23591#false} is VALID [2018-11-14 18:55:39,922 INFO L273 TraceCheckUtils]: 93: Hoare triple {23591#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23591#false} is VALID [2018-11-14 18:55:39,922 INFO L273 TraceCheckUtils]: 94: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,922 INFO L273 TraceCheckUtils]: 95: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,922 INFO L273 TraceCheckUtils]: 96: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,923 INFO L273 TraceCheckUtils]: 97: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,923 INFO L273 TraceCheckUtils]: 98: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,923 INFO L273 TraceCheckUtils]: 99: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,923 INFO L273 TraceCheckUtils]: 100: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,923 INFO L273 TraceCheckUtils]: 101: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,923 INFO L273 TraceCheckUtils]: 102: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,924 INFO L273 TraceCheckUtils]: 103: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,924 INFO L273 TraceCheckUtils]: 104: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,924 INFO L273 TraceCheckUtils]: 105: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,924 INFO L273 TraceCheckUtils]: 106: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,924 INFO L273 TraceCheckUtils]: 107: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,924 INFO L273 TraceCheckUtils]: 108: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,924 INFO L273 TraceCheckUtils]: 109: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,924 INFO L273 TraceCheckUtils]: 110: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,924 INFO L273 TraceCheckUtils]: 111: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,924 INFO L273 TraceCheckUtils]: 112: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,925 INFO L273 TraceCheckUtils]: 113: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,925 INFO L273 TraceCheckUtils]: 114: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,925 INFO L273 TraceCheckUtils]: 115: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,925 INFO L273 TraceCheckUtils]: 116: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,925 INFO L273 TraceCheckUtils]: 117: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,925 INFO L273 TraceCheckUtils]: 118: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,925 INFO L273 TraceCheckUtils]: 119: Hoare triple {23591#false} assume !(~i~0 < 10000); {23591#false} is VALID [2018-11-14 18:55:39,925 INFO L273 TraceCheckUtils]: 120: Hoare triple {23591#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23591#false} is VALID [2018-11-14 18:55:39,925 INFO L273 TraceCheckUtils]: 121: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,925 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {23591#false} {23591#false} #73#return; {23591#false} is VALID [2018-11-14 18:55:39,926 INFO L273 TraceCheckUtils]: 123: Hoare triple {23591#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {23591#false} is VALID [2018-11-14 18:55:39,926 INFO L256 TraceCheckUtils]: 124: Hoare triple {23591#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {23591#false} is VALID [2018-11-14 18:55:39,926 INFO L273 TraceCheckUtils]: 125: Hoare triple {23591#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23591#false} is VALID [2018-11-14 18:55:39,926 INFO L273 TraceCheckUtils]: 126: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,926 INFO L273 TraceCheckUtils]: 127: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,926 INFO L273 TraceCheckUtils]: 128: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,926 INFO L273 TraceCheckUtils]: 129: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,926 INFO L273 TraceCheckUtils]: 130: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,926 INFO L273 TraceCheckUtils]: 131: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,926 INFO L273 TraceCheckUtils]: 132: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,927 INFO L273 TraceCheckUtils]: 133: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,927 INFO L273 TraceCheckUtils]: 134: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,927 INFO L273 TraceCheckUtils]: 135: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,927 INFO L273 TraceCheckUtils]: 136: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,927 INFO L273 TraceCheckUtils]: 137: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,927 INFO L273 TraceCheckUtils]: 138: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,927 INFO L273 TraceCheckUtils]: 139: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,927 INFO L273 TraceCheckUtils]: 140: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,927 INFO L273 TraceCheckUtils]: 141: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,927 INFO L273 TraceCheckUtils]: 142: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,928 INFO L273 TraceCheckUtils]: 143: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,928 INFO L273 TraceCheckUtils]: 144: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,928 INFO L273 TraceCheckUtils]: 145: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,928 INFO L273 TraceCheckUtils]: 146: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,928 INFO L273 TraceCheckUtils]: 147: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,928 INFO L273 TraceCheckUtils]: 148: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,928 INFO L273 TraceCheckUtils]: 149: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,928 INFO L273 TraceCheckUtils]: 150: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,928 INFO L273 TraceCheckUtils]: 151: Hoare triple {23591#false} assume !(~i~0 < 10000); {23591#false} is VALID [2018-11-14 18:55:39,928 INFO L273 TraceCheckUtils]: 152: Hoare triple {23591#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23591#false} is VALID [2018-11-14 18:55:39,929 INFO L273 TraceCheckUtils]: 153: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,929 INFO L268 TraceCheckUtils]: 154: Hoare quadruple {23591#false} {23591#false} #75#return; {23591#false} is VALID [2018-11-14 18:55:39,929 INFO L273 TraceCheckUtils]: 155: Hoare triple {23591#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23591#false} is VALID [2018-11-14 18:55:39,929 INFO L273 TraceCheckUtils]: 156: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,929 INFO L273 TraceCheckUtils]: 157: Hoare triple {23591#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23591#false} is VALID [2018-11-14 18:55:39,929 INFO L273 TraceCheckUtils]: 158: Hoare triple {23591#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23591#false} is VALID [2018-11-14 18:55:39,929 INFO L273 TraceCheckUtils]: 159: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,929 INFO L273 TraceCheckUtils]: 160: Hoare triple {23591#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23591#false} is VALID [2018-11-14 18:55:39,929 INFO L273 TraceCheckUtils]: 161: Hoare triple {23591#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23591#false} is VALID [2018-11-14 18:55:39,929 INFO L273 TraceCheckUtils]: 162: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,930 INFO L273 TraceCheckUtils]: 163: Hoare triple {23591#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23591#false} is VALID [2018-11-14 18:55:39,930 INFO L273 TraceCheckUtils]: 164: Hoare triple {23591#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23591#false} is VALID [2018-11-14 18:55:39,930 INFO L273 TraceCheckUtils]: 165: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,930 INFO L273 TraceCheckUtils]: 166: Hoare triple {23591#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23591#false} is VALID [2018-11-14 18:55:39,930 INFO L273 TraceCheckUtils]: 167: Hoare triple {23591#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23591#false} is VALID [2018-11-14 18:55:39,930 INFO L273 TraceCheckUtils]: 168: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,930 INFO L273 TraceCheckUtils]: 169: Hoare triple {23591#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23591#false} is VALID [2018-11-14 18:55:39,930 INFO L273 TraceCheckUtils]: 170: Hoare triple {23591#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23591#false} is VALID [2018-11-14 18:55:39,930 INFO L273 TraceCheckUtils]: 171: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,930 INFO L273 TraceCheckUtils]: 172: Hoare triple {23591#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23591#false} is VALID [2018-11-14 18:55:39,930 INFO L273 TraceCheckUtils]: 173: Hoare triple {23591#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23591#false} is VALID [2018-11-14 18:55:39,931 INFO L273 TraceCheckUtils]: 174: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,931 INFO L273 TraceCheckUtils]: 175: Hoare triple {23591#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23591#false} is VALID [2018-11-14 18:55:39,931 INFO L273 TraceCheckUtils]: 176: Hoare triple {23591#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23591#false} is VALID [2018-11-14 18:55:39,931 INFO L273 TraceCheckUtils]: 177: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,931 INFO L273 TraceCheckUtils]: 178: Hoare triple {23591#false} assume !(~i~2 < 9999); {23591#false} is VALID [2018-11-14 18:55:39,931 INFO L273 TraceCheckUtils]: 179: Hoare triple {23591#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {23591#false} is VALID [2018-11-14 18:55:39,931 INFO L256 TraceCheckUtils]: 180: Hoare triple {23591#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {23591#false} is VALID [2018-11-14 18:55:39,931 INFO L273 TraceCheckUtils]: 181: Hoare triple {23591#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23591#false} is VALID [2018-11-14 18:55:39,931 INFO L273 TraceCheckUtils]: 182: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,931 INFO L273 TraceCheckUtils]: 183: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,932 INFO L273 TraceCheckUtils]: 184: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,932 INFO L273 TraceCheckUtils]: 185: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,932 INFO L273 TraceCheckUtils]: 186: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,932 INFO L273 TraceCheckUtils]: 187: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,932 INFO L273 TraceCheckUtils]: 188: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,932 INFO L273 TraceCheckUtils]: 189: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,932 INFO L273 TraceCheckUtils]: 190: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,932 INFO L273 TraceCheckUtils]: 191: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,932 INFO L273 TraceCheckUtils]: 192: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,932 INFO L273 TraceCheckUtils]: 193: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,932 INFO L273 TraceCheckUtils]: 194: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,933 INFO L273 TraceCheckUtils]: 195: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,933 INFO L273 TraceCheckUtils]: 196: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,933 INFO L273 TraceCheckUtils]: 197: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,933 INFO L273 TraceCheckUtils]: 198: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,933 INFO L273 TraceCheckUtils]: 199: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,933 INFO L273 TraceCheckUtils]: 200: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,933 INFO L273 TraceCheckUtils]: 201: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,933 INFO L273 TraceCheckUtils]: 202: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,933 INFO L273 TraceCheckUtils]: 203: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,933 INFO L273 TraceCheckUtils]: 204: Hoare triple {23591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23591#false} is VALID [2018-11-14 18:55:39,933 INFO L273 TraceCheckUtils]: 205: Hoare triple {23591#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23591#false} is VALID [2018-11-14 18:55:39,934 INFO L273 TraceCheckUtils]: 206: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,934 INFO L273 TraceCheckUtils]: 207: Hoare triple {23591#false} assume !(~i~0 < 10000); {23591#false} is VALID [2018-11-14 18:55:39,934 INFO L273 TraceCheckUtils]: 208: Hoare triple {23591#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23591#false} is VALID [2018-11-14 18:55:39,934 INFO L273 TraceCheckUtils]: 209: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 18:55:39,934 INFO L268 TraceCheckUtils]: 210: Hoare quadruple {23591#false} {23591#false} #77#return; {23591#false} is VALID [2018-11-14 18:55:39,934 INFO L273 TraceCheckUtils]: 211: Hoare triple {23591#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23591#false} is VALID [2018-11-14 18:55:39,934 INFO L273 TraceCheckUtils]: 212: Hoare triple {23591#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23591#false} is VALID [2018-11-14 18:55:39,934 INFO L273 TraceCheckUtils]: 213: Hoare triple {23591#false} assume !false; {23591#false} is VALID [2018-11-14 18:55:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2257 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 18:55:39,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:55:39,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-14 18:55:39,974 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 214 [2018-11-14 18:55:39,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:55:39,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 18:55:40,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:40,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 18:55:40,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 18:55:40,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:55:40,103 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 32 states. [2018-11-14 18:55:40,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:40,508 INFO L93 Difference]: Finished difference Result 222 states and 230 transitions. [2018-11-14 18:55:40,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 18:55:40,508 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 214 [2018-11-14 18:55:40,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:55:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:55:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 144 transitions. [2018-11-14 18:55:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:55:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 144 transitions. [2018-11-14 18:55:40,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 144 transitions. [2018-11-14 18:55:40,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:40,645 INFO L225 Difference]: With dead ends: 222 [2018-11-14 18:55:40,645 INFO L226 Difference]: Without dead ends: 159 [2018-11-14 18:55:40,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:55:40,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-14 18:55:40,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-11-14 18:55:40,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:55:40,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 158 states. [2018-11-14 18:55:40,701 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 158 states. [2018-11-14 18:55:40,702 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 158 states. [2018-11-14 18:55:40,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:40,705 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2018-11-14 18:55:40,705 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2018-11-14 18:55:40,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:40,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:40,706 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 159 states. [2018-11-14 18:55:40,706 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 159 states. [2018-11-14 18:55:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:40,709 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2018-11-14 18:55:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2018-11-14 18:55:40,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:40,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:40,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:55:40,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:55:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-14 18:55:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 162 transitions. [2018-11-14 18:55:40,712 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 162 transitions. Word has length 214 [2018-11-14 18:55:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:55:40,712 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 162 transitions. [2018-11-14 18:55:40,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 18:55:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2018-11-14 18:55:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-14 18:55:40,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:55:40,713 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 27, 24, 24, 8, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:55:40,714 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:55:40,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:55:40,714 INFO L82 PathProgramCache]: Analyzing trace with hash -937872049, now seen corresponding path program 27 times [2018-11-14 18:55:40,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:55:40,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:55:40,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:40,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:55:40,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:41,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {25092#true} call ULTIMATE.init(); {25092#true} is VALID [2018-11-14 18:55:41,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {25092#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25092#true} is VALID [2018-11-14 18:55:41,339 INFO L273 TraceCheckUtils]: 2: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,339 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25092#true} {25092#true} #69#return; {25092#true} is VALID [2018-11-14 18:55:41,339 INFO L256 TraceCheckUtils]: 4: Hoare triple {25092#true} call #t~ret13 := main(); {25092#true} is VALID [2018-11-14 18:55:41,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {25092#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {25094#(= main_~i~1 0)} is VALID [2018-11-14 18:55:41,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {25094#(= main_~i~1 0)} assume true; {25094#(= main_~i~1 0)} is VALID [2018-11-14 18:55:41,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {25094#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25094#(= main_~i~1 0)} is VALID [2018-11-14 18:55:41,341 INFO L273 TraceCheckUtils]: 8: Hoare triple {25094#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25095#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:41,341 INFO L273 TraceCheckUtils]: 9: Hoare triple {25095#(<= main_~i~1 1)} assume true; {25095#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:41,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {25095#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25095#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:41,343 INFO L273 TraceCheckUtils]: 11: Hoare triple {25095#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25096#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:41,343 INFO L273 TraceCheckUtils]: 12: Hoare triple {25096#(<= main_~i~1 2)} assume true; {25096#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:41,344 INFO L273 TraceCheckUtils]: 13: Hoare triple {25096#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25096#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:41,344 INFO L273 TraceCheckUtils]: 14: Hoare triple {25096#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25097#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:41,345 INFO L273 TraceCheckUtils]: 15: Hoare triple {25097#(<= main_~i~1 3)} assume true; {25097#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:41,345 INFO L273 TraceCheckUtils]: 16: Hoare triple {25097#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25097#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:41,346 INFO L273 TraceCheckUtils]: 17: Hoare triple {25097#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25098#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:41,347 INFO L273 TraceCheckUtils]: 18: Hoare triple {25098#(<= main_~i~1 4)} assume true; {25098#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:41,347 INFO L273 TraceCheckUtils]: 19: Hoare triple {25098#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25098#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:41,348 INFO L273 TraceCheckUtils]: 20: Hoare triple {25098#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25099#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:41,348 INFO L273 TraceCheckUtils]: 21: Hoare triple {25099#(<= main_~i~1 5)} assume true; {25099#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:41,349 INFO L273 TraceCheckUtils]: 22: Hoare triple {25099#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25099#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:41,350 INFO L273 TraceCheckUtils]: 23: Hoare triple {25099#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25100#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:41,350 INFO L273 TraceCheckUtils]: 24: Hoare triple {25100#(<= main_~i~1 6)} assume true; {25100#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:41,351 INFO L273 TraceCheckUtils]: 25: Hoare triple {25100#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25100#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:41,351 INFO L273 TraceCheckUtils]: 26: Hoare triple {25100#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25101#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:41,352 INFO L273 TraceCheckUtils]: 27: Hoare triple {25101#(<= main_~i~1 7)} assume true; {25101#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:41,352 INFO L273 TraceCheckUtils]: 28: Hoare triple {25101#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25101#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:41,353 INFO L273 TraceCheckUtils]: 29: Hoare triple {25101#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25102#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:41,354 INFO L273 TraceCheckUtils]: 30: Hoare triple {25102#(<= main_~i~1 8)} assume true; {25102#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:41,354 INFO L273 TraceCheckUtils]: 31: Hoare triple {25102#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25102#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:41,355 INFO L273 TraceCheckUtils]: 32: Hoare triple {25102#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25103#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:41,355 INFO L273 TraceCheckUtils]: 33: Hoare triple {25103#(<= main_~i~1 9)} assume true; {25103#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:41,356 INFO L273 TraceCheckUtils]: 34: Hoare triple {25103#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25103#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:41,357 INFO L273 TraceCheckUtils]: 35: Hoare triple {25103#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25104#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:41,357 INFO L273 TraceCheckUtils]: 36: Hoare triple {25104#(<= main_~i~1 10)} assume true; {25104#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:41,358 INFO L273 TraceCheckUtils]: 37: Hoare triple {25104#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25104#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:41,358 INFO L273 TraceCheckUtils]: 38: Hoare triple {25104#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25105#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:41,359 INFO L273 TraceCheckUtils]: 39: Hoare triple {25105#(<= main_~i~1 11)} assume true; {25105#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:41,359 INFO L273 TraceCheckUtils]: 40: Hoare triple {25105#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25105#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:41,360 INFO L273 TraceCheckUtils]: 41: Hoare triple {25105#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25106#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:41,361 INFO L273 TraceCheckUtils]: 42: Hoare triple {25106#(<= main_~i~1 12)} assume true; {25106#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:41,361 INFO L273 TraceCheckUtils]: 43: Hoare triple {25106#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25106#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:41,362 INFO L273 TraceCheckUtils]: 44: Hoare triple {25106#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25107#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:41,362 INFO L273 TraceCheckUtils]: 45: Hoare triple {25107#(<= main_~i~1 13)} assume true; {25107#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:41,363 INFO L273 TraceCheckUtils]: 46: Hoare triple {25107#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25107#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:41,363 INFO L273 TraceCheckUtils]: 47: Hoare triple {25107#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25108#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:41,364 INFO L273 TraceCheckUtils]: 48: Hoare triple {25108#(<= main_~i~1 14)} assume true; {25108#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:41,364 INFO L273 TraceCheckUtils]: 49: Hoare triple {25108#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25108#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:41,365 INFO L273 TraceCheckUtils]: 50: Hoare triple {25108#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25109#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:41,366 INFO L273 TraceCheckUtils]: 51: Hoare triple {25109#(<= main_~i~1 15)} assume true; {25109#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:41,366 INFO L273 TraceCheckUtils]: 52: Hoare triple {25109#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25109#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:41,367 INFO L273 TraceCheckUtils]: 53: Hoare triple {25109#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25110#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:41,367 INFO L273 TraceCheckUtils]: 54: Hoare triple {25110#(<= main_~i~1 16)} assume true; {25110#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:41,368 INFO L273 TraceCheckUtils]: 55: Hoare triple {25110#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25110#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:41,369 INFO L273 TraceCheckUtils]: 56: Hoare triple {25110#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25111#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:41,369 INFO L273 TraceCheckUtils]: 57: Hoare triple {25111#(<= main_~i~1 17)} assume true; {25111#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:41,370 INFO L273 TraceCheckUtils]: 58: Hoare triple {25111#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25111#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:41,370 INFO L273 TraceCheckUtils]: 59: Hoare triple {25111#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25112#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:41,371 INFO L273 TraceCheckUtils]: 60: Hoare triple {25112#(<= main_~i~1 18)} assume true; {25112#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:41,371 INFO L273 TraceCheckUtils]: 61: Hoare triple {25112#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25112#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:41,372 INFO L273 TraceCheckUtils]: 62: Hoare triple {25112#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25113#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:41,373 INFO L273 TraceCheckUtils]: 63: Hoare triple {25113#(<= main_~i~1 19)} assume true; {25113#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:41,373 INFO L273 TraceCheckUtils]: 64: Hoare triple {25113#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25113#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:41,374 INFO L273 TraceCheckUtils]: 65: Hoare triple {25113#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25114#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:41,374 INFO L273 TraceCheckUtils]: 66: Hoare triple {25114#(<= main_~i~1 20)} assume true; {25114#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:41,375 INFO L273 TraceCheckUtils]: 67: Hoare triple {25114#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25114#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:41,376 INFO L273 TraceCheckUtils]: 68: Hoare triple {25114#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25115#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:41,376 INFO L273 TraceCheckUtils]: 69: Hoare triple {25115#(<= main_~i~1 21)} assume true; {25115#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:41,377 INFO L273 TraceCheckUtils]: 70: Hoare triple {25115#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25115#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:41,377 INFO L273 TraceCheckUtils]: 71: Hoare triple {25115#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25116#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:41,378 INFO L273 TraceCheckUtils]: 72: Hoare triple {25116#(<= main_~i~1 22)} assume true; {25116#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:41,378 INFO L273 TraceCheckUtils]: 73: Hoare triple {25116#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25116#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:41,379 INFO L273 TraceCheckUtils]: 74: Hoare triple {25116#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25117#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:41,380 INFO L273 TraceCheckUtils]: 75: Hoare triple {25117#(<= main_~i~1 23)} assume true; {25117#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:41,380 INFO L273 TraceCheckUtils]: 76: Hoare triple {25117#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25117#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:41,381 INFO L273 TraceCheckUtils]: 77: Hoare triple {25117#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25118#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:41,381 INFO L273 TraceCheckUtils]: 78: Hoare triple {25118#(<= main_~i~1 24)} assume true; {25118#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:41,382 INFO L273 TraceCheckUtils]: 79: Hoare triple {25118#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25118#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:41,382 INFO L273 TraceCheckUtils]: 80: Hoare triple {25118#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25119#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:41,383 INFO L273 TraceCheckUtils]: 81: Hoare triple {25119#(<= main_~i~1 25)} assume true; {25119#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:41,383 INFO L273 TraceCheckUtils]: 82: Hoare triple {25119#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25119#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:41,384 INFO L273 TraceCheckUtils]: 83: Hoare triple {25119#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25120#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:41,385 INFO L273 TraceCheckUtils]: 84: Hoare triple {25120#(<= main_~i~1 26)} assume true; {25120#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:41,385 INFO L273 TraceCheckUtils]: 85: Hoare triple {25120#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25120#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:41,386 INFO L273 TraceCheckUtils]: 86: Hoare triple {25120#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25121#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:41,386 INFO L273 TraceCheckUtils]: 87: Hoare triple {25121#(<= main_~i~1 27)} assume true; {25121#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:41,387 INFO L273 TraceCheckUtils]: 88: Hoare triple {25121#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25121#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:41,388 INFO L273 TraceCheckUtils]: 89: Hoare triple {25121#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25122#(<= main_~i~1 28)} is VALID [2018-11-14 18:55:41,388 INFO L273 TraceCheckUtils]: 90: Hoare triple {25122#(<= main_~i~1 28)} assume true; {25122#(<= main_~i~1 28)} is VALID [2018-11-14 18:55:41,389 INFO L273 TraceCheckUtils]: 91: Hoare triple {25122#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25122#(<= main_~i~1 28)} is VALID [2018-11-14 18:55:41,389 INFO L273 TraceCheckUtils]: 92: Hoare triple {25122#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25123#(<= main_~i~1 29)} is VALID [2018-11-14 18:55:41,390 INFO L273 TraceCheckUtils]: 93: Hoare triple {25123#(<= main_~i~1 29)} assume true; {25123#(<= main_~i~1 29)} is VALID [2018-11-14 18:55:41,391 INFO L273 TraceCheckUtils]: 94: Hoare triple {25123#(<= main_~i~1 29)} assume !(~i~1 < 10000); {25093#false} is VALID [2018-11-14 18:55:41,391 INFO L256 TraceCheckUtils]: 95: Hoare triple {25093#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {25092#true} is VALID [2018-11-14 18:55:41,391 INFO L273 TraceCheckUtils]: 96: Hoare triple {25092#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {25092#true} is VALID [2018-11-14 18:55:41,391 INFO L273 TraceCheckUtils]: 97: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,391 INFO L273 TraceCheckUtils]: 98: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,391 INFO L273 TraceCheckUtils]: 99: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,392 INFO L273 TraceCheckUtils]: 100: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,392 INFO L273 TraceCheckUtils]: 101: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,392 INFO L273 TraceCheckUtils]: 102: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,392 INFO L273 TraceCheckUtils]: 103: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,392 INFO L273 TraceCheckUtils]: 104: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,393 INFO L273 TraceCheckUtils]: 105: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,393 INFO L273 TraceCheckUtils]: 106: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,393 INFO L273 TraceCheckUtils]: 107: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,393 INFO L273 TraceCheckUtils]: 108: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,393 INFO L273 TraceCheckUtils]: 109: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,393 INFO L273 TraceCheckUtils]: 110: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,394 INFO L273 TraceCheckUtils]: 111: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,394 INFO L273 TraceCheckUtils]: 112: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,394 INFO L273 TraceCheckUtils]: 113: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,394 INFO L273 TraceCheckUtils]: 114: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,394 INFO L273 TraceCheckUtils]: 115: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,394 INFO L273 TraceCheckUtils]: 116: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,395 INFO L273 TraceCheckUtils]: 117: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,395 INFO L273 TraceCheckUtils]: 118: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,395 INFO L273 TraceCheckUtils]: 119: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,395 INFO L273 TraceCheckUtils]: 120: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,395 INFO L273 TraceCheckUtils]: 121: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,395 INFO L273 TraceCheckUtils]: 122: Hoare triple {25092#true} assume !(~i~0 < 10000); {25092#true} is VALID [2018-11-14 18:55:41,395 INFO L273 TraceCheckUtils]: 123: Hoare triple {25092#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {25092#true} is VALID [2018-11-14 18:55:41,396 INFO L273 TraceCheckUtils]: 124: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,396 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {25092#true} {25093#false} #73#return; {25093#false} is VALID [2018-11-14 18:55:41,396 INFO L273 TraceCheckUtils]: 126: Hoare triple {25093#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {25093#false} is VALID [2018-11-14 18:55:41,396 INFO L256 TraceCheckUtils]: 127: Hoare triple {25093#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {25092#true} is VALID [2018-11-14 18:55:41,396 INFO L273 TraceCheckUtils]: 128: Hoare triple {25092#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {25092#true} is VALID [2018-11-14 18:55:41,396 INFO L273 TraceCheckUtils]: 129: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,396 INFO L273 TraceCheckUtils]: 130: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,396 INFO L273 TraceCheckUtils]: 131: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,396 INFO L273 TraceCheckUtils]: 132: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,397 INFO L273 TraceCheckUtils]: 133: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,397 INFO L273 TraceCheckUtils]: 134: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,397 INFO L273 TraceCheckUtils]: 135: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,397 INFO L273 TraceCheckUtils]: 136: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,397 INFO L273 TraceCheckUtils]: 137: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,397 INFO L273 TraceCheckUtils]: 138: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,397 INFO L273 TraceCheckUtils]: 139: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,397 INFO L273 TraceCheckUtils]: 140: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,397 INFO L273 TraceCheckUtils]: 141: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,397 INFO L273 TraceCheckUtils]: 142: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,398 INFO L273 TraceCheckUtils]: 143: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,398 INFO L273 TraceCheckUtils]: 144: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,398 INFO L273 TraceCheckUtils]: 145: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,398 INFO L273 TraceCheckUtils]: 146: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,398 INFO L273 TraceCheckUtils]: 147: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,398 INFO L273 TraceCheckUtils]: 148: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,398 INFO L273 TraceCheckUtils]: 149: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,398 INFO L273 TraceCheckUtils]: 150: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,398 INFO L273 TraceCheckUtils]: 151: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,398 INFO L273 TraceCheckUtils]: 152: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,399 INFO L273 TraceCheckUtils]: 153: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,399 INFO L273 TraceCheckUtils]: 154: Hoare triple {25092#true} assume !(~i~0 < 10000); {25092#true} is VALID [2018-11-14 18:55:41,399 INFO L273 TraceCheckUtils]: 155: Hoare triple {25092#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {25092#true} is VALID [2018-11-14 18:55:41,399 INFO L273 TraceCheckUtils]: 156: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,399 INFO L268 TraceCheckUtils]: 157: Hoare quadruple {25092#true} {25093#false} #75#return; {25093#false} is VALID [2018-11-14 18:55:41,399 INFO L273 TraceCheckUtils]: 158: Hoare triple {25093#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {25093#false} is VALID [2018-11-14 18:55:41,399 INFO L273 TraceCheckUtils]: 159: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 18:55:41,399 INFO L273 TraceCheckUtils]: 160: Hoare triple {25093#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25093#false} is VALID [2018-11-14 18:55:41,399 INFO L273 TraceCheckUtils]: 161: Hoare triple {25093#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25093#false} is VALID [2018-11-14 18:55:41,399 INFO L273 TraceCheckUtils]: 162: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 18:55:41,400 INFO L273 TraceCheckUtils]: 163: Hoare triple {25093#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25093#false} is VALID [2018-11-14 18:55:41,400 INFO L273 TraceCheckUtils]: 164: Hoare triple {25093#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25093#false} is VALID [2018-11-14 18:55:41,400 INFO L273 TraceCheckUtils]: 165: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 18:55:41,400 INFO L273 TraceCheckUtils]: 166: Hoare triple {25093#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25093#false} is VALID [2018-11-14 18:55:41,400 INFO L273 TraceCheckUtils]: 167: Hoare triple {25093#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25093#false} is VALID [2018-11-14 18:55:41,400 INFO L273 TraceCheckUtils]: 168: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 18:55:41,400 INFO L273 TraceCheckUtils]: 169: Hoare triple {25093#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25093#false} is VALID [2018-11-14 18:55:41,400 INFO L273 TraceCheckUtils]: 170: Hoare triple {25093#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25093#false} is VALID [2018-11-14 18:55:41,400 INFO L273 TraceCheckUtils]: 171: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 18:55:41,400 INFO L273 TraceCheckUtils]: 172: Hoare triple {25093#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25093#false} is VALID [2018-11-14 18:55:41,401 INFO L273 TraceCheckUtils]: 173: Hoare triple {25093#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25093#false} is VALID [2018-11-14 18:55:41,401 INFO L273 TraceCheckUtils]: 174: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 18:55:41,401 INFO L273 TraceCheckUtils]: 175: Hoare triple {25093#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25093#false} is VALID [2018-11-14 18:55:41,401 INFO L273 TraceCheckUtils]: 176: Hoare triple {25093#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25093#false} is VALID [2018-11-14 18:55:41,401 INFO L273 TraceCheckUtils]: 177: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 18:55:41,401 INFO L273 TraceCheckUtils]: 178: Hoare triple {25093#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25093#false} is VALID [2018-11-14 18:55:41,401 INFO L273 TraceCheckUtils]: 179: Hoare triple {25093#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25093#false} is VALID [2018-11-14 18:55:41,401 INFO L273 TraceCheckUtils]: 180: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 18:55:41,401 INFO L273 TraceCheckUtils]: 181: Hoare triple {25093#false} assume !(~i~2 < 9999); {25093#false} is VALID [2018-11-14 18:55:41,401 INFO L273 TraceCheckUtils]: 182: Hoare triple {25093#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {25093#false} is VALID [2018-11-14 18:55:41,402 INFO L256 TraceCheckUtils]: 183: Hoare triple {25093#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {25092#true} is VALID [2018-11-14 18:55:41,402 INFO L273 TraceCheckUtils]: 184: Hoare triple {25092#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {25092#true} is VALID [2018-11-14 18:55:41,402 INFO L273 TraceCheckUtils]: 185: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,402 INFO L273 TraceCheckUtils]: 186: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,402 INFO L273 TraceCheckUtils]: 187: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,402 INFO L273 TraceCheckUtils]: 188: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,402 INFO L273 TraceCheckUtils]: 189: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,402 INFO L273 TraceCheckUtils]: 190: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,402 INFO L273 TraceCheckUtils]: 191: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,403 INFO L273 TraceCheckUtils]: 192: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,403 INFO L273 TraceCheckUtils]: 193: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,403 INFO L273 TraceCheckUtils]: 194: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,403 INFO L273 TraceCheckUtils]: 195: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,403 INFO L273 TraceCheckUtils]: 196: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,403 INFO L273 TraceCheckUtils]: 197: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,403 INFO L273 TraceCheckUtils]: 198: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,403 INFO L273 TraceCheckUtils]: 199: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,403 INFO L273 TraceCheckUtils]: 200: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,403 INFO L273 TraceCheckUtils]: 201: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,404 INFO L273 TraceCheckUtils]: 202: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,404 INFO L273 TraceCheckUtils]: 203: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,404 INFO L273 TraceCheckUtils]: 204: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,404 INFO L273 TraceCheckUtils]: 205: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,404 INFO L273 TraceCheckUtils]: 206: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,404 INFO L273 TraceCheckUtils]: 207: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:41,404 INFO L273 TraceCheckUtils]: 208: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:41,404 INFO L273 TraceCheckUtils]: 209: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,404 INFO L273 TraceCheckUtils]: 210: Hoare triple {25092#true} assume !(~i~0 < 10000); {25092#true} is VALID [2018-11-14 18:55:41,404 INFO L273 TraceCheckUtils]: 211: Hoare triple {25092#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {25092#true} is VALID [2018-11-14 18:55:41,405 INFO L273 TraceCheckUtils]: 212: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:41,405 INFO L268 TraceCheckUtils]: 213: Hoare quadruple {25092#true} {25093#false} #77#return; {25093#false} is VALID [2018-11-14 18:55:41,405 INFO L273 TraceCheckUtils]: 214: Hoare triple {25093#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {25093#false} is VALID [2018-11-14 18:55:41,405 INFO L273 TraceCheckUtils]: 215: Hoare triple {25093#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {25093#false} is VALID [2018-11-14 18:55:41,405 INFO L273 TraceCheckUtils]: 216: Hoare triple {25093#false} assume !false; {25093#false} is VALID [2018-11-14 18:55:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2343 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 18:55:41,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:55:41,427 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-14 18:55:41,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:55:41,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-14 18:55:41,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:55:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:41,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:55:42,232 INFO L256 TraceCheckUtils]: 0: Hoare triple {25092#true} call ULTIMATE.init(); {25092#true} is VALID [2018-11-14 18:55:42,233 INFO L273 TraceCheckUtils]: 1: Hoare triple {25092#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25092#true} is VALID [2018-11-14 18:55:42,233 INFO L273 TraceCheckUtils]: 2: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,233 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25092#true} {25092#true} #69#return; {25092#true} is VALID [2018-11-14 18:55:42,233 INFO L256 TraceCheckUtils]: 4: Hoare triple {25092#true} call #t~ret13 := main(); {25092#true} is VALID [2018-11-14 18:55:42,234 INFO L273 TraceCheckUtils]: 5: Hoare triple {25092#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {25092#true} is VALID [2018-11-14 18:55:42,234 INFO L273 TraceCheckUtils]: 6: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,234 INFO L273 TraceCheckUtils]: 7: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,235 INFO L273 TraceCheckUtils]: 11: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,235 INFO L273 TraceCheckUtils]: 17: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,235 INFO L273 TraceCheckUtils]: 19: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,236 INFO L273 TraceCheckUtils]: 20: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,236 INFO L273 TraceCheckUtils]: 21: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,236 INFO L273 TraceCheckUtils]: 23: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,236 INFO L273 TraceCheckUtils]: 24: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,236 INFO L273 TraceCheckUtils]: 25: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,236 INFO L273 TraceCheckUtils]: 26: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,236 INFO L273 TraceCheckUtils]: 27: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,236 INFO L273 TraceCheckUtils]: 28: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,237 INFO L273 TraceCheckUtils]: 29: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,237 INFO L273 TraceCheckUtils]: 30: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,237 INFO L273 TraceCheckUtils]: 31: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,237 INFO L273 TraceCheckUtils]: 32: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,237 INFO L273 TraceCheckUtils]: 33: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,237 INFO L273 TraceCheckUtils]: 35: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,237 INFO L273 TraceCheckUtils]: 36: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,237 INFO L273 TraceCheckUtils]: 37: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,237 INFO L273 TraceCheckUtils]: 38: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,238 INFO L273 TraceCheckUtils]: 39: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,238 INFO L273 TraceCheckUtils]: 40: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,238 INFO L273 TraceCheckUtils]: 41: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,238 INFO L273 TraceCheckUtils]: 42: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,238 INFO L273 TraceCheckUtils]: 43: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,238 INFO L273 TraceCheckUtils]: 44: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,238 INFO L273 TraceCheckUtils]: 45: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,238 INFO L273 TraceCheckUtils]: 46: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,238 INFO L273 TraceCheckUtils]: 47: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,238 INFO L273 TraceCheckUtils]: 48: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,239 INFO L273 TraceCheckUtils]: 49: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,239 INFO L273 TraceCheckUtils]: 50: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,239 INFO L273 TraceCheckUtils]: 51: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,239 INFO L273 TraceCheckUtils]: 52: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,239 INFO L273 TraceCheckUtils]: 53: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,239 INFO L273 TraceCheckUtils]: 54: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,239 INFO L273 TraceCheckUtils]: 55: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,239 INFO L273 TraceCheckUtils]: 56: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,239 INFO L273 TraceCheckUtils]: 57: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,239 INFO L273 TraceCheckUtils]: 58: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,240 INFO L273 TraceCheckUtils]: 59: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,240 INFO L273 TraceCheckUtils]: 60: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,240 INFO L273 TraceCheckUtils]: 61: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,240 INFO L273 TraceCheckUtils]: 62: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,240 INFO L273 TraceCheckUtils]: 63: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,240 INFO L273 TraceCheckUtils]: 64: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,240 INFO L273 TraceCheckUtils]: 65: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,240 INFO L273 TraceCheckUtils]: 66: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,240 INFO L273 TraceCheckUtils]: 67: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,241 INFO L273 TraceCheckUtils]: 68: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,241 INFO L273 TraceCheckUtils]: 69: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,241 INFO L273 TraceCheckUtils]: 70: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,241 INFO L273 TraceCheckUtils]: 71: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,241 INFO L273 TraceCheckUtils]: 72: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,241 INFO L273 TraceCheckUtils]: 73: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,241 INFO L273 TraceCheckUtils]: 74: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,241 INFO L273 TraceCheckUtils]: 75: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,241 INFO L273 TraceCheckUtils]: 76: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,241 INFO L273 TraceCheckUtils]: 77: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,242 INFO L273 TraceCheckUtils]: 78: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,242 INFO L273 TraceCheckUtils]: 79: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,242 INFO L273 TraceCheckUtils]: 80: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,242 INFO L273 TraceCheckUtils]: 81: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,242 INFO L273 TraceCheckUtils]: 82: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,242 INFO L273 TraceCheckUtils]: 83: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,242 INFO L273 TraceCheckUtils]: 84: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,242 INFO L273 TraceCheckUtils]: 85: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,242 INFO L273 TraceCheckUtils]: 86: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,242 INFO L273 TraceCheckUtils]: 87: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,243 INFO L273 TraceCheckUtils]: 88: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,243 INFO L273 TraceCheckUtils]: 89: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,243 INFO L273 TraceCheckUtils]: 90: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,243 INFO L273 TraceCheckUtils]: 91: Hoare triple {25092#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {25092#true} is VALID [2018-11-14 18:55:42,243 INFO L273 TraceCheckUtils]: 92: Hoare triple {25092#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {25092#true} is VALID [2018-11-14 18:55:42,243 INFO L273 TraceCheckUtils]: 93: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,243 INFO L273 TraceCheckUtils]: 94: Hoare triple {25092#true} assume !(~i~1 < 10000); {25092#true} is VALID [2018-11-14 18:55:42,243 INFO L256 TraceCheckUtils]: 95: Hoare triple {25092#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {25092#true} is VALID [2018-11-14 18:55:42,243 INFO L273 TraceCheckUtils]: 96: Hoare triple {25092#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {25092#true} is VALID [2018-11-14 18:55:42,243 INFO L273 TraceCheckUtils]: 97: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,244 INFO L273 TraceCheckUtils]: 98: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,244 INFO L273 TraceCheckUtils]: 99: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,244 INFO L273 TraceCheckUtils]: 100: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,244 INFO L273 TraceCheckUtils]: 101: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,244 INFO L273 TraceCheckUtils]: 102: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,244 INFO L273 TraceCheckUtils]: 103: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,244 INFO L273 TraceCheckUtils]: 104: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,244 INFO L273 TraceCheckUtils]: 105: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,244 INFO L273 TraceCheckUtils]: 106: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,244 INFO L273 TraceCheckUtils]: 107: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,245 INFO L273 TraceCheckUtils]: 108: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,245 INFO L273 TraceCheckUtils]: 109: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,245 INFO L273 TraceCheckUtils]: 110: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,245 INFO L273 TraceCheckUtils]: 111: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,245 INFO L273 TraceCheckUtils]: 112: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,245 INFO L273 TraceCheckUtils]: 113: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,245 INFO L273 TraceCheckUtils]: 114: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,245 INFO L273 TraceCheckUtils]: 115: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,245 INFO L273 TraceCheckUtils]: 116: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,245 INFO L273 TraceCheckUtils]: 117: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,246 INFO L273 TraceCheckUtils]: 118: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,246 INFO L273 TraceCheckUtils]: 119: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,246 INFO L273 TraceCheckUtils]: 120: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,246 INFO L273 TraceCheckUtils]: 121: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,246 INFO L273 TraceCheckUtils]: 122: Hoare triple {25092#true} assume !(~i~0 < 10000); {25092#true} is VALID [2018-11-14 18:55:42,246 INFO L273 TraceCheckUtils]: 123: Hoare triple {25092#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {25092#true} is VALID [2018-11-14 18:55:42,246 INFO L273 TraceCheckUtils]: 124: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,246 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {25092#true} {25092#true} #73#return; {25092#true} is VALID [2018-11-14 18:55:42,246 INFO L273 TraceCheckUtils]: 126: Hoare triple {25092#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {25092#true} is VALID [2018-11-14 18:55:42,247 INFO L256 TraceCheckUtils]: 127: Hoare triple {25092#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {25092#true} is VALID [2018-11-14 18:55:42,247 INFO L273 TraceCheckUtils]: 128: Hoare triple {25092#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {25092#true} is VALID [2018-11-14 18:55:42,247 INFO L273 TraceCheckUtils]: 129: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,247 INFO L273 TraceCheckUtils]: 130: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,247 INFO L273 TraceCheckUtils]: 131: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,247 INFO L273 TraceCheckUtils]: 132: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,247 INFO L273 TraceCheckUtils]: 133: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,247 INFO L273 TraceCheckUtils]: 134: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,247 INFO L273 TraceCheckUtils]: 135: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,247 INFO L273 TraceCheckUtils]: 136: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,248 INFO L273 TraceCheckUtils]: 137: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,248 INFO L273 TraceCheckUtils]: 138: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,248 INFO L273 TraceCheckUtils]: 139: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,248 INFO L273 TraceCheckUtils]: 140: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,248 INFO L273 TraceCheckUtils]: 141: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,248 INFO L273 TraceCheckUtils]: 142: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,248 INFO L273 TraceCheckUtils]: 143: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,248 INFO L273 TraceCheckUtils]: 144: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,248 INFO L273 TraceCheckUtils]: 145: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,249 INFO L273 TraceCheckUtils]: 146: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,249 INFO L273 TraceCheckUtils]: 147: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,249 INFO L273 TraceCheckUtils]: 148: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,249 INFO L273 TraceCheckUtils]: 149: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,249 INFO L273 TraceCheckUtils]: 150: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,249 INFO L273 TraceCheckUtils]: 151: Hoare triple {25092#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25092#true} is VALID [2018-11-14 18:55:42,249 INFO L273 TraceCheckUtils]: 152: Hoare triple {25092#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25092#true} is VALID [2018-11-14 18:55:42,249 INFO L273 TraceCheckUtils]: 153: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,249 INFO L273 TraceCheckUtils]: 154: Hoare triple {25092#true} assume !(~i~0 < 10000); {25092#true} is VALID [2018-11-14 18:55:42,249 INFO L273 TraceCheckUtils]: 155: Hoare triple {25092#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {25092#true} is VALID [2018-11-14 18:55:42,250 INFO L273 TraceCheckUtils]: 156: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,250 INFO L268 TraceCheckUtils]: 157: Hoare quadruple {25092#true} {25092#true} #75#return; {25092#true} is VALID [2018-11-14 18:55:42,250 INFO L273 TraceCheckUtils]: 158: Hoare triple {25092#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {25092#true} is VALID [2018-11-14 18:55:42,250 INFO L273 TraceCheckUtils]: 159: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,250 INFO L273 TraceCheckUtils]: 160: Hoare triple {25092#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25092#true} is VALID [2018-11-14 18:55:42,250 INFO L273 TraceCheckUtils]: 161: Hoare triple {25092#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25092#true} is VALID [2018-11-14 18:55:42,250 INFO L273 TraceCheckUtils]: 162: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,250 INFO L273 TraceCheckUtils]: 163: Hoare triple {25092#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25092#true} is VALID [2018-11-14 18:55:42,250 INFO L273 TraceCheckUtils]: 164: Hoare triple {25092#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25092#true} is VALID [2018-11-14 18:55:42,250 INFO L273 TraceCheckUtils]: 165: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,251 INFO L273 TraceCheckUtils]: 166: Hoare triple {25092#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25092#true} is VALID [2018-11-14 18:55:42,251 INFO L273 TraceCheckUtils]: 167: Hoare triple {25092#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25092#true} is VALID [2018-11-14 18:55:42,251 INFO L273 TraceCheckUtils]: 168: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,251 INFO L273 TraceCheckUtils]: 169: Hoare triple {25092#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25092#true} is VALID [2018-11-14 18:55:42,251 INFO L273 TraceCheckUtils]: 170: Hoare triple {25092#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25092#true} is VALID [2018-11-14 18:55:42,251 INFO L273 TraceCheckUtils]: 171: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,251 INFO L273 TraceCheckUtils]: 172: Hoare triple {25092#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25092#true} is VALID [2018-11-14 18:55:42,251 INFO L273 TraceCheckUtils]: 173: Hoare triple {25092#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25092#true} is VALID [2018-11-14 18:55:42,251 INFO L273 TraceCheckUtils]: 174: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,251 INFO L273 TraceCheckUtils]: 175: Hoare triple {25092#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25092#true} is VALID [2018-11-14 18:55:42,252 INFO L273 TraceCheckUtils]: 176: Hoare triple {25092#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25092#true} is VALID [2018-11-14 18:55:42,252 INFO L273 TraceCheckUtils]: 177: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,252 INFO L273 TraceCheckUtils]: 178: Hoare triple {25092#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25092#true} is VALID [2018-11-14 18:55:42,252 INFO L273 TraceCheckUtils]: 179: Hoare triple {25092#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25092#true} is VALID [2018-11-14 18:55:42,252 INFO L273 TraceCheckUtils]: 180: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 18:55:42,252 INFO L273 TraceCheckUtils]: 181: Hoare triple {25092#true} assume !(~i~2 < 9999); {25092#true} is VALID [2018-11-14 18:55:42,252 INFO L273 TraceCheckUtils]: 182: Hoare triple {25092#true} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {25092#true} is VALID [2018-11-14 18:55:42,252 INFO L256 TraceCheckUtils]: 183: Hoare triple {25092#true} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {25092#true} is VALID [2018-11-14 18:55:42,253 INFO L273 TraceCheckUtils]: 184: Hoare triple {25092#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {25679#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:55:42,253 INFO L273 TraceCheckUtils]: 185: Hoare triple {25679#(<= bAnd_~i~0 1)} assume true; {25679#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:55:42,253 INFO L273 TraceCheckUtils]: 186: Hoare triple {25679#(<= bAnd_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25679#(<= bAnd_~i~0 1)} is VALID [2018-11-14 18:55:42,254 INFO L273 TraceCheckUtils]: 187: Hoare triple {25679#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25689#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:55:42,254 INFO L273 TraceCheckUtils]: 188: Hoare triple {25689#(<= bAnd_~i~0 2)} assume true; {25689#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:55:42,255 INFO L273 TraceCheckUtils]: 189: Hoare triple {25689#(<= bAnd_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25689#(<= bAnd_~i~0 2)} is VALID [2018-11-14 18:55:42,255 INFO L273 TraceCheckUtils]: 190: Hoare triple {25689#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25699#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:55:42,255 INFO L273 TraceCheckUtils]: 191: Hoare triple {25699#(<= bAnd_~i~0 3)} assume true; {25699#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:55:42,256 INFO L273 TraceCheckUtils]: 192: Hoare triple {25699#(<= bAnd_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25699#(<= bAnd_~i~0 3)} is VALID [2018-11-14 18:55:42,256 INFO L273 TraceCheckUtils]: 193: Hoare triple {25699#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25709#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:55:42,257 INFO L273 TraceCheckUtils]: 194: Hoare triple {25709#(<= bAnd_~i~0 4)} assume true; {25709#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:55:42,257 INFO L273 TraceCheckUtils]: 195: Hoare triple {25709#(<= bAnd_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25709#(<= bAnd_~i~0 4)} is VALID [2018-11-14 18:55:42,258 INFO L273 TraceCheckUtils]: 196: Hoare triple {25709#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25719#(<= bAnd_~i~0 5)} is VALID [2018-11-14 18:55:42,258 INFO L273 TraceCheckUtils]: 197: Hoare triple {25719#(<= bAnd_~i~0 5)} assume true; {25719#(<= bAnd_~i~0 5)} is VALID [2018-11-14 18:55:42,259 INFO L273 TraceCheckUtils]: 198: Hoare triple {25719#(<= bAnd_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25719#(<= bAnd_~i~0 5)} is VALID [2018-11-14 18:55:42,260 INFO L273 TraceCheckUtils]: 199: Hoare triple {25719#(<= bAnd_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25729#(<= bAnd_~i~0 6)} is VALID [2018-11-14 18:55:42,260 INFO L273 TraceCheckUtils]: 200: Hoare triple {25729#(<= bAnd_~i~0 6)} assume true; {25729#(<= bAnd_~i~0 6)} is VALID [2018-11-14 18:55:42,261 INFO L273 TraceCheckUtils]: 201: Hoare triple {25729#(<= bAnd_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25729#(<= bAnd_~i~0 6)} is VALID [2018-11-14 18:55:42,261 INFO L273 TraceCheckUtils]: 202: Hoare triple {25729#(<= bAnd_~i~0 6)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25739#(<= bAnd_~i~0 7)} is VALID [2018-11-14 18:55:42,262 INFO L273 TraceCheckUtils]: 203: Hoare triple {25739#(<= bAnd_~i~0 7)} assume true; {25739#(<= bAnd_~i~0 7)} is VALID [2018-11-14 18:55:42,262 INFO L273 TraceCheckUtils]: 204: Hoare triple {25739#(<= bAnd_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25739#(<= bAnd_~i~0 7)} is VALID [2018-11-14 18:55:42,263 INFO L273 TraceCheckUtils]: 205: Hoare triple {25739#(<= bAnd_~i~0 7)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25749#(<= bAnd_~i~0 8)} is VALID [2018-11-14 18:55:42,264 INFO L273 TraceCheckUtils]: 206: Hoare triple {25749#(<= bAnd_~i~0 8)} assume true; {25749#(<= bAnd_~i~0 8)} is VALID [2018-11-14 18:55:42,264 INFO L273 TraceCheckUtils]: 207: Hoare triple {25749#(<= bAnd_~i~0 8)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {25749#(<= bAnd_~i~0 8)} is VALID [2018-11-14 18:55:42,265 INFO L273 TraceCheckUtils]: 208: Hoare triple {25749#(<= bAnd_~i~0 8)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {25759#(<= bAnd_~i~0 9)} is VALID [2018-11-14 18:55:42,265 INFO L273 TraceCheckUtils]: 209: Hoare triple {25759#(<= bAnd_~i~0 9)} assume true; {25759#(<= bAnd_~i~0 9)} is VALID [2018-11-14 18:55:42,266 INFO L273 TraceCheckUtils]: 210: Hoare triple {25759#(<= bAnd_~i~0 9)} assume !(~i~0 < 10000); {25093#false} is VALID [2018-11-14 18:55:42,266 INFO L273 TraceCheckUtils]: 211: Hoare triple {25093#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {25093#false} is VALID [2018-11-14 18:55:42,266 INFO L273 TraceCheckUtils]: 212: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 18:55:42,267 INFO L268 TraceCheckUtils]: 213: Hoare quadruple {25093#false} {25092#true} #77#return; {25093#false} is VALID [2018-11-14 18:55:42,267 INFO L273 TraceCheckUtils]: 214: Hoare triple {25093#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {25093#false} is VALID [2018-11-14 18:55:42,267 INFO L273 TraceCheckUtils]: 215: Hoare triple {25093#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {25093#false} is VALID [2018-11-14 18:55:42,267 INFO L273 TraceCheckUtils]: 216: Hoare triple {25093#false} assume !false; {25093#false} is VALID [2018-11-14 18:55:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2343 backedges. 458 proven. 100 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2018-11-14 18:55:42,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:55:42,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 11] total 41 [2018-11-14 18:55:42,308 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 217 [2018-11-14 18:55:42,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:55:42,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-14 18:55:42,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:42,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-14 18:55:42,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-14 18:55:42,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2018-11-14 18:55:42,459 INFO L87 Difference]: Start difference. First operand 158 states and 162 transitions. Second operand 41 states. [2018-11-14 18:55:43,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:43,597 INFO L93 Difference]: Finished difference Result 229 states and 241 transitions. [2018-11-14 18:55:43,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-14 18:55:43,597 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 217 [2018-11-14 18:55:43,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:55:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 18:55:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 178 transitions. [2018-11-14 18:55:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 18:55:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 178 transitions. [2018-11-14 18:55:43,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 178 transitions. [2018-11-14 18:55:43,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:43,806 INFO L225 Difference]: With dead ends: 229 [2018-11-14 18:55:43,806 INFO L226 Difference]: Without dead ends: 166 [2018-11-14 18:55:43,807 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2018-11-14 18:55:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-14 18:55:44,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-11-14 18:55:44,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:55:44,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 164 states. [2018-11-14 18:55:44,196 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 164 states. [2018-11-14 18:55:44,196 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 164 states. [2018-11-14 18:55:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:44,199 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2018-11-14 18:55:44,199 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2018-11-14 18:55:44,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:44,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:44,199 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 166 states. [2018-11-14 18:55:44,199 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 166 states. [2018-11-14 18:55:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:44,202 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2018-11-14 18:55:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2018-11-14 18:55:44,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:44,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:44,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:55:44,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:55:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-14 18:55:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2018-11-14 18:55:44,206 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 217 [2018-11-14 18:55:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:55:44,207 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2018-11-14 18:55:44,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-14 18:55:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2018-11-14 18:55:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-14 18:55:44,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:55:44,208 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 27, 27, 8, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:55:44,209 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:55:44,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:55:44,209 INFO L82 PathProgramCache]: Analyzing trace with hash -569773369, now seen corresponding path program 28 times [2018-11-14 18:55:44,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:55:44,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:55:44,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:44,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:55:44,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:45,045 INFO L256 TraceCheckUtils]: 0: Hoare triple {26643#true} call ULTIMATE.init(); {26643#true} is VALID [2018-11-14 18:55:45,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {26643#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26643#true} is VALID [2018-11-14 18:55:45,045 INFO L273 TraceCheckUtils]: 2: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,045 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26643#true} {26643#true} #69#return; {26643#true} is VALID [2018-11-14 18:55:45,046 INFO L256 TraceCheckUtils]: 4: Hoare triple {26643#true} call #t~ret13 := main(); {26643#true} is VALID [2018-11-14 18:55:45,046 INFO L273 TraceCheckUtils]: 5: Hoare triple {26643#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26645#(= main_~i~1 0)} is VALID [2018-11-14 18:55:45,047 INFO L273 TraceCheckUtils]: 6: Hoare triple {26645#(= main_~i~1 0)} assume true; {26645#(= main_~i~1 0)} is VALID [2018-11-14 18:55:45,047 INFO L273 TraceCheckUtils]: 7: Hoare triple {26645#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26645#(= main_~i~1 0)} is VALID [2018-11-14 18:55:45,048 INFO L273 TraceCheckUtils]: 8: Hoare triple {26645#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26646#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:45,048 INFO L273 TraceCheckUtils]: 9: Hoare triple {26646#(<= main_~i~1 1)} assume true; {26646#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:45,048 INFO L273 TraceCheckUtils]: 10: Hoare triple {26646#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26646#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:45,049 INFO L273 TraceCheckUtils]: 11: Hoare triple {26646#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26647#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:45,049 INFO L273 TraceCheckUtils]: 12: Hoare triple {26647#(<= main_~i~1 2)} assume true; {26647#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:45,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {26647#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26647#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:45,050 INFO L273 TraceCheckUtils]: 14: Hoare triple {26647#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26648#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:45,051 INFO L273 TraceCheckUtils]: 15: Hoare triple {26648#(<= main_~i~1 3)} assume true; {26648#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:45,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {26648#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26648#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:45,052 INFO L273 TraceCheckUtils]: 17: Hoare triple {26648#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26649#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:45,052 INFO L273 TraceCheckUtils]: 18: Hoare triple {26649#(<= main_~i~1 4)} assume true; {26649#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:45,053 INFO L273 TraceCheckUtils]: 19: Hoare triple {26649#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26649#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:45,054 INFO L273 TraceCheckUtils]: 20: Hoare triple {26649#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26650#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:45,054 INFO L273 TraceCheckUtils]: 21: Hoare triple {26650#(<= main_~i~1 5)} assume true; {26650#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:45,055 INFO L273 TraceCheckUtils]: 22: Hoare triple {26650#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26650#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:45,055 INFO L273 TraceCheckUtils]: 23: Hoare triple {26650#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26651#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:45,056 INFO L273 TraceCheckUtils]: 24: Hoare triple {26651#(<= main_~i~1 6)} assume true; {26651#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:45,056 INFO L273 TraceCheckUtils]: 25: Hoare triple {26651#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26651#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:45,057 INFO L273 TraceCheckUtils]: 26: Hoare triple {26651#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26652#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:45,057 INFO L273 TraceCheckUtils]: 27: Hoare triple {26652#(<= main_~i~1 7)} assume true; {26652#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:45,058 INFO L273 TraceCheckUtils]: 28: Hoare triple {26652#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26652#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:45,059 INFO L273 TraceCheckUtils]: 29: Hoare triple {26652#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26653#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:45,059 INFO L273 TraceCheckUtils]: 30: Hoare triple {26653#(<= main_~i~1 8)} assume true; {26653#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:45,060 INFO L273 TraceCheckUtils]: 31: Hoare triple {26653#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26653#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:45,060 INFO L273 TraceCheckUtils]: 32: Hoare triple {26653#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26654#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:45,061 INFO L273 TraceCheckUtils]: 33: Hoare triple {26654#(<= main_~i~1 9)} assume true; {26654#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:45,061 INFO L273 TraceCheckUtils]: 34: Hoare triple {26654#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26654#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:45,062 INFO L273 TraceCheckUtils]: 35: Hoare triple {26654#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26655#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:45,063 INFO L273 TraceCheckUtils]: 36: Hoare triple {26655#(<= main_~i~1 10)} assume true; {26655#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:45,063 INFO L273 TraceCheckUtils]: 37: Hoare triple {26655#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26655#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:45,064 INFO L273 TraceCheckUtils]: 38: Hoare triple {26655#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26656#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:45,064 INFO L273 TraceCheckUtils]: 39: Hoare triple {26656#(<= main_~i~1 11)} assume true; {26656#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:45,065 INFO L273 TraceCheckUtils]: 40: Hoare triple {26656#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26656#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:45,066 INFO L273 TraceCheckUtils]: 41: Hoare triple {26656#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26657#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:45,066 INFO L273 TraceCheckUtils]: 42: Hoare triple {26657#(<= main_~i~1 12)} assume true; {26657#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:45,067 INFO L273 TraceCheckUtils]: 43: Hoare triple {26657#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26657#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:45,067 INFO L273 TraceCheckUtils]: 44: Hoare triple {26657#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26658#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:45,068 INFO L273 TraceCheckUtils]: 45: Hoare triple {26658#(<= main_~i~1 13)} assume true; {26658#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:45,068 INFO L273 TraceCheckUtils]: 46: Hoare triple {26658#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26658#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:45,069 INFO L273 TraceCheckUtils]: 47: Hoare triple {26658#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26659#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:45,069 INFO L273 TraceCheckUtils]: 48: Hoare triple {26659#(<= main_~i~1 14)} assume true; {26659#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:45,070 INFO L273 TraceCheckUtils]: 49: Hoare triple {26659#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26659#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:45,071 INFO L273 TraceCheckUtils]: 50: Hoare triple {26659#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26660#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:45,071 INFO L273 TraceCheckUtils]: 51: Hoare triple {26660#(<= main_~i~1 15)} assume true; {26660#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:45,072 INFO L273 TraceCheckUtils]: 52: Hoare triple {26660#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26660#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:45,072 INFO L273 TraceCheckUtils]: 53: Hoare triple {26660#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26661#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:45,073 INFO L273 TraceCheckUtils]: 54: Hoare triple {26661#(<= main_~i~1 16)} assume true; {26661#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:45,073 INFO L273 TraceCheckUtils]: 55: Hoare triple {26661#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26661#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:45,074 INFO L273 TraceCheckUtils]: 56: Hoare triple {26661#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26662#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:45,075 INFO L273 TraceCheckUtils]: 57: Hoare triple {26662#(<= main_~i~1 17)} assume true; {26662#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:45,075 INFO L273 TraceCheckUtils]: 58: Hoare triple {26662#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26662#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:45,076 INFO L273 TraceCheckUtils]: 59: Hoare triple {26662#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26663#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:45,076 INFO L273 TraceCheckUtils]: 60: Hoare triple {26663#(<= main_~i~1 18)} assume true; {26663#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:45,077 INFO L273 TraceCheckUtils]: 61: Hoare triple {26663#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26663#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:45,078 INFO L273 TraceCheckUtils]: 62: Hoare triple {26663#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26664#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:45,078 INFO L273 TraceCheckUtils]: 63: Hoare triple {26664#(<= main_~i~1 19)} assume true; {26664#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:45,079 INFO L273 TraceCheckUtils]: 64: Hoare triple {26664#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26664#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:45,079 INFO L273 TraceCheckUtils]: 65: Hoare triple {26664#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26665#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:45,080 INFO L273 TraceCheckUtils]: 66: Hoare triple {26665#(<= main_~i~1 20)} assume true; {26665#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:45,080 INFO L273 TraceCheckUtils]: 67: Hoare triple {26665#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26665#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:45,081 INFO L273 TraceCheckUtils]: 68: Hoare triple {26665#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26666#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:45,082 INFO L273 TraceCheckUtils]: 69: Hoare triple {26666#(<= main_~i~1 21)} assume true; {26666#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:45,082 INFO L273 TraceCheckUtils]: 70: Hoare triple {26666#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26666#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:45,083 INFO L273 TraceCheckUtils]: 71: Hoare triple {26666#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26667#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:45,083 INFO L273 TraceCheckUtils]: 72: Hoare triple {26667#(<= main_~i~1 22)} assume true; {26667#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:45,084 INFO L273 TraceCheckUtils]: 73: Hoare triple {26667#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26667#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:45,084 INFO L273 TraceCheckUtils]: 74: Hoare triple {26667#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26668#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:45,085 INFO L273 TraceCheckUtils]: 75: Hoare triple {26668#(<= main_~i~1 23)} assume true; {26668#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:45,085 INFO L273 TraceCheckUtils]: 76: Hoare triple {26668#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26668#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:45,086 INFO L273 TraceCheckUtils]: 77: Hoare triple {26668#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26669#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:45,087 INFO L273 TraceCheckUtils]: 78: Hoare triple {26669#(<= main_~i~1 24)} assume true; {26669#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:45,087 INFO L273 TraceCheckUtils]: 79: Hoare triple {26669#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26669#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:45,088 INFO L273 TraceCheckUtils]: 80: Hoare triple {26669#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26670#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:45,088 INFO L273 TraceCheckUtils]: 81: Hoare triple {26670#(<= main_~i~1 25)} assume true; {26670#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:45,089 INFO L273 TraceCheckUtils]: 82: Hoare triple {26670#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26670#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:45,090 INFO L273 TraceCheckUtils]: 83: Hoare triple {26670#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26671#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:45,090 INFO L273 TraceCheckUtils]: 84: Hoare triple {26671#(<= main_~i~1 26)} assume true; {26671#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:45,091 INFO L273 TraceCheckUtils]: 85: Hoare triple {26671#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26671#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:45,091 INFO L273 TraceCheckUtils]: 86: Hoare triple {26671#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26672#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:45,092 INFO L273 TraceCheckUtils]: 87: Hoare triple {26672#(<= main_~i~1 27)} assume true; {26672#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:45,092 INFO L273 TraceCheckUtils]: 88: Hoare triple {26672#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26672#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:45,093 INFO L273 TraceCheckUtils]: 89: Hoare triple {26672#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26673#(<= main_~i~1 28)} is VALID [2018-11-14 18:55:45,094 INFO L273 TraceCheckUtils]: 90: Hoare triple {26673#(<= main_~i~1 28)} assume true; {26673#(<= main_~i~1 28)} is VALID [2018-11-14 18:55:45,094 INFO L273 TraceCheckUtils]: 91: Hoare triple {26673#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26673#(<= main_~i~1 28)} is VALID [2018-11-14 18:55:45,095 INFO L273 TraceCheckUtils]: 92: Hoare triple {26673#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26674#(<= main_~i~1 29)} is VALID [2018-11-14 18:55:45,095 INFO L273 TraceCheckUtils]: 93: Hoare triple {26674#(<= main_~i~1 29)} assume true; {26674#(<= main_~i~1 29)} is VALID [2018-11-14 18:55:45,096 INFO L273 TraceCheckUtils]: 94: Hoare triple {26674#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26674#(<= main_~i~1 29)} is VALID [2018-11-14 18:55:45,097 INFO L273 TraceCheckUtils]: 95: Hoare triple {26674#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26675#(<= main_~i~1 30)} is VALID [2018-11-14 18:55:45,097 INFO L273 TraceCheckUtils]: 96: Hoare triple {26675#(<= main_~i~1 30)} assume true; {26675#(<= main_~i~1 30)} is VALID [2018-11-14 18:55:45,098 INFO L273 TraceCheckUtils]: 97: Hoare triple {26675#(<= main_~i~1 30)} assume !(~i~1 < 10000); {26644#false} is VALID [2018-11-14 18:55:45,098 INFO L256 TraceCheckUtils]: 98: Hoare triple {26644#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {26643#true} is VALID [2018-11-14 18:55:45,098 INFO L273 TraceCheckUtils]: 99: Hoare triple {26643#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26643#true} is VALID [2018-11-14 18:55:45,098 INFO L273 TraceCheckUtils]: 100: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,098 INFO L273 TraceCheckUtils]: 101: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,099 INFO L273 TraceCheckUtils]: 102: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,099 INFO L273 TraceCheckUtils]: 103: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,099 INFO L273 TraceCheckUtils]: 104: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,099 INFO L273 TraceCheckUtils]: 105: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,099 INFO L273 TraceCheckUtils]: 106: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,099 INFO L273 TraceCheckUtils]: 107: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,099 INFO L273 TraceCheckUtils]: 108: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,100 INFO L273 TraceCheckUtils]: 109: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,100 INFO L273 TraceCheckUtils]: 110: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,100 INFO L273 TraceCheckUtils]: 111: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,100 INFO L273 TraceCheckUtils]: 112: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,100 INFO L273 TraceCheckUtils]: 113: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,100 INFO L273 TraceCheckUtils]: 114: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,100 INFO L273 TraceCheckUtils]: 115: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,100 INFO L273 TraceCheckUtils]: 116: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,100 INFO L273 TraceCheckUtils]: 117: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,100 INFO L273 TraceCheckUtils]: 118: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,101 INFO L273 TraceCheckUtils]: 119: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,101 INFO L273 TraceCheckUtils]: 120: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,101 INFO L273 TraceCheckUtils]: 121: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,101 INFO L273 TraceCheckUtils]: 122: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,101 INFO L273 TraceCheckUtils]: 123: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,101 INFO L273 TraceCheckUtils]: 124: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,101 INFO L273 TraceCheckUtils]: 125: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,101 INFO L273 TraceCheckUtils]: 126: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,101 INFO L273 TraceCheckUtils]: 127: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,101 INFO L273 TraceCheckUtils]: 128: Hoare triple {26643#true} assume !(~i~0 < 10000); {26643#true} is VALID [2018-11-14 18:55:45,102 INFO L273 TraceCheckUtils]: 129: Hoare triple {26643#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26643#true} is VALID [2018-11-14 18:55:45,102 INFO L273 TraceCheckUtils]: 130: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,102 INFO L268 TraceCheckUtils]: 131: Hoare quadruple {26643#true} {26644#false} #73#return; {26644#false} is VALID [2018-11-14 18:55:45,102 INFO L273 TraceCheckUtils]: 132: Hoare triple {26644#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {26644#false} is VALID [2018-11-14 18:55:45,102 INFO L256 TraceCheckUtils]: 133: Hoare triple {26644#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {26643#true} is VALID [2018-11-14 18:55:45,102 INFO L273 TraceCheckUtils]: 134: Hoare triple {26643#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26643#true} is VALID [2018-11-14 18:55:45,102 INFO L273 TraceCheckUtils]: 135: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,102 INFO L273 TraceCheckUtils]: 136: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,102 INFO L273 TraceCheckUtils]: 137: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,102 INFO L273 TraceCheckUtils]: 138: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,103 INFO L273 TraceCheckUtils]: 139: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,103 INFO L273 TraceCheckUtils]: 140: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,103 INFO L273 TraceCheckUtils]: 141: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,103 INFO L273 TraceCheckUtils]: 142: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,103 INFO L273 TraceCheckUtils]: 143: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,103 INFO L273 TraceCheckUtils]: 144: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,103 INFO L273 TraceCheckUtils]: 145: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,103 INFO L273 TraceCheckUtils]: 146: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,103 INFO L273 TraceCheckUtils]: 147: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,103 INFO L273 TraceCheckUtils]: 148: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,104 INFO L273 TraceCheckUtils]: 149: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,104 INFO L273 TraceCheckUtils]: 150: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,104 INFO L273 TraceCheckUtils]: 151: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,104 INFO L273 TraceCheckUtils]: 152: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,104 INFO L273 TraceCheckUtils]: 153: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,104 INFO L273 TraceCheckUtils]: 154: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,104 INFO L273 TraceCheckUtils]: 155: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,104 INFO L273 TraceCheckUtils]: 156: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,104 INFO L273 TraceCheckUtils]: 157: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,104 INFO L273 TraceCheckUtils]: 158: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,105 INFO L273 TraceCheckUtils]: 159: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,105 INFO L273 TraceCheckUtils]: 160: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,105 INFO L273 TraceCheckUtils]: 161: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,105 INFO L273 TraceCheckUtils]: 162: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,105 INFO L273 TraceCheckUtils]: 163: Hoare triple {26643#true} assume !(~i~0 < 10000); {26643#true} is VALID [2018-11-14 18:55:45,105 INFO L273 TraceCheckUtils]: 164: Hoare triple {26643#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26643#true} is VALID [2018-11-14 18:55:45,105 INFO L273 TraceCheckUtils]: 165: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,105 INFO L268 TraceCheckUtils]: 166: Hoare quadruple {26643#true} {26644#false} #75#return; {26644#false} is VALID [2018-11-14 18:55:45,105 INFO L273 TraceCheckUtils]: 167: Hoare triple {26644#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26644#false} is VALID [2018-11-14 18:55:45,105 INFO L273 TraceCheckUtils]: 168: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,106 INFO L273 TraceCheckUtils]: 169: Hoare triple {26644#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26644#false} is VALID [2018-11-14 18:55:45,106 INFO L273 TraceCheckUtils]: 170: Hoare triple {26644#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26644#false} is VALID [2018-11-14 18:55:45,106 INFO L273 TraceCheckUtils]: 171: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,106 INFO L273 TraceCheckUtils]: 172: Hoare triple {26644#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26644#false} is VALID [2018-11-14 18:55:45,106 INFO L273 TraceCheckUtils]: 173: Hoare triple {26644#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26644#false} is VALID [2018-11-14 18:55:45,106 INFO L273 TraceCheckUtils]: 174: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,106 INFO L273 TraceCheckUtils]: 175: Hoare triple {26644#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26644#false} is VALID [2018-11-14 18:55:45,106 INFO L273 TraceCheckUtils]: 176: Hoare triple {26644#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26644#false} is VALID [2018-11-14 18:55:45,106 INFO L273 TraceCheckUtils]: 177: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,106 INFO L273 TraceCheckUtils]: 178: Hoare triple {26644#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26644#false} is VALID [2018-11-14 18:55:45,107 INFO L273 TraceCheckUtils]: 179: Hoare triple {26644#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26644#false} is VALID [2018-11-14 18:55:45,107 INFO L273 TraceCheckUtils]: 180: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,107 INFO L273 TraceCheckUtils]: 181: Hoare triple {26644#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26644#false} is VALID [2018-11-14 18:55:45,107 INFO L273 TraceCheckUtils]: 182: Hoare triple {26644#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26644#false} is VALID [2018-11-14 18:55:45,107 INFO L273 TraceCheckUtils]: 183: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,107 INFO L273 TraceCheckUtils]: 184: Hoare triple {26644#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26644#false} is VALID [2018-11-14 18:55:45,107 INFO L273 TraceCheckUtils]: 185: Hoare triple {26644#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26644#false} is VALID [2018-11-14 18:55:45,107 INFO L273 TraceCheckUtils]: 186: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,107 INFO L273 TraceCheckUtils]: 187: Hoare triple {26644#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26644#false} is VALID [2018-11-14 18:55:45,107 INFO L273 TraceCheckUtils]: 188: Hoare triple {26644#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26644#false} is VALID [2018-11-14 18:55:45,108 INFO L273 TraceCheckUtils]: 189: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,108 INFO L273 TraceCheckUtils]: 190: Hoare triple {26644#false} assume !(~i~2 < 9999); {26644#false} is VALID [2018-11-14 18:55:45,108 INFO L273 TraceCheckUtils]: 191: Hoare triple {26644#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {26644#false} is VALID [2018-11-14 18:55:45,108 INFO L256 TraceCheckUtils]: 192: Hoare triple {26644#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {26643#true} is VALID [2018-11-14 18:55:45,108 INFO L273 TraceCheckUtils]: 193: Hoare triple {26643#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26643#true} is VALID [2018-11-14 18:55:45,108 INFO L273 TraceCheckUtils]: 194: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,108 INFO L273 TraceCheckUtils]: 195: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,108 INFO L273 TraceCheckUtils]: 196: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,108 INFO L273 TraceCheckUtils]: 197: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,108 INFO L273 TraceCheckUtils]: 198: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,109 INFO L273 TraceCheckUtils]: 199: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,109 INFO L273 TraceCheckUtils]: 200: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,109 INFO L273 TraceCheckUtils]: 201: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,109 INFO L273 TraceCheckUtils]: 202: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,109 INFO L273 TraceCheckUtils]: 203: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,109 INFO L273 TraceCheckUtils]: 204: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,109 INFO L273 TraceCheckUtils]: 205: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,109 INFO L273 TraceCheckUtils]: 206: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,109 INFO L273 TraceCheckUtils]: 207: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,109 INFO L273 TraceCheckUtils]: 208: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,110 INFO L273 TraceCheckUtils]: 209: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,110 INFO L273 TraceCheckUtils]: 210: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,110 INFO L273 TraceCheckUtils]: 211: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,110 INFO L273 TraceCheckUtils]: 212: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,110 INFO L273 TraceCheckUtils]: 213: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,110 INFO L273 TraceCheckUtils]: 214: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,110 INFO L273 TraceCheckUtils]: 215: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,110 INFO L273 TraceCheckUtils]: 216: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,110 INFO L273 TraceCheckUtils]: 217: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,110 INFO L273 TraceCheckUtils]: 218: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,111 INFO L273 TraceCheckUtils]: 219: Hoare triple {26643#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26643#true} is VALID [2018-11-14 18:55:45,111 INFO L273 TraceCheckUtils]: 220: Hoare triple {26643#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26643#true} is VALID [2018-11-14 18:55:45,111 INFO L273 TraceCheckUtils]: 221: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,111 INFO L273 TraceCheckUtils]: 222: Hoare triple {26643#true} assume !(~i~0 < 10000); {26643#true} is VALID [2018-11-14 18:55:45,111 INFO L273 TraceCheckUtils]: 223: Hoare triple {26643#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26643#true} is VALID [2018-11-14 18:55:45,111 INFO L273 TraceCheckUtils]: 224: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,111 INFO L268 TraceCheckUtils]: 225: Hoare quadruple {26643#true} {26644#false} #77#return; {26644#false} is VALID [2018-11-14 18:55:45,111 INFO L273 TraceCheckUtils]: 226: Hoare triple {26644#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26644#false} is VALID [2018-11-14 18:55:45,111 INFO L273 TraceCheckUtils]: 227: Hoare triple {26644#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26644#false} is VALID [2018-11-14 18:55:45,111 INFO L273 TraceCheckUtils]: 228: Hoare triple {26644#false} assume !false; {26644#false} is VALID [2018-11-14 18:55:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2675 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 1310 trivial. 0 not checked. [2018-11-14 18:55:45,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:55:45,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 18:55:45,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:55:45,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:55:45,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:55:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:45,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:55:45,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {26643#true} call ULTIMATE.init(); {26643#true} is VALID [2018-11-14 18:55:45,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {26643#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26643#true} is VALID [2018-11-14 18:55:45,580 INFO L273 TraceCheckUtils]: 2: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 18:55:45,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26643#true} {26643#true} #69#return; {26643#true} is VALID [2018-11-14 18:55:45,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {26643#true} call #t~ret13 := main(); {26643#true} is VALID [2018-11-14 18:55:45,581 INFO L273 TraceCheckUtils]: 5: Hoare triple {26643#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26694#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:45,582 INFO L273 TraceCheckUtils]: 6: Hoare triple {26694#(<= main_~i~1 0)} assume true; {26694#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:45,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {26694#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26694#(<= main_~i~1 0)} is VALID [2018-11-14 18:55:45,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {26694#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26646#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:45,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {26646#(<= main_~i~1 1)} assume true; {26646#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:45,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {26646#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26646#(<= main_~i~1 1)} is VALID [2018-11-14 18:55:45,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {26646#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26647#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:45,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {26647#(<= main_~i~1 2)} assume true; {26647#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:45,585 INFO L273 TraceCheckUtils]: 13: Hoare triple {26647#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26647#(<= main_~i~1 2)} is VALID [2018-11-14 18:55:45,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {26647#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26648#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:45,586 INFO L273 TraceCheckUtils]: 15: Hoare triple {26648#(<= main_~i~1 3)} assume true; {26648#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:45,586 INFO L273 TraceCheckUtils]: 16: Hoare triple {26648#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26648#(<= main_~i~1 3)} is VALID [2018-11-14 18:55:45,587 INFO L273 TraceCheckUtils]: 17: Hoare triple {26648#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26649#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:45,588 INFO L273 TraceCheckUtils]: 18: Hoare triple {26649#(<= main_~i~1 4)} assume true; {26649#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:45,588 INFO L273 TraceCheckUtils]: 19: Hoare triple {26649#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26649#(<= main_~i~1 4)} is VALID [2018-11-14 18:55:45,589 INFO L273 TraceCheckUtils]: 20: Hoare triple {26649#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26650#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:45,589 INFO L273 TraceCheckUtils]: 21: Hoare triple {26650#(<= main_~i~1 5)} assume true; {26650#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:45,590 INFO L273 TraceCheckUtils]: 22: Hoare triple {26650#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26650#(<= main_~i~1 5)} is VALID [2018-11-14 18:55:45,591 INFO L273 TraceCheckUtils]: 23: Hoare triple {26650#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26651#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:45,591 INFO L273 TraceCheckUtils]: 24: Hoare triple {26651#(<= main_~i~1 6)} assume true; {26651#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:45,592 INFO L273 TraceCheckUtils]: 25: Hoare triple {26651#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26651#(<= main_~i~1 6)} is VALID [2018-11-14 18:55:45,592 INFO L273 TraceCheckUtils]: 26: Hoare triple {26651#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26652#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:45,593 INFO L273 TraceCheckUtils]: 27: Hoare triple {26652#(<= main_~i~1 7)} assume true; {26652#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:45,593 INFO L273 TraceCheckUtils]: 28: Hoare triple {26652#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26652#(<= main_~i~1 7)} is VALID [2018-11-14 18:55:45,594 INFO L273 TraceCheckUtils]: 29: Hoare triple {26652#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26653#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:45,595 INFO L273 TraceCheckUtils]: 30: Hoare triple {26653#(<= main_~i~1 8)} assume true; {26653#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:45,595 INFO L273 TraceCheckUtils]: 31: Hoare triple {26653#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26653#(<= main_~i~1 8)} is VALID [2018-11-14 18:55:45,596 INFO L273 TraceCheckUtils]: 32: Hoare triple {26653#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26654#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:45,596 INFO L273 TraceCheckUtils]: 33: Hoare triple {26654#(<= main_~i~1 9)} assume true; {26654#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:45,597 INFO L273 TraceCheckUtils]: 34: Hoare triple {26654#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26654#(<= main_~i~1 9)} is VALID [2018-11-14 18:55:45,597 INFO L273 TraceCheckUtils]: 35: Hoare triple {26654#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26655#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:45,598 INFO L273 TraceCheckUtils]: 36: Hoare triple {26655#(<= main_~i~1 10)} assume true; {26655#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:45,598 INFO L273 TraceCheckUtils]: 37: Hoare triple {26655#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26655#(<= main_~i~1 10)} is VALID [2018-11-14 18:55:45,599 INFO L273 TraceCheckUtils]: 38: Hoare triple {26655#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26656#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:45,600 INFO L273 TraceCheckUtils]: 39: Hoare triple {26656#(<= main_~i~1 11)} assume true; {26656#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:45,600 INFO L273 TraceCheckUtils]: 40: Hoare triple {26656#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26656#(<= main_~i~1 11)} is VALID [2018-11-14 18:55:45,601 INFO L273 TraceCheckUtils]: 41: Hoare triple {26656#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26657#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:45,602 INFO L273 TraceCheckUtils]: 42: Hoare triple {26657#(<= main_~i~1 12)} assume true; {26657#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:45,602 INFO L273 TraceCheckUtils]: 43: Hoare triple {26657#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26657#(<= main_~i~1 12)} is VALID [2018-11-14 18:55:45,603 INFO L273 TraceCheckUtils]: 44: Hoare triple {26657#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26658#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:45,603 INFO L273 TraceCheckUtils]: 45: Hoare triple {26658#(<= main_~i~1 13)} assume true; {26658#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:45,604 INFO L273 TraceCheckUtils]: 46: Hoare triple {26658#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26658#(<= main_~i~1 13)} is VALID [2018-11-14 18:55:45,604 INFO L273 TraceCheckUtils]: 47: Hoare triple {26658#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26659#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:45,605 INFO L273 TraceCheckUtils]: 48: Hoare triple {26659#(<= main_~i~1 14)} assume true; {26659#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:45,605 INFO L273 TraceCheckUtils]: 49: Hoare triple {26659#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26659#(<= main_~i~1 14)} is VALID [2018-11-14 18:55:45,606 INFO L273 TraceCheckUtils]: 50: Hoare triple {26659#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26660#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:45,607 INFO L273 TraceCheckUtils]: 51: Hoare triple {26660#(<= main_~i~1 15)} assume true; {26660#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:45,607 INFO L273 TraceCheckUtils]: 52: Hoare triple {26660#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26660#(<= main_~i~1 15)} is VALID [2018-11-14 18:55:45,608 INFO L273 TraceCheckUtils]: 53: Hoare triple {26660#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26661#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:45,608 INFO L273 TraceCheckUtils]: 54: Hoare triple {26661#(<= main_~i~1 16)} assume true; {26661#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:45,609 INFO L273 TraceCheckUtils]: 55: Hoare triple {26661#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26661#(<= main_~i~1 16)} is VALID [2018-11-14 18:55:45,610 INFO L273 TraceCheckUtils]: 56: Hoare triple {26661#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26662#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:45,610 INFO L273 TraceCheckUtils]: 57: Hoare triple {26662#(<= main_~i~1 17)} assume true; {26662#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:45,611 INFO L273 TraceCheckUtils]: 58: Hoare triple {26662#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26662#(<= main_~i~1 17)} is VALID [2018-11-14 18:55:45,611 INFO L273 TraceCheckUtils]: 59: Hoare triple {26662#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26663#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:45,612 INFO L273 TraceCheckUtils]: 60: Hoare triple {26663#(<= main_~i~1 18)} assume true; {26663#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:45,612 INFO L273 TraceCheckUtils]: 61: Hoare triple {26663#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26663#(<= main_~i~1 18)} is VALID [2018-11-14 18:55:45,613 INFO L273 TraceCheckUtils]: 62: Hoare triple {26663#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26664#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:45,614 INFO L273 TraceCheckUtils]: 63: Hoare triple {26664#(<= main_~i~1 19)} assume true; {26664#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:45,614 INFO L273 TraceCheckUtils]: 64: Hoare triple {26664#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26664#(<= main_~i~1 19)} is VALID [2018-11-14 18:55:45,615 INFO L273 TraceCheckUtils]: 65: Hoare triple {26664#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26665#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:45,615 INFO L273 TraceCheckUtils]: 66: Hoare triple {26665#(<= main_~i~1 20)} assume true; {26665#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:45,616 INFO L273 TraceCheckUtils]: 67: Hoare triple {26665#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26665#(<= main_~i~1 20)} is VALID [2018-11-14 18:55:45,617 INFO L273 TraceCheckUtils]: 68: Hoare triple {26665#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26666#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:45,617 INFO L273 TraceCheckUtils]: 69: Hoare triple {26666#(<= main_~i~1 21)} assume true; {26666#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:45,618 INFO L273 TraceCheckUtils]: 70: Hoare triple {26666#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26666#(<= main_~i~1 21)} is VALID [2018-11-14 18:55:45,618 INFO L273 TraceCheckUtils]: 71: Hoare triple {26666#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26667#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:45,619 INFO L273 TraceCheckUtils]: 72: Hoare triple {26667#(<= main_~i~1 22)} assume true; {26667#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:45,619 INFO L273 TraceCheckUtils]: 73: Hoare triple {26667#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26667#(<= main_~i~1 22)} is VALID [2018-11-14 18:55:45,620 INFO L273 TraceCheckUtils]: 74: Hoare triple {26667#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26668#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:45,621 INFO L273 TraceCheckUtils]: 75: Hoare triple {26668#(<= main_~i~1 23)} assume true; {26668#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:45,621 INFO L273 TraceCheckUtils]: 76: Hoare triple {26668#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26668#(<= main_~i~1 23)} is VALID [2018-11-14 18:55:45,622 INFO L273 TraceCheckUtils]: 77: Hoare triple {26668#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26669#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:45,622 INFO L273 TraceCheckUtils]: 78: Hoare triple {26669#(<= main_~i~1 24)} assume true; {26669#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:45,623 INFO L273 TraceCheckUtils]: 79: Hoare triple {26669#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26669#(<= main_~i~1 24)} is VALID [2018-11-14 18:55:45,624 INFO L273 TraceCheckUtils]: 80: Hoare triple {26669#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26670#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:45,624 INFO L273 TraceCheckUtils]: 81: Hoare triple {26670#(<= main_~i~1 25)} assume true; {26670#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:45,625 INFO L273 TraceCheckUtils]: 82: Hoare triple {26670#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26670#(<= main_~i~1 25)} is VALID [2018-11-14 18:55:45,625 INFO L273 TraceCheckUtils]: 83: Hoare triple {26670#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26671#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:45,626 INFO L273 TraceCheckUtils]: 84: Hoare triple {26671#(<= main_~i~1 26)} assume true; {26671#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:45,626 INFO L273 TraceCheckUtils]: 85: Hoare triple {26671#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26671#(<= main_~i~1 26)} is VALID [2018-11-14 18:55:45,627 INFO L273 TraceCheckUtils]: 86: Hoare triple {26671#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26672#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:45,628 INFO L273 TraceCheckUtils]: 87: Hoare triple {26672#(<= main_~i~1 27)} assume true; {26672#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:45,628 INFO L273 TraceCheckUtils]: 88: Hoare triple {26672#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26672#(<= main_~i~1 27)} is VALID [2018-11-14 18:55:45,629 INFO L273 TraceCheckUtils]: 89: Hoare triple {26672#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26673#(<= main_~i~1 28)} is VALID [2018-11-14 18:55:45,629 INFO L273 TraceCheckUtils]: 90: Hoare triple {26673#(<= main_~i~1 28)} assume true; {26673#(<= main_~i~1 28)} is VALID [2018-11-14 18:55:45,630 INFO L273 TraceCheckUtils]: 91: Hoare triple {26673#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26673#(<= main_~i~1 28)} is VALID [2018-11-14 18:55:45,630 INFO L273 TraceCheckUtils]: 92: Hoare triple {26673#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26674#(<= main_~i~1 29)} is VALID [2018-11-14 18:55:45,631 INFO L273 TraceCheckUtils]: 93: Hoare triple {26674#(<= main_~i~1 29)} assume true; {26674#(<= main_~i~1 29)} is VALID [2018-11-14 18:55:45,631 INFO L273 TraceCheckUtils]: 94: Hoare triple {26674#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26674#(<= main_~i~1 29)} is VALID [2018-11-14 18:55:45,632 INFO L273 TraceCheckUtils]: 95: Hoare triple {26674#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26675#(<= main_~i~1 30)} is VALID [2018-11-14 18:55:45,633 INFO L273 TraceCheckUtils]: 96: Hoare triple {26675#(<= main_~i~1 30)} assume true; {26675#(<= main_~i~1 30)} is VALID [2018-11-14 18:55:45,633 INFO L273 TraceCheckUtils]: 97: Hoare triple {26675#(<= main_~i~1 30)} assume !(~i~1 < 10000); {26644#false} is VALID [2018-11-14 18:55:45,634 INFO L256 TraceCheckUtils]: 98: Hoare triple {26644#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {26644#false} is VALID [2018-11-14 18:55:45,634 INFO L273 TraceCheckUtils]: 99: Hoare triple {26644#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26644#false} is VALID [2018-11-14 18:55:45,634 INFO L273 TraceCheckUtils]: 100: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,634 INFO L273 TraceCheckUtils]: 101: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,634 INFO L273 TraceCheckUtils]: 102: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,634 INFO L273 TraceCheckUtils]: 103: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,635 INFO L273 TraceCheckUtils]: 104: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,635 INFO L273 TraceCheckUtils]: 105: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,635 INFO L273 TraceCheckUtils]: 106: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,635 INFO L273 TraceCheckUtils]: 107: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,635 INFO L273 TraceCheckUtils]: 108: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,636 INFO L273 TraceCheckUtils]: 109: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,636 INFO L273 TraceCheckUtils]: 110: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,636 INFO L273 TraceCheckUtils]: 111: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,636 INFO L273 TraceCheckUtils]: 112: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,636 INFO L273 TraceCheckUtils]: 113: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,636 INFO L273 TraceCheckUtils]: 114: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,636 INFO L273 TraceCheckUtils]: 115: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,636 INFO L273 TraceCheckUtils]: 116: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,637 INFO L273 TraceCheckUtils]: 117: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,637 INFO L273 TraceCheckUtils]: 118: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,637 INFO L273 TraceCheckUtils]: 119: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,637 INFO L273 TraceCheckUtils]: 120: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,637 INFO L273 TraceCheckUtils]: 121: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,637 INFO L273 TraceCheckUtils]: 122: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,637 INFO L273 TraceCheckUtils]: 123: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,637 INFO L273 TraceCheckUtils]: 124: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,637 INFO L273 TraceCheckUtils]: 125: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,637 INFO L273 TraceCheckUtils]: 126: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,638 INFO L273 TraceCheckUtils]: 127: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,638 INFO L273 TraceCheckUtils]: 128: Hoare triple {26644#false} assume !(~i~0 < 10000); {26644#false} is VALID [2018-11-14 18:55:45,638 INFO L273 TraceCheckUtils]: 129: Hoare triple {26644#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26644#false} is VALID [2018-11-14 18:55:45,638 INFO L273 TraceCheckUtils]: 130: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,638 INFO L268 TraceCheckUtils]: 131: Hoare quadruple {26644#false} {26644#false} #73#return; {26644#false} is VALID [2018-11-14 18:55:45,638 INFO L273 TraceCheckUtils]: 132: Hoare triple {26644#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {26644#false} is VALID [2018-11-14 18:55:45,638 INFO L256 TraceCheckUtils]: 133: Hoare triple {26644#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {26644#false} is VALID [2018-11-14 18:55:45,638 INFO L273 TraceCheckUtils]: 134: Hoare triple {26644#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26644#false} is VALID [2018-11-14 18:55:45,638 INFO L273 TraceCheckUtils]: 135: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,638 INFO L273 TraceCheckUtils]: 136: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,639 INFO L273 TraceCheckUtils]: 137: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,639 INFO L273 TraceCheckUtils]: 138: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,639 INFO L273 TraceCheckUtils]: 139: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,639 INFO L273 TraceCheckUtils]: 140: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,639 INFO L273 TraceCheckUtils]: 141: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,639 INFO L273 TraceCheckUtils]: 142: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,639 INFO L273 TraceCheckUtils]: 143: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,639 INFO L273 TraceCheckUtils]: 144: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,639 INFO L273 TraceCheckUtils]: 145: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,640 INFO L273 TraceCheckUtils]: 146: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,640 INFO L273 TraceCheckUtils]: 147: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,640 INFO L273 TraceCheckUtils]: 148: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,640 INFO L273 TraceCheckUtils]: 149: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,640 INFO L273 TraceCheckUtils]: 150: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,640 INFO L273 TraceCheckUtils]: 151: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,640 INFO L273 TraceCheckUtils]: 152: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,640 INFO L273 TraceCheckUtils]: 153: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,640 INFO L273 TraceCheckUtils]: 154: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,640 INFO L273 TraceCheckUtils]: 155: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,640 INFO L273 TraceCheckUtils]: 156: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,641 INFO L273 TraceCheckUtils]: 157: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,641 INFO L273 TraceCheckUtils]: 158: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,641 INFO L273 TraceCheckUtils]: 159: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,641 INFO L273 TraceCheckUtils]: 160: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,641 INFO L273 TraceCheckUtils]: 161: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,641 INFO L273 TraceCheckUtils]: 162: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,641 INFO L273 TraceCheckUtils]: 163: Hoare triple {26644#false} assume !(~i~0 < 10000); {26644#false} is VALID [2018-11-14 18:55:45,641 INFO L273 TraceCheckUtils]: 164: Hoare triple {26644#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26644#false} is VALID [2018-11-14 18:55:45,641 INFO L273 TraceCheckUtils]: 165: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,642 INFO L268 TraceCheckUtils]: 166: Hoare quadruple {26644#false} {26644#false} #75#return; {26644#false} is VALID [2018-11-14 18:55:45,642 INFO L273 TraceCheckUtils]: 167: Hoare triple {26644#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26644#false} is VALID [2018-11-14 18:55:45,642 INFO L273 TraceCheckUtils]: 168: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,642 INFO L273 TraceCheckUtils]: 169: Hoare triple {26644#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26644#false} is VALID [2018-11-14 18:55:45,642 INFO L273 TraceCheckUtils]: 170: Hoare triple {26644#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26644#false} is VALID [2018-11-14 18:55:45,642 INFO L273 TraceCheckUtils]: 171: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,642 INFO L273 TraceCheckUtils]: 172: Hoare triple {26644#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26644#false} is VALID [2018-11-14 18:55:45,642 INFO L273 TraceCheckUtils]: 173: Hoare triple {26644#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26644#false} is VALID [2018-11-14 18:55:45,642 INFO L273 TraceCheckUtils]: 174: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,642 INFO L273 TraceCheckUtils]: 175: Hoare triple {26644#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26644#false} is VALID [2018-11-14 18:55:45,643 INFO L273 TraceCheckUtils]: 176: Hoare triple {26644#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26644#false} is VALID [2018-11-14 18:55:45,643 INFO L273 TraceCheckUtils]: 177: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,643 INFO L273 TraceCheckUtils]: 178: Hoare triple {26644#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26644#false} is VALID [2018-11-14 18:55:45,643 INFO L273 TraceCheckUtils]: 179: Hoare triple {26644#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26644#false} is VALID [2018-11-14 18:55:45,643 INFO L273 TraceCheckUtils]: 180: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,643 INFO L273 TraceCheckUtils]: 181: Hoare triple {26644#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26644#false} is VALID [2018-11-14 18:55:45,643 INFO L273 TraceCheckUtils]: 182: Hoare triple {26644#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26644#false} is VALID [2018-11-14 18:55:45,643 INFO L273 TraceCheckUtils]: 183: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,643 INFO L273 TraceCheckUtils]: 184: Hoare triple {26644#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26644#false} is VALID [2018-11-14 18:55:45,643 INFO L273 TraceCheckUtils]: 185: Hoare triple {26644#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26644#false} is VALID [2018-11-14 18:55:45,644 INFO L273 TraceCheckUtils]: 186: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,644 INFO L273 TraceCheckUtils]: 187: Hoare triple {26644#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26644#false} is VALID [2018-11-14 18:55:45,644 INFO L273 TraceCheckUtils]: 188: Hoare triple {26644#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26644#false} is VALID [2018-11-14 18:55:45,644 INFO L273 TraceCheckUtils]: 189: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,644 INFO L273 TraceCheckUtils]: 190: Hoare triple {26644#false} assume !(~i~2 < 9999); {26644#false} is VALID [2018-11-14 18:55:45,644 INFO L273 TraceCheckUtils]: 191: Hoare triple {26644#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {26644#false} is VALID [2018-11-14 18:55:45,644 INFO L256 TraceCheckUtils]: 192: Hoare triple {26644#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {26644#false} is VALID [2018-11-14 18:55:45,644 INFO L273 TraceCheckUtils]: 193: Hoare triple {26644#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26644#false} is VALID [2018-11-14 18:55:45,644 INFO L273 TraceCheckUtils]: 194: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,644 INFO L273 TraceCheckUtils]: 195: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,645 INFO L273 TraceCheckUtils]: 196: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,645 INFO L273 TraceCheckUtils]: 197: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,645 INFO L273 TraceCheckUtils]: 198: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,645 INFO L273 TraceCheckUtils]: 199: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,645 INFO L273 TraceCheckUtils]: 200: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,645 INFO L273 TraceCheckUtils]: 201: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,645 INFO L273 TraceCheckUtils]: 202: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,645 INFO L273 TraceCheckUtils]: 203: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,645 INFO L273 TraceCheckUtils]: 204: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,645 INFO L273 TraceCheckUtils]: 205: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,646 INFO L273 TraceCheckUtils]: 206: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,646 INFO L273 TraceCheckUtils]: 207: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,646 INFO L273 TraceCheckUtils]: 208: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,646 INFO L273 TraceCheckUtils]: 209: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,646 INFO L273 TraceCheckUtils]: 210: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,646 INFO L273 TraceCheckUtils]: 211: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,646 INFO L273 TraceCheckUtils]: 212: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,646 INFO L273 TraceCheckUtils]: 213: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,646 INFO L273 TraceCheckUtils]: 214: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,646 INFO L273 TraceCheckUtils]: 215: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,647 INFO L273 TraceCheckUtils]: 216: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,647 INFO L273 TraceCheckUtils]: 217: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,647 INFO L273 TraceCheckUtils]: 218: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,647 INFO L273 TraceCheckUtils]: 219: Hoare triple {26644#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26644#false} is VALID [2018-11-14 18:55:45,647 INFO L273 TraceCheckUtils]: 220: Hoare triple {26644#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26644#false} is VALID [2018-11-14 18:55:45,647 INFO L273 TraceCheckUtils]: 221: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,647 INFO L273 TraceCheckUtils]: 222: Hoare triple {26644#false} assume !(~i~0 < 10000); {26644#false} is VALID [2018-11-14 18:55:45,647 INFO L273 TraceCheckUtils]: 223: Hoare triple {26644#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26644#false} is VALID [2018-11-14 18:55:45,647 INFO L273 TraceCheckUtils]: 224: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 18:55:45,647 INFO L268 TraceCheckUtils]: 225: Hoare quadruple {26644#false} {26644#false} #77#return; {26644#false} is VALID [2018-11-14 18:55:45,648 INFO L273 TraceCheckUtils]: 226: Hoare triple {26644#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26644#false} is VALID [2018-11-14 18:55:45,648 INFO L273 TraceCheckUtils]: 227: Hoare triple {26644#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26644#false} is VALID [2018-11-14 18:55:45,648 INFO L273 TraceCheckUtils]: 228: Hoare triple {26644#false} assume !false; {26644#false} is VALID [2018-11-14 18:55:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2675 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 1310 trivial. 0 not checked. [2018-11-14 18:55:45,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:55:45,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-14 18:55:45,694 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 229 [2018-11-14 18:55:45,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:55:45,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 18:55:45,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:45,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 18:55:45,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 18:55:45,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:55:45,829 INFO L87 Difference]: Start difference. First operand 164 states and 168 transitions. Second operand 34 states. [2018-11-14 18:55:47,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:47,302 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2018-11-14 18:55:47,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-14 18:55:47,303 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 229 [2018-11-14 18:55:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:55:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:55:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 150 transitions. [2018-11-14 18:55:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:55:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 150 transitions. [2018-11-14 18:55:47,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 150 transitions. [2018-11-14 18:55:47,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:47,460 INFO L225 Difference]: With dead ends: 234 [2018-11-14 18:55:47,461 INFO L226 Difference]: Without dead ends: 168 [2018-11-14 18:55:47,461 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 229 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-14 18:55:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-14 18:55:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-11-14 18:55:47,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:55:47,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand 167 states. [2018-11-14 18:55:47,531 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 167 states. [2018-11-14 18:55:47,531 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 167 states. [2018-11-14 18:55:47,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:47,533 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2018-11-14 18:55:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2018-11-14 18:55:47,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:47,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:47,534 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 168 states. [2018-11-14 18:55:47,534 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 168 states. [2018-11-14 18:55:47,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:47,537 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2018-11-14 18:55:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2018-11-14 18:55:47,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:47,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:47,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:55:47,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:55:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-14 18:55:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2018-11-14 18:55:47,541 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 229 [2018-11-14 18:55:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:55:47,541 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2018-11-14 18:55:47,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 18:55:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2018-11-14 18:55:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-14 18:55:47,543 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:55:47,543 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 27, 27, 8, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:55:47,543 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:55:47,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:55:47,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1093490035, now seen corresponding path program 29 times [2018-11-14 18:55:47,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:55:47,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:55:47,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:47,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:55:47,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat