java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/bAnd3_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:06:52,550 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:06:52,552 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:06:52,564 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:06:52,564 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:06:52,565 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:06:52,567 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:06:52,569 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:06:52,570 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:06:52,571 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:06:52,572 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:06:52,572 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:06:52,573 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:06:52,574 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:06:52,576 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:06:52,576 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:06:52,577 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:06:52,579 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:06:52,581 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:06:52,583 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:06:52,584 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:06:52,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:06:52,588 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:06:52,588 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:06:52,588 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:06:52,589 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:06:52,590 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:06:52,591 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:06:52,592 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:06:52,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:06:52,593 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:06:52,594 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:06:52,594 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:06:52,594 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:06:52,595 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:06:52,596 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:06:52,597 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:06:52,613 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:06:52,614 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:06:52,615 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:06:52,616 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:06:52,616 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:06:52,617 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:06:52,617 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:06:52,617 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:06:52,617 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:06:52,617 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:06:52,619 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:06:52,619 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:06:52,619 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:06:52,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:06:52,619 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:06:52,620 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:06:52,620 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:06:52,620 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:06:52,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:06:52,620 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:06:52,621 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:06:52,622 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:06:52,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:06:52,622 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:06:52,622 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:06:52,623 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:06:52,623 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:06:52,623 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:06:52,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:06:52,623 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:06:52,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:06:52,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:06:52,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:06:52,700 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:06:52,700 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:06:52,701 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 17:06:52,756 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee813504e/1c644adf1414479ba3848cecb793d02f/FLAGa68597c36 [2018-11-14 17:06:53,188 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:06:53,189 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd3_true-unreach-call.i [2018-11-14 17:06:53,194 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee813504e/1c644adf1414479ba3848cecb793d02f/FLAGa68597c36 [2018-11-14 17:06:53,209 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee813504e/1c644adf1414479ba3848cecb793d02f [2018-11-14 17:06:53,219 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:06:53,221 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:06:53,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:06:53,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:06:53,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:06:53,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:06:53" (1/1) ... [2018-11-14 17:06:53,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2015b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:53, skipping insertion in model container [2018-11-14 17:06:53,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:06:53" (1/1) ... [2018-11-14 17:06:53,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:06:53,265 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:06:53,505 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:06:53,517 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:06:53,546 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:06:53,573 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:06:53,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:53 WrapperNode [2018-11-14 17:06:53,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:06:53,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:06:53,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:06:53,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:06:53,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:53" (1/1) ... [2018-11-14 17:06:53,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:53" (1/1) ... [2018-11-14 17:06:53,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:53" (1/1) ... [2018-11-14 17:06:53,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:53" (1/1) ... [2018-11-14 17:06:53,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:53" (1/1) ... [2018-11-14 17:06:53,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:53" (1/1) ... [2018-11-14 17:06:53,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:53" (1/1) ... [2018-11-14 17:06:53,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:06:53,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:06:53,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:06:53,658 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:06:53,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:53" (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 17:06:53,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:06:53,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:06:53,789 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2018-11-14 17:06:53,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:06:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:06:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:06:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2018-11-14 17:06:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:06:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:06:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:06:53,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:06:53,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:06:53,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:06:53,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:06:53,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:06:54,500 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:06:54,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:06:54 BoogieIcfgContainer [2018-11-14 17:06:54,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:06:54,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:06:54,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:06:54,506 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:06:54,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:06:53" (1/3) ... [2018-11-14 17:06:54,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1243f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:06:54, skipping insertion in model container [2018-11-14 17:06:54,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:53" (2/3) ... [2018-11-14 17:06:54,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1243f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:06:54, skipping insertion in model container [2018-11-14 17:06:54,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:06:54" (3/3) ... [2018-11-14 17:06:54,510 INFO L112 eAbstractionObserver]: Analyzing ICFG bAnd3_true-unreach-call.i [2018-11-14 17:06:54,520 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:06:54,529 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:06:54,545 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:06:54,578 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:06:54,579 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:06:54,579 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:06:54,579 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:06:54,579 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:06:54,579 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:06:54,580 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:06:54,580 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:06:54,580 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:06:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 17:06:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:06:54,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:54,606 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 17:06:54,609 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:54,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:54,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1401494287, now seen corresponding path program 1 times [2018-11-14 17:06:54,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:54,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:54,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:54,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:54,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:54,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 17:06:54,839 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 17:06:54,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:06:54,841 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #69#return; {37#true} is VALID [2018-11-14 17:06:54,842 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret13 := main(); {37#true} is VALID [2018-11-14 17:06:54,842 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 17:06:54,855 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 17:06:54,856 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 17:06:54,856 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 17:06:54,857 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 17:06:54,857 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 17:06:54,857 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:06:54,858 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#true} {38#false} #73#return; {38#false} is VALID [2018-11-14 17:06:54,858 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 17:06:54,859 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 17:06:54,859 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 17:06:54,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 17:06:54,860 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 17:06:54,860 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:06:54,860 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {37#true} {38#false} #75#return; {38#false} is VALID [2018-11-14 17:06:54,861 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 17:06:54,861 INFO L273 TraceCheckUtils]: 21: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:06:54,861 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 17:06:54,862 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 17:06:54,862 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 17:06:54,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 17:06:54,863 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 17:06:54,863 INFO L273 TraceCheckUtils]: 27: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:06:54,863 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {37#true} {38#false} #77#return; {38#false} is VALID [2018-11-14 17:06:54,864 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 17:06:54,864 INFO L273 TraceCheckUtils]: 30: Hoare triple {38#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {38#false} is VALID [2018-11-14 17:06:54,864 INFO L273 TraceCheckUtils]: 31: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 17:06:54,871 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 17:06:54,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:06:54,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:06:54,879 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:06:54,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:54,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:06:55,147 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 17:06:55,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:06:55,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:06:55,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:06:55,158 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 17:06:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:55,290 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-14 17:06:55,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:06:55,290 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:06:55,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:06:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:06:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:06:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:06:55,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-14 17:06:55,636 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 17:06:55,649 INFO L225 Difference]: With dead ends: 59 [2018-11-14 17:06:55,650 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 17:06:55,654 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 17:06:55,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 17:06:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 17:06:55,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:55,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 17:06:55,707 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:06:55,707 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:06:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:55,714 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:06:55,714 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:06:55,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:55,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:55,716 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:06:55,717 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:06:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:55,728 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:06:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:06:55,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:55,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:55,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:55,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:06:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-14 17:06:55,736 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2018-11-14 17:06:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:55,737 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-14 17:06:55,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:06:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:06:55,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:06:55,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:55,739 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 17:06:55,740 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:55,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:55,740 INFO L82 PathProgramCache]: Analyzing trace with hash -741637549, now seen corresponding path program 1 times [2018-11-14 17:06:55,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:55,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:55,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:55,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:55,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:55,893 INFO L256 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2018-11-14 17:06:55,893 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 17:06:55,894 INFO L273 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:06:55,894 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #69#return; {215#true} is VALID [2018-11-14 17:06:55,895 INFO L256 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret13 := main(); {215#true} is VALID [2018-11-14 17:06:55,896 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 17:06:55,898 INFO L273 TraceCheckUtils]: 6: Hoare triple {217#(= main_~i~1 0)} assume true; {217#(= main_~i~1 0)} is VALID [2018-11-14 17:06:55,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {217#(= main_~i~1 0)} assume !(~i~1 < 10000); {216#false} is VALID [2018-11-14 17:06:55,900 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 17:06:55,901 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 17:06:55,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:06:55,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {215#true} assume !(~i~0 < 10000); {215#true} is VALID [2018-11-14 17:06:55,902 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 17:06:55,902 INFO L273 TraceCheckUtils]: 13: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:06:55,903 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {215#true} {216#false} #73#return; {216#false} is VALID [2018-11-14 17:06:55,903 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 17:06:55,904 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 17:06:55,904 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 17:06:55,904 INFO L273 TraceCheckUtils]: 18: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:06:55,905 INFO L273 TraceCheckUtils]: 19: Hoare triple {215#true} assume !(~i~0 < 10000); {215#true} is VALID [2018-11-14 17:06:55,905 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 17:06:55,905 INFO L273 TraceCheckUtils]: 21: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:06:55,906 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {215#true} {216#false} #75#return; {216#false} is VALID [2018-11-14 17:06:55,906 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 17:06:55,906 INFO L273 TraceCheckUtils]: 24: Hoare triple {216#false} assume true; {216#false} is VALID [2018-11-14 17:06:55,907 INFO L273 TraceCheckUtils]: 25: Hoare triple {216#false} assume !(~i~2 < 9999); {216#false} is VALID [2018-11-14 17:06:55,907 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 17:06:55,908 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 17:06:55,908 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 17:06:55,908 INFO L273 TraceCheckUtils]: 29: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:06:55,909 INFO L273 TraceCheckUtils]: 30: Hoare triple {215#true} assume !(~i~0 < 10000); {215#true} is VALID [2018-11-14 17:06:55,909 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 17:06:55,909 INFO L273 TraceCheckUtils]: 32: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:06:55,910 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {215#true} {216#false} #77#return; {216#false} is VALID [2018-11-14 17:06:55,910 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 17:06:55,910 INFO L273 TraceCheckUtils]: 35: Hoare triple {216#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {216#false} is VALID [2018-11-14 17:06:55,911 INFO L273 TraceCheckUtils]: 36: Hoare triple {216#false} assume !false; {216#false} is VALID [2018-11-14 17:06:55,914 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 17:06:55,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:06:55,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:06:55,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:06:55,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:55,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:06:56,081 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 17:06:56,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:06:56,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:06:56,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:06:56,083 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-14 17:06:56,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:56,542 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-14 17:06:56,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:06:56,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:06:56,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:06:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:06:56,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:06:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:06:56,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-14 17:06:56,704 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 17:06:56,706 INFO L225 Difference]: With dead ends: 52 [2018-11-14 17:06:56,707 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:06:56,709 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 17:06:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:06:56,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-14 17:06:56,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:56,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-14 17:06:56,739 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-14 17:06:56,740 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-14 17:06:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:56,743 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:06:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:06:56,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:56,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:56,745 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-14 17:06:56,745 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-14 17:06:56,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:56,749 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:06:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:06:56,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:56,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:56,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:56,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:06:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 17:06:56,754 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2018-11-14 17:06:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:56,754 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 17:06:56,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:06:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 17:06:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:06:56,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:56,756 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 17:06:56,757 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:56,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:56,757 INFO L82 PathProgramCache]: Analyzing trace with hash 989317657, now seen corresponding path program 1 times [2018-11-14 17:06:56,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:56,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:56,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:56,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:56,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:56,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 17:06:56,850 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 17:06:56,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:56,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 17:06:56,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret13 := main(); {397#true} is VALID [2018-11-14 17:06:56,852 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 17:06:56,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:56,852 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 17:06:56,853 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 17:06:56,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:56,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 10000); {397#true} is VALID [2018-11-14 17:06:56,853 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 17:06:56,855 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 17:06:56,857 INFO L273 TraceCheckUtils]: 13: Hoare triple {399#(= bAnd_~i~0 1)} assume true; {399#(= bAnd_~i~0 1)} is VALID [2018-11-14 17:06:56,857 INFO L273 TraceCheckUtils]: 14: Hoare triple {399#(= bAnd_~i~0 1)} assume !(~i~0 < 10000); {398#false} is VALID [2018-11-14 17:06:56,858 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 17:06:56,858 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:56,858 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 17:06:56,858 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 17:06:56,859 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 17:06:56,859 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 17:06:56,859 INFO L273 TraceCheckUtils]: 21: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:56,859 INFO L273 TraceCheckUtils]: 22: Hoare triple {397#true} assume !(~i~0 < 10000); {397#true} is VALID [2018-11-14 17:06:56,860 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 17:06:56,863 INFO L273 TraceCheckUtils]: 24: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:56,863 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {397#true} {398#false} #75#return; {398#false} is VALID [2018-11-14 17:06:56,863 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 17:06:56,864 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:56,864 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 9999); {398#false} is VALID [2018-11-14 17:06:56,864 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 17:06:56,864 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 17:06:56,868 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 17:06:56,868 INFO L273 TraceCheckUtils]: 32: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:56,869 INFO L273 TraceCheckUtils]: 33: Hoare triple {397#true} assume !(~i~0 < 10000); {397#true} is VALID [2018-11-14 17:06:56,869 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 17:06:56,869 INFO L273 TraceCheckUtils]: 35: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:56,870 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {397#true} {398#false} #77#return; {398#false} is VALID [2018-11-14 17:06:56,870 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 17:06:56,870 INFO L273 TraceCheckUtils]: 38: Hoare triple {398#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {398#false} is VALID [2018-11-14 17:06:56,871 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 17:06:56,873 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 17:06:56,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:56,874 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 17:06:56,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:56,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:06:57,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 17:06:57,293 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 17:06:57,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:57,293 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 17:06:57,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret13 := main(); {397#true} is VALID [2018-11-14 17:06:57,294 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 17:06:57,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:57,295 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 17:06:57,295 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 17:06:57,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:57,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 10000); {397#true} is VALID [2018-11-14 17:06:57,296 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 17:06:57,305 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 17:06:57,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {439#(<= bAnd_~i~0 1)} assume true; {439#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:06:57,313 INFO L273 TraceCheckUtils]: 14: Hoare triple {439#(<= bAnd_~i~0 1)} assume !(~i~0 < 10000); {398#false} is VALID [2018-11-14 17:06:57,313 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 17:06:57,313 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:57,314 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 17:06:57,314 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 17:06:57,314 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 17:06:57,315 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 17:06:57,315 INFO L273 TraceCheckUtils]: 21: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:57,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {398#false} assume !(~i~0 < 10000); {398#false} is VALID [2018-11-14 17:06:57,316 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 17:06:57,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:57,316 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {398#false} {398#false} #75#return; {398#false} is VALID [2018-11-14 17:06:57,316 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 17:06:57,317 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:57,317 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 9999); {398#false} is VALID [2018-11-14 17:06:57,317 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 17:06:57,318 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 17:06:57,318 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 17:06:57,318 INFO L273 TraceCheckUtils]: 32: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:57,318 INFO L273 TraceCheckUtils]: 33: Hoare triple {398#false} assume !(~i~0 < 10000); {398#false} is VALID [2018-11-14 17:06:57,319 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 17:06:57,319 INFO L273 TraceCheckUtils]: 35: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:57,319 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {398#false} {398#false} #77#return; {398#false} is VALID [2018-11-14 17:06:57,320 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 17:06:57,320 INFO L273 TraceCheckUtils]: 38: Hoare triple {398#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {398#false} is VALID [2018-11-14 17:06:57,320 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 17:06:57,322 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 17:06:57,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:06:57,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-14 17:06:57,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 17:06:57,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:57,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:06:57,523 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 17:06:57,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:06:57,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:06:57,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:06:57,524 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-11-14 17:06:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:57,789 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-11-14 17:06:57,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:06:57,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 17:06:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:06:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:06:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:06:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:06:57,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-14 17:06:57,911 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 17:06:57,914 INFO L225 Difference]: With dead ends: 53 [2018-11-14 17:06:57,914 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 17:06:57,915 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 17:06:57,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 17:06:57,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-14 17:06:57,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:57,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-14 17:06:57,932 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-14 17:06:57,933 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-14 17:06:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:57,936 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 17:06:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 17:06:57,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:57,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:57,938 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-14 17:06:57,938 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-14 17:06:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:57,941 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 17:06:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 17:06:57,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:57,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:57,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:57,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:06:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-14 17:06:57,945 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 40 [2018-11-14 17:06:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:57,945 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-14 17:06:57,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:06:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 17:06:57,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 17:06:57,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:57,947 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 17:06:57,948 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:57,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:57,948 INFO L82 PathProgramCache]: Analyzing trace with hash 841579359, now seen corresponding path program 1 times [2018-11-14 17:06:57,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:57,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:57,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:57,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:57,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:58,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {705#true} is VALID [2018-11-14 17:06:58,047 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 17:06:58,047 INFO L273 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:58,048 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #69#return; {705#true} is VALID [2018-11-14 17:06:58,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {705#true} call #t~ret13 := main(); {705#true} is VALID [2018-11-14 17:06:58,048 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 17:06:58,049 INFO L273 TraceCheckUtils]: 6: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:58,049 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 17:06:58,049 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 17:06:58,050 INFO L273 TraceCheckUtils]: 9: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:58,050 INFO L273 TraceCheckUtils]: 10: Hoare triple {705#true} assume !(~i~1 < 10000); {705#true} is VALID [2018-11-14 17:06:58,050 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 17:06:58,050 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 17:06:58,051 INFO L273 TraceCheckUtils]: 13: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:58,051 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 17:06:58,051 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 17:06:58,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:58,052 INFO L273 TraceCheckUtils]: 17: Hoare triple {705#true} assume !(~i~0 < 10000); {705#true} is VALID [2018-11-14 17:06:58,052 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 17:06:58,052 INFO L273 TraceCheckUtils]: 19: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:58,052 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {705#true} {705#true} #73#return; {705#true} is VALID [2018-11-14 17:06:58,052 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 17:06:58,053 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 17:06:58,053 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 17:06:58,053 INFO L273 TraceCheckUtils]: 24: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:58,054 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 17:06:58,054 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 17:06:58,054 INFO L273 TraceCheckUtils]: 27: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:58,054 INFO L273 TraceCheckUtils]: 28: Hoare triple {705#true} assume !(~i~0 < 10000); {705#true} is VALID [2018-11-14 17:06:58,054 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 17:06:58,055 INFO L273 TraceCheckUtils]: 30: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:58,055 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {705#true} {705#true} #75#return; {705#true} is VALID [2018-11-14 17:06:58,055 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 17:06:58,057 INFO L273 TraceCheckUtils]: 33: Hoare triple {707#(= main_~i~2 0)} assume true; {707#(= main_~i~2 0)} is VALID [2018-11-14 17:06:58,057 INFO L273 TraceCheckUtils]: 34: Hoare triple {707#(= main_~i~2 0)} assume !(~i~2 < 9999); {706#false} is VALID [2018-11-14 17:06:58,057 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 17:06:58,058 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 17:06:58,058 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 17:06:58,058 INFO L273 TraceCheckUtils]: 38: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:58,058 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 17:06:58,058 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 17:06:58,059 INFO L273 TraceCheckUtils]: 41: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:58,059 INFO L273 TraceCheckUtils]: 42: Hoare triple {705#true} assume !(~i~0 < 10000); {705#true} is VALID [2018-11-14 17:06:58,059 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 17:06:58,059 INFO L273 TraceCheckUtils]: 44: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:58,059 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {705#true} {706#false} #77#return; {706#false} is VALID [2018-11-14 17:06:58,060 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 17:06:58,060 INFO L273 TraceCheckUtils]: 47: Hoare triple {706#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {706#false} is VALID [2018-11-14 17:06:58,060 INFO L273 TraceCheckUtils]: 48: Hoare triple {706#false} assume !false; {706#false} is VALID [2018-11-14 17:06:58,064 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 17:06:58,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:06:58,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:06:58,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:06:58,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:58,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:06:58,125 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 17:06:58,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:06:58,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:06:58,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:06:58,126 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-14 17:06:58,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:58,217 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 17:06:58,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:06:58,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:06:58,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:06:58,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 17:06:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:06:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 17:06:58,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-14 17:06:58,431 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 17:06:58,433 INFO L225 Difference]: With dead ends: 51 [2018-11-14 17:06:58,434 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:06:58,435 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 17:06:58,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:06:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-14 17:06:58,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:58,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-14 17:06:58,449 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-14 17:06:58,449 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-14 17:06:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:58,451 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 17:06:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 17:06:58,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:58,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:58,453 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-14 17:06:58,453 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-14 17:06:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:58,456 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 17:06:58,456 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 17:06:58,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:58,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:58,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:58,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:06:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-14 17:06:58,460 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 49 [2018-11-14 17:06:58,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:58,460 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-14 17:06:58,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:06:58,460 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-14 17:06:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 17:06:58,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:58,462 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 17:06:58,462 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:58,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:58,463 INFO L82 PathProgramCache]: Analyzing trace with hash 611709709, now seen corresponding path program 1 times [2018-11-14 17:06:58,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:58,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:58,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:58,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:58,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:58,588 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 17:06:58,588 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 17:06:58,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:58,589 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 17:06:58,589 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret13 := main(); {900#true} is VALID [2018-11-14 17:06:58,594 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 17:06:58,595 INFO L273 TraceCheckUtils]: 6: Hoare triple {902#(= main_~i~1 0)} assume true; {902#(= main_~i~1 0)} is VALID [2018-11-14 17:06:58,595 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 17:06:58,597 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 17:06:58,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:58,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 10000); {901#false} is VALID [2018-11-14 17:06:58,599 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 17:06:58,599 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 17:06:58,600 INFO L273 TraceCheckUtils]: 13: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:58,600 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 17:06:58,601 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 17:06:58,601 INFO L273 TraceCheckUtils]: 16: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:58,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {900#true} assume !(~i~0 < 10000); {900#true} is VALID [2018-11-14 17:06:58,602 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 17:06:58,602 INFO L273 TraceCheckUtils]: 19: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:58,602 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {900#true} {901#false} #73#return; {901#false} is VALID [2018-11-14 17:06:58,603 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 17:06:58,603 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 17:06:58,603 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 17:06:58,604 INFO L273 TraceCheckUtils]: 24: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:58,604 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 17:06:58,604 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 17:06:58,604 INFO L273 TraceCheckUtils]: 27: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:58,605 INFO L273 TraceCheckUtils]: 28: Hoare triple {900#true} assume !(~i~0 < 10000); {900#true} is VALID [2018-11-14 17:06:58,605 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 17:06:58,605 INFO L273 TraceCheckUtils]: 30: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:58,606 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {900#true} {901#false} #75#return; {901#false} is VALID [2018-11-14 17:06:58,606 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 17:06:58,606 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:58,606 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 17:06:58,607 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 17:06:58,607 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:58,607 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 9999); {901#false} is VALID [2018-11-14 17:06:58,607 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 17:06:58,608 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 17:06:58,608 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 17:06:58,608 INFO L273 TraceCheckUtils]: 41: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:58,608 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 17:06:58,609 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 17:06:58,609 INFO L273 TraceCheckUtils]: 44: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:58,609 INFO L273 TraceCheckUtils]: 45: Hoare triple {900#true} assume !(~i~0 < 10000); {900#true} is VALID [2018-11-14 17:06:58,609 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 17:06:58,609 INFO L273 TraceCheckUtils]: 47: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:58,610 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {900#true} {901#false} #77#return; {901#false} is VALID [2018-11-14 17:06:58,610 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 17:06:58,610 INFO L273 TraceCheckUtils]: 50: Hoare triple {901#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {901#false} is VALID [2018-11-14 17:06:58,610 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 17:06:58,614 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 17:06:58,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:58,615 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 17:06:58,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:58,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:06:59,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 17:06:59,144 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 17:06:59,145 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:59,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 17:06:59,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret13 := main(); {900#true} is VALID [2018-11-14 17:06:59,146 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 17:06:59,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {922#(<= main_~i~1 0)} assume true; {922#(<= main_~i~1 0)} is VALID [2018-11-14 17:06:59,149 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 17:06:59,149 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 17:06:59,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:59,150 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 10000); {901#false} is VALID [2018-11-14 17:06:59,151 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 17:06:59,151 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 17:06:59,151 INFO L273 TraceCheckUtils]: 13: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:59,152 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 17:06:59,152 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 17:06:59,152 INFO L273 TraceCheckUtils]: 16: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:59,153 INFO L273 TraceCheckUtils]: 17: Hoare triple {901#false} assume !(~i~0 < 10000); {901#false} is VALID [2018-11-14 17:06:59,153 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 17:06:59,153 INFO L273 TraceCheckUtils]: 19: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:59,153 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {901#false} {901#false} #73#return; {901#false} is VALID [2018-11-14 17:06:59,154 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 17:06:59,154 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 17:06:59,154 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 17:06:59,155 INFO L273 TraceCheckUtils]: 24: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:59,155 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 17:06:59,155 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 17:06:59,155 INFO L273 TraceCheckUtils]: 27: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:59,156 INFO L273 TraceCheckUtils]: 28: Hoare triple {901#false} assume !(~i~0 < 10000); {901#false} is VALID [2018-11-14 17:06:59,156 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 17:06:59,156 INFO L273 TraceCheckUtils]: 30: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:59,156 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {901#false} {901#false} #75#return; {901#false} is VALID [2018-11-14 17:06:59,157 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 17:06:59,157 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:59,157 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 17:06:59,158 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 17:06:59,158 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:59,158 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 9999); {901#false} is VALID [2018-11-14 17:06:59,158 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 17:06:59,159 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 17:06:59,159 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 17:06:59,159 INFO L273 TraceCheckUtils]: 41: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:59,159 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 17:06:59,160 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 17:06:59,160 INFO L273 TraceCheckUtils]: 44: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:59,160 INFO L273 TraceCheckUtils]: 45: Hoare triple {901#false} assume !(~i~0 < 10000); {901#false} is VALID [2018-11-14 17:06:59,161 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 17:06:59,161 INFO L273 TraceCheckUtils]: 47: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:59,161 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {901#false} {901#false} #77#return; {901#false} is VALID [2018-11-14 17:06:59,161 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 17:06:59,162 INFO L273 TraceCheckUtils]: 50: Hoare triple {901#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {901#false} is VALID [2018-11-14 17:06:59,162 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 17:06:59,165 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 17:06:59,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:06:59,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 17:06:59,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 17:06:59,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:59,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:06:59,283 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 17:06:59,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:06:59,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:06:59,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:06:59,284 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2018-11-14 17:06:59,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:59,424 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-14 17:06:59,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:06:59,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 17:06:59,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:06:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 17:06:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:06:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 17:06:59,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2018-11-14 17:06:59,596 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 17:06:59,598 INFO L225 Difference]: With dead ends: 63 [2018-11-14 17:06:59,598 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 17:06:59,599 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 17:06:59,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 17:06:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-14 17:06:59,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:59,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-14 17:06:59,622 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-14 17:06:59,622 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-14 17:06:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:59,625 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 17:06:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 17:06:59,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:59,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:59,626 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-14 17:06:59,626 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-14 17:06:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:59,629 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 17:06:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 17:06:59,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:59,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:59,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:59,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:06:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-14 17:06:59,633 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 52 [2018-11-14 17:06:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:59,633 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-14 17:06:59,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:06:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 17:06:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 17:06:59,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:59,637 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 17:06:59,638 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:59,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:59,638 INFO L82 PathProgramCache]: Analyzing trace with hash -349935993, now seen corresponding path program 2 times [2018-11-14 17:06:59,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:59,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:59,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:59,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:59,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:59,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 17:06:59,793 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 17:06:59,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:59,794 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 17:06:59,794 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret13 := main(); {1277#true} is VALID [2018-11-14 17:06:59,795 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 17:06:59,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {1279#(= main_~i~1 0)} assume true; {1279#(= main_~i~1 0)} is VALID [2018-11-14 17:06:59,796 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 17:06:59,796 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 17:06:59,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(<= main_~i~1 1)} assume true; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:59,802 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 17:06:59,802 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 17:06:59,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {1281#(<= main_~i~1 2)} assume true; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:59,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 10000); {1278#false} is VALID [2018-11-14 17:06:59,804 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 17:06:59,805 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 17:06:59,805 INFO L273 TraceCheckUtils]: 16: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:59,805 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 17:06:59,806 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 17:06:59,806 INFO L273 TraceCheckUtils]: 19: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:59,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {1277#true} assume !(~i~0 < 10000); {1277#true} is VALID [2018-11-14 17:06:59,807 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 17:06:59,807 INFO L273 TraceCheckUtils]: 22: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:59,808 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1277#true} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 17:06:59,808 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 17:06:59,808 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 17:06:59,808 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 17:06:59,809 INFO L273 TraceCheckUtils]: 27: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:59,809 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 17:06:59,809 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 17:06:59,809 INFO L273 TraceCheckUtils]: 30: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:59,809 INFO L273 TraceCheckUtils]: 31: Hoare triple {1277#true} assume !(~i~0 < 10000); {1277#true} is VALID [2018-11-14 17:06:59,810 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 17:06:59,810 INFO L273 TraceCheckUtils]: 33: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:59,810 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1277#true} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 17:06:59,810 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 17:06:59,810 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:06:59,811 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 17:06:59,811 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 17:06:59,811 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:06:59,811 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 9999); {1278#false} is VALID [2018-11-14 17:06:59,811 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 17:06:59,811 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 17:06:59,812 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 17:06:59,812 INFO L273 TraceCheckUtils]: 44: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:59,812 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 17:06:59,812 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 17:06:59,812 INFO L273 TraceCheckUtils]: 47: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:59,813 INFO L273 TraceCheckUtils]: 48: Hoare triple {1277#true} assume !(~i~0 < 10000); {1277#true} is VALID [2018-11-14 17:06:59,813 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 17:06:59,813 INFO L273 TraceCheckUtils]: 50: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:59,813 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1277#true} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 17:06:59,813 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 17:06:59,813 INFO L273 TraceCheckUtils]: 53: Hoare triple {1278#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1278#false} is VALID [2018-11-14 17:06:59,814 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 17:06:59,817 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 17:06:59,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:59,817 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 17:06:59,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:06:59,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:06:59,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:06:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:59,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:00,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 17:07:00,055 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 17:07:00,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:07:00,056 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 17:07:00,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret13 := main(); {1277#true} is VALID [2018-11-14 17:07:00,064 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 17:07:00,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {1300#(<= main_~i~1 0)} assume true; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:00,065 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 17:07:00,066 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 17:07:00,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(<= main_~i~1 1)} assume true; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:00,067 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 17:07:00,067 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 17:07:00,068 INFO L273 TraceCheckUtils]: 12: Hoare triple {1281#(<= main_~i~1 2)} assume true; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:00,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 10000); {1278#false} is VALID [2018-11-14 17:07:00,068 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 17:07:00,069 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 17:07:00,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:00,069 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 17:07:00,069 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 17:07:00,070 INFO L273 TraceCheckUtils]: 19: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:00,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {1278#false} assume !(~i~0 < 10000); {1278#false} is VALID [2018-11-14 17:07:00,070 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 17:07:00,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:00,071 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1278#false} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 17:07:00,071 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 17:07:00,072 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 17:07:00,072 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 17:07:00,072 INFO L273 TraceCheckUtils]: 27: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:00,072 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 17:07:00,073 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 17:07:00,073 INFO L273 TraceCheckUtils]: 30: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:00,073 INFO L273 TraceCheckUtils]: 31: Hoare triple {1278#false} assume !(~i~0 < 10000); {1278#false} is VALID [2018-11-14 17:07:00,073 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 17:07:00,074 INFO L273 TraceCheckUtils]: 33: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:00,074 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1278#false} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 17:07:00,074 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 17:07:00,074 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:00,075 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 17:07:00,075 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 17:07:00,075 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:00,075 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 9999); {1278#false} is VALID [2018-11-14 17:07:00,075 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 17:07:00,076 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 17:07:00,076 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 17:07:00,076 INFO L273 TraceCheckUtils]: 44: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:00,076 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 17:07:00,077 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 17:07:00,077 INFO L273 TraceCheckUtils]: 47: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:00,077 INFO L273 TraceCheckUtils]: 48: Hoare triple {1278#false} assume !(~i~0 < 10000); {1278#false} is VALID [2018-11-14 17:07:00,077 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 17:07:00,078 INFO L273 TraceCheckUtils]: 50: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:00,078 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1278#false} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 17:07:00,078 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 17:07:00,078 INFO L273 TraceCheckUtils]: 53: Hoare triple {1278#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1278#false} is VALID [2018-11-14 17:07:00,079 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 17:07:00,082 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 17:07:00,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:00,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 17:07:00,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 17:07:00,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:00,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:07:00,164 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 17:07:00,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:07:00,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:07:00,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:07:00,165 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2018-11-14 17:07:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:00,316 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-14 17:07:00,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:07:00,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 17:07:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:07:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 17:07:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:07:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 17:07:00,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2018-11-14 17:07:00,505 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 17:07:00,506 INFO L225 Difference]: With dead ends: 66 [2018-11-14 17:07:00,507 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:07:00,508 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 17:07:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:07:00,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-14 17:07:00,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:00,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-14 17:07:00,538 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-14 17:07:00,538 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-14 17:07:00,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:00,541 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:07:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:07:00,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:00,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:00,542 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-14 17:07:00,542 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-14 17:07:00,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:00,545 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:07:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:07:00,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:00,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:00,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:00,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:07:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-14 17:07:00,548 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 55 [2018-11-14 17:07:00,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:00,549 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-14 17:07:00,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:07:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-14 17:07:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 17:07:00,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:00,550 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 17:07:00,550 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:00,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:00,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1305179955, now seen corresponding path program 3 times [2018-11-14 17:07:00,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:00,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:00,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:00,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:00,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:01,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 17:07:01,176 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 17:07:01,176 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,177 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 17:07:01,177 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret13 := main(); {1678#true} is VALID [2018-11-14 17:07:01,178 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 17:07:01,178 INFO L273 TraceCheckUtils]: 6: Hoare triple {1680#(= main_~i~1 0)} assume true; {1680#(= main_~i~1 0)} is VALID [2018-11-14 17:07:01,179 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 17:07:01,179 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 17:07:01,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {1681#(<= main_~i~1 1)} assume true; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:01,180 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 17:07:01,181 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 17:07:01,181 INFO L273 TraceCheckUtils]: 12: Hoare triple {1682#(<= main_~i~1 2)} assume true; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:01,182 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 17:07:01,183 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 17:07:01,184 INFO L273 TraceCheckUtils]: 15: Hoare triple {1683#(<= main_~i~1 3)} assume true; {1683#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:01,184 INFO L273 TraceCheckUtils]: 16: Hoare triple {1683#(<= main_~i~1 3)} assume !(~i~1 < 10000); {1679#false} is VALID [2018-11-14 17:07:01,185 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 17:07:01,185 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 17:07:01,185 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,185 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 17:07:01,186 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 17:07:01,186 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,186 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 10000); {1678#true} is VALID [2018-11-14 17:07:01,187 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 17:07:01,187 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,187 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1679#false} #73#return; {1679#false} is VALID [2018-11-14 17:07:01,187 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 17:07:01,188 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 17:07:01,188 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 17:07:01,188 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,188 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 17:07:01,189 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 17:07:01,189 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,189 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 10000); {1678#true} is VALID [2018-11-14 17:07:01,189 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 17:07:01,189 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,189 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1679#false} #75#return; {1679#false} is VALID [2018-11-14 17:07:01,190 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 17:07:01,190 INFO L273 TraceCheckUtils]: 39: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 17:07:01,190 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 17:07:01,190 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 17:07:01,190 INFO L273 TraceCheckUtils]: 42: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 17:07:01,190 INFO L273 TraceCheckUtils]: 43: Hoare triple {1679#false} assume !(~i~2 < 9999); {1679#false} is VALID [2018-11-14 17:07:01,191 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 17:07:01,191 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 17:07:01,191 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 17:07:01,191 INFO L273 TraceCheckUtils]: 47: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,191 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 17:07:01,192 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 17:07:01,192 INFO L273 TraceCheckUtils]: 50: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,192 INFO L273 TraceCheckUtils]: 51: Hoare triple {1678#true} assume !(~i~0 < 10000); {1678#true} is VALID [2018-11-14 17:07:01,192 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 17:07:01,192 INFO L273 TraceCheckUtils]: 53: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,192 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1678#true} {1679#false} #77#return; {1679#false} is VALID [2018-11-14 17:07:01,193 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 17:07:01,193 INFO L273 TraceCheckUtils]: 56: Hoare triple {1679#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1679#false} is VALID [2018-11-14 17:07:01,193 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 17:07:01,196 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 17:07:01,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:01,197 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 17:07:01,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:07:01,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:07:01,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:01,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:01,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 17:07:01,468 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 17:07:01,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 17:07:01,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret13 := main(); {1678#true} is VALID [2018-11-14 17:07:01,468 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 17:07:01,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,469 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 17:07:01,469 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 17:07:01,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,470 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 17:07:01,470 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 17:07:01,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,470 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 17:07:01,471 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 17:07:01,471 INFO L273 TraceCheckUtils]: 15: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,471 INFO L273 TraceCheckUtils]: 16: Hoare triple {1678#true} assume !(~i~1 < 10000); {1678#true} is VALID [2018-11-14 17:07:01,471 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 17:07:01,471 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 17:07:01,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,471 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 17:07:01,471 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 17:07:01,472 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,472 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 10000); {1678#true} is VALID [2018-11-14 17:07:01,472 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 17:07:01,472 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,472 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1678#true} #73#return; {1678#true} is VALID [2018-11-14 17:07:01,472 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 17:07:01,472 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 17:07:01,473 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 17:07:01,473 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,473 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 17:07:01,473 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 17:07:01,473 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,473 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 10000); {1678#true} is VALID [2018-11-14 17:07:01,473 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 17:07:01,473 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,474 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1678#true} #75#return; {1678#true} is VALID [2018-11-14 17:07:01,474 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 17:07:01,474 INFO L273 TraceCheckUtils]: 39: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,474 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 17:07:01,474 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 17:07:01,475 INFO L273 TraceCheckUtils]: 42: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:01,475 INFO L273 TraceCheckUtils]: 43: Hoare triple {1678#true} assume !(~i~2 < 9999); {1678#true} is VALID [2018-11-14 17:07:01,475 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 17:07:01,475 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 17:07:01,488 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 17:07:01,489 INFO L273 TraceCheckUtils]: 47: Hoare triple {1825#(<= bAnd_~i~0 1)} assume true; {1825#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:01,489 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 17:07:01,490 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 17:07:01,490 INFO L273 TraceCheckUtils]: 50: Hoare triple {1835#(<= bAnd_~i~0 2)} assume true; {1835#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:01,491 INFO L273 TraceCheckUtils]: 51: Hoare triple {1835#(<= bAnd_~i~0 2)} assume !(~i~0 < 10000); {1679#false} is VALID [2018-11-14 17:07:01,491 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 17:07:01,491 INFO L273 TraceCheckUtils]: 53: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 17:07:01,491 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1679#false} {1678#true} #77#return; {1679#false} is VALID [2018-11-14 17:07:01,491 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 17:07:01,491 INFO L273 TraceCheckUtils]: 56: Hoare triple {1679#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1679#false} is VALID [2018-11-14 17:07:01,492 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 17:07:01,493 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 17:07:01,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:01,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-14 17:07:01,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 17:07:01,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:01,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:07:01,688 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 17:07:01,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:07:01,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:07:01,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:07:01,689 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-14 17:07:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:02,093 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-11-14 17:07:02,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:07:02,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 17:07:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:07:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 17:07:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:07:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 17:07:02,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2018-11-14 17:07:02,222 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 17:07:02,224 INFO L225 Difference]: With dead ends: 73 [2018-11-14 17:07:02,224 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 17:07:02,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:07:02,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 17:07:02,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-14 17:07:02,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:02,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-14 17:07:02,242 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-14 17:07:02,243 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-14 17:07:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:02,245 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 17:07:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 17:07:02,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:02,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:02,246 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-14 17:07:02,246 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-14 17:07:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:02,249 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 17:07:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 17:07:02,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:02,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:02,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:02,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:07:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-14 17:07:02,252 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 58 [2018-11-14 17:07:02,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:02,253 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-14 17:07:02,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:07:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 17:07:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-14 17:07:02,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:02,254 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 17:07:02,255 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:02,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:02,255 INFO L82 PathProgramCache]: Analyzing trace with hash 375282389, now seen corresponding path program 4 times [2018-11-14 17:07:02,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:02,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:02,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:02,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:02,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:02,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 17:07:02,421 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 17:07:02,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:02,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 17:07:02,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret13 := main(); {2121#true} is VALID [2018-11-14 17:07:02,423 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 17:07:02,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {2123#(= main_~i~1 0)} assume true; {2123#(= main_~i~1 0)} is VALID [2018-11-14 17:07:02,424 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 17:07:02,424 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 17:07:02,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {2124#(<= main_~i~1 1)} assume true; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:02,425 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 17:07:02,426 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 17:07:02,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {2125#(<= main_~i~1 2)} assume true; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:02,428 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 17:07:02,429 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 17:07:02,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#(<= main_~i~1 3)} assume true; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:02,461 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 17:07:02,462 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 17:07:02,462 INFO L273 TraceCheckUtils]: 18: Hoare triple {2127#(<= main_~i~1 4)} assume true; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:02,466 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(<= main_~i~1 4)} assume !(~i~1 < 10000); {2122#false} is VALID [2018-11-14 17:07:02,466 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 17:07:02,466 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 17:07:02,466 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:02,466 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 17:07:02,466 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 17:07:02,467 INFO L273 TraceCheckUtils]: 25: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:02,467 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 17:07:02,467 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 17:07:02,467 INFO L273 TraceCheckUtils]: 28: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:02,467 INFO L273 TraceCheckUtils]: 29: Hoare triple {2121#true} assume !(~i~0 < 10000); {2121#true} is VALID [2018-11-14 17:07:02,467 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 17:07:02,467 INFO L273 TraceCheckUtils]: 31: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:02,468 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2121#true} {2122#false} #73#return; {2122#false} is VALID [2018-11-14 17:07:02,468 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 17:07:02,468 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 17:07:02,468 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 17:07:02,468 INFO L273 TraceCheckUtils]: 36: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:02,469 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 17:07:02,469 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 17:07:02,469 INFO L273 TraceCheckUtils]: 39: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:02,469 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 17:07:02,469 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 17:07:02,469 INFO L273 TraceCheckUtils]: 42: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:02,470 INFO L273 TraceCheckUtils]: 43: Hoare triple {2121#true} assume !(~i~0 < 10000); {2121#true} is VALID [2018-11-14 17:07:02,470 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 17:07:02,470 INFO L273 TraceCheckUtils]: 45: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:02,470 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2121#true} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 17:07:02,470 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 17:07:02,471 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,471 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 17:07:02,471 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 17:07:02,471 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,471 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 9999); {2122#false} is VALID [2018-11-14 17:07:02,471 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 17:07:02,472 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 17:07:02,472 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 17:07:02,472 INFO L273 TraceCheckUtils]: 56: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:02,472 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 17:07:02,472 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 17:07:02,472 INFO L273 TraceCheckUtils]: 59: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:02,473 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 17:07:02,473 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 17:07:02,473 INFO L273 TraceCheckUtils]: 62: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:02,473 INFO L273 TraceCheckUtils]: 63: Hoare triple {2121#true} assume !(~i~0 < 10000); {2121#true} is VALID [2018-11-14 17:07:02,473 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 17:07:02,473 INFO L273 TraceCheckUtils]: 65: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:02,474 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2121#true} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 17:07:02,474 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 17:07:02,474 INFO L273 TraceCheckUtils]: 68: Hoare triple {2122#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2122#false} is VALID [2018-11-14 17:07:02,474 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 17:07:02,477 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 17:07:02,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:02,477 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 17:07:02,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:07:02,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:07:02,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:02,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:02,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 17:07:02,666 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 17:07:02,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:02,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 17:07:02,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret13 := main(); {2121#true} is VALID [2018-11-14 17:07:02,668 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 17:07:02,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {2146#(<= main_~i~1 0)} assume true; {2146#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:02,669 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 17:07:02,669 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 17:07:02,670 INFO L273 TraceCheckUtils]: 9: Hoare triple {2124#(<= main_~i~1 1)} assume true; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:02,670 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 17:07:02,671 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 17:07:02,671 INFO L273 TraceCheckUtils]: 12: Hoare triple {2125#(<= main_~i~1 2)} assume true; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:02,672 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 17:07:02,673 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 17:07:02,673 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#(<= main_~i~1 3)} assume true; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:02,674 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 17:07:02,675 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 17:07:02,675 INFO L273 TraceCheckUtils]: 18: Hoare triple {2127#(<= main_~i~1 4)} assume true; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:02,676 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(<= main_~i~1 4)} assume !(~i~1 < 10000); {2122#false} is VALID [2018-11-14 17:07:02,676 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 17:07:02,677 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 17:07:02,677 INFO L273 TraceCheckUtils]: 22: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,677 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 17:07:02,677 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 17:07:02,677 INFO L273 TraceCheckUtils]: 25: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,678 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 17:07:02,678 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 17:07:02,678 INFO L273 TraceCheckUtils]: 28: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,678 INFO L273 TraceCheckUtils]: 29: Hoare triple {2122#false} assume !(~i~0 < 10000); {2122#false} is VALID [2018-11-14 17:07:02,679 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 17:07:02,679 INFO L273 TraceCheckUtils]: 31: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,679 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2122#false} {2122#false} #73#return; {2122#false} is VALID [2018-11-14 17:07:02,679 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 17:07:02,679 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 17:07:02,679 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 17:07:02,679 INFO L273 TraceCheckUtils]: 36: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,680 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 17:07:02,680 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 17:07:02,680 INFO L273 TraceCheckUtils]: 39: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,680 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 17:07:02,680 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 17:07:02,680 INFO L273 TraceCheckUtils]: 42: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,680 INFO L273 TraceCheckUtils]: 43: Hoare triple {2122#false} assume !(~i~0 < 10000); {2122#false} is VALID [2018-11-14 17:07:02,680 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 17:07:02,681 INFO L273 TraceCheckUtils]: 45: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,681 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2122#false} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 17:07:02,681 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 17:07:02,681 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,681 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 17:07:02,681 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 17:07:02,681 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,681 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 9999); {2122#false} is VALID [2018-11-14 17:07:02,682 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 17:07:02,682 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 17:07:02,682 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 17:07:02,682 INFO L273 TraceCheckUtils]: 56: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,682 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 17:07:02,682 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 17:07:02,682 INFO L273 TraceCheckUtils]: 59: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,682 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 17:07:02,683 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 17:07:02,683 INFO L273 TraceCheckUtils]: 62: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,683 INFO L273 TraceCheckUtils]: 63: Hoare triple {2122#false} assume !(~i~0 < 10000); {2122#false} is VALID [2018-11-14 17:07:02,683 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 17:07:02,683 INFO L273 TraceCheckUtils]: 65: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:02,683 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2122#false} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 17:07:02,683 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 17:07:02,684 INFO L273 TraceCheckUtils]: 68: Hoare triple {2122#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2122#false} is VALID [2018-11-14 17:07:02,686 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 17:07:02,689 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 17:07:02,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:02,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 17:07:02,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-14 17:07:02,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:02,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:07:02,808 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 17:07:02,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:07:02,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:07:02,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:07:02,809 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 8 states. [2018-11-14 17:07:03,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:03,050 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-14 17:07:03,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:07:03,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-14 17:07:03,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:07:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-14 17:07:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:07:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-14 17:07:03,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2018-11-14 17:07:03,219 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 17:07:03,221 INFO L225 Difference]: With dead ends: 78 [2018-11-14 17:07:03,221 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 17:07:03,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:07:03,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 17:07:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-14 17:07:03,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:03,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-14 17:07:03,268 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-14 17:07:03,268 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-14 17:07:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:03,272 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 17:07:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 17:07:03,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:03,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:03,273 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-14 17:07:03,273 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-14 17:07:03,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:03,276 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 17:07:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 17:07:03,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:03,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:03,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:03,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 17:07:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-14 17:07:03,279 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 70 [2018-11-14 17:07:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:03,279 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-14 17:07:03,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:07:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-14 17:07:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-14 17:07:03,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:03,280 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 17:07:03,281 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:03,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:03,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1521001423, now seen corresponding path program 5 times [2018-11-14 17:07:03,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:03,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:03,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:03,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:03,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:04,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2018-11-14 17:07:04,111 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 17:07:04,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} #69#return; {2615#true} is VALID [2018-11-14 17:07:04,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {2615#true} call #t~ret13 := main(); {2615#true} is VALID [2018-11-14 17:07:04,112 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 17:07:04,112 INFO L273 TraceCheckUtils]: 6: Hoare triple {2617#(= main_~i~1 0)} assume true; {2617#(= main_~i~1 0)} is VALID [2018-11-14 17:07:04,112 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 17:07:04,113 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 17:07:04,113 INFO L273 TraceCheckUtils]: 9: Hoare triple {2618#(<= main_~i~1 1)} assume true; {2618#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:04,113 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 17:07:04,114 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 17:07:04,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {2619#(<= main_~i~1 2)} assume true; {2619#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:04,115 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 17:07:04,116 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 17:07:04,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {2620#(<= main_~i~1 3)} assume true; {2620#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:04,117 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 17:07:04,118 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 17:07:04,118 INFO L273 TraceCheckUtils]: 18: Hoare triple {2621#(<= main_~i~1 4)} assume true; {2621#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:04,119 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 17:07:04,119 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 17:07:04,120 INFO L273 TraceCheckUtils]: 21: Hoare triple {2622#(<= main_~i~1 5)} assume true; {2622#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:04,124 INFO L273 TraceCheckUtils]: 22: Hoare triple {2622#(<= main_~i~1 5)} assume !(~i~1 < 10000); {2616#false} is VALID [2018-11-14 17:07:04,124 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 17:07:04,124 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 17:07:04,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,125 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 17:07:04,125 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 17:07:04,125 INFO L273 TraceCheckUtils]: 28: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,125 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 17:07:04,126 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 17:07:04,126 INFO L273 TraceCheckUtils]: 31: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,126 INFO L273 TraceCheckUtils]: 32: Hoare triple {2615#true} assume !(~i~0 < 10000); {2615#true} is VALID [2018-11-14 17:07:04,126 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 17:07:04,126 INFO L273 TraceCheckUtils]: 34: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,126 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2615#true} {2616#false} #73#return; {2616#false} is VALID [2018-11-14 17:07:04,126 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 17:07:04,126 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 17:07:04,127 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 17:07:04,127 INFO L273 TraceCheckUtils]: 39: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,127 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 17:07:04,127 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 17:07:04,127 INFO L273 TraceCheckUtils]: 42: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,127 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 17:07:04,127 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 17:07:04,127 INFO L273 TraceCheckUtils]: 45: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,128 INFO L273 TraceCheckUtils]: 46: Hoare triple {2615#true} assume !(~i~0 < 10000); {2615#true} is VALID [2018-11-14 17:07:04,128 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 17:07:04,128 INFO L273 TraceCheckUtils]: 48: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,128 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2615#true} {2616#false} #75#return; {2616#false} is VALID [2018-11-14 17:07:04,128 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 17:07:04,128 INFO L273 TraceCheckUtils]: 51: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:04,128 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 17:07:04,128 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 17:07:04,129 INFO L273 TraceCheckUtils]: 54: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:04,129 INFO L273 TraceCheckUtils]: 55: Hoare triple {2616#false} assume !(~i~2 < 9999); {2616#false} is VALID [2018-11-14 17:07:04,129 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 17:07:04,129 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 17:07:04,129 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 17:07:04,129 INFO L273 TraceCheckUtils]: 59: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,130 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 17:07:04,130 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 17:07:04,130 INFO L273 TraceCheckUtils]: 62: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,130 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 17:07:04,130 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 17:07:04,131 INFO L273 TraceCheckUtils]: 65: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,131 INFO L273 TraceCheckUtils]: 66: Hoare triple {2615#true} assume !(~i~0 < 10000); {2615#true} is VALID [2018-11-14 17:07:04,131 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 17:07:04,131 INFO L273 TraceCheckUtils]: 68: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,131 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {2615#true} {2616#false} #77#return; {2616#false} is VALID [2018-11-14 17:07:04,131 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 17:07:04,132 INFO L273 TraceCheckUtils]: 71: Hoare triple {2616#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2616#false} is VALID [2018-11-14 17:07:04,132 INFO L273 TraceCheckUtils]: 72: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2018-11-14 17:07:04,135 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 17:07:04,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:04,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 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 17:07:04,147 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:07:04,233 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 17:07:04,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:04,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:04,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2018-11-14 17:07:04,484 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 17:07:04,485 INFO L273 TraceCheckUtils]: 2: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,485 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} #69#return; {2615#true} is VALID [2018-11-14 17:07:04,485 INFO L256 TraceCheckUtils]: 4: Hoare triple {2615#true} call #t~ret13 := main(); {2615#true} is VALID [2018-11-14 17:07:04,485 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 17:07:04,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,486 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 17:07:04,486 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 17:07:04,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,486 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 17:07:04,487 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 17:07:04,487 INFO L273 TraceCheckUtils]: 12: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,487 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 17:07:04,487 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 17:07:04,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,488 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 17:07:04,488 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 17:07:04,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,488 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 17:07:04,488 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 17:07:04,488 INFO L273 TraceCheckUtils]: 21: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:04,488 INFO L273 TraceCheckUtils]: 22: Hoare triple {2615#true} assume !(~i~1 < 10000); {2615#true} is VALID [2018-11-14 17:07:04,488 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 17:07:04,489 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 17:07:04,489 INFO L273 TraceCheckUtils]: 25: Hoare triple {2698#(<= bAnd_~i~0 1)} assume true; {2698#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:04,490 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 17:07:04,490 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 17:07:04,491 INFO L273 TraceCheckUtils]: 28: Hoare triple {2708#(<= bAnd_~i~0 2)} assume true; {2708#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:04,491 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 17:07:04,491 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 17:07:04,492 INFO L273 TraceCheckUtils]: 31: Hoare triple {2718#(<= bAnd_~i~0 3)} assume true; {2718#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:04,492 INFO L273 TraceCheckUtils]: 32: Hoare triple {2718#(<= bAnd_~i~0 3)} assume !(~i~0 < 10000); {2616#false} is VALID [2018-11-14 17:07:04,492 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 17:07:04,493 INFO L273 TraceCheckUtils]: 34: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:04,493 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2616#false} {2615#true} #73#return; {2616#false} is VALID [2018-11-14 17:07:04,493 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 17:07:04,493 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 17:07:04,494 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 17:07:04,494 INFO L273 TraceCheckUtils]: 39: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:04,494 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 17:07:04,494 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 17:07:04,495 INFO L273 TraceCheckUtils]: 42: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:04,495 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 17:07:04,495 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 17:07:04,495 INFO L273 TraceCheckUtils]: 45: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:04,495 INFO L273 TraceCheckUtils]: 46: Hoare triple {2616#false} assume !(~i~0 < 10000); {2616#false} is VALID [2018-11-14 17:07:04,496 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 17:07:04,496 INFO L273 TraceCheckUtils]: 48: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:04,496 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2616#false} {2616#false} #75#return; {2616#false} is VALID [2018-11-14 17:07:04,496 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 17:07:04,496 INFO L273 TraceCheckUtils]: 51: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:04,496 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 17:07:04,497 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 17:07:04,497 INFO L273 TraceCheckUtils]: 54: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:04,497 INFO L273 TraceCheckUtils]: 55: Hoare triple {2616#false} assume !(~i~2 < 9999); {2616#false} is VALID [2018-11-14 17:07:04,497 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 17:07:04,497 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 17:07:04,498 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 17:07:04,498 INFO L273 TraceCheckUtils]: 59: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:04,498 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 17:07:04,498 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 17:07:04,498 INFO L273 TraceCheckUtils]: 62: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:04,499 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 17:07:04,499 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 17:07:04,499 INFO L273 TraceCheckUtils]: 65: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:04,499 INFO L273 TraceCheckUtils]: 66: Hoare triple {2616#false} assume !(~i~0 < 10000); {2616#false} is VALID [2018-11-14 17:07:04,499 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 17:07:04,499 INFO L273 TraceCheckUtils]: 68: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:04,500 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {2616#false} {2616#false} #77#return; {2616#false} is VALID [2018-11-14 17:07:04,500 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 17:07:04,500 INFO L273 TraceCheckUtils]: 71: Hoare triple {2616#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2616#false} is VALID [2018-11-14 17:07:04,500 INFO L273 TraceCheckUtils]: 72: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2018-11-14 17:07:04,505 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 17:07:04,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:04,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-14 17:07:04,538 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-11-14 17:07:04,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:04,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:07:04,700 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 17:07:04,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:07:04,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:07:04,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:04,701 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 11 states. [2018-11-14 17:07:05,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:05,446 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2018-11-14 17:07:05,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:07:05,446 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-11-14 17:07:05,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-14 17:07:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-14 17:07:05,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 88 transitions. [2018-11-14 17:07:05,557 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 17:07:05,559 INFO L225 Difference]: With dead ends: 85 [2018-11-14 17:07:05,559 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 17:07:05,560 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:05,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 17:07:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-14 17:07:05,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:05,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-14 17:07:05,578 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-14 17:07:05,578 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-14 17:07:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:05,581 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 17:07:05,581 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 17:07:05,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:05,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:05,582 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-14 17:07:05,582 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-14 17:07:05,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:05,584 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 17:07:05,585 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 17:07:05,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:05,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:05,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:05,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 17:07:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-14 17:07:05,588 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 73 [2018-11-14 17:07:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:05,588 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-14 17:07:05,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:07:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-14 17:07:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-14 17:07:05,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:05,589 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 17:07:05,590 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:05,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:05,590 INFO L82 PathProgramCache]: Analyzing trace with hash -335328825, now seen corresponding path program 6 times [2018-11-14 17:07:05,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:05,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:05,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:05,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:05,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:06,027 INFO L256 TraceCheckUtils]: 0: Hoare triple {3152#true} call ULTIMATE.init(); {3152#true} is VALID [2018-11-14 17:07:06,028 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 17:07:06,028 INFO L273 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,029 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #69#return; {3152#true} is VALID [2018-11-14 17:07:06,029 INFO L256 TraceCheckUtils]: 4: Hoare triple {3152#true} call #t~ret13 := main(); {3152#true} is VALID [2018-11-14 17:07:06,029 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 17:07:06,030 INFO L273 TraceCheckUtils]: 6: Hoare triple {3154#(= main_~i~1 0)} assume true; {3154#(= main_~i~1 0)} is VALID [2018-11-14 17:07:06,030 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 17:07:06,031 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 17:07:06,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {3155#(<= main_~i~1 1)} assume true; {3155#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:06,031 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 17:07:06,032 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 17:07:06,032 INFO L273 TraceCheckUtils]: 12: Hoare triple {3156#(<= main_~i~1 2)} assume true; {3156#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:06,033 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 17:07:06,034 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 17:07:06,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {3157#(<= main_~i~1 3)} assume true; {3157#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:06,035 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 17:07:06,035 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 17:07:06,036 INFO L273 TraceCheckUtils]: 18: Hoare triple {3158#(<= main_~i~1 4)} assume true; {3158#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:06,036 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 17:07:06,037 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 17:07:06,038 INFO L273 TraceCheckUtils]: 21: Hoare triple {3159#(<= main_~i~1 5)} assume true; {3159#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:06,038 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 17:07:06,039 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 17:07:06,040 INFO L273 TraceCheckUtils]: 24: Hoare triple {3160#(<= main_~i~1 6)} assume true; {3160#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:06,040 INFO L273 TraceCheckUtils]: 25: Hoare triple {3160#(<= main_~i~1 6)} assume !(~i~1 < 10000); {3153#false} is VALID [2018-11-14 17:07:06,040 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 17:07:06,041 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 17:07:06,041 INFO L273 TraceCheckUtils]: 28: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,041 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 17:07:06,041 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 17:07:06,042 INFO L273 TraceCheckUtils]: 31: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,042 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 17:07:06,042 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 17:07:06,042 INFO L273 TraceCheckUtils]: 34: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,042 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 17:07:06,043 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 17:07:06,043 INFO L273 TraceCheckUtils]: 37: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,043 INFO L273 TraceCheckUtils]: 38: Hoare triple {3152#true} assume !(~i~0 < 10000); {3152#true} is VALID [2018-11-14 17:07:06,043 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 17:07:06,043 INFO L273 TraceCheckUtils]: 40: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,044 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3152#true} {3153#false} #73#return; {3153#false} is VALID [2018-11-14 17:07:06,044 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 17:07:06,044 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 17:07:06,044 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 17:07:06,044 INFO L273 TraceCheckUtils]: 45: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,044 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 17:07:06,045 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 17:07:06,045 INFO L273 TraceCheckUtils]: 48: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,045 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 17:07:06,045 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 17:07:06,045 INFO L273 TraceCheckUtils]: 51: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,045 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 17:07:06,045 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 17:07:06,045 INFO L273 TraceCheckUtils]: 54: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,046 INFO L273 TraceCheckUtils]: 55: Hoare triple {3152#true} assume !(~i~0 < 10000); {3152#true} is VALID [2018-11-14 17:07:06,046 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 17:07:06,046 INFO L273 TraceCheckUtils]: 57: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,046 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3152#true} {3153#false} #75#return; {3153#false} is VALID [2018-11-14 17:07:06,046 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 17:07:06,046 INFO L273 TraceCheckUtils]: 60: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:06,046 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 17:07:06,046 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 17:07:06,047 INFO L273 TraceCheckUtils]: 63: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:06,047 INFO L273 TraceCheckUtils]: 64: Hoare triple {3153#false} assume !(~i~2 < 9999); {3153#false} is VALID [2018-11-14 17:07:06,047 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 17:07:06,047 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 17:07:06,047 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 17:07:06,047 INFO L273 TraceCheckUtils]: 68: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,047 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 17:07:06,047 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 17:07:06,047 INFO L273 TraceCheckUtils]: 71: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,048 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 17:07:06,048 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 17:07:06,048 INFO L273 TraceCheckUtils]: 74: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,048 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 17:07:06,048 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 17:07:06,048 INFO L273 TraceCheckUtils]: 77: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,048 INFO L273 TraceCheckUtils]: 78: Hoare triple {3152#true} assume !(~i~0 < 10000); {3152#true} is VALID [2018-11-14 17:07:06,048 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 17:07:06,049 INFO L273 TraceCheckUtils]: 80: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,049 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {3152#true} {3153#false} #77#return; {3153#false} is VALID [2018-11-14 17:07:06,049 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 17:07:06,049 INFO L273 TraceCheckUtils]: 83: Hoare triple {3153#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3153#false} is VALID [2018-11-14 17:07:06,049 INFO L273 TraceCheckUtils]: 84: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2018-11-14 17:07:06,052 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 17:07:06,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:06,053 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 17:07:06,061 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:07:06,154 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-14 17:07:06,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:06,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:06,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {3152#true} call ULTIMATE.init(); {3152#true} is VALID [2018-11-14 17:07:06,380 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 17:07:06,380 INFO L273 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,381 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #69#return; {3152#true} is VALID [2018-11-14 17:07:06,381 INFO L256 TraceCheckUtils]: 4: Hoare triple {3152#true} call #t~ret13 := main(); {3152#true} is VALID [2018-11-14 17:07:06,381 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 17:07:06,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,382 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 17:07:06,382 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 17:07:06,382 INFO L273 TraceCheckUtils]: 9: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,382 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 17:07:06,382 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 17:07:06,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,382 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 17:07:06,383 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 17:07:06,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,383 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 17:07:06,383 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 17:07:06,383 INFO L273 TraceCheckUtils]: 18: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,383 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 17:07:06,383 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 17:07:06,383 INFO L273 TraceCheckUtils]: 21: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,384 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 17:07:06,384 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 17:07:06,384 INFO L273 TraceCheckUtils]: 24: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,384 INFO L273 TraceCheckUtils]: 25: Hoare triple {3152#true} assume !(~i~1 < 10000); {3152#true} is VALID [2018-11-14 17:07:06,384 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 17:07:06,384 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 17:07:06,384 INFO L273 TraceCheckUtils]: 28: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,384 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 17:07:06,384 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 17:07:06,385 INFO L273 TraceCheckUtils]: 31: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,385 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 17:07:06,385 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 17:07:06,385 INFO L273 TraceCheckUtils]: 34: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,385 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 17:07:06,385 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 17:07:06,385 INFO L273 TraceCheckUtils]: 37: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,385 INFO L273 TraceCheckUtils]: 38: Hoare triple {3152#true} assume !(~i~0 < 10000); {3152#true} is VALID [2018-11-14 17:07:06,386 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 17:07:06,386 INFO L273 TraceCheckUtils]: 40: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,386 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3152#true} {3152#true} #73#return; {3152#true} is VALID [2018-11-14 17:07:06,386 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 17:07:06,386 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 17:07:06,386 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 17:07:06,386 INFO L273 TraceCheckUtils]: 45: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,386 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 17:07:06,387 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 17:07:06,387 INFO L273 TraceCheckUtils]: 48: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,387 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 17:07:06,387 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 17:07:06,387 INFO L273 TraceCheckUtils]: 51: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,387 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 17:07:06,387 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 17:07:06,388 INFO L273 TraceCheckUtils]: 54: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,388 INFO L273 TraceCheckUtils]: 55: Hoare triple {3152#true} assume !(~i~0 < 10000); {3152#true} is VALID [2018-11-14 17:07:06,388 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 17:07:06,388 INFO L273 TraceCheckUtils]: 57: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:06,388 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3152#true} {3152#true} #75#return; {3152#true} is VALID [2018-11-14 17:07:06,397 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 17:07:06,398 INFO L273 TraceCheckUtils]: 60: Hoare triple {3341#(<= main_~i~2 0)} assume true; {3341#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:06,398 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 17:07:06,399 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 17:07:06,399 INFO L273 TraceCheckUtils]: 63: Hoare triple {3351#(<= main_~i~2 1)} assume true; {3351#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:06,400 INFO L273 TraceCheckUtils]: 64: Hoare triple {3351#(<= main_~i~2 1)} assume !(~i~2 < 9999); {3153#false} is VALID [2018-11-14 17:07:06,400 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 17:07:06,400 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 17:07:06,400 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 17:07:06,400 INFO L273 TraceCheckUtils]: 68: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:06,400 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 17:07:06,400 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 17:07:06,401 INFO L273 TraceCheckUtils]: 71: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:06,401 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 17:07:06,401 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 17:07:06,401 INFO L273 TraceCheckUtils]: 74: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:06,401 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 17:07:06,402 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 17:07:06,402 INFO L273 TraceCheckUtils]: 77: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:06,402 INFO L273 TraceCheckUtils]: 78: Hoare triple {3153#false} assume !(~i~0 < 10000); {3153#false} is VALID [2018-11-14 17:07:06,402 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 17:07:06,403 INFO L273 TraceCheckUtils]: 80: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:06,403 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {3153#false} {3153#false} #77#return; {3153#false} is VALID [2018-11-14 17:07:06,403 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 17:07:06,403 INFO L273 TraceCheckUtils]: 83: Hoare triple {3153#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3153#false} is VALID [2018-11-14 17:07:06,404 INFO L273 TraceCheckUtils]: 84: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2018-11-14 17:07:06,407 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 17:07:06,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:06,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-14 17:07:06,430 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-14 17:07:06,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:06,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:07:06,529 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 17:07:06,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:07:06,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:07:06,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:06,530 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 11 states. [2018-11-14 17:07:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:06,867 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-14 17:07:06,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:07:06,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-14 17:07:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-14 17:07:06,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-14 17:07:06,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 85 transitions. [2018-11-14 17:07:06,981 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 17:07:06,983 INFO L225 Difference]: With dead ends: 94 [2018-11-14 17:07:06,983 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 17:07:06,984 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:06,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 17:07:07,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-14 17:07:07,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:07,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 62 states. [2018-11-14 17:07:07,010 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 62 states. [2018-11-14 17:07:07,010 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 62 states. [2018-11-14 17:07:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:07,012 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-14 17:07:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-14 17:07:07,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:07,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:07,012 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 64 states. [2018-11-14 17:07:07,013 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 64 states. [2018-11-14 17:07:07,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:07,014 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-14 17:07:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-14 17:07:07,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:07,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:07,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:07,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 17:07:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-11-14 17:07:07,017 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 85 [2018-11-14 17:07:07,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:07,017 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-11-14 17:07:07,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:07:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-14 17:07:07,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-14 17:07:07,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:07,019 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 17:07:07,019 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:07,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:07,019 INFO L82 PathProgramCache]: Analyzing trace with hash 318027935, now seen corresponding path program 7 times [2018-11-14 17:07:07,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:07,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:07,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:07,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:07,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:07,187 INFO L256 TraceCheckUtils]: 0: Hoare triple {3757#true} call ULTIMATE.init(); {3757#true} is VALID [2018-11-14 17:07:07,187 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 17:07:07,188 INFO L273 TraceCheckUtils]: 2: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,188 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3757#true} {3757#true} #69#return; {3757#true} is VALID [2018-11-14 17:07:07,188 INFO L256 TraceCheckUtils]: 4: Hoare triple {3757#true} call #t~ret13 := main(); {3757#true} is VALID [2018-11-14 17:07:07,189 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 17:07:07,189 INFO L273 TraceCheckUtils]: 6: Hoare triple {3759#(= main_~i~1 0)} assume true; {3759#(= main_~i~1 0)} is VALID [2018-11-14 17:07:07,190 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 17:07:07,191 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 17:07:07,191 INFO L273 TraceCheckUtils]: 9: Hoare triple {3760#(<= main_~i~1 1)} assume true; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:07,192 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 17:07:07,193 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 17:07:07,193 INFO L273 TraceCheckUtils]: 12: Hoare triple {3761#(<= main_~i~1 2)} assume true; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:07,194 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 17:07:07,194 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 17:07:07,195 INFO L273 TraceCheckUtils]: 15: Hoare triple {3762#(<= main_~i~1 3)} assume true; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:07,195 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 17:07:07,196 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 17:07:07,197 INFO L273 TraceCheckUtils]: 18: Hoare triple {3763#(<= main_~i~1 4)} assume true; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:07,197 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 17:07:07,198 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 17:07:07,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {3764#(<= main_~i~1 5)} assume true; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:07,199 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 17:07:07,200 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 17:07:07,200 INFO L273 TraceCheckUtils]: 24: Hoare triple {3765#(<= main_~i~1 6)} assume true; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:07,201 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 17:07:07,202 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 17:07:07,202 INFO L273 TraceCheckUtils]: 27: Hoare triple {3766#(<= main_~i~1 7)} assume true; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:07,203 INFO L273 TraceCheckUtils]: 28: Hoare triple {3766#(<= main_~i~1 7)} assume !(~i~1 < 10000); {3758#false} is VALID [2018-11-14 17:07:07,203 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 17:07:07,203 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 17:07:07,204 INFO L273 TraceCheckUtils]: 31: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,204 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 17:07:07,204 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 17:07:07,204 INFO L273 TraceCheckUtils]: 34: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,204 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 17:07:07,205 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 17:07:07,205 INFO L273 TraceCheckUtils]: 37: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,205 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 17:07:07,205 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 17:07:07,205 INFO L273 TraceCheckUtils]: 40: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,206 INFO L273 TraceCheckUtils]: 41: Hoare triple {3757#true} assume !(~i~0 < 10000); {3757#true} is VALID [2018-11-14 17:07:07,206 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 17:07:07,206 INFO L273 TraceCheckUtils]: 43: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,206 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3757#true} {3758#false} #73#return; {3758#false} is VALID [2018-11-14 17:07:07,206 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 17:07:07,206 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 17:07:07,206 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 17:07:07,206 INFO L273 TraceCheckUtils]: 48: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,206 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 17:07:07,207 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 17:07:07,207 INFO L273 TraceCheckUtils]: 51: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,207 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 17:07:07,207 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 17:07:07,207 INFO L273 TraceCheckUtils]: 54: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,207 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 17:07:07,207 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 17:07:07,207 INFO L273 TraceCheckUtils]: 57: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,208 INFO L273 TraceCheckUtils]: 58: Hoare triple {3757#true} assume !(~i~0 < 10000); {3757#true} is VALID [2018-11-14 17:07:07,208 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 17:07:07,208 INFO L273 TraceCheckUtils]: 60: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,208 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3757#true} {3758#false} #75#return; {3758#false} is VALID [2018-11-14 17:07:07,208 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 17:07:07,208 INFO L273 TraceCheckUtils]: 63: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,208 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 17:07:07,208 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 17:07:07,209 INFO L273 TraceCheckUtils]: 66: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,209 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 17:07:07,209 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 17:07:07,209 INFO L273 TraceCheckUtils]: 69: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,209 INFO L273 TraceCheckUtils]: 70: Hoare triple {3758#false} assume !(~i~2 < 9999); {3758#false} is VALID [2018-11-14 17:07:07,209 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 17:07:07,209 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 17:07:07,209 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 17:07:07,210 INFO L273 TraceCheckUtils]: 74: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,210 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 17:07:07,210 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 17:07:07,210 INFO L273 TraceCheckUtils]: 77: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,210 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 17:07:07,210 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 17:07:07,210 INFO L273 TraceCheckUtils]: 80: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,210 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 17:07:07,210 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 17:07:07,211 INFO L273 TraceCheckUtils]: 83: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,211 INFO L273 TraceCheckUtils]: 84: Hoare triple {3757#true} assume !(~i~0 < 10000); {3757#true} is VALID [2018-11-14 17:07:07,211 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 17:07:07,211 INFO L273 TraceCheckUtils]: 86: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,211 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3757#true} {3758#false} #77#return; {3758#false} is VALID [2018-11-14 17:07:07,211 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 17:07:07,211 INFO L273 TraceCheckUtils]: 89: Hoare triple {3758#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3758#false} is VALID [2018-11-14 17:07:07,211 INFO L273 TraceCheckUtils]: 90: Hoare triple {3758#false} assume !false; {3758#false} is VALID [2018-11-14 17:07:07,216 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 17:07:07,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:07,217 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 17:07:07,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:07,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:07,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {3757#true} call ULTIMATE.init(); {3757#true} is VALID [2018-11-14 17:07:07,432 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 17:07:07,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:07,432 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3757#true} {3757#true} #69#return; {3757#true} is VALID [2018-11-14 17:07:07,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {3757#true} call #t~ret13 := main(); {3757#true} is VALID [2018-11-14 17:07:07,434 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 17:07:07,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {3785#(<= main_~i~1 0)} assume true; {3785#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:07,435 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 17:07:07,435 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 17:07:07,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {3760#(<= main_~i~1 1)} assume true; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:07,436 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 17:07:07,437 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 17:07:07,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {3761#(<= main_~i~1 2)} assume true; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:07,438 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 17:07:07,439 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 17:07:07,439 INFO L273 TraceCheckUtils]: 15: Hoare triple {3762#(<= main_~i~1 3)} assume true; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:07,440 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 17:07:07,441 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 17:07:07,442 INFO L273 TraceCheckUtils]: 18: Hoare triple {3763#(<= main_~i~1 4)} assume true; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:07,442 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 17:07:07,443 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 17:07:07,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {3764#(<= main_~i~1 5)} assume true; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:07,444 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 17:07:07,445 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 17:07:07,446 INFO L273 TraceCheckUtils]: 24: Hoare triple {3765#(<= main_~i~1 6)} assume true; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:07,446 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 17:07:07,447 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 17:07:07,448 INFO L273 TraceCheckUtils]: 27: Hoare triple {3766#(<= main_~i~1 7)} assume true; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:07,449 INFO L273 TraceCheckUtils]: 28: Hoare triple {3766#(<= main_~i~1 7)} assume !(~i~1 < 10000); {3758#false} is VALID [2018-11-14 17:07:07,449 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 17:07:07,449 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 17:07:07,450 INFO L273 TraceCheckUtils]: 31: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,450 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 17:07:07,450 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 17:07:07,450 INFO L273 TraceCheckUtils]: 34: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,451 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 17:07:07,451 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 17:07:07,451 INFO L273 TraceCheckUtils]: 37: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,451 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 17:07:07,452 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 17:07:07,452 INFO L273 TraceCheckUtils]: 40: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,452 INFO L273 TraceCheckUtils]: 41: Hoare triple {3758#false} assume !(~i~0 < 10000); {3758#false} is VALID [2018-11-14 17:07:07,452 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 17:07:07,453 INFO L273 TraceCheckUtils]: 43: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,453 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3758#false} {3758#false} #73#return; {3758#false} is VALID [2018-11-14 17:07:07,453 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 17:07:07,454 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 17:07:07,454 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 17:07:07,454 INFO L273 TraceCheckUtils]: 48: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,454 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 17:07:07,454 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 17:07:07,454 INFO L273 TraceCheckUtils]: 51: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,455 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 17:07:07,455 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 17:07:07,455 INFO L273 TraceCheckUtils]: 54: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,455 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 17:07:07,455 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 17:07:07,455 INFO L273 TraceCheckUtils]: 57: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,455 INFO L273 TraceCheckUtils]: 58: Hoare triple {3758#false} assume !(~i~0 < 10000); {3758#false} is VALID [2018-11-14 17:07:07,456 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 17:07:07,456 INFO L273 TraceCheckUtils]: 60: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,456 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3758#false} {3758#false} #75#return; {3758#false} is VALID [2018-11-14 17:07:07,456 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 17:07:07,456 INFO L273 TraceCheckUtils]: 63: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,456 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 17:07:07,457 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 17:07:07,457 INFO L273 TraceCheckUtils]: 66: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,457 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 17:07:07,457 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 17:07:07,457 INFO L273 TraceCheckUtils]: 69: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,457 INFO L273 TraceCheckUtils]: 70: Hoare triple {3758#false} assume !(~i~2 < 9999); {3758#false} is VALID [2018-11-14 17:07:07,457 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 17:07:07,458 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 17:07:07,458 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 17:07:07,458 INFO L273 TraceCheckUtils]: 74: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,458 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 17:07:07,458 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 17:07:07,458 INFO L273 TraceCheckUtils]: 77: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,458 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 17:07:07,458 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 17:07:07,459 INFO L273 TraceCheckUtils]: 80: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,459 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 17:07:07,459 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 17:07:07,459 INFO L273 TraceCheckUtils]: 83: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,459 INFO L273 TraceCheckUtils]: 84: Hoare triple {3758#false} assume !(~i~0 < 10000); {3758#false} is VALID [2018-11-14 17:07:07,459 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 17:07:07,459 INFO L273 TraceCheckUtils]: 86: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:07,459 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3758#false} {3758#false} #77#return; {3758#false} is VALID [2018-11-14 17:07:07,460 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 17:07:07,460 INFO L273 TraceCheckUtils]: 89: Hoare triple {3758#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3758#false} is VALID [2018-11-14 17:07:07,460 INFO L273 TraceCheckUtils]: 90: Hoare triple {3758#false} assume !false; {3758#false} is VALID [2018-11-14 17:07:07,463 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 17:07:07,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:07,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 17:07:07,486 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-11-14 17:07:07,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:07,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:07:07,554 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 17:07:07,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:07:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:07:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:07,555 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 11 states. [2018-11-14 17:07:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:07,893 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-11-14 17:07:07,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:07:07,893 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-11-14 17:07:07,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:07,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:07,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-14 17:07:07,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-14 17:07:07,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2018-11-14 17:07:07,971 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 17:07:07,973 INFO L225 Difference]: With dead ends: 99 [2018-11-14 17:07:07,973 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 17:07:07,974 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 17:07:07,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 17:07:08,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-14 17:07:08,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:08,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-14 17:07:08,075 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-14 17:07:08,076 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-14 17:07:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:08,077 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 17:07:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 17:07:08,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:08,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:08,078 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-14 17:07:08,078 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-14 17:07:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:08,080 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 17:07:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 17:07:08,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:08,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:08,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:08,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 17:07:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-14 17:07:08,083 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 91 [2018-11-14 17:07:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:08,084 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-14 17:07:08,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:07:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-14 17:07:08,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-14 17:07:08,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:08,085 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 17:07:08,085 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:08,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:08,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1006612453, now seen corresponding path program 8 times [2018-11-14 17:07:08,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:08,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:08,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:08,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:08,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:08,437 INFO L256 TraceCheckUtils]: 0: Hoare triple {4395#true} call ULTIMATE.init(); {4395#true} is VALID [2018-11-14 17:07:08,438 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 17:07:08,438 INFO L273 TraceCheckUtils]: 2: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,439 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4395#true} {4395#true} #69#return; {4395#true} is VALID [2018-11-14 17:07:08,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {4395#true} call #t~ret13 := main(); {4395#true} is VALID [2018-11-14 17:07:08,440 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 17:07:08,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {4397#(= main_~i~1 0)} assume true; {4397#(= main_~i~1 0)} is VALID [2018-11-14 17:07:08,441 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 17:07:08,441 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 17:07:08,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {4398#(<= main_~i~1 1)} assume true; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:08,442 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 17:07:08,443 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 17:07:08,443 INFO L273 TraceCheckUtils]: 12: Hoare triple {4399#(<= main_~i~1 2)} assume true; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:08,444 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 17:07:08,444 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 17:07:08,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {4400#(<= main_~i~1 3)} assume true; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:08,445 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 17:07:08,446 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 17:07:08,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {4401#(<= main_~i~1 4)} assume true; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:08,447 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 17:07:08,448 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 17:07:08,448 INFO L273 TraceCheckUtils]: 21: Hoare triple {4402#(<= main_~i~1 5)} assume true; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:08,449 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 17:07:08,450 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 17:07:08,451 INFO L273 TraceCheckUtils]: 24: Hoare triple {4403#(<= main_~i~1 6)} assume true; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:08,451 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 17:07:08,452 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 17:07:08,453 INFO L273 TraceCheckUtils]: 27: Hoare triple {4404#(<= main_~i~1 7)} assume true; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:08,453 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 17:07:08,454 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 17:07:08,455 INFO L273 TraceCheckUtils]: 30: Hoare triple {4405#(<= main_~i~1 8)} assume true; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:08,456 INFO L273 TraceCheckUtils]: 31: Hoare triple {4405#(<= main_~i~1 8)} assume !(~i~1 < 10000); {4396#false} is VALID [2018-11-14 17:07:08,456 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 17:07:08,456 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 17:07:08,456 INFO L273 TraceCheckUtils]: 34: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,457 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 17:07:08,457 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 17:07:08,457 INFO L273 TraceCheckUtils]: 37: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,458 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 17:07:08,458 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 17:07:08,458 INFO L273 TraceCheckUtils]: 40: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,458 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 17:07:08,458 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 17:07:08,458 INFO L273 TraceCheckUtils]: 43: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,459 INFO L273 TraceCheckUtils]: 44: Hoare triple {4395#true} assume !(~i~0 < 10000); {4395#true} is VALID [2018-11-14 17:07:08,459 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 17:07:08,459 INFO L273 TraceCheckUtils]: 46: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,459 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4395#true} {4396#false} #73#return; {4396#false} is VALID [2018-11-14 17:07:08,459 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 17:07:08,459 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 17:07:08,459 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 17:07:08,460 INFO L273 TraceCheckUtils]: 51: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,460 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 17:07:08,460 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 17:07:08,460 INFO L273 TraceCheckUtils]: 54: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,460 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 17:07:08,460 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 17:07:08,461 INFO L273 TraceCheckUtils]: 57: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,461 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 17:07:08,461 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 17:07:08,461 INFO L273 TraceCheckUtils]: 60: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,461 INFO L273 TraceCheckUtils]: 61: Hoare triple {4395#true} assume !(~i~0 < 10000); {4395#true} is VALID [2018-11-14 17:07:08,461 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 17:07:08,461 INFO L273 TraceCheckUtils]: 63: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,462 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {4395#true} {4396#false} #75#return; {4396#false} is VALID [2018-11-14 17:07:08,462 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 17:07:08,462 INFO L273 TraceCheckUtils]: 66: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,462 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 17:07:08,462 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 17:07:08,462 INFO L273 TraceCheckUtils]: 69: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,463 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 17:07:08,463 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 17:07:08,463 INFO L273 TraceCheckUtils]: 72: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,463 INFO L273 TraceCheckUtils]: 73: Hoare triple {4396#false} assume !(~i~2 < 9999); {4396#false} is VALID [2018-11-14 17:07:08,463 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 17:07:08,463 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 17:07:08,463 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 17:07:08,464 INFO L273 TraceCheckUtils]: 77: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,464 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 17:07:08,464 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 17:07:08,464 INFO L273 TraceCheckUtils]: 80: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,464 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 17:07:08,464 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 17:07:08,464 INFO L273 TraceCheckUtils]: 83: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,465 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 17:07:08,465 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 17:07:08,465 INFO L273 TraceCheckUtils]: 86: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,465 INFO L273 TraceCheckUtils]: 87: Hoare triple {4395#true} assume !(~i~0 < 10000); {4395#true} is VALID [2018-11-14 17:07:08,465 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 17:07:08,465 INFO L273 TraceCheckUtils]: 89: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,466 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {4395#true} {4396#false} #77#return; {4396#false} is VALID [2018-11-14 17:07:08,466 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 17:07:08,466 INFO L273 TraceCheckUtils]: 92: Hoare triple {4396#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4396#false} is VALID [2018-11-14 17:07:08,466 INFO L273 TraceCheckUtils]: 93: Hoare triple {4396#false} assume !false; {4396#false} is VALID [2018-11-14 17:07:08,474 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 17:07:08,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:08,475 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 17:07:08,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:07:08,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:07:08,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:08,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:08,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {4395#true} call ULTIMATE.init(); {4395#true} is VALID [2018-11-14 17:07:08,702 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 17:07:08,702 INFO L273 TraceCheckUtils]: 2: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:08,703 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4395#true} {4395#true} #69#return; {4395#true} is VALID [2018-11-14 17:07:08,703 INFO L256 TraceCheckUtils]: 4: Hoare triple {4395#true} call #t~ret13 := main(); {4395#true} is VALID [2018-11-14 17:07:08,704 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 17:07:08,704 INFO L273 TraceCheckUtils]: 6: Hoare triple {4424#(<= main_~i~1 0)} assume true; {4424#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:08,705 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 17:07:08,705 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 17:07:08,706 INFO L273 TraceCheckUtils]: 9: Hoare triple {4398#(<= main_~i~1 1)} assume true; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:08,706 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 17:07:08,707 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 17:07:08,707 INFO L273 TraceCheckUtils]: 12: Hoare triple {4399#(<= main_~i~1 2)} assume true; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:08,707 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 17:07:08,708 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 17:07:08,709 INFO L273 TraceCheckUtils]: 15: Hoare triple {4400#(<= main_~i~1 3)} assume true; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:08,710 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 17:07:08,710 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 17:07:08,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {4401#(<= main_~i~1 4)} assume true; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:08,712 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 17:07:08,713 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 17:07:08,713 INFO L273 TraceCheckUtils]: 21: Hoare triple {4402#(<= main_~i~1 5)} assume true; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:08,714 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 17:07:08,715 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 17:07:08,715 INFO L273 TraceCheckUtils]: 24: Hoare triple {4403#(<= main_~i~1 6)} assume true; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:08,716 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 17:07:08,717 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 17:07:08,718 INFO L273 TraceCheckUtils]: 27: Hoare triple {4404#(<= main_~i~1 7)} assume true; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:08,718 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 17:07:08,719 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 17:07:08,720 INFO L273 TraceCheckUtils]: 30: Hoare triple {4405#(<= main_~i~1 8)} assume true; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:08,720 INFO L273 TraceCheckUtils]: 31: Hoare triple {4405#(<= main_~i~1 8)} assume !(~i~1 < 10000); {4396#false} is VALID [2018-11-14 17:07:08,721 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 17:07:08,721 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 17:07:08,721 INFO L273 TraceCheckUtils]: 34: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,722 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 17:07:08,722 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 17:07:08,722 INFO L273 TraceCheckUtils]: 37: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,722 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 17:07:08,723 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 17:07:08,723 INFO L273 TraceCheckUtils]: 40: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,723 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 17:07:08,723 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 17:07:08,724 INFO L273 TraceCheckUtils]: 43: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,724 INFO L273 TraceCheckUtils]: 44: Hoare triple {4396#false} assume !(~i~0 < 10000); {4396#false} is VALID [2018-11-14 17:07:08,724 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 17:07:08,724 INFO L273 TraceCheckUtils]: 46: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,725 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4396#false} {4396#false} #73#return; {4396#false} is VALID [2018-11-14 17:07:08,725 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 17:07:08,725 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 17:07:08,725 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 17:07:08,726 INFO L273 TraceCheckUtils]: 51: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,726 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 17:07:08,726 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 17:07:08,726 INFO L273 TraceCheckUtils]: 54: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,726 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 17:07:08,726 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 17:07:08,726 INFO L273 TraceCheckUtils]: 57: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,727 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 17:07:08,727 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 17:07:08,727 INFO L273 TraceCheckUtils]: 60: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,727 INFO L273 TraceCheckUtils]: 61: Hoare triple {4396#false} assume !(~i~0 < 10000); {4396#false} is VALID [2018-11-14 17:07:08,727 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 17:07:08,727 INFO L273 TraceCheckUtils]: 63: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,727 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {4396#false} {4396#false} #75#return; {4396#false} is VALID [2018-11-14 17:07:08,728 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 17:07:08,728 INFO L273 TraceCheckUtils]: 66: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,728 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 17:07:08,728 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 17:07:08,728 INFO L273 TraceCheckUtils]: 69: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,728 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 17:07:08,729 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 17:07:08,729 INFO L273 TraceCheckUtils]: 72: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,729 INFO L273 TraceCheckUtils]: 73: Hoare triple {4396#false} assume !(~i~2 < 9999); {4396#false} is VALID [2018-11-14 17:07:08,729 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 17:07:08,729 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 17:07:08,729 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 17:07:08,729 INFO L273 TraceCheckUtils]: 77: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,730 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 17:07:08,730 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 17:07:08,730 INFO L273 TraceCheckUtils]: 80: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,730 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 17:07:08,730 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 17:07:08,730 INFO L273 TraceCheckUtils]: 83: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,730 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 17:07:08,731 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 17:07:08,731 INFO L273 TraceCheckUtils]: 86: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,731 INFO L273 TraceCheckUtils]: 87: Hoare triple {4396#false} assume !(~i~0 < 10000); {4396#false} is VALID [2018-11-14 17:07:08,731 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 17:07:08,731 INFO L273 TraceCheckUtils]: 89: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:08,731 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {4396#false} {4396#false} #77#return; {4396#false} is VALID [2018-11-14 17:07:08,732 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 17:07:08,732 INFO L273 TraceCheckUtils]: 92: Hoare triple {4396#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4396#false} is VALID [2018-11-14 17:07:08,732 INFO L273 TraceCheckUtils]: 93: Hoare triple {4396#false} assume !false; {4396#false} is VALID [2018-11-14 17:07:08,740 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 17:07:08,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:08,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 17:07:08,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-14 17:07:08,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:08,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:07:08,880 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 17:07:08,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:07:08,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:07:08,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:07:08,882 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 12 states. [2018-11-14 17:07:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:09,432 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-11-14 17:07:09,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:07:09,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-14 17:07:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:07:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-14 17:07:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:07:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-14 17:07:09,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 84 transitions. [2018-11-14 17:07:09,592 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 17:07:09,594 INFO L225 Difference]: With dead ends: 102 [2018-11-14 17:07:09,595 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 17:07:09,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:07:09,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 17:07:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-14 17:07:09,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:09,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2018-11-14 17:07:09,667 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2018-11-14 17:07:09,667 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2018-11-14 17:07:09,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:09,670 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 17:07:09,670 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 17:07:09,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:09,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:09,670 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2018-11-14 17:07:09,670 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2018-11-14 17:07:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:09,673 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 17:07:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 17:07:09,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:09,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:09,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:09,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 17:07:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-14 17:07:09,675 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 94 [2018-11-14 17:07:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:09,675 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-14 17:07:09,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:07:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 17:07:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-14 17:07:09,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:09,677 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 17:07:09,677 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:09,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:09,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1864182495, now seen corresponding path program 9 times [2018-11-14 17:07:09,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:09,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:09,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:09,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:09,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:09,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {5057#true} call ULTIMATE.init(); {5057#true} is VALID [2018-11-14 17:07:09,871 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 17:07:09,872 INFO L273 TraceCheckUtils]: 2: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5057#true} {5057#true} #69#return; {5057#true} is VALID [2018-11-14 17:07:09,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {5057#true} call #t~ret13 := main(); {5057#true} is VALID [2018-11-14 17:07:09,872 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 17:07:09,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {5059#(= main_~i~1 0)} assume true; {5059#(= main_~i~1 0)} is VALID [2018-11-14 17:07:09,873 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 17:07:09,873 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 17:07:09,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {5060#(<= main_~i~1 1)} assume true; {5060#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:09,874 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 17:07:09,874 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 17:07:09,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {5061#(<= main_~i~1 2)} assume true; {5061#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:09,875 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 17:07:09,875 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 17:07:09,876 INFO L273 TraceCheckUtils]: 15: Hoare triple {5062#(<= main_~i~1 3)} assume true; {5062#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:09,876 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 17:07:09,877 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 17:07:09,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {5063#(<= main_~i~1 4)} assume true; {5063#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:09,878 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 17:07:09,879 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 17:07:09,879 INFO L273 TraceCheckUtils]: 21: Hoare triple {5064#(<= main_~i~1 5)} assume true; {5064#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:09,880 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 17:07:09,880 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 17:07:09,881 INFO L273 TraceCheckUtils]: 24: Hoare triple {5065#(<= main_~i~1 6)} assume true; {5065#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:09,900 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 17:07:09,901 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 17:07:09,901 INFO L273 TraceCheckUtils]: 27: Hoare triple {5066#(<= main_~i~1 7)} assume true; {5066#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:09,901 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 17:07:09,902 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 17:07:09,902 INFO L273 TraceCheckUtils]: 30: Hoare triple {5067#(<= main_~i~1 8)} assume true; {5067#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:09,902 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 17:07:09,903 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 17:07:09,904 INFO L273 TraceCheckUtils]: 33: Hoare triple {5068#(<= main_~i~1 9)} assume true; {5068#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:09,904 INFO L273 TraceCheckUtils]: 34: Hoare triple {5068#(<= main_~i~1 9)} assume !(~i~1 < 10000); {5058#false} is VALID [2018-11-14 17:07:09,904 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 17:07:09,905 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 17:07:09,905 INFO L273 TraceCheckUtils]: 37: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,905 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 17:07:09,905 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 17:07:09,905 INFO L273 TraceCheckUtils]: 40: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,906 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 17:07:09,906 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 17:07:09,906 INFO L273 TraceCheckUtils]: 43: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,906 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 17:07:09,906 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 17:07:09,907 INFO L273 TraceCheckUtils]: 46: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,907 INFO L273 TraceCheckUtils]: 47: Hoare triple {5057#true} assume !(~i~0 < 10000); {5057#true} is VALID [2018-11-14 17:07:09,907 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 17:07:09,907 INFO L273 TraceCheckUtils]: 49: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,907 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5057#true} {5058#false} #73#return; {5058#false} is VALID [2018-11-14 17:07:09,908 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 17:07:09,908 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 17:07:09,908 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 17:07:09,908 INFO L273 TraceCheckUtils]: 54: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,908 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 17:07:09,908 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 17:07:09,908 INFO L273 TraceCheckUtils]: 57: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,908 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 17:07:09,909 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 17:07:09,909 INFO L273 TraceCheckUtils]: 60: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,909 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 17:07:09,909 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 17:07:09,909 INFO L273 TraceCheckUtils]: 63: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,909 INFO L273 TraceCheckUtils]: 64: Hoare triple {5057#true} assume !(~i~0 < 10000); {5057#true} is VALID [2018-11-14 17:07:09,909 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 17:07:09,909 INFO L273 TraceCheckUtils]: 66: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,909 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5057#true} {5058#false} #75#return; {5058#false} is VALID [2018-11-14 17:07:09,910 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 17:07:09,910 INFO L273 TraceCheckUtils]: 69: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:07:09,910 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 17:07:09,910 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 17:07:09,910 INFO L273 TraceCheckUtils]: 72: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:07:09,910 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 17:07:09,910 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 17:07:09,910 INFO L273 TraceCheckUtils]: 75: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:07:09,911 INFO L273 TraceCheckUtils]: 76: Hoare triple {5058#false} assume !(~i~2 < 9999); {5058#false} is VALID [2018-11-14 17:07:09,911 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 17:07:09,911 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 17:07:09,911 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 17:07:09,911 INFO L273 TraceCheckUtils]: 80: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,911 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 17:07:09,911 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 17:07:09,912 INFO L273 TraceCheckUtils]: 83: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,912 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 17:07:09,912 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 17:07:09,912 INFO L273 TraceCheckUtils]: 86: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,912 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 17:07:09,912 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 17:07:09,912 INFO L273 TraceCheckUtils]: 89: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,912 INFO L273 TraceCheckUtils]: 90: Hoare triple {5057#true} assume !(~i~0 < 10000); {5057#true} is VALID [2018-11-14 17:07:09,912 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 17:07:09,913 INFO L273 TraceCheckUtils]: 92: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:09,913 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {5057#true} {5058#false} #77#return; {5058#false} is VALID [2018-11-14 17:07:09,913 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 17:07:09,913 INFO L273 TraceCheckUtils]: 95: Hoare triple {5058#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5058#false} is VALID [2018-11-14 17:07:09,913 INFO L273 TraceCheckUtils]: 96: Hoare triple {5058#false} assume !false; {5058#false} is VALID [2018-11-14 17:07:09,917 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 17:07:09,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:09,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:07:09,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:07:09,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 17:07:09,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:09,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:10,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {5057#true} call ULTIMATE.init(); {5057#true} is VALID [2018-11-14 17:07:10,103 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 17:07:10,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5057#true} {5057#true} #69#return; {5057#true} is VALID [2018-11-14 17:07:10,104 INFO L256 TraceCheckUtils]: 4: Hoare triple {5057#true} call #t~ret13 := main(); {5057#true} is VALID [2018-11-14 17:07:10,104 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 17:07:10,104 INFO L273 TraceCheckUtils]: 6: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,105 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 17:07:10,105 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 17:07:10,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,105 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 17:07:10,105 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 17:07:10,106 INFO L273 TraceCheckUtils]: 12: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,106 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 17:07:10,106 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 17:07:10,106 INFO L273 TraceCheckUtils]: 15: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,106 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 17:07:10,106 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 17:07:10,106 INFO L273 TraceCheckUtils]: 18: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,107 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 17:07:10,107 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 17:07:10,107 INFO L273 TraceCheckUtils]: 21: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,107 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 17:07:10,107 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 17:07:10,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,107 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 17:07:10,107 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 17:07:10,108 INFO L273 TraceCheckUtils]: 27: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,108 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 17:07:10,108 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 17:07:10,108 INFO L273 TraceCheckUtils]: 30: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,108 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 17:07:10,108 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 17:07:10,108 INFO L273 TraceCheckUtils]: 33: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,108 INFO L273 TraceCheckUtils]: 34: Hoare triple {5057#true} assume !(~i~1 < 10000); {5057#true} is VALID [2018-11-14 17:07:10,109 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 17:07:10,109 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 17:07:10,109 INFO L273 TraceCheckUtils]: 37: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,109 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 17:07:10,109 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 17:07:10,109 INFO L273 TraceCheckUtils]: 40: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,109 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 17:07:10,109 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 17:07:10,109 INFO L273 TraceCheckUtils]: 43: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,110 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 17:07:10,110 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 17:07:10,110 INFO L273 TraceCheckUtils]: 46: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,110 INFO L273 TraceCheckUtils]: 47: Hoare triple {5057#true} assume !(~i~0 < 10000); {5057#true} is VALID [2018-11-14 17:07:10,110 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 17:07:10,110 INFO L273 TraceCheckUtils]: 49: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,110 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5057#true} {5057#true} #73#return; {5057#true} is VALID [2018-11-14 17:07:10,110 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 17:07:10,111 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 17:07:10,111 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 17:07:10,111 INFO L273 TraceCheckUtils]: 54: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,111 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 17:07:10,111 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 17:07:10,111 INFO L273 TraceCheckUtils]: 57: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,111 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 17:07:10,111 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 17:07:10,112 INFO L273 TraceCheckUtils]: 60: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,112 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 17:07:10,112 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 17:07:10,112 INFO L273 TraceCheckUtils]: 63: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,112 INFO L273 TraceCheckUtils]: 64: Hoare triple {5057#true} assume !(~i~0 < 10000); {5057#true} is VALID [2018-11-14 17:07:10,112 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 17:07:10,112 INFO L273 TraceCheckUtils]: 66: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,112 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5057#true} {5057#true} #75#return; {5057#true} is VALID [2018-11-14 17:07:10,112 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 17:07:10,113 INFO L273 TraceCheckUtils]: 69: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,113 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 17:07:10,113 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 17:07:10,113 INFO L273 TraceCheckUtils]: 72: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,113 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 17:07:10,113 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 17:07:10,113 INFO L273 TraceCheckUtils]: 75: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:10,113 INFO L273 TraceCheckUtils]: 76: Hoare triple {5057#true} assume !(~i~2 < 9999); {5057#true} is VALID [2018-11-14 17:07:10,114 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 17:07:10,114 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 17:07:10,114 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 17:07:10,114 INFO L273 TraceCheckUtils]: 80: Hoare triple {5309#(<= bAnd_~i~0 1)} assume true; {5309#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:10,115 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 17:07:10,115 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 17:07:10,116 INFO L273 TraceCheckUtils]: 83: Hoare triple {5319#(<= bAnd_~i~0 2)} assume true; {5319#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:10,116 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 17:07:10,116 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 17:07:10,117 INFO L273 TraceCheckUtils]: 86: Hoare triple {5329#(<= bAnd_~i~0 3)} assume true; {5329#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:10,117 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 17:07:10,117 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 17:07:10,118 INFO L273 TraceCheckUtils]: 89: Hoare triple {5339#(<= bAnd_~i~0 4)} assume true; {5339#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:10,118 INFO L273 TraceCheckUtils]: 90: Hoare triple {5339#(<= bAnd_~i~0 4)} assume !(~i~0 < 10000); {5058#false} is VALID [2018-11-14 17:07:10,119 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 17:07:10,119 INFO L273 TraceCheckUtils]: 92: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:07:10,119 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {5058#false} {5057#true} #77#return; {5058#false} is VALID [2018-11-14 17:07:10,119 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 17:07:10,119 INFO L273 TraceCheckUtils]: 95: Hoare triple {5058#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5058#false} is VALID [2018-11-14 17:07:10,119 INFO L273 TraceCheckUtils]: 96: Hoare triple {5058#false} assume !false; {5058#false} is VALID [2018-11-14 17:07:10,124 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 17:07:10,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:10,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-11-14 17:07:10,146 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2018-11-14 17:07:10,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:10,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 17:07:10,224 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 17:07:10,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 17:07:10,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 17:07:10,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:07:10,226 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 16 states. [2018-11-14 17:07:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:10,695 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-14 17:07:10,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:07:10,695 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2018-11-14 17:07:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:07:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2018-11-14 17:07:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:07:10,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2018-11-14 17:07:10,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 103 transitions. [2018-11-14 17:07:11,876 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 17:07:11,878 INFO L225 Difference]: With dead ends: 109 [2018-11-14 17:07:11,878 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 17:07:11,879 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:07:11,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 17:07:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-14 17:07:12,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:12,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2018-11-14 17:07:12,404 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2018-11-14 17:07:12,405 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2018-11-14 17:07:12,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:12,407 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-14 17:07:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-14 17:07:12,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:12,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:12,408 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2018-11-14 17:07:12,408 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2018-11-14 17:07:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:12,410 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-14 17:07:12,410 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-14 17:07:12,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:12,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:12,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:12,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 17:07:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-11-14 17:07:12,413 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 97 [2018-11-14 17:07:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:12,413 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-11-14 17:07:12,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 17:07:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-14 17:07:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-14 17:07:12,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:12,415 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 17:07:12,415 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:12,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:12,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1090680019, now seen corresponding path program 10 times [2018-11-14 17:07:12,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:12,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:12,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:12,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:12,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:12,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {5763#true} call ULTIMATE.init(); {5763#true} is VALID [2018-11-14 17:07:12,794 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 17:07:12,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,794 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5763#true} {5763#true} #69#return; {5763#true} is VALID [2018-11-14 17:07:12,794 INFO L256 TraceCheckUtils]: 4: Hoare triple {5763#true} call #t~ret13 := main(); {5763#true} is VALID [2018-11-14 17:07:12,795 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 17:07:12,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {5765#(= main_~i~1 0)} assume true; {5765#(= main_~i~1 0)} is VALID [2018-11-14 17:07:12,796 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 17:07:12,797 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 17:07:12,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {5766#(<= main_~i~1 1)} assume true; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:12,797 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 17:07:12,798 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 17:07:12,798 INFO L273 TraceCheckUtils]: 12: Hoare triple {5767#(<= main_~i~1 2)} assume true; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:12,798 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 17:07:12,802 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 17:07:12,802 INFO L273 TraceCheckUtils]: 15: Hoare triple {5768#(<= main_~i~1 3)} assume true; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:12,802 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 17:07:12,803 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 17:07:12,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {5769#(<= main_~i~1 4)} assume true; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:12,804 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 17:07:12,804 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 17:07:12,804 INFO L273 TraceCheckUtils]: 21: Hoare triple {5770#(<= main_~i~1 5)} assume true; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:12,805 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 17:07:12,805 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 17:07:12,806 INFO L273 TraceCheckUtils]: 24: Hoare triple {5771#(<= main_~i~1 6)} assume true; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:12,806 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 17:07:12,807 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 17:07:12,807 INFO L273 TraceCheckUtils]: 27: Hoare triple {5772#(<= main_~i~1 7)} assume true; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:12,808 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 17:07:12,809 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 17:07:12,809 INFO L273 TraceCheckUtils]: 30: Hoare triple {5773#(<= main_~i~1 8)} assume true; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:12,810 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 17:07:12,810 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 17:07:12,811 INFO L273 TraceCheckUtils]: 33: Hoare triple {5774#(<= main_~i~1 9)} assume true; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:12,812 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 17:07:12,812 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 17:07:12,813 INFO L273 TraceCheckUtils]: 36: Hoare triple {5775#(<= main_~i~1 10)} assume true; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:12,814 INFO L273 TraceCheckUtils]: 37: Hoare triple {5775#(<= main_~i~1 10)} assume !(~i~1 < 10000); {5764#false} is VALID [2018-11-14 17:07:12,814 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 17:07:12,814 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 17:07:12,814 INFO L273 TraceCheckUtils]: 40: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,814 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 17:07:12,815 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 17:07:12,815 INFO L273 TraceCheckUtils]: 43: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,815 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 17:07:12,815 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 17:07:12,815 INFO L273 TraceCheckUtils]: 46: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,816 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 17:07:12,816 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 17:07:12,816 INFO L273 TraceCheckUtils]: 49: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,816 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 17:07:12,816 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 17:07:12,817 INFO L273 TraceCheckUtils]: 52: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,817 INFO L273 TraceCheckUtils]: 53: Hoare triple {5763#true} assume !(~i~0 < 10000); {5763#true} is VALID [2018-11-14 17:07:12,817 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 17:07:12,817 INFO L273 TraceCheckUtils]: 55: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,817 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {5763#true} {5764#false} #73#return; {5764#false} is VALID [2018-11-14 17:07:12,817 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 17:07:12,818 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 17:07:12,818 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 17:07:12,818 INFO L273 TraceCheckUtils]: 60: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,818 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 17:07:12,818 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 17:07:12,818 INFO L273 TraceCheckUtils]: 63: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,818 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 17:07:12,818 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 17:07:12,819 INFO L273 TraceCheckUtils]: 66: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,821 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 17:07:12,821 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 17:07:12,821 INFO L273 TraceCheckUtils]: 69: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,821 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 17:07:12,821 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 17:07:12,822 INFO L273 TraceCheckUtils]: 72: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,822 INFO L273 TraceCheckUtils]: 73: Hoare triple {5763#true} assume !(~i~0 < 10000); {5763#true} is VALID [2018-11-14 17:07:12,822 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 17:07:12,822 INFO L273 TraceCheckUtils]: 75: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,822 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {5763#true} {5764#false} #75#return; {5764#false} is VALID [2018-11-14 17:07:12,822 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 17:07:12,823 INFO L273 TraceCheckUtils]: 78: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:12,823 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 17:07:12,823 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 17:07:12,823 INFO L273 TraceCheckUtils]: 81: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:12,823 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 17:07:12,823 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 17:07:12,824 INFO L273 TraceCheckUtils]: 84: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:12,824 INFO L273 TraceCheckUtils]: 85: Hoare triple {5764#false} assume !(~i~2 < 9999); {5764#false} is VALID [2018-11-14 17:07:12,824 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 17:07:12,824 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 17:07:12,824 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 17:07:12,824 INFO L273 TraceCheckUtils]: 89: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,825 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 17:07:12,825 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 17:07:12,825 INFO L273 TraceCheckUtils]: 92: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,825 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 17:07:12,825 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 17:07:12,825 INFO L273 TraceCheckUtils]: 95: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,826 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 17:07:12,826 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 17:07:12,826 INFO L273 TraceCheckUtils]: 98: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,826 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 17:07:12,826 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 17:07:12,826 INFO L273 TraceCheckUtils]: 101: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,827 INFO L273 TraceCheckUtils]: 102: Hoare triple {5763#true} assume !(~i~0 < 10000); {5763#true} is VALID [2018-11-14 17:07:12,827 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 17:07:12,827 INFO L273 TraceCheckUtils]: 104: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:12,827 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {5763#true} {5764#false} #77#return; {5764#false} is VALID [2018-11-14 17:07:12,827 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 17:07:12,827 INFO L273 TraceCheckUtils]: 107: Hoare triple {5764#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5764#false} is VALID [2018-11-14 17:07:12,828 INFO L273 TraceCheckUtils]: 108: Hoare triple {5764#false} assume !false; {5764#false} is VALID [2018-11-14 17:07:12,834 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 17:07:12,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:12,835 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 17:07:12,848 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:07:12,884 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:07:12,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:12,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:13,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {5763#true} call ULTIMATE.init(); {5763#true} is VALID [2018-11-14 17:07:13,084 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 17:07:13,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:13,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5763#true} {5763#true} #69#return; {5763#true} is VALID [2018-11-14 17:07:13,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {5763#true} call #t~ret13 := main(); {5763#true} is VALID [2018-11-14 17:07:13,086 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 17:07:13,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {5794#(<= main_~i~1 0)} assume true; {5794#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:13,086 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 17:07:13,087 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 17:07:13,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {5766#(<= main_~i~1 1)} assume true; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:13,087 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 17:07:13,088 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 17:07:13,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {5767#(<= main_~i~1 2)} assume true; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:13,088 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 17:07:13,089 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 17:07:13,090 INFO L273 TraceCheckUtils]: 15: Hoare triple {5768#(<= main_~i~1 3)} assume true; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:13,090 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 17:07:13,091 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 17:07:13,092 INFO L273 TraceCheckUtils]: 18: Hoare triple {5769#(<= main_~i~1 4)} assume true; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:13,092 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 17:07:13,093 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 17:07:13,093 INFO L273 TraceCheckUtils]: 21: Hoare triple {5770#(<= main_~i~1 5)} assume true; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:13,094 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 17:07:13,095 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 17:07:13,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {5771#(<= main_~i~1 6)} assume true; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:13,096 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 17:07:13,096 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 17:07:13,097 INFO L273 TraceCheckUtils]: 27: Hoare triple {5772#(<= main_~i~1 7)} assume true; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:13,097 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 17:07:13,098 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 17:07:13,099 INFO L273 TraceCheckUtils]: 30: Hoare triple {5773#(<= main_~i~1 8)} assume true; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:13,099 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 17:07:13,100 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 17:07:13,100 INFO L273 TraceCheckUtils]: 33: Hoare triple {5774#(<= main_~i~1 9)} assume true; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:13,101 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 17:07:13,102 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 17:07:13,102 INFO L273 TraceCheckUtils]: 36: Hoare triple {5775#(<= main_~i~1 10)} assume true; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:13,103 INFO L273 TraceCheckUtils]: 37: Hoare triple {5775#(<= main_~i~1 10)} assume !(~i~1 < 10000); {5764#false} is VALID [2018-11-14 17:07:13,103 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 17:07:13,103 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 17:07:13,104 INFO L273 TraceCheckUtils]: 40: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,104 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 17:07:13,104 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 17:07:13,104 INFO L273 TraceCheckUtils]: 43: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,104 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 17:07:13,105 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 17:07:13,105 INFO L273 TraceCheckUtils]: 46: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,105 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 17:07:13,105 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 17:07:13,105 INFO L273 TraceCheckUtils]: 49: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,106 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 17:07:13,106 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 17:07:13,106 INFO L273 TraceCheckUtils]: 52: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,106 INFO L273 TraceCheckUtils]: 53: Hoare triple {5764#false} assume !(~i~0 < 10000); {5764#false} is VALID [2018-11-14 17:07:13,106 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 17:07:13,106 INFO L273 TraceCheckUtils]: 55: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,107 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {5764#false} {5764#false} #73#return; {5764#false} is VALID [2018-11-14 17:07:13,107 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 17:07:13,107 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 17:07:13,107 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 17:07:13,107 INFO L273 TraceCheckUtils]: 60: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,107 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 17:07:13,108 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 17:07:13,108 INFO L273 TraceCheckUtils]: 63: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,108 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 17:07:13,108 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 17:07:13,108 INFO L273 TraceCheckUtils]: 66: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,108 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 17:07:13,109 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 17:07:13,109 INFO L273 TraceCheckUtils]: 69: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,109 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 17:07:13,109 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 17:07:13,109 INFO L273 TraceCheckUtils]: 72: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,109 INFO L273 TraceCheckUtils]: 73: Hoare triple {5764#false} assume !(~i~0 < 10000); {5764#false} is VALID [2018-11-14 17:07:13,110 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 17:07:13,110 INFO L273 TraceCheckUtils]: 75: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,110 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {5764#false} {5764#false} #75#return; {5764#false} is VALID [2018-11-14 17:07:13,110 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 17:07:13,110 INFO L273 TraceCheckUtils]: 78: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,110 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 17:07:13,110 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 17:07:13,111 INFO L273 TraceCheckUtils]: 81: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,111 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 17:07:13,111 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 17:07:13,111 INFO L273 TraceCheckUtils]: 84: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,111 INFO L273 TraceCheckUtils]: 85: Hoare triple {5764#false} assume !(~i~2 < 9999); {5764#false} is VALID [2018-11-14 17:07:13,111 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 17:07:13,112 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 17:07:13,112 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 17:07:13,112 INFO L273 TraceCheckUtils]: 89: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,112 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 17:07:13,112 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 17:07:13,112 INFO L273 TraceCheckUtils]: 92: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,113 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 17:07:13,113 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 17:07:13,113 INFO L273 TraceCheckUtils]: 95: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,113 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 17:07:13,113 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 17:07:13,113 INFO L273 TraceCheckUtils]: 98: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,113 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 17:07:13,114 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 17:07:13,114 INFO L273 TraceCheckUtils]: 101: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,114 INFO L273 TraceCheckUtils]: 102: Hoare triple {5764#false} assume !(~i~0 < 10000); {5764#false} is VALID [2018-11-14 17:07:13,114 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 17:07:13,114 INFO L273 TraceCheckUtils]: 104: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:13,114 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {5764#false} {5764#false} #77#return; {5764#false} is VALID [2018-11-14 17:07:13,115 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 17:07:13,115 INFO L273 TraceCheckUtils]: 107: Hoare triple {5764#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5764#false} is VALID [2018-11-14 17:07:13,115 INFO L273 TraceCheckUtils]: 108: Hoare triple {5764#false} assume !false; {5764#false} is VALID [2018-11-14 17:07:13,121 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 17:07:13,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:13,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 17:07:13,142 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2018-11-14 17:07:13,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:13,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:07:13,218 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 17:07:13,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:07:13,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:07:13,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:07:13,220 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 14 states. [2018-11-14 17:07:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:13,572 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-14 17:07:13,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:07:13,572 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2018-11-14 17:07:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:07:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2018-11-14 17:07:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:07:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2018-11-14 17:07:13,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 90 transitions. [2018-11-14 17:07:14,003 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 17:07:14,005 INFO L225 Difference]: With dead ends: 114 [2018-11-14 17:07:14,006 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 17:07:14,007 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 17:07:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 17:07:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-14 17:07:14,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:14,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-14 17:07:14,076 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-14 17:07:14,076 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-14 17:07:14,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:14,078 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-14 17:07:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-14 17:07:14,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:14,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:14,079 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-14 17:07:14,079 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-14 17:07:14,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:14,081 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-14 17:07:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-14 17:07:14,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:14,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:14,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:14,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 17:07:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-14 17:07:14,083 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 109 [2018-11-14 17:07:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:14,084 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-14 17:07:14,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:07:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-14 17:07:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-14 17:07:14,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:14,085 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 17:07:14,085 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:14,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:14,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1670093159, now seen corresponding path program 11 times [2018-11-14 17:07:14,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:14,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:14,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:14,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:14,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:14,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {6518#true} call ULTIMATE.init(); {6518#true} is VALID [2018-11-14 17:07:14,604 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 17:07:14,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,604 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6518#true} {6518#true} #69#return; {6518#true} is VALID [2018-11-14 17:07:14,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {6518#true} call #t~ret13 := main(); {6518#true} is VALID [2018-11-14 17:07:14,605 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 17:07:14,606 INFO L273 TraceCheckUtils]: 6: Hoare triple {6520#(= main_~i~1 0)} assume true; {6520#(= main_~i~1 0)} is VALID [2018-11-14 17:07:14,606 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 17:07:14,607 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 17:07:14,607 INFO L273 TraceCheckUtils]: 9: Hoare triple {6521#(<= main_~i~1 1)} assume true; {6521#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:14,608 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 17:07:14,609 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 17:07:14,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {6522#(<= main_~i~1 2)} assume true; {6522#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:14,610 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 17:07:14,611 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 17:07:14,611 INFO L273 TraceCheckUtils]: 15: Hoare triple {6523#(<= main_~i~1 3)} assume true; {6523#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:14,612 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 17:07:14,612 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 17:07:14,613 INFO L273 TraceCheckUtils]: 18: Hoare triple {6524#(<= main_~i~1 4)} assume true; {6524#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:14,613 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 17:07:14,614 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 17:07:14,615 INFO L273 TraceCheckUtils]: 21: Hoare triple {6525#(<= main_~i~1 5)} assume true; {6525#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:14,615 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 17:07:14,616 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 17:07:14,616 INFO L273 TraceCheckUtils]: 24: Hoare triple {6526#(<= main_~i~1 6)} assume true; {6526#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:14,617 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 17:07:14,618 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 17:07:14,618 INFO L273 TraceCheckUtils]: 27: Hoare triple {6527#(<= main_~i~1 7)} assume true; {6527#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:14,619 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 17:07:14,620 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 17:07:14,620 INFO L273 TraceCheckUtils]: 30: Hoare triple {6528#(<= main_~i~1 8)} assume true; {6528#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:14,621 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 17:07:14,621 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 17:07:14,622 INFO L273 TraceCheckUtils]: 33: Hoare triple {6529#(<= main_~i~1 9)} assume true; {6529#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:14,622 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 17:07:14,623 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 17:07:14,624 INFO L273 TraceCheckUtils]: 36: Hoare triple {6530#(<= main_~i~1 10)} assume true; {6530#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:14,624 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 17:07:14,625 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 17:07:14,626 INFO L273 TraceCheckUtils]: 39: Hoare triple {6531#(<= main_~i~1 11)} assume true; {6531#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:14,626 INFO L273 TraceCheckUtils]: 40: Hoare triple {6531#(<= main_~i~1 11)} assume !(~i~1 < 10000); {6519#false} is VALID [2018-11-14 17:07:14,626 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 17:07:14,627 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 17:07:14,627 INFO L273 TraceCheckUtils]: 43: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,627 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 17:07:14,627 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 17:07:14,627 INFO L273 TraceCheckUtils]: 46: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,628 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 17:07:14,628 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 17:07:14,628 INFO L273 TraceCheckUtils]: 49: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,628 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 17:07:14,628 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 17:07:14,629 INFO L273 TraceCheckUtils]: 52: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,629 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 17:07:14,629 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 17:07:14,629 INFO L273 TraceCheckUtils]: 55: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,629 INFO L273 TraceCheckUtils]: 56: Hoare triple {6518#true} assume !(~i~0 < 10000); {6518#true} is VALID [2018-11-14 17:07:14,629 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 17:07:14,629 INFO L273 TraceCheckUtils]: 58: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,629 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6518#true} {6519#false} #73#return; {6519#false} is VALID [2018-11-14 17:07:14,629 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 17:07:14,630 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 17:07:14,630 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 17:07:14,630 INFO L273 TraceCheckUtils]: 63: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,630 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 17:07:14,630 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 17:07:14,630 INFO L273 TraceCheckUtils]: 66: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,630 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 17:07:14,630 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 17:07:14,630 INFO L273 TraceCheckUtils]: 69: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,631 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 17:07:14,631 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 17:07:14,631 INFO L273 TraceCheckUtils]: 72: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,631 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 17:07:14,631 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 17:07:14,631 INFO L273 TraceCheckUtils]: 75: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,631 INFO L273 TraceCheckUtils]: 76: Hoare triple {6518#true} assume !(~i~0 < 10000); {6518#true} is VALID [2018-11-14 17:07:14,631 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 17:07:14,632 INFO L273 TraceCheckUtils]: 78: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,632 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6518#true} {6519#false} #75#return; {6519#false} is VALID [2018-11-14 17:07:14,632 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 17:07:14,632 INFO L273 TraceCheckUtils]: 81: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:14,632 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 17:07:14,632 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 17:07:14,632 INFO L273 TraceCheckUtils]: 84: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:14,632 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 17:07:14,632 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 17:07:14,633 INFO L273 TraceCheckUtils]: 87: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:14,633 INFO L273 TraceCheckUtils]: 88: Hoare triple {6519#false} assume !(~i~2 < 9999); {6519#false} is VALID [2018-11-14 17:07:14,633 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 17:07:14,633 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 17:07:14,633 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 17:07:14,633 INFO L273 TraceCheckUtils]: 92: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,633 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 17:07:14,633 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 17:07:14,633 INFO L273 TraceCheckUtils]: 95: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,634 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 17:07:14,634 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 17:07:14,634 INFO L273 TraceCheckUtils]: 98: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,634 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 17:07:14,634 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 17:07:14,634 INFO L273 TraceCheckUtils]: 101: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,634 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 17:07:14,634 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 17:07:14,634 INFO L273 TraceCheckUtils]: 104: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,635 INFO L273 TraceCheckUtils]: 105: Hoare triple {6518#true} assume !(~i~0 < 10000); {6518#true} is VALID [2018-11-14 17:07:14,635 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 17:07:14,635 INFO L273 TraceCheckUtils]: 107: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:14,635 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {6518#true} {6519#false} #77#return; {6519#false} is VALID [2018-11-14 17:07:14,635 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 17:07:14,635 INFO L273 TraceCheckUtils]: 110: Hoare triple {6519#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6519#false} is VALID [2018-11-14 17:07:14,635 INFO L273 TraceCheckUtils]: 111: Hoare triple {6519#false} assume !false; {6519#false} is VALID [2018-11-14 17:07:14,641 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 17:07:14,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:14,641 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 17:07:14,649 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:07:14,965 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-14 17:07:14,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:14,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:15,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {6518#true} call ULTIMATE.init(); {6518#true} is VALID [2018-11-14 17:07:15,154 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 17:07:15,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:15,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6518#true} {6518#true} #69#return; {6518#true} is VALID [2018-11-14 17:07:15,155 INFO L256 TraceCheckUtils]: 4: Hoare triple {6518#true} call #t~ret13 := main(); {6518#true} is VALID [2018-11-14 17:07:15,155 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 17:07:15,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:15,155 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 17:07:15,155 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 17:07:15,156 INFO L273 TraceCheckUtils]: 9: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:15,156 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 17:07:15,156 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 17:07:15,156 INFO L273 TraceCheckUtils]: 12: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:15,156 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 17:07:15,156 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 17:07:15,157 INFO L273 TraceCheckUtils]: 15: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:15,157 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 17:07:15,157 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 17:07:15,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:15,157 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 17:07:15,157 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 17:07:15,158 INFO L273 TraceCheckUtils]: 21: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:15,158 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 17:07:15,158 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 17:07:15,158 INFO L273 TraceCheckUtils]: 24: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:15,158 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 17:07:15,158 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 17:07:15,159 INFO L273 TraceCheckUtils]: 27: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:15,159 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 17:07:15,159 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 17:07:15,159 INFO L273 TraceCheckUtils]: 30: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:15,159 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 17:07:15,159 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 17:07:15,160 INFO L273 TraceCheckUtils]: 33: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:15,160 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 17:07:15,160 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 17:07:15,160 INFO L273 TraceCheckUtils]: 36: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:15,160 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 17:07:15,161 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 17:07:15,161 INFO L273 TraceCheckUtils]: 39: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:15,161 INFO L273 TraceCheckUtils]: 40: Hoare triple {6518#true} assume !(~i~1 < 10000); {6518#true} is VALID [2018-11-14 17:07:15,161 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 17:07:15,178 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 17:07:15,193 INFO L273 TraceCheckUtils]: 43: Hoare triple {6661#(<= bAnd_~i~0 1)} assume true; {6661#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:15,201 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 17:07:15,215 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 17:07:15,216 INFO L273 TraceCheckUtils]: 46: Hoare triple {6671#(<= bAnd_~i~0 2)} assume true; {6671#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:15,216 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 17:07:15,219 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 17:07:15,219 INFO L273 TraceCheckUtils]: 49: Hoare triple {6681#(<= bAnd_~i~0 3)} assume true; {6681#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:15,219 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 17:07:15,220 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 17:07:15,222 INFO L273 TraceCheckUtils]: 52: Hoare triple {6691#(<= bAnd_~i~0 4)} assume true; {6691#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:15,222 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 17:07:15,222 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 17:07:15,223 INFO L273 TraceCheckUtils]: 55: Hoare triple {6701#(<= bAnd_~i~0 5)} assume true; {6701#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:07:15,223 INFO L273 TraceCheckUtils]: 56: Hoare triple {6701#(<= bAnd_~i~0 5)} assume !(~i~0 < 10000); {6519#false} is VALID [2018-11-14 17:07:15,223 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 17:07:15,223 INFO L273 TraceCheckUtils]: 58: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,224 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6519#false} {6518#true} #73#return; {6519#false} is VALID [2018-11-14 17:07:15,224 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 17:07:15,224 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 17:07:15,224 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 17:07:15,224 INFO L273 TraceCheckUtils]: 63: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,224 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 17:07:15,224 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 17:07:15,224 INFO L273 TraceCheckUtils]: 66: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,224 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 17:07:15,225 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 17:07:15,225 INFO L273 TraceCheckUtils]: 69: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,225 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 17:07:15,225 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 17:07:15,225 INFO L273 TraceCheckUtils]: 72: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,225 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 17:07:15,225 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 17:07:15,225 INFO L273 TraceCheckUtils]: 75: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,225 INFO L273 TraceCheckUtils]: 76: Hoare triple {6519#false} assume !(~i~0 < 10000); {6519#false} is VALID [2018-11-14 17:07:15,226 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 17:07:15,226 INFO L273 TraceCheckUtils]: 78: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,226 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6519#false} {6519#false} #75#return; {6519#false} is VALID [2018-11-14 17:07:15,226 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 17:07:15,226 INFO L273 TraceCheckUtils]: 81: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,226 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 17:07:15,226 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 17:07:15,226 INFO L273 TraceCheckUtils]: 84: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,227 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 17:07:15,227 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 17:07:15,227 INFO L273 TraceCheckUtils]: 87: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,227 INFO L273 TraceCheckUtils]: 88: Hoare triple {6519#false} assume !(~i~2 < 9999); {6519#false} is VALID [2018-11-14 17:07:15,227 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 17:07:15,227 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 17:07:15,227 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 17:07:15,227 INFO L273 TraceCheckUtils]: 92: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,227 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 17:07:15,228 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 17:07:15,228 INFO L273 TraceCheckUtils]: 95: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,228 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 17:07:15,228 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 17:07:15,228 INFO L273 TraceCheckUtils]: 98: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,228 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 17:07:15,228 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 17:07:15,228 INFO L273 TraceCheckUtils]: 101: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,228 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 17:07:15,229 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 17:07:15,229 INFO L273 TraceCheckUtils]: 104: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,229 INFO L273 TraceCheckUtils]: 105: Hoare triple {6519#false} assume !(~i~0 < 10000); {6519#false} is VALID [2018-11-14 17:07:15,229 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 17:07:15,229 INFO L273 TraceCheckUtils]: 107: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:15,229 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {6519#false} {6519#false} #77#return; {6519#false} is VALID [2018-11-14 17:07:15,229 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 17:07:15,229 INFO L273 TraceCheckUtils]: 110: Hoare triple {6519#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6519#false} is VALID [2018-11-14 17:07:15,229 INFO L273 TraceCheckUtils]: 111: Hoare triple {6519#false} assume !false; {6519#false} is VALID [2018-11-14 17:07:15,234 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 17:07:15,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:15,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-14 17:07:15,255 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2018-11-14 17:07:15,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:15,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 17:07:15,367 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 17:07:15,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 17:07:15,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 17:07:15,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:07:15,368 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 19 states. [2018-11-14 17:07:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:15,781 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-11-14 17:07:15,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 17:07:15,781 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2018-11-14 17:07:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:07:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 112 transitions. [2018-11-14 17:07:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:07:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 112 transitions. [2018-11-14 17:07:15,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 112 transitions. [2018-11-14 17:07:15,923 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 17:07:15,925 INFO L225 Difference]: With dead ends: 121 [2018-11-14 17:07:15,925 INFO L226 Difference]: Without dead ends: 85 [2018-11-14 17:07:15,926 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:07:15,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-14 17:07:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-11-14 17:07:16,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:16,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 83 states. [2018-11-14 17:07:16,064 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 83 states. [2018-11-14 17:07:16,064 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 83 states. [2018-11-14 17:07:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:16,066 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-14 17:07:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-14 17:07:16,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:16,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:16,068 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 85 states. [2018-11-14 17:07:16,068 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 85 states. [2018-11-14 17:07:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:16,070 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-14 17:07:16,070 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-14 17:07:16,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:16,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:16,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:16,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 17:07:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-14 17:07:16,074 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 112 [2018-11-14 17:07:16,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:16,074 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-14 17:07:16,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 17:07:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-14 17:07:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-14 17:07:16,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:16,076 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 17:07:16,076 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:16,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:16,077 INFO L82 PathProgramCache]: Analyzing trace with hash -167472347, now seen corresponding path program 12 times [2018-11-14 17:07:16,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:16,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:16,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:16,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:16,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:16,885 INFO L256 TraceCheckUtils]: 0: Hoare triple {7318#true} call ULTIMATE.init(); {7318#true} is VALID [2018-11-14 17:07:16,885 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 17:07:16,886 INFO L273 TraceCheckUtils]: 2: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,886 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7318#true} {7318#true} #69#return; {7318#true} is VALID [2018-11-14 17:07:16,886 INFO L256 TraceCheckUtils]: 4: Hoare triple {7318#true} call #t~ret13 := main(); {7318#true} is VALID [2018-11-14 17:07:16,887 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 17:07:16,887 INFO L273 TraceCheckUtils]: 6: Hoare triple {7320#(= main_~i~1 0)} assume true; {7320#(= main_~i~1 0)} is VALID [2018-11-14 17:07:16,888 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 17:07:16,889 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 17:07:16,889 INFO L273 TraceCheckUtils]: 9: Hoare triple {7321#(<= main_~i~1 1)} assume true; {7321#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:16,890 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 17:07:16,891 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 17:07:16,891 INFO L273 TraceCheckUtils]: 12: Hoare triple {7322#(<= main_~i~1 2)} assume true; {7322#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:16,892 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 17:07:16,893 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 17:07:16,893 INFO L273 TraceCheckUtils]: 15: Hoare triple {7323#(<= main_~i~1 3)} assume true; {7323#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:16,894 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 17:07:16,895 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 17:07:16,895 INFO L273 TraceCheckUtils]: 18: Hoare triple {7324#(<= main_~i~1 4)} assume true; {7324#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:16,896 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 17:07:16,897 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 17:07:16,897 INFO L273 TraceCheckUtils]: 21: Hoare triple {7325#(<= main_~i~1 5)} assume true; {7325#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:16,898 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 17:07:16,899 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 17:07:16,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {7326#(<= main_~i~1 6)} assume true; {7326#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:16,900 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 17:07:16,901 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 17:07:16,902 INFO L273 TraceCheckUtils]: 27: Hoare triple {7327#(<= main_~i~1 7)} assume true; {7327#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:16,902 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 17:07:16,903 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 17:07:16,904 INFO L273 TraceCheckUtils]: 30: Hoare triple {7328#(<= main_~i~1 8)} assume true; {7328#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:16,904 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 17:07:16,905 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 17:07:16,906 INFO L273 TraceCheckUtils]: 33: Hoare triple {7329#(<= main_~i~1 9)} assume true; {7329#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:16,906 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 17:07:16,907 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 17:07:16,907 INFO L273 TraceCheckUtils]: 36: Hoare triple {7330#(<= main_~i~1 10)} assume true; {7330#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:16,908 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 17:07:16,909 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 17:07:16,909 INFO L273 TraceCheckUtils]: 39: Hoare triple {7331#(<= main_~i~1 11)} assume true; {7331#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:16,910 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 17:07:16,911 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 17:07:16,911 INFO L273 TraceCheckUtils]: 42: Hoare triple {7332#(<= main_~i~1 12)} assume true; {7332#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:16,912 INFO L273 TraceCheckUtils]: 43: Hoare triple {7332#(<= main_~i~1 12)} assume !(~i~1 < 10000); {7319#false} is VALID [2018-11-14 17:07:16,912 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 17:07:16,913 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 17:07:16,913 INFO L273 TraceCheckUtils]: 46: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,913 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 17:07:16,913 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 17:07:16,914 INFO L273 TraceCheckUtils]: 49: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,914 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 17:07:16,914 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 17:07:16,914 INFO L273 TraceCheckUtils]: 52: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,915 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 17:07:16,915 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 17:07:16,915 INFO L273 TraceCheckUtils]: 55: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,915 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 17:07:16,915 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 17:07:16,916 INFO L273 TraceCheckUtils]: 58: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,916 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 17:07:16,916 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 17:07:16,916 INFO L273 TraceCheckUtils]: 61: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,917 INFO L273 TraceCheckUtils]: 62: Hoare triple {7318#true} assume !(~i~0 < 10000); {7318#true} is VALID [2018-11-14 17:07:16,917 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 17:07:16,917 INFO L273 TraceCheckUtils]: 64: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,917 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {7318#true} {7319#false} #73#return; {7319#false} is VALID [2018-11-14 17:07:16,917 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 17:07:16,917 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 17:07:16,918 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 17:07:16,918 INFO L273 TraceCheckUtils]: 69: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,918 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 17:07:16,918 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 17:07:16,918 INFO L273 TraceCheckUtils]: 72: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,918 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 17:07:16,918 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 17:07:16,919 INFO L273 TraceCheckUtils]: 75: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,919 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 17:07:16,919 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 17:07:16,919 INFO L273 TraceCheckUtils]: 78: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,919 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 17:07:16,919 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 17:07:16,920 INFO L273 TraceCheckUtils]: 81: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,920 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 17:07:16,920 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 17:07:16,920 INFO L273 TraceCheckUtils]: 84: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,920 INFO L273 TraceCheckUtils]: 85: Hoare triple {7318#true} assume !(~i~0 < 10000); {7318#true} is VALID [2018-11-14 17:07:16,920 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 17:07:16,920 INFO L273 TraceCheckUtils]: 87: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,921 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {7318#true} {7319#false} #75#return; {7319#false} is VALID [2018-11-14 17:07:16,921 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 17:07:16,921 INFO L273 TraceCheckUtils]: 90: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:16,921 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 17:07:16,921 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 17:07:16,921 INFO L273 TraceCheckUtils]: 93: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:16,921 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 17:07:16,922 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 17:07:16,922 INFO L273 TraceCheckUtils]: 96: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:16,922 INFO L273 TraceCheckUtils]: 97: Hoare triple {7319#false} assume !(~i~2 < 9999); {7319#false} is VALID [2018-11-14 17:07:16,922 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 17:07:16,922 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 17:07:16,922 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 17:07:16,922 INFO L273 TraceCheckUtils]: 101: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,923 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 17:07:16,923 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 17:07:16,923 INFO L273 TraceCheckUtils]: 104: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,923 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 17:07:16,923 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 17:07:16,923 INFO L273 TraceCheckUtils]: 107: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,924 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 17:07:16,924 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 17:07:16,924 INFO L273 TraceCheckUtils]: 110: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,924 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 17:07:16,924 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 17:07:16,924 INFO L273 TraceCheckUtils]: 113: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,924 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 17:07:16,925 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 17:07:16,925 INFO L273 TraceCheckUtils]: 116: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,925 INFO L273 TraceCheckUtils]: 117: Hoare triple {7318#true} assume !(~i~0 < 10000); {7318#true} is VALID [2018-11-14 17:07:16,925 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 17:07:16,925 INFO L273 TraceCheckUtils]: 119: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:16,925 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {7318#true} {7319#false} #77#return; {7319#false} is VALID [2018-11-14 17:07:16,925 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 17:07:16,926 INFO L273 TraceCheckUtils]: 122: Hoare triple {7319#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7319#false} is VALID [2018-11-14 17:07:16,926 INFO L273 TraceCheckUtils]: 123: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2018-11-14 17:07:16,940 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 17:07:16,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:16,940 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 17:07:16,948 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:07:17,019 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 17:07:17,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:17,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:17,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {7318#true} call ULTIMATE.init(); {7318#true} is VALID [2018-11-14 17:07:17,278 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 17:07:17,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7318#true} {7318#true} #69#return; {7318#true} is VALID [2018-11-14 17:07:17,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {7318#true} call #t~ret13 := main(); {7318#true} is VALID [2018-11-14 17:07:17,279 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 17:07:17,279 INFO L273 TraceCheckUtils]: 6: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,280 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 17:07:17,280 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 17:07:17,280 INFO L273 TraceCheckUtils]: 9: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,280 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 17:07:17,280 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 17:07:17,281 INFO L273 TraceCheckUtils]: 12: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,281 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 17:07:17,281 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 17:07:17,281 INFO L273 TraceCheckUtils]: 15: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,281 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 17:07:17,281 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 17:07:17,281 INFO L273 TraceCheckUtils]: 18: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,281 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 17:07:17,281 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 17:07:17,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,282 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 17:07:17,282 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 17:07:17,282 INFO L273 TraceCheckUtils]: 24: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,282 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 17:07:17,282 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 17:07:17,282 INFO L273 TraceCheckUtils]: 27: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,282 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 17:07:17,282 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 17:07:17,283 INFO L273 TraceCheckUtils]: 30: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,283 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 17:07:17,283 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 17:07:17,283 INFO L273 TraceCheckUtils]: 33: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,283 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 17:07:17,283 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 17:07:17,283 INFO L273 TraceCheckUtils]: 36: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,283 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 17:07:17,284 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 17:07:17,284 INFO L273 TraceCheckUtils]: 39: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,284 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 17:07:17,284 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 17:07:17,284 INFO L273 TraceCheckUtils]: 42: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,284 INFO L273 TraceCheckUtils]: 43: Hoare triple {7318#true} assume !(~i~1 < 10000); {7318#true} is VALID [2018-11-14 17:07:17,284 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 17:07:17,284 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 17:07:17,284 INFO L273 TraceCheckUtils]: 46: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,285 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 17:07:17,285 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 17:07:17,285 INFO L273 TraceCheckUtils]: 49: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,285 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 17:07:17,285 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 17:07:17,285 INFO L273 TraceCheckUtils]: 52: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,285 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 17:07:17,285 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 17:07:17,285 INFO L273 TraceCheckUtils]: 55: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,286 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 17:07:17,286 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 17:07:17,286 INFO L273 TraceCheckUtils]: 58: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,286 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 17:07:17,286 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 17:07:17,286 INFO L273 TraceCheckUtils]: 61: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,286 INFO L273 TraceCheckUtils]: 62: Hoare triple {7318#true} assume !(~i~0 < 10000); {7318#true} is VALID [2018-11-14 17:07:17,286 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 17:07:17,286 INFO L273 TraceCheckUtils]: 64: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,287 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {7318#true} {7318#true} #73#return; {7318#true} is VALID [2018-11-14 17:07:17,287 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 17:07:17,287 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 17:07:17,287 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 17:07:17,287 INFO L273 TraceCheckUtils]: 69: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,287 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 17:07:17,287 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 17:07:17,287 INFO L273 TraceCheckUtils]: 72: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,288 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 17:07:17,288 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 17:07:17,288 INFO L273 TraceCheckUtils]: 75: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,288 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 17:07:17,288 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 17:07:17,288 INFO L273 TraceCheckUtils]: 78: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,288 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 17:07:17,288 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 17:07:17,288 INFO L273 TraceCheckUtils]: 81: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,289 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 17:07:17,289 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 17:07:17,289 INFO L273 TraceCheckUtils]: 84: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,289 INFO L273 TraceCheckUtils]: 85: Hoare triple {7318#true} assume !(~i~0 < 10000); {7318#true} is VALID [2018-11-14 17:07:17,289 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 17:07:17,289 INFO L273 TraceCheckUtils]: 87: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:17,289 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {7318#true} {7318#true} #75#return; {7318#true} is VALID [2018-11-14 17:07:17,290 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 17:07:17,290 INFO L273 TraceCheckUtils]: 90: Hoare triple {7603#(<= main_~i~2 0)} assume true; {7603#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:17,290 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 17:07:17,291 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 17:07:17,291 INFO L273 TraceCheckUtils]: 93: Hoare triple {7613#(<= main_~i~2 1)} assume true; {7613#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:17,292 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 17:07:17,292 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 17:07:17,293 INFO L273 TraceCheckUtils]: 96: Hoare triple {7623#(<= main_~i~2 2)} assume true; {7623#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:17,293 INFO L273 TraceCheckUtils]: 97: Hoare triple {7623#(<= main_~i~2 2)} assume !(~i~2 < 9999); {7319#false} is VALID [2018-11-14 17:07:17,294 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 17:07:17,294 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 17:07:17,294 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 17:07:17,294 INFO L273 TraceCheckUtils]: 101: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:17,294 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 17:07:17,295 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 17:07:17,295 INFO L273 TraceCheckUtils]: 104: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:17,295 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 17:07:17,295 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 17:07:17,295 INFO L273 TraceCheckUtils]: 107: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:17,296 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 17:07:17,296 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 17:07:17,296 INFO L273 TraceCheckUtils]: 110: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:17,296 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 17:07:17,296 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 17:07:17,297 INFO L273 TraceCheckUtils]: 113: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:17,297 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 17:07:17,297 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 17:07:17,297 INFO L273 TraceCheckUtils]: 116: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:17,297 INFO L273 TraceCheckUtils]: 117: Hoare triple {7319#false} assume !(~i~0 < 10000); {7319#false} is VALID [2018-11-14 17:07:17,297 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 17:07:17,297 INFO L273 TraceCheckUtils]: 119: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:17,297 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {7319#false} {7319#false} #77#return; {7319#false} is VALID [2018-11-14 17:07:17,297 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 17:07:17,298 INFO L273 TraceCheckUtils]: 122: Hoare triple {7319#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7319#false} is VALID [2018-11-14 17:07:17,298 INFO L273 TraceCheckUtils]: 123: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2018-11-14 17:07:17,303 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 17:07:17,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:17,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2018-11-14 17:07:17,325 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2018-11-14 17:07:17,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:17,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:07:17,406 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 17:07:17,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:07:17,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:07:17,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:07:17,408 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 18 states. [2018-11-14 17:07:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:17,908 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-14 17:07:17,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 17:07:17,908 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2018-11-14 17:07:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:07:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 106 transitions. [2018-11-14 17:07:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:07:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 106 transitions. [2018-11-14 17:07:17,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 106 transitions. [2018-11-14 17:07:18,015 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 17:07:18,017 INFO L225 Difference]: With dead ends: 130 [2018-11-14 17:07:18,017 INFO L226 Difference]: Without dead ends: 91 [2018-11-14 17:07:18,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:07:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-14 17:07:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-11-14 17:07:18,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:18,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 89 states. [2018-11-14 17:07:18,054 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 89 states. [2018-11-14 17:07:18,054 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 89 states. [2018-11-14 17:07:18,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:18,057 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-14 17:07:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-14 17:07:18,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:18,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:18,058 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 91 states. [2018-11-14 17:07:18,058 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 91 states. [2018-11-14 17:07:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:18,060 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-14 17:07:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-14 17:07:18,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:18,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:18,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:18,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 17:07:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-14 17:07:18,063 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-14 17:07:18,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:18,063 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-14 17:07:18,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:07:18,063 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-14 17:07:18,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-14 17:07:18,065 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:18,065 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 17:07:18,065 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:18,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:18,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1755612877, now seen corresponding path program 13 times [2018-11-14 17:07:18,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:18,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:18,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:18,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:18,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:18,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {8185#true} call ULTIMATE.init(); {8185#true} is VALID [2018-11-14 17:07:18,340 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 17:07:18,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,340 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8185#true} {8185#true} #69#return; {8185#true} is VALID [2018-11-14 17:07:18,340 INFO L256 TraceCheckUtils]: 4: Hoare triple {8185#true} call #t~ret13 := main(); {8185#true} is VALID [2018-11-14 17:07:18,341 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 17:07:18,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {8187#(= main_~i~1 0)} assume true; {8187#(= main_~i~1 0)} is VALID [2018-11-14 17:07:18,342 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 17:07:18,342 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 17:07:18,343 INFO L273 TraceCheckUtils]: 9: Hoare triple {8188#(<= main_~i~1 1)} assume true; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:18,343 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 17:07:18,344 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 17:07:18,344 INFO L273 TraceCheckUtils]: 12: Hoare triple {8189#(<= main_~i~1 2)} assume true; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:18,344 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 17:07:18,345 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 17:07:18,345 INFO L273 TraceCheckUtils]: 15: Hoare triple {8190#(<= main_~i~1 3)} assume true; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:18,345 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 17:07:18,346 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 17:07:18,346 INFO L273 TraceCheckUtils]: 18: Hoare triple {8191#(<= main_~i~1 4)} assume true; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:18,347 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 17:07:18,348 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 17:07:18,348 INFO L273 TraceCheckUtils]: 21: Hoare triple {8192#(<= main_~i~1 5)} assume true; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:18,349 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 17:07:18,352 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 17:07:18,352 INFO L273 TraceCheckUtils]: 24: Hoare triple {8193#(<= main_~i~1 6)} assume true; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:18,353 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 17:07:18,353 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 17:07:18,353 INFO L273 TraceCheckUtils]: 27: Hoare triple {8194#(<= main_~i~1 7)} assume true; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:18,354 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 17:07:18,354 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 17:07:18,355 INFO L273 TraceCheckUtils]: 30: Hoare triple {8195#(<= main_~i~1 8)} assume true; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:18,355 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 17:07:18,355 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 17:07:18,356 INFO L273 TraceCheckUtils]: 33: Hoare triple {8196#(<= main_~i~1 9)} assume true; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:18,356 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 17:07:18,356 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 17:07:18,357 INFO L273 TraceCheckUtils]: 36: Hoare triple {8197#(<= main_~i~1 10)} assume true; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:18,357 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 17:07:18,358 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 17:07:18,359 INFO L273 TraceCheckUtils]: 39: Hoare triple {8198#(<= main_~i~1 11)} assume true; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:18,359 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 17:07:18,360 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 17:07:18,360 INFO L273 TraceCheckUtils]: 42: Hoare triple {8199#(<= main_~i~1 12)} assume true; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:18,361 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 17:07:18,362 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 17:07:18,362 INFO L273 TraceCheckUtils]: 45: Hoare triple {8200#(<= main_~i~1 13)} assume true; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:18,363 INFO L273 TraceCheckUtils]: 46: Hoare triple {8200#(<= main_~i~1 13)} assume !(~i~1 < 10000); {8186#false} is VALID [2018-11-14 17:07:18,363 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 17:07:18,363 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 17:07:18,363 INFO L273 TraceCheckUtils]: 49: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,364 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 17:07:18,364 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 17:07:18,364 INFO L273 TraceCheckUtils]: 52: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,364 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 17:07:18,364 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 17:07:18,365 INFO L273 TraceCheckUtils]: 55: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,365 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 17:07:18,365 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 17:07:18,365 INFO L273 TraceCheckUtils]: 58: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,365 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 17:07:18,366 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 17:07:18,366 INFO L273 TraceCheckUtils]: 61: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,366 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 17:07:18,366 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 17:07:18,366 INFO L273 TraceCheckUtils]: 64: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,366 INFO L273 TraceCheckUtils]: 65: Hoare triple {8185#true} assume !(~i~0 < 10000); {8185#true} is VALID [2018-11-14 17:07:18,366 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 17:07:18,366 INFO L273 TraceCheckUtils]: 67: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,367 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {8185#true} {8186#false} #73#return; {8186#false} is VALID [2018-11-14 17:07:18,367 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 17:07:18,367 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 17:07:18,367 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 17:07:18,367 INFO L273 TraceCheckUtils]: 72: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,367 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 17:07:18,367 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 17:07:18,367 INFO L273 TraceCheckUtils]: 75: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,367 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 17:07:18,368 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 17:07:18,368 INFO L273 TraceCheckUtils]: 78: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,368 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 17:07:18,368 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 17:07:18,368 INFO L273 TraceCheckUtils]: 81: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,368 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 17:07:18,368 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 17:07:18,368 INFO L273 TraceCheckUtils]: 84: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,368 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 17:07:18,369 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 17:07:18,369 INFO L273 TraceCheckUtils]: 87: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,369 INFO L273 TraceCheckUtils]: 88: Hoare triple {8185#true} assume !(~i~0 < 10000); {8185#true} is VALID [2018-11-14 17:07:18,369 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 17:07:18,369 INFO L273 TraceCheckUtils]: 90: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,369 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {8185#true} {8186#false} #75#return; {8186#false} is VALID [2018-11-14 17:07:18,369 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 17:07:18,369 INFO L273 TraceCheckUtils]: 93: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,369 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 17:07:18,370 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 17:07:18,370 INFO L273 TraceCheckUtils]: 96: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,370 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 17:07:18,370 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 17:07:18,370 INFO L273 TraceCheckUtils]: 99: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,370 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 17:07:18,370 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 17:07:18,370 INFO L273 TraceCheckUtils]: 102: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,371 INFO L273 TraceCheckUtils]: 103: Hoare triple {8186#false} assume !(~i~2 < 9999); {8186#false} is VALID [2018-11-14 17:07:18,371 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 17:07:18,371 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 17:07:18,371 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 17:07:18,371 INFO L273 TraceCheckUtils]: 107: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,371 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 17:07:18,371 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 17:07:18,371 INFO L273 TraceCheckUtils]: 110: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,371 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 17:07:18,372 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 17:07:18,372 INFO L273 TraceCheckUtils]: 113: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,372 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 17:07:18,372 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 17:07:18,372 INFO L273 TraceCheckUtils]: 116: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,372 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 17:07:18,372 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 17:07:18,372 INFO L273 TraceCheckUtils]: 119: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,372 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 17:07:18,373 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 17:07:18,373 INFO L273 TraceCheckUtils]: 122: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,373 INFO L273 TraceCheckUtils]: 123: Hoare triple {8185#true} assume !(~i~0 < 10000); {8185#true} is VALID [2018-11-14 17:07:18,373 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 17:07:18,373 INFO L273 TraceCheckUtils]: 125: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,373 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {8185#true} {8186#false} #77#return; {8186#false} is VALID [2018-11-14 17:07:18,373 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 17:07:18,373 INFO L273 TraceCheckUtils]: 128: Hoare triple {8186#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8186#false} is VALID [2018-11-14 17:07:18,373 INFO L273 TraceCheckUtils]: 129: Hoare triple {8186#false} assume !false; {8186#false} is VALID [2018-11-14 17:07:18,381 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 17:07:18,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:18,381 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 17:07:18,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:18,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:18,729 INFO L256 TraceCheckUtils]: 0: Hoare triple {8185#true} call ULTIMATE.init(); {8185#true} is VALID [2018-11-14 17:07:18,729 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 17:07:18,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:18,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8185#true} {8185#true} #69#return; {8185#true} is VALID [2018-11-14 17:07:18,730 INFO L256 TraceCheckUtils]: 4: Hoare triple {8185#true} call #t~ret13 := main(); {8185#true} is VALID [2018-11-14 17:07:18,730 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 17:07:18,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {8219#(<= main_~i~1 0)} assume true; {8219#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:18,731 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 17:07:18,732 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 17:07:18,732 INFO L273 TraceCheckUtils]: 9: Hoare triple {8188#(<= main_~i~1 1)} assume true; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:18,733 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 17:07:18,733 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 17:07:18,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {8189#(<= main_~i~1 2)} assume true; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:18,734 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 17:07:18,734 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 17:07:18,735 INFO L273 TraceCheckUtils]: 15: Hoare triple {8190#(<= main_~i~1 3)} assume true; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:18,735 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 17:07:18,736 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 17:07:18,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {8191#(<= main_~i~1 4)} assume true; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:18,737 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 17:07:18,738 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 17:07:18,738 INFO L273 TraceCheckUtils]: 21: Hoare triple {8192#(<= main_~i~1 5)} assume true; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:18,739 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 17:07:18,740 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 17:07:18,740 INFO L273 TraceCheckUtils]: 24: Hoare triple {8193#(<= main_~i~1 6)} assume true; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:18,741 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 17:07:18,741 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 17:07:18,742 INFO L273 TraceCheckUtils]: 27: Hoare triple {8194#(<= main_~i~1 7)} assume true; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:18,742 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 17:07:18,743 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 17:07:18,744 INFO L273 TraceCheckUtils]: 30: Hoare triple {8195#(<= main_~i~1 8)} assume true; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:18,744 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 17:07:18,745 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 17:07:18,745 INFO L273 TraceCheckUtils]: 33: Hoare triple {8196#(<= main_~i~1 9)} assume true; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:18,746 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 17:07:18,747 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 17:07:18,747 INFO L273 TraceCheckUtils]: 36: Hoare triple {8197#(<= main_~i~1 10)} assume true; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:18,748 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 17:07:18,749 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 17:07:18,749 INFO L273 TraceCheckUtils]: 39: Hoare triple {8198#(<= main_~i~1 11)} assume true; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:18,750 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 17:07:18,750 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 17:07:18,751 INFO L273 TraceCheckUtils]: 42: Hoare triple {8199#(<= main_~i~1 12)} assume true; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:18,751 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 17:07:18,752 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 17:07:18,753 INFO L273 TraceCheckUtils]: 45: Hoare triple {8200#(<= main_~i~1 13)} assume true; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:18,753 INFO L273 TraceCheckUtils]: 46: Hoare triple {8200#(<= main_~i~1 13)} assume !(~i~1 < 10000); {8186#false} is VALID [2018-11-14 17:07:18,753 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 17:07:18,754 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 17:07:18,754 INFO L273 TraceCheckUtils]: 49: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,754 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 17:07:18,754 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 17:07:18,754 INFO L273 TraceCheckUtils]: 52: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,755 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 17:07:18,755 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 17:07:18,755 INFO L273 TraceCheckUtils]: 55: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,755 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 17:07:18,755 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 17:07:18,755 INFO L273 TraceCheckUtils]: 58: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,756 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 17:07:18,756 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 17:07:18,756 INFO L273 TraceCheckUtils]: 61: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,756 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 17:07:18,756 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 17:07:18,756 INFO L273 TraceCheckUtils]: 64: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,756 INFO L273 TraceCheckUtils]: 65: Hoare triple {8186#false} assume !(~i~0 < 10000); {8186#false} is VALID [2018-11-14 17:07:18,756 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 17:07:18,756 INFO L273 TraceCheckUtils]: 67: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,757 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {8186#false} {8186#false} #73#return; {8186#false} is VALID [2018-11-14 17:07:18,757 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 17:07:18,757 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 17:07:18,757 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 17:07:18,757 INFO L273 TraceCheckUtils]: 72: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,757 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 17:07:18,757 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 17:07:18,757 INFO L273 TraceCheckUtils]: 75: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,758 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 17:07:18,758 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 17:07:18,758 INFO L273 TraceCheckUtils]: 78: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,758 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 17:07:18,758 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 17:07:18,758 INFO L273 TraceCheckUtils]: 81: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,758 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 17:07:18,758 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 17:07:18,758 INFO L273 TraceCheckUtils]: 84: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,759 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 17:07:18,759 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 17:07:18,759 INFO L273 TraceCheckUtils]: 87: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,759 INFO L273 TraceCheckUtils]: 88: Hoare triple {8186#false} assume !(~i~0 < 10000); {8186#false} is VALID [2018-11-14 17:07:18,759 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 17:07:18,759 INFO L273 TraceCheckUtils]: 90: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,759 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {8186#false} {8186#false} #75#return; {8186#false} is VALID [2018-11-14 17:07:18,759 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 17:07:18,759 INFO L273 TraceCheckUtils]: 93: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,760 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 17:07:18,760 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 17:07:18,760 INFO L273 TraceCheckUtils]: 96: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,760 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 17:07:18,760 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 17:07:18,760 INFO L273 TraceCheckUtils]: 99: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,760 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 17:07:18,760 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 17:07:18,760 INFO L273 TraceCheckUtils]: 102: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,761 INFO L273 TraceCheckUtils]: 103: Hoare triple {8186#false} assume !(~i~2 < 9999); {8186#false} is VALID [2018-11-14 17:07:18,761 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 17:07:18,761 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 17:07:18,761 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 17:07:18,761 INFO L273 TraceCheckUtils]: 107: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,761 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 17:07:18,761 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 17:07:18,761 INFO L273 TraceCheckUtils]: 110: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,761 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 17:07:18,762 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 17:07:18,762 INFO L273 TraceCheckUtils]: 113: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,762 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 17:07:18,762 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 17:07:18,762 INFO L273 TraceCheckUtils]: 116: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,762 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 17:07:18,762 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 17:07:18,762 INFO L273 TraceCheckUtils]: 119: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,763 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 17:07:18,763 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 17:07:18,763 INFO L273 TraceCheckUtils]: 122: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,763 INFO L273 TraceCheckUtils]: 123: Hoare triple {8186#false} assume !(~i~0 < 10000); {8186#false} is VALID [2018-11-14 17:07:18,763 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 17:07:18,763 INFO L273 TraceCheckUtils]: 125: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:18,763 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {8186#false} {8186#false} #77#return; {8186#false} is VALID [2018-11-14 17:07:18,763 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 17:07:18,763 INFO L273 TraceCheckUtils]: 128: Hoare triple {8186#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8186#false} is VALID [2018-11-14 17:07:18,764 INFO L273 TraceCheckUtils]: 129: Hoare triple {8186#false} assume !false; {8186#false} is VALID [2018-11-14 17:07:18,771 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 17:07:18,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:18,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 17:07:18,792 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2018-11-14 17:07:18,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:18,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 17:07:18,907 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 17:07:18,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 17:07:18,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 17:07:18,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:07:18,908 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 17 states. [2018-11-14 17:07:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:19,218 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-11-14 17:07:19,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:07:19,219 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2018-11-14 17:07:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:07:19,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-14 17:07:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:07:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-14 17:07:19,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 99 transitions. [2018-11-14 17:07:19,330 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 17:07:19,332 INFO L225 Difference]: With dead ends: 135 [2018-11-14 17:07:19,332 INFO L226 Difference]: Without dead ends: 93 [2018-11-14 17:07:19,333 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:07:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-14 17:07:19,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-14 17:07:19,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:19,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 92 states. [2018-11-14 17:07:19,426 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 92 states. [2018-11-14 17:07:19,426 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 92 states. [2018-11-14 17:07:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:19,428 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-14 17:07:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-14 17:07:19,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:19,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:19,429 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 93 states. [2018-11-14 17:07:19,429 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 93 states. [2018-11-14 17:07:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:19,431 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-14 17:07:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-14 17:07:19,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:19,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:19,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:19,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 17:07:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-11-14 17:07:19,434 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 130 [2018-11-14 17:07:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:19,434 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-11-14 17:07:19,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 17:07:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-14 17:07:19,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-14 17:07:19,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:19,436 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 17:07:19,436 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:19,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:19,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1039240391, now seen corresponding path program 14 times [2018-11-14 17:07:19,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:19,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:19,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:19,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:19,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:19,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {9084#true} call ULTIMATE.init(); {9084#true} is VALID [2018-11-14 17:07:19,829 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 17:07:19,829 INFO L273 TraceCheckUtils]: 2: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,829 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9084#true} {9084#true} #69#return; {9084#true} is VALID [2018-11-14 17:07:19,830 INFO L256 TraceCheckUtils]: 4: Hoare triple {9084#true} call #t~ret13 := main(); {9084#true} is VALID [2018-11-14 17:07:19,830 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 17:07:19,831 INFO L273 TraceCheckUtils]: 6: Hoare triple {9086#(= main_~i~1 0)} assume true; {9086#(= main_~i~1 0)} is VALID [2018-11-14 17:07:19,831 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 17:07:19,832 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 17:07:19,832 INFO L273 TraceCheckUtils]: 9: Hoare triple {9087#(<= main_~i~1 1)} assume true; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:19,832 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 17:07:19,833 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 17:07:19,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {9088#(<= main_~i~1 2)} assume true; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:19,833 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 17:07:19,834 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 17:07:19,835 INFO L273 TraceCheckUtils]: 15: Hoare triple {9089#(<= main_~i~1 3)} assume true; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:19,835 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 17:07:19,836 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 17:07:19,837 INFO L273 TraceCheckUtils]: 18: Hoare triple {9090#(<= main_~i~1 4)} assume true; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:19,837 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 17:07:19,838 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 17:07:19,838 INFO L273 TraceCheckUtils]: 21: Hoare triple {9091#(<= main_~i~1 5)} assume true; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:19,839 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 17:07:19,840 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 17:07:19,840 INFO L273 TraceCheckUtils]: 24: Hoare triple {9092#(<= main_~i~1 6)} assume true; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:19,841 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 17:07:19,841 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 17:07:19,842 INFO L273 TraceCheckUtils]: 27: Hoare triple {9093#(<= main_~i~1 7)} assume true; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:19,842 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 17:07:19,843 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 17:07:19,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {9094#(<= main_~i~1 8)} assume true; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:19,844 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 17:07:19,845 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 17:07:19,845 INFO L273 TraceCheckUtils]: 33: Hoare triple {9095#(<= main_~i~1 9)} assume true; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:19,846 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 17:07:19,847 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 17:07:19,847 INFO L273 TraceCheckUtils]: 36: Hoare triple {9096#(<= main_~i~1 10)} assume true; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:19,848 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 17:07:19,848 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 17:07:19,849 INFO L273 TraceCheckUtils]: 39: Hoare triple {9097#(<= main_~i~1 11)} assume true; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:19,850 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 17:07:19,850 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 17:07:19,851 INFO L273 TraceCheckUtils]: 42: Hoare triple {9098#(<= main_~i~1 12)} assume true; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:19,851 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 17:07:19,852 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 17:07:19,853 INFO L273 TraceCheckUtils]: 45: Hoare triple {9099#(<= main_~i~1 13)} assume true; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:19,853 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 17:07:19,854 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 17:07:19,854 INFO L273 TraceCheckUtils]: 48: Hoare triple {9100#(<= main_~i~1 14)} assume true; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:19,855 INFO L273 TraceCheckUtils]: 49: Hoare triple {9100#(<= main_~i~1 14)} assume !(~i~1 < 10000); {9085#false} is VALID [2018-11-14 17:07:19,855 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 17:07:19,855 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 17:07:19,856 INFO L273 TraceCheckUtils]: 52: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,856 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 17:07:19,856 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 17:07:19,856 INFO L273 TraceCheckUtils]: 55: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,856 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 17:07:19,857 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 17:07:19,857 INFO L273 TraceCheckUtils]: 58: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,857 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 17:07:19,857 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 17:07:19,857 INFO L273 TraceCheckUtils]: 61: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,858 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 17:07:19,858 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 17:07:19,858 INFO L273 TraceCheckUtils]: 64: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,858 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 17:07:19,858 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 17:07:19,858 INFO L273 TraceCheckUtils]: 67: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,858 INFO L273 TraceCheckUtils]: 68: Hoare triple {9084#true} assume !(~i~0 < 10000); {9084#true} is VALID [2018-11-14 17:07:19,858 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 17:07:19,858 INFO L273 TraceCheckUtils]: 70: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,859 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {9084#true} {9085#false} #73#return; {9085#false} is VALID [2018-11-14 17:07:19,859 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 17:07:19,859 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 17:07:19,859 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 17:07:19,859 INFO L273 TraceCheckUtils]: 75: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,859 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 17:07:19,859 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 17:07:19,859 INFO L273 TraceCheckUtils]: 78: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,859 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 17:07:19,860 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 17:07:19,860 INFO L273 TraceCheckUtils]: 81: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,860 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 17:07:19,860 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 17:07:19,860 INFO L273 TraceCheckUtils]: 84: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,860 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 17:07:19,860 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 17:07:19,860 INFO L273 TraceCheckUtils]: 87: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,860 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 17:07:19,861 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 17:07:19,861 INFO L273 TraceCheckUtils]: 90: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,861 INFO L273 TraceCheckUtils]: 91: Hoare triple {9084#true} assume !(~i~0 < 10000); {9084#true} is VALID [2018-11-14 17:07:19,861 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 17:07:19,861 INFO L273 TraceCheckUtils]: 93: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,861 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9084#true} {9085#false} #75#return; {9085#false} is VALID [2018-11-14 17:07:19,861 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 17:07:19,861 INFO L273 TraceCheckUtils]: 96: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:19,862 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 17:07:19,862 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 17:07:19,862 INFO L273 TraceCheckUtils]: 99: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:19,862 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 17:07:19,862 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 17:07:19,862 INFO L273 TraceCheckUtils]: 102: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:19,862 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 17:07:19,862 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 17:07:19,862 INFO L273 TraceCheckUtils]: 105: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:19,863 INFO L273 TraceCheckUtils]: 106: Hoare triple {9085#false} assume !(~i~2 < 9999); {9085#false} is VALID [2018-11-14 17:07:19,863 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 17:07:19,863 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 17:07:19,863 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 17:07:19,863 INFO L273 TraceCheckUtils]: 110: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,863 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 17:07:19,863 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 17:07:19,863 INFO L273 TraceCheckUtils]: 113: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,864 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 17:07:19,864 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 17:07:19,864 INFO L273 TraceCheckUtils]: 116: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,864 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 17:07:19,864 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 17:07:19,864 INFO L273 TraceCheckUtils]: 119: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,864 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 17:07:19,864 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 17:07:19,864 INFO L273 TraceCheckUtils]: 122: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,865 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 17:07:19,865 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 17:07:19,865 INFO L273 TraceCheckUtils]: 125: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,865 INFO L273 TraceCheckUtils]: 126: Hoare triple {9084#true} assume !(~i~0 < 10000); {9084#true} is VALID [2018-11-14 17:07:19,865 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 17:07:19,865 INFO L273 TraceCheckUtils]: 128: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:19,865 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {9084#true} {9085#false} #77#return; {9085#false} is VALID [2018-11-14 17:07:19,866 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 17:07:19,866 INFO L273 TraceCheckUtils]: 131: Hoare triple {9085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9085#false} is VALID [2018-11-14 17:07:19,866 INFO L273 TraceCheckUtils]: 132: Hoare triple {9085#false} assume !false; {9085#false} is VALID [2018-11-14 17:07:19,876 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 17:07:19,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:19,876 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 17:07:19,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:07:19,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:07:19,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:19,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:20,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {9084#true} call ULTIMATE.init(); {9084#true} is VALID [2018-11-14 17:07:20,236 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 17:07:20,236 INFO L273 TraceCheckUtils]: 2: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:20,236 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9084#true} {9084#true} #69#return; {9084#true} is VALID [2018-11-14 17:07:20,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {9084#true} call #t~ret13 := main(); {9084#true} is VALID [2018-11-14 17:07:20,237 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 17:07:20,238 INFO L273 TraceCheckUtils]: 6: Hoare triple {9119#(<= main_~i~1 0)} assume true; {9119#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:20,238 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 17:07:20,239 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 17:07:20,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {9087#(<= main_~i~1 1)} assume true; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:20,239 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 17:07:20,240 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 17:07:20,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {9088#(<= main_~i~1 2)} assume true; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:20,240 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 17:07:20,241 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 17:07:20,242 INFO L273 TraceCheckUtils]: 15: Hoare triple {9089#(<= main_~i~1 3)} assume true; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:20,248 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 17:07:20,249 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 17:07:20,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {9090#(<= main_~i~1 4)} assume true; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:20,249 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 17:07:20,250 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 17:07:20,250 INFO L273 TraceCheckUtils]: 21: Hoare triple {9091#(<= main_~i~1 5)} assume true; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:20,250 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 17:07:20,251 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 17:07:20,251 INFO L273 TraceCheckUtils]: 24: Hoare triple {9092#(<= main_~i~1 6)} assume true; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:20,251 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 17:07:20,252 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 17:07:20,252 INFO L273 TraceCheckUtils]: 27: Hoare triple {9093#(<= main_~i~1 7)} assume true; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:20,253 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 17:07:20,254 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 17:07:20,254 INFO L273 TraceCheckUtils]: 30: Hoare triple {9094#(<= main_~i~1 8)} assume true; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:20,255 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 17:07:20,255 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 17:07:20,256 INFO L273 TraceCheckUtils]: 33: Hoare triple {9095#(<= main_~i~1 9)} assume true; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:20,256 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 17:07:20,257 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 17:07:20,257 INFO L273 TraceCheckUtils]: 36: Hoare triple {9096#(<= main_~i~1 10)} assume true; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:20,258 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 17:07:20,259 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 17:07:20,259 INFO L273 TraceCheckUtils]: 39: Hoare triple {9097#(<= main_~i~1 11)} assume true; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:20,260 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 17:07:20,260 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 17:07:20,261 INFO L273 TraceCheckUtils]: 42: Hoare triple {9098#(<= main_~i~1 12)} assume true; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:20,261 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 17:07:20,262 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 17:07:20,262 INFO L273 TraceCheckUtils]: 45: Hoare triple {9099#(<= main_~i~1 13)} assume true; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:20,263 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 17:07:20,264 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 17:07:20,264 INFO L273 TraceCheckUtils]: 48: Hoare triple {9100#(<= main_~i~1 14)} assume true; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:20,265 INFO L273 TraceCheckUtils]: 49: Hoare triple {9100#(<= main_~i~1 14)} assume !(~i~1 < 10000); {9085#false} is VALID [2018-11-14 17:07:20,265 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 17:07:20,265 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 17:07:20,265 INFO L273 TraceCheckUtils]: 52: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,266 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 17:07:20,266 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 17:07:20,266 INFO L273 TraceCheckUtils]: 55: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,266 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 17:07:20,266 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 17:07:20,267 INFO L273 TraceCheckUtils]: 58: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,267 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 17:07:20,267 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 17:07:20,267 INFO L273 TraceCheckUtils]: 61: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,267 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 17:07:20,267 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 17:07:20,267 INFO L273 TraceCheckUtils]: 64: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,268 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 17:07:20,268 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 17:07:20,268 INFO L273 TraceCheckUtils]: 67: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,268 INFO L273 TraceCheckUtils]: 68: Hoare triple {9085#false} assume !(~i~0 < 10000); {9085#false} is VALID [2018-11-14 17:07:20,268 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 17:07:20,268 INFO L273 TraceCheckUtils]: 70: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,268 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {9085#false} {9085#false} #73#return; {9085#false} is VALID [2018-11-14 17:07:20,268 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 17:07:20,268 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 17:07:20,269 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 17:07:20,269 INFO L273 TraceCheckUtils]: 75: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,269 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 17:07:20,269 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 17:07:20,269 INFO L273 TraceCheckUtils]: 78: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,269 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 17:07:20,269 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 17:07:20,269 INFO L273 TraceCheckUtils]: 81: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,269 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 17:07:20,270 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 17:07:20,270 INFO L273 TraceCheckUtils]: 84: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,270 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 17:07:20,270 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 17:07:20,270 INFO L273 TraceCheckUtils]: 87: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,270 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 17:07:20,270 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 17:07:20,270 INFO L273 TraceCheckUtils]: 90: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,270 INFO L273 TraceCheckUtils]: 91: Hoare triple {9085#false} assume !(~i~0 < 10000); {9085#false} is VALID [2018-11-14 17:07:20,271 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 17:07:20,271 INFO L273 TraceCheckUtils]: 93: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,271 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9085#false} {9085#false} #75#return; {9085#false} is VALID [2018-11-14 17:07:20,271 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 17:07:20,271 INFO L273 TraceCheckUtils]: 96: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,271 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 17:07:20,271 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 17:07:20,271 INFO L273 TraceCheckUtils]: 99: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,271 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 17:07:20,272 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 17:07:20,272 INFO L273 TraceCheckUtils]: 102: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,272 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 17:07:20,272 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 17:07:20,272 INFO L273 TraceCheckUtils]: 105: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,272 INFO L273 TraceCheckUtils]: 106: Hoare triple {9085#false} assume !(~i~2 < 9999); {9085#false} is VALID [2018-11-14 17:07:20,272 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 17:07:20,272 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 17:07:20,272 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 17:07:20,273 INFO L273 TraceCheckUtils]: 110: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,273 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 17:07:20,273 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 17:07:20,273 INFO L273 TraceCheckUtils]: 113: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,273 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 17:07:20,273 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 17:07:20,273 INFO L273 TraceCheckUtils]: 116: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,273 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 17:07:20,274 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 17:07:20,274 INFO L273 TraceCheckUtils]: 119: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,274 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 17:07:20,274 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 17:07:20,274 INFO L273 TraceCheckUtils]: 122: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,274 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 17:07:20,274 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 17:07:20,274 INFO L273 TraceCheckUtils]: 125: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,275 INFO L273 TraceCheckUtils]: 126: Hoare triple {9085#false} assume !(~i~0 < 10000); {9085#false} is VALID [2018-11-14 17:07:20,275 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 17:07:20,275 INFO L273 TraceCheckUtils]: 128: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:20,275 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {9085#false} {9085#false} #77#return; {9085#false} is VALID [2018-11-14 17:07:20,275 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 17:07:20,275 INFO L273 TraceCheckUtils]: 131: Hoare triple {9085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9085#false} is VALID [2018-11-14 17:07:20,276 INFO L273 TraceCheckUtils]: 132: Hoare triple {9085#false} assume !false; {9085#false} is VALID [2018-11-14 17:07:20,284 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 17:07:20,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:20,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 17:07:20,305 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2018-11-14 17:07:20,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:20,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:07:20,383 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 17:07:20,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:07:20,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:07:20,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:07:20,384 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 18 states. [2018-11-14 17:07:21,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:21,074 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-14 17:07:21,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 17:07:21,074 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2018-11-14 17:07:21,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:07:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-14 17:07:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:07:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-14 17:07:21,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 102 transitions. [2018-11-14 17:07:21,187 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 17:07:21,189 INFO L225 Difference]: With dead ends: 138 [2018-11-14 17:07:21,190 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 17:07:21,190 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:07:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 17:07:21,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-14 17:07:21,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:21,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-14 17:07:21,216 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-14 17:07:21,216 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-14 17:07:21,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:21,218 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 17:07:21,218 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 17:07:21,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:21,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:21,219 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-14 17:07:21,219 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-14 17:07:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:21,220 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 17:07:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 17:07:21,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:21,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:21,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:21,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-14 17:07:21,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-14 17:07:21,222 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 133 [2018-11-14 17:07:21,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:21,222 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-14 17:07:21,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:07:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-14 17:07:21,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-14 17:07:21,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:21,224 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 17:07:21,224 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:21,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:21,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1279003789, now seen corresponding path program 15 times [2018-11-14 17:07:21,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:21,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:21,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:21,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:21,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:21,949 INFO L256 TraceCheckUtils]: 0: Hoare triple {10007#true} call ULTIMATE.init(); {10007#true} is VALID [2018-11-14 17:07:21,950 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 17:07:21,950 INFO L273 TraceCheckUtils]: 2: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,950 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10007#true} {10007#true} #69#return; {10007#true} is VALID [2018-11-14 17:07:21,950 INFO L256 TraceCheckUtils]: 4: Hoare triple {10007#true} call #t~ret13 := main(); {10007#true} is VALID [2018-11-14 17:07:21,951 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 17:07:21,951 INFO L273 TraceCheckUtils]: 6: Hoare triple {10009#(= main_~i~1 0)} assume true; {10009#(= main_~i~1 0)} is VALID [2018-11-14 17:07:21,952 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 17:07:21,953 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 17:07:21,953 INFO L273 TraceCheckUtils]: 9: Hoare triple {10010#(<= main_~i~1 1)} assume true; {10010#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:21,954 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 17:07:21,954 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 17:07:21,954 INFO L273 TraceCheckUtils]: 12: Hoare triple {10011#(<= main_~i~1 2)} assume true; {10011#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:21,955 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 17:07:21,955 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 17:07:21,956 INFO L273 TraceCheckUtils]: 15: Hoare triple {10012#(<= main_~i~1 3)} assume true; {10012#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:21,956 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 17:07:21,957 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 17:07:21,957 INFO L273 TraceCheckUtils]: 18: Hoare triple {10013#(<= main_~i~1 4)} assume true; {10013#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:21,958 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 17:07:21,959 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 17:07:21,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {10014#(<= main_~i~1 5)} assume true; {10014#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:21,960 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 17:07:21,960 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 17:07:21,961 INFO L273 TraceCheckUtils]: 24: Hoare triple {10015#(<= main_~i~1 6)} assume true; {10015#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:21,961 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 17:07:21,962 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 17:07:21,963 INFO L273 TraceCheckUtils]: 27: Hoare triple {10016#(<= main_~i~1 7)} assume true; {10016#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:21,963 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 17:07:21,964 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 17:07:21,965 INFO L273 TraceCheckUtils]: 30: Hoare triple {10017#(<= main_~i~1 8)} assume true; {10017#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:21,965 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 17:07:21,966 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 17:07:21,966 INFO L273 TraceCheckUtils]: 33: Hoare triple {10018#(<= main_~i~1 9)} assume true; {10018#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:21,967 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 17:07:21,968 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 17:07:21,968 INFO L273 TraceCheckUtils]: 36: Hoare triple {10019#(<= main_~i~1 10)} assume true; {10019#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:21,969 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 17:07:21,969 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 17:07:21,970 INFO L273 TraceCheckUtils]: 39: Hoare triple {10020#(<= main_~i~1 11)} assume true; {10020#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:21,970 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 17:07:21,971 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 17:07:21,972 INFO L273 TraceCheckUtils]: 42: Hoare triple {10021#(<= main_~i~1 12)} assume true; {10021#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:21,972 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 17:07:21,973 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 17:07:21,974 INFO L273 TraceCheckUtils]: 45: Hoare triple {10022#(<= main_~i~1 13)} assume true; {10022#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:21,974 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 17:07:21,975 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 17:07:21,975 INFO L273 TraceCheckUtils]: 48: Hoare triple {10023#(<= main_~i~1 14)} assume true; {10023#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:21,976 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 17:07:21,977 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 17:07:21,977 INFO L273 TraceCheckUtils]: 51: Hoare triple {10024#(<= main_~i~1 15)} assume true; {10024#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:21,978 INFO L273 TraceCheckUtils]: 52: Hoare triple {10024#(<= main_~i~1 15)} assume !(~i~1 < 10000); {10008#false} is VALID [2018-11-14 17:07:21,978 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 17:07:21,978 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 17:07:21,978 INFO L273 TraceCheckUtils]: 55: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,979 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 17:07:21,979 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 17:07:21,979 INFO L273 TraceCheckUtils]: 58: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,979 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 17:07:21,979 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 17:07:21,980 INFO L273 TraceCheckUtils]: 61: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,980 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 17:07:21,980 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 17:07:21,980 INFO L273 TraceCheckUtils]: 64: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,980 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 17:07:21,981 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 17:07:21,981 INFO L273 TraceCheckUtils]: 67: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,981 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 17:07:21,981 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 17:07:21,981 INFO L273 TraceCheckUtils]: 70: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,981 INFO L273 TraceCheckUtils]: 71: Hoare triple {10007#true} assume !(~i~0 < 10000); {10007#true} is VALID [2018-11-14 17:07:21,982 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 17:07:21,982 INFO L273 TraceCheckUtils]: 73: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,982 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {10007#true} {10008#false} #73#return; {10008#false} is VALID [2018-11-14 17:07:21,982 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 17:07:21,982 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 17:07:21,982 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 17:07:21,982 INFO L273 TraceCheckUtils]: 78: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,982 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 17:07:21,982 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 17:07:21,983 INFO L273 TraceCheckUtils]: 81: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,983 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 17:07:21,983 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 17:07:21,983 INFO L273 TraceCheckUtils]: 84: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,983 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 17:07:21,983 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 17:07:21,983 INFO L273 TraceCheckUtils]: 87: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,983 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 17:07:21,983 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 17:07:21,984 INFO L273 TraceCheckUtils]: 90: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,984 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 17:07:21,984 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 17:07:21,984 INFO L273 TraceCheckUtils]: 93: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,984 INFO L273 TraceCheckUtils]: 94: Hoare triple {10007#true} assume !(~i~0 < 10000); {10007#true} is VALID [2018-11-14 17:07:21,984 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 17:07:21,984 INFO L273 TraceCheckUtils]: 96: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,984 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {10007#true} {10008#false} #75#return; {10008#false} is VALID [2018-11-14 17:07:21,984 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 17:07:21,985 INFO L273 TraceCheckUtils]: 99: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:21,985 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 17:07:21,985 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 17:07:21,985 INFO L273 TraceCheckUtils]: 102: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:21,985 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 17:07:21,985 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 17:07:21,985 INFO L273 TraceCheckUtils]: 105: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:21,985 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 17:07:21,985 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 17:07:21,986 INFO L273 TraceCheckUtils]: 108: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:21,986 INFO L273 TraceCheckUtils]: 109: Hoare triple {10008#false} assume !(~i~2 < 9999); {10008#false} is VALID [2018-11-14 17:07:21,986 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 17:07:21,986 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 17:07:21,986 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 17:07:21,986 INFO L273 TraceCheckUtils]: 113: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,986 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 17:07:21,986 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 17:07:21,987 INFO L273 TraceCheckUtils]: 116: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,987 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 17:07:21,987 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 17:07:21,987 INFO L273 TraceCheckUtils]: 119: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,987 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 17:07:21,987 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 17:07:21,987 INFO L273 TraceCheckUtils]: 122: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,987 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 17:07:21,988 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 17:07:21,988 INFO L273 TraceCheckUtils]: 125: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,988 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 17:07:21,988 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 17:07:21,988 INFO L273 TraceCheckUtils]: 128: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,988 INFO L273 TraceCheckUtils]: 129: Hoare triple {10007#true} assume !(~i~0 < 10000); {10007#true} is VALID [2018-11-14 17:07:21,988 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 17:07:21,988 INFO L273 TraceCheckUtils]: 131: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,989 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {10007#true} {10008#false} #77#return; {10008#false} is VALID [2018-11-14 17:07:21,989 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 17:07:21,989 INFO L273 TraceCheckUtils]: 134: Hoare triple {10008#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10008#false} is VALID [2018-11-14 17:07:21,989 INFO L273 TraceCheckUtils]: 135: Hoare triple {10008#false} assume !false; {10008#false} is VALID [2018-11-14 17:07:21,997 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 17:07:21,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:21,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:22,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:07:22,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 17:07:22,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:22,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:22,249 INFO L256 TraceCheckUtils]: 0: Hoare triple {10007#true} call ULTIMATE.init(); {10007#true} is VALID [2018-11-14 17:07:22,249 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 17:07:22,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,250 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10007#true} {10007#true} #69#return; {10007#true} is VALID [2018-11-14 17:07:22,250 INFO L256 TraceCheckUtils]: 4: Hoare triple {10007#true} call #t~ret13 := main(); {10007#true} is VALID [2018-11-14 17:07:22,250 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 17:07:22,251 INFO L273 TraceCheckUtils]: 6: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,251 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 17:07:22,251 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 17:07:22,251 INFO L273 TraceCheckUtils]: 9: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,252 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 17:07:22,252 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 17:07:22,252 INFO L273 TraceCheckUtils]: 12: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,252 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 17:07:22,252 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 17:07:22,252 INFO L273 TraceCheckUtils]: 15: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,253 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 17:07:22,253 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 17:07:22,253 INFO L273 TraceCheckUtils]: 18: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,253 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 17:07:22,253 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 17:07:22,253 INFO L273 TraceCheckUtils]: 21: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,253 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 17:07:22,254 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 17:07:22,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,254 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 17:07:22,254 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 17:07:22,254 INFO L273 TraceCheckUtils]: 27: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,254 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 17:07:22,254 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 17:07:22,255 INFO L273 TraceCheckUtils]: 30: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,255 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 17:07:22,255 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 17:07:22,255 INFO L273 TraceCheckUtils]: 33: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,255 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 17:07:22,255 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 17:07:22,255 INFO L273 TraceCheckUtils]: 36: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,256 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 17:07:22,256 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 17:07:22,256 INFO L273 TraceCheckUtils]: 39: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,256 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 17:07:22,256 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 17:07:22,256 INFO L273 TraceCheckUtils]: 42: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,256 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 17:07:22,257 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 17:07:22,257 INFO L273 TraceCheckUtils]: 45: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,257 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 17:07:22,257 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 17:07:22,257 INFO L273 TraceCheckUtils]: 48: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,257 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 17:07:22,257 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 17:07:22,258 INFO L273 TraceCheckUtils]: 51: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,258 INFO L273 TraceCheckUtils]: 52: Hoare triple {10007#true} assume !(~i~1 < 10000); {10007#true} is VALID [2018-11-14 17:07:22,258 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 17:07:22,258 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 17:07:22,258 INFO L273 TraceCheckUtils]: 55: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,258 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 17:07:22,258 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 17:07:22,259 INFO L273 TraceCheckUtils]: 58: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,259 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 17:07:22,259 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 17:07:22,259 INFO L273 TraceCheckUtils]: 61: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,259 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 17:07:22,259 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 17:07:22,260 INFO L273 TraceCheckUtils]: 64: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,260 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 17:07:22,260 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 17:07:22,260 INFO L273 TraceCheckUtils]: 67: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,260 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 17:07:22,260 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 17:07:22,260 INFO L273 TraceCheckUtils]: 70: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,261 INFO L273 TraceCheckUtils]: 71: Hoare triple {10007#true} assume !(~i~0 < 10000); {10007#true} is VALID [2018-11-14 17:07:22,261 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 17:07:22,261 INFO L273 TraceCheckUtils]: 73: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,261 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {10007#true} {10007#true} #73#return; {10007#true} is VALID [2018-11-14 17:07:22,261 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 17:07:22,261 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 17:07:22,261 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 17:07:22,262 INFO L273 TraceCheckUtils]: 78: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,262 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 17:07:22,262 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 17:07:22,262 INFO L273 TraceCheckUtils]: 81: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,262 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 17:07:22,262 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 17:07:22,262 INFO L273 TraceCheckUtils]: 84: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,263 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 17:07:22,263 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 17:07:22,263 INFO L273 TraceCheckUtils]: 87: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,263 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 17:07:22,263 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 17:07:22,263 INFO L273 TraceCheckUtils]: 90: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,263 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 17:07:22,264 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 17:07:22,264 INFO L273 TraceCheckUtils]: 93: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,264 INFO L273 TraceCheckUtils]: 94: Hoare triple {10007#true} assume !(~i~0 < 10000); {10007#true} is VALID [2018-11-14 17:07:22,264 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 17:07:22,264 INFO L273 TraceCheckUtils]: 96: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:22,264 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {10007#true} {10007#true} #75#return; {10007#true} is VALID [2018-11-14 17:07:22,267 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 17:07:22,267 INFO L273 TraceCheckUtils]: 99: Hoare triple {10322#(<= main_~i~2 0)} assume true; {10322#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:22,267 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 17:07:22,268 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 17:07:22,269 INFO L273 TraceCheckUtils]: 102: Hoare triple {10332#(<= main_~i~2 1)} assume true; {10332#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:22,269 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 17:07:22,270 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 17:07:22,270 INFO L273 TraceCheckUtils]: 105: Hoare triple {10342#(<= main_~i~2 2)} assume true; {10342#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:22,271 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 17:07:22,272 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 17:07:22,272 INFO L273 TraceCheckUtils]: 108: Hoare triple {10352#(<= main_~i~2 3)} assume true; {10352#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:22,273 INFO L273 TraceCheckUtils]: 109: Hoare triple {10352#(<= main_~i~2 3)} assume !(~i~2 < 9999); {10008#false} is VALID [2018-11-14 17:07:22,273 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 17:07:22,273 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 17:07:22,273 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 17:07:22,274 INFO L273 TraceCheckUtils]: 113: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:22,274 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 17:07:22,274 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 17:07:22,274 INFO L273 TraceCheckUtils]: 116: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:22,274 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 17:07:22,275 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 17:07:22,275 INFO L273 TraceCheckUtils]: 119: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:22,275 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 17:07:22,275 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 17:07:22,275 INFO L273 TraceCheckUtils]: 122: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:22,276 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 17:07:22,276 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 17:07:22,276 INFO L273 TraceCheckUtils]: 125: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:22,276 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 17:07:22,276 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 17:07:22,276 INFO L273 TraceCheckUtils]: 128: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:22,276 INFO L273 TraceCheckUtils]: 129: Hoare triple {10008#false} assume !(~i~0 < 10000); {10008#false} is VALID [2018-11-14 17:07:22,276 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 17:07:22,277 INFO L273 TraceCheckUtils]: 131: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:22,277 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {10008#false} {10008#false} #77#return; {10008#false} is VALID [2018-11-14 17:07:22,277 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 17:07:22,277 INFO L273 TraceCheckUtils]: 134: Hoare triple {10008#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10008#false} is VALID [2018-11-14 17:07:22,277 INFO L273 TraceCheckUtils]: 135: Hoare triple {10008#false} assume !false; {10008#false} is VALID [2018-11-14 17:07:22,300 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 17:07:22,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:22,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6] total 22 [2018-11-14 17:07:22,321 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 136 [2018-11-14 17:07:22,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:22,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 17:07:22,427 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 17:07:22,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 17:07:22,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 17:07:22,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:07:22,429 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 22 states. [2018-11-14 17:07:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:22,883 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-11-14 17:07:22,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 17:07:22,884 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 136 [2018-11-14 17:07:22,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:07:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 118 transitions. [2018-11-14 17:07:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:07:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 118 transitions. [2018-11-14 17:07:22,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 118 transitions. [2018-11-14 17:07:23,012 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 17:07:23,014 INFO L225 Difference]: With dead ends: 145 [2018-11-14 17:07:23,015 INFO L226 Difference]: Without dead ends: 103 [2018-11-14 17:07:23,015 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 17:07:23,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-14 17:07:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-11-14 17:07:23,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:23,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 101 states. [2018-11-14 17:07:23,050 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 101 states. [2018-11-14 17:07:23,050 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 101 states. [2018-11-14 17:07:23,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:23,053 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-14 17:07:23,053 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-14 17:07:23,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:23,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:23,054 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 103 states. [2018-11-14 17:07:23,054 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 103 states. [2018-11-14 17:07:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:23,056 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-14 17:07:23,056 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-14 17:07:23,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:23,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:23,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:23,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 17:07:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-11-14 17:07:23,059 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 136 [2018-11-14 17:07:23,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:23,059 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-11-14 17:07:23,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 17:07:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-14 17:07:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-14 17:07:23,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:23,061 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 17:07:23,061 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:23,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash 562002789, now seen corresponding path program 16 times [2018-11-14 17:07:23,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:23,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:23,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:23,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {10974#true} call ULTIMATE.init(); {10974#true} is VALID [2018-11-14 17:07:23,510 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 17:07:23,510 INFO L273 TraceCheckUtils]: 2: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,510 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10974#true} {10974#true} #69#return; {10974#true} is VALID [2018-11-14 17:07:23,510 INFO L256 TraceCheckUtils]: 4: Hoare triple {10974#true} call #t~ret13 := main(); {10974#true} is VALID [2018-11-14 17:07:23,510 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 17:07:23,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {10976#(= main_~i~1 0)} assume true; {10976#(= main_~i~1 0)} is VALID [2018-11-14 17:07:23,511 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 17:07:23,511 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 17:07:23,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {10977#(<= main_~i~1 1)} assume true; {10977#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:23,512 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 17:07:23,513 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 17:07:23,513 INFO L273 TraceCheckUtils]: 12: Hoare triple {10978#(<= main_~i~1 2)} assume true; {10978#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:23,514 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 17:07:23,514 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 17:07:23,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {10979#(<= main_~i~1 3)} assume true; {10979#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:23,516 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 17:07:23,516 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 17:07:23,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {10980#(<= main_~i~1 4)} assume true; {10980#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:23,517 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 17:07:23,518 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 17:07:23,519 INFO L273 TraceCheckUtils]: 21: Hoare triple {10981#(<= main_~i~1 5)} assume true; {10981#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:23,519 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 17:07:23,520 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 17:07:23,520 INFO L273 TraceCheckUtils]: 24: Hoare triple {10982#(<= main_~i~1 6)} assume true; {10982#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:23,521 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 17:07:23,521 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 17:07:23,522 INFO L273 TraceCheckUtils]: 27: Hoare triple {10983#(<= main_~i~1 7)} assume true; {10983#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:23,522 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 17:07:23,523 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 17:07:23,524 INFO L273 TraceCheckUtils]: 30: Hoare triple {10984#(<= main_~i~1 8)} assume true; {10984#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:23,524 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 17:07:23,525 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 17:07:23,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {10985#(<= main_~i~1 9)} assume true; {10985#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:23,526 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 17:07:23,526 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 17:07:23,527 INFO L273 TraceCheckUtils]: 36: Hoare triple {10986#(<= main_~i~1 10)} assume true; {10986#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:23,527 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 17:07:23,528 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 17:07:23,529 INFO L273 TraceCheckUtils]: 39: Hoare triple {10987#(<= main_~i~1 11)} assume true; {10987#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:23,529 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 17:07:23,530 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 17:07:23,530 INFO L273 TraceCheckUtils]: 42: Hoare triple {10988#(<= main_~i~1 12)} assume true; {10988#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:23,531 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 17:07:23,531 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 17:07:23,532 INFO L273 TraceCheckUtils]: 45: Hoare triple {10989#(<= main_~i~1 13)} assume true; {10989#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:23,532 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 17:07:23,533 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 17:07:23,534 INFO L273 TraceCheckUtils]: 48: Hoare triple {10990#(<= main_~i~1 14)} assume true; {10990#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:23,534 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 17:07:23,535 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 17:07:23,535 INFO L273 TraceCheckUtils]: 51: Hoare triple {10991#(<= main_~i~1 15)} assume true; {10991#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:23,536 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 17:07:23,536 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 17:07:23,537 INFO L273 TraceCheckUtils]: 54: Hoare triple {10992#(<= main_~i~1 16)} assume true; {10992#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:23,538 INFO L273 TraceCheckUtils]: 55: Hoare triple {10992#(<= main_~i~1 16)} assume !(~i~1 < 10000); {10975#false} is VALID [2018-11-14 17:07:23,538 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 17:07:23,538 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 17:07:23,538 INFO L273 TraceCheckUtils]: 58: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,538 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 17:07:23,539 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 17:07:23,539 INFO L273 TraceCheckUtils]: 61: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,539 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 17:07:23,539 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 17:07:23,539 INFO L273 TraceCheckUtils]: 64: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,539 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 17:07:23,540 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 17:07:23,540 INFO L273 TraceCheckUtils]: 67: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,540 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 17:07:23,540 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 17:07:23,540 INFO L273 TraceCheckUtils]: 70: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,540 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 17:07:23,541 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 17:07:23,541 INFO L273 TraceCheckUtils]: 73: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,541 INFO L273 TraceCheckUtils]: 74: Hoare triple {10974#true} assume !(~i~0 < 10000); {10974#true} is VALID [2018-11-14 17:07:23,541 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 17:07:23,541 INFO L273 TraceCheckUtils]: 76: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,541 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {10974#true} {10975#false} #73#return; {10975#false} is VALID [2018-11-14 17:07:23,541 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 17:07:23,541 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 17:07:23,542 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 17:07:23,542 INFO L273 TraceCheckUtils]: 81: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,542 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 17:07:23,542 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 17:07:23,542 INFO L273 TraceCheckUtils]: 84: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,542 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 17:07:23,542 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 17:07:23,542 INFO L273 TraceCheckUtils]: 87: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,542 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 17:07:23,543 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 17:07:23,543 INFO L273 TraceCheckUtils]: 90: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,543 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 17:07:23,543 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 17:07:23,543 INFO L273 TraceCheckUtils]: 93: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,543 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 17:07:23,543 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 17:07:23,543 INFO L273 TraceCheckUtils]: 96: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,543 INFO L273 TraceCheckUtils]: 97: Hoare triple {10974#true} assume !(~i~0 < 10000); {10974#true} is VALID [2018-11-14 17:07:23,544 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 17:07:23,544 INFO L273 TraceCheckUtils]: 99: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,544 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {10974#true} {10975#false} #75#return; {10975#false} is VALID [2018-11-14 17:07:23,544 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 17:07:23,544 INFO L273 TraceCheckUtils]: 102: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:07:23,544 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 17:07:23,544 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 17:07:23,544 INFO L273 TraceCheckUtils]: 105: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:07:23,545 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 17:07:23,545 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 17:07:23,545 INFO L273 TraceCheckUtils]: 108: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:07:23,545 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 17:07:23,545 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 17:07:23,545 INFO L273 TraceCheckUtils]: 111: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:07:23,545 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 17:07:23,545 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 17:07:23,545 INFO L273 TraceCheckUtils]: 114: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:07:23,546 INFO L273 TraceCheckUtils]: 115: Hoare triple {10975#false} assume !(~i~2 < 9999); {10975#false} is VALID [2018-11-14 17:07:23,546 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 17:07:23,546 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 17:07:23,546 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 17:07:23,546 INFO L273 TraceCheckUtils]: 119: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,546 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 17:07:23,546 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 17:07:23,546 INFO L273 TraceCheckUtils]: 122: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,546 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 17:07:23,547 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 17:07:23,547 INFO L273 TraceCheckUtils]: 125: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,547 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 17:07:23,547 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 17:07:23,547 INFO L273 TraceCheckUtils]: 128: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,547 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 17:07:23,547 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 17:07:23,547 INFO L273 TraceCheckUtils]: 131: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,547 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 17:07:23,548 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 17:07:23,548 INFO L273 TraceCheckUtils]: 134: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,548 INFO L273 TraceCheckUtils]: 135: Hoare triple {10974#true} assume !(~i~0 < 10000); {10974#true} is VALID [2018-11-14 17:07:23,548 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 17:07:23,548 INFO L273 TraceCheckUtils]: 137: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,548 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {10974#true} {10975#false} #77#return; {10975#false} is VALID [2018-11-14 17:07:23,548 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 17:07:23,548 INFO L273 TraceCheckUtils]: 140: Hoare triple {10975#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10975#false} is VALID [2018-11-14 17:07:23,548 INFO L273 TraceCheckUtils]: 141: Hoare triple {10975#false} assume !false; {10975#false} is VALID [2018-11-14 17:07:23,557 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 17:07:23,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:23,558 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 17:07:23,567 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:07:23,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:07:23,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:23,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:23,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {10974#true} call ULTIMATE.init(); {10974#true} is VALID [2018-11-14 17:07:23,871 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 17:07:23,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10974#true} {10974#true} #69#return; {10974#true} is VALID [2018-11-14 17:07:23,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {10974#true} call #t~ret13 := main(); {10974#true} is VALID [2018-11-14 17:07:23,872 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 17:07:23,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,872 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 17:07:23,872 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 17:07:23,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,873 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 17:07:23,873 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 17:07:23,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,873 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 17:07:23,873 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 17:07:23,873 INFO L273 TraceCheckUtils]: 15: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,873 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 17:07:23,874 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 17:07:23,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,874 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 17:07:23,874 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 17:07:23,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,874 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 17:07:23,874 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 17:07:23,874 INFO L273 TraceCheckUtils]: 24: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,874 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 17:07:23,875 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 17:07:23,875 INFO L273 TraceCheckUtils]: 27: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,875 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 17:07:23,875 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 17:07:23,875 INFO L273 TraceCheckUtils]: 30: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,875 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 17:07:23,875 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 17:07:23,875 INFO L273 TraceCheckUtils]: 33: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,875 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 17:07:23,876 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 17:07:23,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,876 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 17:07:23,876 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 17:07:23,876 INFO L273 TraceCheckUtils]: 39: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,876 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 17:07:23,876 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 17:07:23,876 INFO L273 TraceCheckUtils]: 42: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,876 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 17:07:23,877 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 17:07:23,877 INFO L273 TraceCheckUtils]: 45: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,877 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 17:07:23,877 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 17:07:23,877 INFO L273 TraceCheckUtils]: 48: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,877 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 17:07:23,877 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 17:07:23,877 INFO L273 TraceCheckUtils]: 51: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,877 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 17:07:23,878 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 17:07:23,878 INFO L273 TraceCheckUtils]: 54: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,878 INFO L273 TraceCheckUtils]: 55: Hoare triple {10974#true} assume !(~i~1 < 10000); {10974#true} is VALID [2018-11-14 17:07:23,878 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 17:07:23,878 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 17:07:23,878 INFO L273 TraceCheckUtils]: 58: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,878 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 17:07:23,878 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 17:07:23,879 INFO L273 TraceCheckUtils]: 61: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,879 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 17:07:23,879 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 17:07:23,879 INFO L273 TraceCheckUtils]: 64: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,879 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 17:07:23,879 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 17:07:23,879 INFO L273 TraceCheckUtils]: 67: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,879 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 17:07:23,879 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 17:07:23,880 INFO L273 TraceCheckUtils]: 70: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,880 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 17:07:23,880 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 17:07:23,880 INFO L273 TraceCheckUtils]: 73: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,880 INFO L273 TraceCheckUtils]: 74: Hoare triple {10974#true} assume !(~i~0 < 10000); {10974#true} is VALID [2018-11-14 17:07:23,880 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 17:07:23,880 INFO L273 TraceCheckUtils]: 76: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,880 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {10974#true} {10974#true} #73#return; {10974#true} is VALID [2018-11-14 17:07:23,880 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 17:07:23,881 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 17:07:23,881 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 17:07:23,881 INFO L273 TraceCheckUtils]: 81: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,881 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 17:07:23,881 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 17:07:23,881 INFO L273 TraceCheckUtils]: 84: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,881 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 17:07:23,881 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 17:07:23,881 INFO L273 TraceCheckUtils]: 87: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,882 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 17:07:23,882 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 17:07:23,882 INFO L273 TraceCheckUtils]: 90: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,882 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 17:07:23,882 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 17:07:23,882 INFO L273 TraceCheckUtils]: 93: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,882 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 17:07:23,883 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 17:07:23,883 INFO L273 TraceCheckUtils]: 96: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,883 INFO L273 TraceCheckUtils]: 97: Hoare triple {10974#true} assume !(~i~0 < 10000); {10974#true} is VALID [2018-11-14 17:07:23,883 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 17:07:23,883 INFO L273 TraceCheckUtils]: 99: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,883 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {10974#true} {10974#true} #75#return; {10974#true} is VALID [2018-11-14 17:07:23,884 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 17:07:23,884 INFO L273 TraceCheckUtils]: 102: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,884 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 17:07:23,884 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 17:07:23,884 INFO L273 TraceCheckUtils]: 105: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,884 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 17:07:23,885 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 17:07:23,885 INFO L273 TraceCheckUtils]: 108: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,885 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 17:07:23,885 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 17:07:23,885 INFO L273 TraceCheckUtils]: 111: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,885 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 17:07:23,886 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 17:07:23,886 INFO L273 TraceCheckUtils]: 114: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,886 INFO L273 TraceCheckUtils]: 115: Hoare triple {10974#true} assume !(~i~2 < 9999); {10974#true} is VALID [2018-11-14 17:07:23,886 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 17:07:23,886 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 17:07:23,905 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 17:07:23,919 INFO L273 TraceCheckUtils]: 119: Hoare triple {11350#(<= bAnd_~i~0 1)} assume true; {11350#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:23,927 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 17:07:23,943 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 17:07:23,957 INFO L273 TraceCheckUtils]: 122: Hoare triple {11360#(<= bAnd_~i~0 2)} assume true; {11360#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:23,965 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 17:07:23,981 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 17:07:23,989 INFO L273 TraceCheckUtils]: 125: Hoare triple {11370#(<= bAnd_~i~0 3)} assume true; {11370#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:24,002 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 17:07:24,021 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 17:07:24,030 INFO L273 TraceCheckUtils]: 128: Hoare triple {11380#(<= bAnd_~i~0 4)} assume true; {11380#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:24,043 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 17:07:24,052 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 17:07:24,065 INFO L273 TraceCheckUtils]: 131: Hoare triple {11390#(<= bAnd_~i~0 5)} assume true; {11390#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:07:24,079 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 17:07:24,088 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 17:07:24,101 INFO L273 TraceCheckUtils]: 134: Hoare triple {11400#(<= bAnd_~i~0 6)} assume true; {11400#(<= bAnd_~i~0 6)} is VALID [2018-11-14 17:07:24,113 INFO L273 TraceCheckUtils]: 135: Hoare triple {11400#(<= bAnd_~i~0 6)} assume !(~i~0 < 10000); {10975#false} is VALID [2018-11-14 17:07:24,114 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 17:07:24,114 INFO L273 TraceCheckUtils]: 137: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:07:24,114 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {10975#false} {10974#true} #77#return; {10975#false} is VALID [2018-11-14 17:07:24,114 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 17:07:24,114 INFO L273 TraceCheckUtils]: 140: Hoare triple {10975#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10975#false} is VALID [2018-11-14 17:07:24,115 INFO L273 TraceCheckUtils]: 141: Hoare triple {10975#false} assume !false; {10975#false} is VALID [2018-11-14 17:07:24,122 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 17:07:24,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:24,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 8] total 25 [2018-11-14 17:07:24,143 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 142 [2018-11-14 17:07:24,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:24,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 17:07:24,252 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 17:07:24,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 17:07:24,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 17:07:24,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:07:24,253 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 25 states. [2018-11-14 17:07:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:25,277 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-11-14 17:07:25,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 17:07:25,278 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 142 [2018-11-14 17:07:25,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:25,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:07:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-14 17:07:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:07:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-14 17:07:25,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 130 transitions. [2018-11-14 17:07:25,457 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 17:07:25,459 INFO L225 Difference]: With dead ends: 154 [2018-11-14 17:07:25,459 INFO L226 Difference]: Without dead ends: 109 [2018-11-14 17:07:25,460 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 17:07:25,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-14 17:07:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-11-14 17:07:25,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:25,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 107 states. [2018-11-14 17:07:25,485 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 107 states. [2018-11-14 17:07:25,485 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 107 states. [2018-11-14 17:07:25,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:25,488 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 17:07:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 17:07:25,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:25,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:25,489 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 109 states. [2018-11-14 17:07:25,489 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 109 states. [2018-11-14 17:07:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:25,491 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 17:07:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 17:07:25,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:25,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:25,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:25,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 17:07:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-14 17:07:25,494 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 142 [2018-11-14 17:07:25,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:25,494 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-14 17:07:25,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 17:07:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-14 17:07:25,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-14 17:07:25,496 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:25,496 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 17:07:25,496 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:25,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:25,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1450365401, now seen corresponding path program 17 times [2018-11-14 17:07:25,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:25,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:25,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:25,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:25,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:26,649 INFO L256 TraceCheckUtils]: 0: Hoare triple {11994#true} call ULTIMATE.init(); {11994#true} is VALID [2018-11-14 17:07:26,649 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 17:07:26,649 INFO L273 TraceCheckUtils]: 2: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11994#true} {11994#true} #69#return; {11994#true} is VALID [2018-11-14 17:07:26,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {11994#true} call #t~ret13 := main(); {11994#true} is VALID [2018-11-14 17:07:26,650 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 17:07:26,650 INFO L273 TraceCheckUtils]: 6: Hoare triple {11996#(= main_~i~1 0)} assume true; {11996#(= main_~i~1 0)} is VALID [2018-11-14 17:07:26,651 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 17:07:26,651 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 17:07:26,652 INFO L273 TraceCheckUtils]: 9: Hoare triple {11997#(<= main_~i~1 1)} assume true; {11997#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:26,652 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 17:07:26,652 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 17:07:26,653 INFO L273 TraceCheckUtils]: 12: Hoare triple {11998#(<= main_~i~1 2)} assume true; {11998#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:26,653 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 17:07:26,653 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 17:07:26,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {11999#(<= main_~i~1 3)} assume true; {11999#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:26,654 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 17:07:26,655 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 17:07:26,656 INFO L273 TraceCheckUtils]: 18: Hoare triple {12000#(<= main_~i~1 4)} assume true; {12000#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:26,656 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 17:07:26,657 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 17:07:26,675 INFO L273 TraceCheckUtils]: 21: Hoare triple {12001#(<= main_~i~1 5)} assume true; {12001#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:26,684 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 17:07:26,688 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 17:07:26,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {12002#(<= main_~i~1 6)} assume true; {12002#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:26,689 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 17:07:26,690 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 17:07:26,690 INFO L273 TraceCheckUtils]: 27: Hoare triple {12003#(<= main_~i~1 7)} assume true; {12003#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:26,690 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 17:07:26,691 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 17:07:26,691 INFO L273 TraceCheckUtils]: 30: Hoare triple {12004#(<= main_~i~1 8)} assume true; {12004#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:26,691 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 17:07:26,692 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 17:07:26,692 INFO L273 TraceCheckUtils]: 33: Hoare triple {12005#(<= main_~i~1 9)} assume true; {12005#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:26,693 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 17:07:26,693 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 17:07:26,693 INFO L273 TraceCheckUtils]: 36: Hoare triple {12006#(<= main_~i~1 10)} assume true; {12006#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:26,694 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 17:07:26,694 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 17:07:26,695 INFO L273 TraceCheckUtils]: 39: Hoare triple {12007#(<= main_~i~1 11)} assume true; {12007#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:26,696 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 17:07:26,696 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 17:07:26,697 INFO L273 TraceCheckUtils]: 42: Hoare triple {12008#(<= main_~i~1 12)} assume true; {12008#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:26,697 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 17:07:26,698 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 17:07:26,699 INFO L273 TraceCheckUtils]: 45: Hoare triple {12009#(<= main_~i~1 13)} assume true; {12009#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:26,699 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 17:07:26,700 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 17:07:26,700 INFO L273 TraceCheckUtils]: 48: Hoare triple {12010#(<= main_~i~1 14)} assume true; {12010#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:26,701 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 17:07:26,702 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 17:07:26,702 INFO L273 TraceCheckUtils]: 51: Hoare triple {12011#(<= main_~i~1 15)} assume true; {12011#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:26,703 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 17:07:26,703 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 17:07:26,704 INFO L273 TraceCheckUtils]: 54: Hoare triple {12012#(<= main_~i~1 16)} assume true; {12012#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:26,704 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 17:07:26,705 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 17:07:26,706 INFO L273 TraceCheckUtils]: 57: Hoare triple {12013#(<= main_~i~1 17)} assume true; {12013#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:26,706 INFO L273 TraceCheckUtils]: 58: Hoare triple {12013#(<= main_~i~1 17)} assume !(~i~1 < 10000); {11995#false} is VALID [2018-11-14 17:07:26,706 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 17:07:26,707 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 17:07:26,707 INFO L273 TraceCheckUtils]: 61: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,707 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 17:07:26,707 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 17:07:26,707 INFO L273 TraceCheckUtils]: 64: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,708 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 17:07:26,708 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 17:07:26,708 INFO L273 TraceCheckUtils]: 67: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,708 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 17:07:26,708 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 17:07:26,709 INFO L273 TraceCheckUtils]: 70: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,709 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 17:07:26,709 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 17:07:26,709 INFO L273 TraceCheckUtils]: 73: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,709 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 17:07:26,709 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 17:07:26,710 INFO L273 TraceCheckUtils]: 76: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,710 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 17:07:26,710 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 17:07:26,710 INFO L273 TraceCheckUtils]: 79: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,710 INFO L273 TraceCheckUtils]: 80: Hoare triple {11994#true} assume !(~i~0 < 10000); {11994#true} is VALID [2018-11-14 17:07:26,710 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 17:07:26,711 INFO L273 TraceCheckUtils]: 82: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,711 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {11994#true} {11995#false} #73#return; {11995#false} is VALID [2018-11-14 17:07:26,711 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 17:07:26,711 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 17:07:26,711 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 17:07:26,711 INFO L273 TraceCheckUtils]: 87: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,711 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 17:07:26,711 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 17:07:26,711 INFO L273 TraceCheckUtils]: 90: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,712 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 17:07:26,712 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 17:07:26,712 INFO L273 TraceCheckUtils]: 93: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,712 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 17:07:26,712 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 17:07:26,712 INFO L273 TraceCheckUtils]: 96: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,712 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 17:07:26,712 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 17:07:26,712 INFO L273 TraceCheckUtils]: 99: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,713 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 17:07:26,713 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 17:07:26,713 INFO L273 TraceCheckUtils]: 102: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,713 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 17:07:26,713 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 17:07:26,713 INFO L273 TraceCheckUtils]: 105: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,713 INFO L273 TraceCheckUtils]: 106: Hoare triple {11994#true} assume !(~i~0 < 10000); {11994#true} is VALID [2018-11-14 17:07:26,713 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 17:07:26,713 INFO L273 TraceCheckUtils]: 108: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,714 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {11994#true} {11995#false} #75#return; {11995#false} is VALID [2018-11-14 17:07:26,714 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 17:07:26,714 INFO L273 TraceCheckUtils]: 111: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:26,714 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 17:07:26,714 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 17:07:26,714 INFO L273 TraceCheckUtils]: 114: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:26,714 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 17:07:26,714 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 17:07:26,714 INFO L273 TraceCheckUtils]: 117: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:26,714 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 17:07:26,715 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 17:07:26,715 INFO L273 TraceCheckUtils]: 120: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:26,715 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 17:07:26,715 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 17:07:26,715 INFO L273 TraceCheckUtils]: 123: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:26,715 INFO L273 TraceCheckUtils]: 124: Hoare triple {11995#false} assume !(~i~2 < 9999); {11995#false} is VALID [2018-11-14 17:07:26,715 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 17:07:26,715 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 17:07:26,715 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 17:07:26,716 INFO L273 TraceCheckUtils]: 128: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,716 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 17:07:26,716 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 17:07:26,716 INFO L273 TraceCheckUtils]: 131: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,716 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 17:07:26,716 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 17:07:26,716 INFO L273 TraceCheckUtils]: 134: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,716 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 17:07:26,716 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 17:07:26,717 INFO L273 TraceCheckUtils]: 137: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,717 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 17:07:26,717 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 17:07:26,717 INFO L273 TraceCheckUtils]: 140: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,717 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 17:07:26,717 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 17:07:26,717 INFO L273 TraceCheckUtils]: 143: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,717 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 17:07:26,717 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 17:07:26,718 INFO L273 TraceCheckUtils]: 146: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,718 INFO L273 TraceCheckUtils]: 147: Hoare triple {11994#true} assume !(~i~0 < 10000); {11994#true} is VALID [2018-11-14 17:07:26,718 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 17:07:26,718 INFO L273 TraceCheckUtils]: 149: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,718 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {11994#true} {11995#false} #77#return; {11995#false} is VALID [2018-11-14 17:07:26,718 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 17:07:26,718 INFO L273 TraceCheckUtils]: 152: Hoare triple {11995#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11995#false} is VALID [2018-11-14 17:07:26,718 INFO L273 TraceCheckUtils]: 153: Hoare triple {11995#false} assume !false; {11995#false} is VALID [2018-11-14 17:07:26,731 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 17:07:26,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:26,731 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 17:07:26,749 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:07:27,406 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-14 17:07:27,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:27,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:27,652 INFO L256 TraceCheckUtils]: 0: Hoare triple {11994#true} call ULTIMATE.init(); {11994#true} is VALID [2018-11-14 17:07:27,652 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 17:07:27,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11994#true} {11994#true} #69#return; {11994#true} is VALID [2018-11-14 17:07:27,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {11994#true} call #t~ret13 := main(); {11994#true} is VALID [2018-11-14 17:07:27,653 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 17:07:27,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,653 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 17:07:27,653 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 17:07:27,654 INFO L273 TraceCheckUtils]: 9: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,654 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 17:07:27,654 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 17:07:27,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,654 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 17:07:27,654 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 17:07:27,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,655 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 17:07:27,655 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 17:07:27,655 INFO L273 TraceCheckUtils]: 18: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,655 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 17:07:27,655 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 17:07:27,655 INFO L273 TraceCheckUtils]: 21: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,655 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 17:07:27,655 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 17:07:27,655 INFO L273 TraceCheckUtils]: 24: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,655 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 17:07:27,656 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 17:07:27,656 INFO L273 TraceCheckUtils]: 27: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,656 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 17:07:27,656 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 17:07:27,656 INFO L273 TraceCheckUtils]: 30: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,656 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 17:07:27,656 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 17:07:27,656 INFO L273 TraceCheckUtils]: 33: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,656 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 17:07:27,657 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 17:07:27,657 INFO L273 TraceCheckUtils]: 36: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,657 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 17:07:27,657 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 17:07:27,657 INFO L273 TraceCheckUtils]: 39: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,657 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 17:07:27,657 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 17:07:27,657 INFO L273 TraceCheckUtils]: 42: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,657 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 17:07:27,658 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 17:07:27,658 INFO L273 TraceCheckUtils]: 45: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,658 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 17:07:27,658 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 17:07:27,658 INFO L273 TraceCheckUtils]: 48: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,658 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 17:07:27,658 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 17:07:27,658 INFO L273 TraceCheckUtils]: 51: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,658 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 17:07:27,658 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 17:07:27,659 INFO L273 TraceCheckUtils]: 54: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,659 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 17:07:27,659 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 17:07:27,659 INFO L273 TraceCheckUtils]: 57: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,659 INFO L273 TraceCheckUtils]: 58: Hoare triple {11994#true} assume !(~i~1 < 10000); {11994#true} is VALID [2018-11-14 17:07:27,659 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 17:07:27,660 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 17:07:27,660 INFO L273 TraceCheckUtils]: 61: Hoare triple {12197#(<= bAnd_~i~0 1)} assume true; {12197#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:27,660 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 17:07:27,661 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 17:07:27,661 INFO L273 TraceCheckUtils]: 64: Hoare triple {12207#(<= bAnd_~i~0 2)} assume true; {12207#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:27,661 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 17:07:27,662 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 17:07:27,663 INFO L273 TraceCheckUtils]: 67: Hoare triple {12217#(<= bAnd_~i~0 3)} assume true; {12217#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:27,666 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 17:07:27,667 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 17:07:27,667 INFO L273 TraceCheckUtils]: 70: Hoare triple {12227#(<= bAnd_~i~0 4)} assume true; {12227#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:27,668 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 17:07:27,668 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 17:07:27,668 INFO L273 TraceCheckUtils]: 73: Hoare triple {12237#(<= bAnd_~i~0 5)} assume true; {12237#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:07:27,669 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 17:07:27,669 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 17:07:27,669 INFO L273 TraceCheckUtils]: 76: Hoare triple {12247#(<= bAnd_~i~0 6)} assume true; {12247#(<= bAnd_~i~0 6)} is VALID [2018-11-14 17:07:27,670 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 17:07:27,670 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 17:07:27,670 INFO L273 TraceCheckUtils]: 79: Hoare triple {12257#(<= bAnd_~i~0 7)} assume true; {12257#(<= bAnd_~i~0 7)} is VALID [2018-11-14 17:07:27,671 INFO L273 TraceCheckUtils]: 80: Hoare triple {12257#(<= bAnd_~i~0 7)} assume !(~i~0 < 10000); {11995#false} is VALID [2018-11-14 17:07:27,671 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 17:07:27,671 INFO L273 TraceCheckUtils]: 82: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,672 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {11995#false} {11994#true} #73#return; {11995#false} is VALID [2018-11-14 17:07:27,672 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 17:07:27,672 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 17:07:27,672 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 17:07:27,672 INFO L273 TraceCheckUtils]: 87: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,673 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 17:07:27,673 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 17:07:27,673 INFO L273 TraceCheckUtils]: 90: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,673 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 17:07:27,673 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 17:07:27,673 INFO L273 TraceCheckUtils]: 93: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,674 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 17:07:27,674 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 17:07:27,674 INFO L273 TraceCheckUtils]: 96: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,674 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 17:07:27,674 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 17:07:27,674 INFO L273 TraceCheckUtils]: 99: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,674 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 17:07:27,675 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 17:07:27,675 INFO L273 TraceCheckUtils]: 102: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,675 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 17:07:27,675 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 17:07:27,675 INFO L273 TraceCheckUtils]: 105: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,675 INFO L273 TraceCheckUtils]: 106: Hoare triple {11995#false} assume !(~i~0 < 10000); {11995#false} is VALID [2018-11-14 17:07:27,675 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 17:07:27,675 INFO L273 TraceCheckUtils]: 108: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,675 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {11995#false} {11995#false} #75#return; {11995#false} is VALID [2018-11-14 17:07:27,675 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 17:07:27,676 INFO L273 TraceCheckUtils]: 111: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,676 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 17:07:27,676 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 17:07:27,676 INFO L273 TraceCheckUtils]: 114: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,676 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 17:07:27,676 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 17:07:27,676 INFO L273 TraceCheckUtils]: 117: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,676 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 17:07:27,676 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 17:07:27,677 INFO L273 TraceCheckUtils]: 120: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,677 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 17:07:27,677 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 17:07:27,677 INFO L273 TraceCheckUtils]: 123: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,677 INFO L273 TraceCheckUtils]: 124: Hoare triple {11995#false} assume !(~i~2 < 9999); {11995#false} is VALID [2018-11-14 17:07:27,677 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 17:07:27,677 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 17:07:27,677 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 17:07:27,677 INFO L273 TraceCheckUtils]: 128: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,678 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 17:07:27,678 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 17:07:27,678 INFO L273 TraceCheckUtils]: 131: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,678 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 17:07:27,678 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 17:07:27,678 INFO L273 TraceCheckUtils]: 134: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,678 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 17:07:27,678 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 17:07:27,678 INFO L273 TraceCheckUtils]: 137: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,679 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 17:07:27,679 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 17:07:27,679 INFO L273 TraceCheckUtils]: 140: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,679 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 17:07:27,679 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 17:07:27,679 INFO L273 TraceCheckUtils]: 143: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,679 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 17:07:27,679 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 17:07:27,679 INFO L273 TraceCheckUtils]: 146: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,679 INFO L273 TraceCheckUtils]: 147: Hoare triple {11995#false} assume !(~i~0 < 10000); {11995#false} is VALID [2018-11-14 17:07:27,680 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 17:07:27,680 INFO L273 TraceCheckUtils]: 149: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,680 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {11995#false} {11995#false} #77#return; {11995#false} is VALID [2018-11-14 17:07:27,680 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 17:07:27,680 INFO L273 TraceCheckUtils]: 152: Hoare triple {11995#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11995#false} is VALID [2018-11-14 17:07:27,680 INFO L273 TraceCheckUtils]: 153: Hoare triple {11995#false} assume !false; {11995#false} is VALID [2018-11-14 17:07:27,689 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 17:07:27,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:27,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-14 17:07:27,711 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2018-11-14 17:07:27,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:27,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 17:07:27,824 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 17:07:27,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 17:07:27,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 17:07:27,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:07:27,826 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 27 states. [2018-11-14 17:07:28,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:28,676 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2018-11-14 17:07:28,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 17:07:28,676 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2018-11-14 17:07:28,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:07:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2018-11-14 17:07:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:07:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2018-11-14 17:07:28,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 136 transitions. [2018-11-14 17:07:28,805 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 17:07:28,808 INFO L225 Difference]: With dead ends: 163 [2018-11-14 17:07:28,808 INFO L226 Difference]: Without dead ends: 115 [2018-11-14 17:07:28,808 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:07:28,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-14 17:07:28,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-11-14 17:07:28,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:28,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 113 states. [2018-11-14 17:07:28,853 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 113 states. [2018-11-14 17:07:28,854 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 113 states. [2018-11-14 17:07:28,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:28,857 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-14 17:07:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-14 17:07:28,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:28,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:28,858 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 115 states. [2018-11-14 17:07:28,858 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 115 states. [2018-11-14 17:07:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:28,861 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-14 17:07:28,861 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-14 17:07:28,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:28,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:28,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:28,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-14 17:07:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-11-14 17:07:28,864 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 154 [2018-11-14 17:07:28,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:28,865 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-11-14 17:07:28,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 17:07:28,865 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-14 17:07:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-14 17:07:28,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:28,867 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 17:07:28,867 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:28,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:28,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1920636699, now seen corresponding path program 18 times [2018-11-14 17:07:28,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:28,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:28,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:28,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:28,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:29,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {13084#true} call ULTIMATE.init(); {13084#true} is VALID [2018-11-14 17:07:29,328 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 17:07:29,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13084#true} {13084#true} #69#return; {13084#true} is VALID [2018-11-14 17:07:29,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {13084#true} call #t~ret13 := main(); {13084#true} is VALID [2018-11-14 17:07:29,329 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 17:07:29,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {13086#(= main_~i~1 0)} assume true; {13086#(= main_~i~1 0)} is VALID [2018-11-14 17:07:29,330 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 17:07:29,330 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 17:07:29,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {13087#(<= main_~i~1 1)} assume true; {13087#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:29,331 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 17:07:29,331 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 17:07:29,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {13088#(<= main_~i~1 2)} assume true; {13088#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:29,332 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 17:07:29,332 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 17:07:29,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {13089#(<= main_~i~1 3)} assume true; {13089#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:29,333 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 17:07:29,335 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 17:07:29,335 INFO L273 TraceCheckUtils]: 18: Hoare triple {13090#(<= main_~i~1 4)} assume true; {13090#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:29,336 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 17:07:29,337 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 17:07:29,337 INFO L273 TraceCheckUtils]: 21: Hoare triple {13091#(<= main_~i~1 5)} assume true; {13091#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:29,338 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 17:07:29,338 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 17:07:29,339 INFO L273 TraceCheckUtils]: 24: Hoare triple {13092#(<= main_~i~1 6)} assume true; {13092#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:29,339 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 17:07:29,340 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 17:07:29,341 INFO L273 TraceCheckUtils]: 27: Hoare triple {13093#(<= main_~i~1 7)} assume true; {13093#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:29,341 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 17:07:29,342 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 17:07:29,343 INFO L273 TraceCheckUtils]: 30: Hoare triple {13094#(<= main_~i~1 8)} assume true; {13094#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:29,343 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 17:07:29,344 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 17:07:29,344 INFO L273 TraceCheckUtils]: 33: Hoare triple {13095#(<= main_~i~1 9)} assume true; {13095#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:29,345 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 17:07:29,346 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 17:07:29,346 INFO L273 TraceCheckUtils]: 36: Hoare triple {13096#(<= main_~i~1 10)} assume true; {13096#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:29,347 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 17:07:29,347 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 17:07:29,348 INFO L273 TraceCheckUtils]: 39: Hoare triple {13097#(<= main_~i~1 11)} assume true; {13097#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:29,351 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 17:07:29,351 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 17:07:29,352 INFO L273 TraceCheckUtils]: 42: Hoare triple {13098#(<= main_~i~1 12)} assume true; {13098#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:29,352 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 17:07:29,352 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 17:07:29,353 INFO L273 TraceCheckUtils]: 45: Hoare triple {13099#(<= main_~i~1 13)} assume true; {13099#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:29,353 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 17:07:29,354 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 17:07:29,354 INFO L273 TraceCheckUtils]: 48: Hoare triple {13100#(<= main_~i~1 14)} assume true; {13100#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:29,354 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 17:07:29,355 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 17:07:29,355 INFO L273 TraceCheckUtils]: 51: Hoare triple {13101#(<= main_~i~1 15)} assume true; {13101#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:29,355 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 17:07:29,356 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 17:07:29,356 INFO L273 TraceCheckUtils]: 54: Hoare triple {13102#(<= main_~i~1 16)} assume true; {13102#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:29,357 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 17:07:29,358 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 17:07:29,358 INFO L273 TraceCheckUtils]: 57: Hoare triple {13103#(<= main_~i~1 17)} assume true; {13103#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:29,359 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 17:07:29,359 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 17:07:29,360 INFO L273 TraceCheckUtils]: 60: Hoare triple {13104#(<= main_~i~1 18)} assume true; {13104#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:29,361 INFO L273 TraceCheckUtils]: 61: Hoare triple {13104#(<= main_~i~1 18)} assume !(~i~1 < 10000); {13085#false} is VALID [2018-11-14 17:07:29,361 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 17:07:29,361 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 17:07:29,362 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,362 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 17:07:29,362 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 17:07:29,362 INFO L273 TraceCheckUtils]: 67: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,363 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 17:07:29,363 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 17:07:29,363 INFO L273 TraceCheckUtils]: 70: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,363 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 17:07:29,363 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 17:07:29,364 INFO L273 TraceCheckUtils]: 73: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,364 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 17:07:29,364 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 17:07:29,364 INFO L273 TraceCheckUtils]: 76: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,365 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 17:07:29,365 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 17:07:29,365 INFO L273 TraceCheckUtils]: 79: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,365 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 17:07:29,366 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 17:07:29,366 INFO L273 TraceCheckUtils]: 82: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,366 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 17:07:29,366 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 17:07:29,366 INFO L273 TraceCheckUtils]: 85: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,366 INFO L273 TraceCheckUtils]: 86: Hoare triple {13084#true} assume !(~i~0 < 10000); {13084#true} is VALID [2018-11-14 17:07:29,366 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 17:07:29,366 INFO L273 TraceCheckUtils]: 88: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,367 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {13084#true} {13085#false} #73#return; {13085#false} is VALID [2018-11-14 17:07:29,367 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 17:07:29,367 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 17:07:29,367 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 17:07:29,367 INFO L273 TraceCheckUtils]: 93: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,367 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 17:07:29,368 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 17:07:29,368 INFO L273 TraceCheckUtils]: 96: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,368 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 17:07:29,368 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 17:07:29,368 INFO L273 TraceCheckUtils]: 99: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,368 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 17:07:29,368 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 17:07:29,369 INFO L273 TraceCheckUtils]: 102: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,369 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 17:07:29,369 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 17:07:29,369 INFO L273 TraceCheckUtils]: 105: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,369 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 17:07:29,369 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 17:07:29,369 INFO L273 TraceCheckUtils]: 108: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,370 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 17:07:29,370 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 17:07:29,370 INFO L273 TraceCheckUtils]: 111: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,370 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 17:07:29,370 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 17:07:29,370 INFO L273 TraceCheckUtils]: 114: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,370 INFO L273 TraceCheckUtils]: 115: Hoare triple {13084#true} assume !(~i~0 < 10000); {13084#true} is VALID [2018-11-14 17:07:29,371 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 17:07:29,371 INFO L273 TraceCheckUtils]: 117: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,371 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {13084#true} {13085#false} #75#return; {13085#false} is VALID [2018-11-14 17:07:29,371 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 17:07:29,371 INFO L273 TraceCheckUtils]: 120: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:29,371 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 17:07:29,371 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 17:07:29,372 INFO L273 TraceCheckUtils]: 123: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:29,372 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 17:07:29,372 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 17:07:29,372 INFO L273 TraceCheckUtils]: 126: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:29,372 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 17:07:29,372 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 17:07:29,372 INFO L273 TraceCheckUtils]: 129: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:29,373 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 17:07:29,373 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 17:07:29,373 INFO L273 TraceCheckUtils]: 132: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:29,373 INFO L273 TraceCheckUtils]: 133: Hoare triple {13085#false} assume !(~i~2 < 9999); {13085#false} is VALID [2018-11-14 17:07:29,373 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 17:07:29,373 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 17:07:29,373 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 17:07:29,374 INFO L273 TraceCheckUtils]: 137: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,374 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 17:07:29,374 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 17:07:29,374 INFO L273 TraceCheckUtils]: 140: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,374 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 17:07:29,375 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 17:07:29,375 INFO L273 TraceCheckUtils]: 143: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,375 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 17:07:29,375 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 17:07:29,375 INFO L273 TraceCheckUtils]: 146: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,376 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 17:07:29,376 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 17:07:29,376 INFO L273 TraceCheckUtils]: 149: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,376 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 17:07:29,376 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 17:07:29,377 INFO L273 TraceCheckUtils]: 152: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,377 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 17:07:29,377 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 17:07:29,377 INFO L273 TraceCheckUtils]: 155: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,377 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 17:07:29,378 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 17:07:29,378 INFO L273 TraceCheckUtils]: 158: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,378 INFO L273 TraceCheckUtils]: 159: Hoare triple {13084#true} assume !(~i~0 < 10000); {13084#true} is VALID [2018-11-14 17:07:29,378 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 17:07:29,378 INFO L273 TraceCheckUtils]: 161: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,379 INFO L268 TraceCheckUtils]: 162: Hoare quadruple {13084#true} {13085#false} #77#return; {13085#false} is VALID [2018-11-14 17:07:29,379 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 17:07:29,379 INFO L273 TraceCheckUtils]: 164: Hoare triple {13085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13085#false} is VALID [2018-11-14 17:07:29,379 INFO L273 TraceCheckUtils]: 165: Hoare triple {13085#false} assume !false; {13085#false} is VALID [2018-11-14 17:07:29,410 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 17:07:29,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:29,411 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 17:07:29,419 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:07:29,749 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-14 17:07:29,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:29,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:30,151 INFO L256 TraceCheckUtils]: 0: Hoare triple {13084#true} call ULTIMATE.init(); {13084#true} is VALID [2018-11-14 17:07:30,151 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 17:07:30,151 INFO L273 TraceCheckUtils]: 2: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,152 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13084#true} {13084#true} #69#return; {13084#true} is VALID [2018-11-14 17:07:30,152 INFO L256 TraceCheckUtils]: 4: Hoare triple {13084#true} call #t~ret13 := main(); {13084#true} is VALID [2018-11-14 17:07:30,152 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 17:07:30,152 INFO L273 TraceCheckUtils]: 6: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,153 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 17:07:30,153 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 17:07:30,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,153 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 17:07:30,153 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 17:07:30,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,153 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 17:07:30,153 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 17:07:30,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,154 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 17:07:30,154 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 17:07:30,154 INFO L273 TraceCheckUtils]: 18: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,154 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 17:07:30,154 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 17:07:30,154 INFO L273 TraceCheckUtils]: 21: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,154 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 17:07:30,154 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 17:07:30,155 INFO L273 TraceCheckUtils]: 24: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,155 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 17:07:30,155 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 17:07:30,155 INFO L273 TraceCheckUtils]: 27: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,155 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 17:07:30,155 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 17:07:30,155 INFO L273 TraceCheckUtils]: 30: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,156 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 17:07:30,156 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 17:07:30,156 INFO L273 TraceCheckUtils]: 33: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,156 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 17:07:30,156 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 17:07:30,156 INFO L273 TraceCheckUtils]: 36: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,156 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 17:07:30,156 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 17:07:30,157 INFO L273 TraceCheckUtils]: 39: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,157 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 17:07:30,157 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 17:07:30,157 INFO L273 TraceCheckUtils]: 42: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,157 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 17:07:30,157 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 17:07:30,157 INFO L273 TraceCheckUtils]: 45: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,158 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 17:07:30,158 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 17:07:30,158 INFO L273 TraceCheckUtils]: 48: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,158 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 17:07:30,158 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 17:07:30,158 INFO L273 TraceCheckUtils]: 51: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,159 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 17:07:30,159 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 17:07:30,159 INFO L273 TraceCheckUtils]: 54: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,159 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 17:07:30,159 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 17:07:30,159 INFO L273 TraceCheckUtils]: 57: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,160 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 17:07:30,160 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 17:07:30,161 INFO L273 TraceCheckUtils]: 60: Hoare triple {13286#(<= main_~i~1 10000)} assume true; {13286#(<= main_~i~1 10000)} is VALID [2018-11-14 17:07:30,161 INFO L273 TraceCheckUtils]: 61: Hoare triple {13286#(<= main_~i~1 10000)} assume !(~i~1 < 10000); {13084#true} is VALID [2018-11-14 17:07:30,161 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 17:07:30,161 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 17:07:30,161 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,161 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 17:07:30,162 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 17:07:30,162 INFO L273 TraceCheckUtils]: 67: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,162 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 17:07:30,162 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 17:07:30,162 INFO L273 TraceCheckUtils]: 70: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,162 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 17:07:30,163 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 17:07:30,163 INFO L273 TraceCheckUtils]: 73: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,163 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 17:07:30,163 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 17:07:30,163 INFO L273 TraceCheckUtils]: 76: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,163 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 17:07:30,164 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 17:07:30,164 INFO L273 TraceCheckUtils]: 79: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,164 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 17:07:30,164 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 17:07:30,164 INFO L273 TraceCheckUtils]: 82: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,164 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 17:07:30,165 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 17:07:30,165 INFO L273 TraceCheckUtils]: 85: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,165 INFO L273 TraceCheckUtils]: 86: Hoare triple {13084#true} assume !(~i~0 < 10000); {13084#true} is VALID [2018-11-14 17:07:30,165 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 17:07:30,165 INFO L273 TraceCheckUtils]: 88: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,165 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {13084#true} {13084#true} #73#return; {13084#true} is VALID [2018-11-14 17:07:30,165 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 17:07:30,166 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 17:07:30,166 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 17:07:30,166 INFO L273 TraceCheckUtils]: 93: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,166 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 17:07:30,166 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 17:07:30,166 INFO L273 TraceCheckUtils]: 96: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,167 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 17:07:30,167 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 17:07:30,167 INFO L273 TraceCheckUtils]: 99: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,167 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 17:07:30,167 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 17:07:30,167 INFO L273 TraceCheckUtils]: 102: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,167 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 17:07:30,168 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 17:07:30,168 INFO L273 TraceCheckUtils]: 105: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,168 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 17:07:30,168 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 17:07:30,168 INFO L273 TraceCheckUtils]: 108: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,168 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 17:07:30,169 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 17:07:30,169 INFO L273 TraceCheckUtils]: 111: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,169 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 17:07:30,169 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 17:07:30,169 INFO L273 TraceCheckUtils]: 114: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,169 INFO L273 TraceCheckUtils]: 115: Hoare triple {13084#true} assume !(~i~0 < 10000); {13084#true} is VALID [2018-11-14 17:07:30,169 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 17:07:30,170 INFO L273 TraceCheckUtils]: 117: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,170 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {13084#true} {13084#true} #75#return; {13084#true} is VALID [2018-11-14 17:07:30,190 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 17:07:30,204 INFO L273 TraceCheckUtils]: 120: Hoare triple {13467#(<= main_~i~2 0)} assume true; {13467#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:30,213 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 17:07:30,227 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 17:07:30,236 INFO L273 TraceCheckUtils]: 123: Hoare triple {13477#(<= main_~i~2 1)} assume true; {13477#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:30,242 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 17:07:30,243 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 17:07:30,244 INFO L273 TraceCheckUtils]: 126: Hoare triple {13487#(<= main_~i~2 2)} assume true; {13487#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:30,244 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 17:07:30,247 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 17:07:30,247 INFO L273 TraceCheckUtils]: 129: Hoare triple {13497#(<= main_~i~2 3)} assume true; {13497#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:30,249 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 17:07:30,249 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 17:07:30,249 INFO L273 TraceCheckUtils]: 132: Hoare triple {13507#(<= main_~i~2 4)} assume true; {13507#(<= main_~i~2 4)} is VALID [2018-11-14 17:07:30,250 INFO L273 TraceCheckUtils]: 133: Hoare triple {13507#(<= main_~i~2 4)} assume !(~i~2 < 9999); {13085#false} is VALID [2018-11-14 17:07:30,250 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 17:07:30,250 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 17:07:30,250 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 17:07:30,250 INFO L273 TraceCheckUtils]: 137: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,250 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 17:07:30,250 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 17:07:30,251 INFO L273 TraceCheckUtils]: 140: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,251 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 17:07:30,251 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 17:07:30,251 INFO L273 TraceCheckUtils]: 143: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,251 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 17:07:30,251 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 17:07:30,251 INFO L273 TraceCheckUtils]: 146: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,251 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 17:07:30,251 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 17:07:30,251 INFO L273 TraceCheckUtils]: 149: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,252 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 17:07:30,252 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 17:07:30,252 INFO L273 TraceCheckUtils]: 152: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,252 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 17:07:30,252 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 17:07:30,252 INFO L273 TraceCheckUtils]: 155: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,252 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 17:07:30,252 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 17:07:30,252 INFO L273 TraceCheckUtils]: 158: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,253 INFO L273 TraceCheckUtils]: 159: Hoare triple {13085#false} assume !(~i~0 < 10000); {13085#false} is VALID [2018-11-14 17:07:30,253 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 17:07:30,253 INFO L273 TraceCheckUtils]: 161: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,253 INFO L268 TraceCheckUtils]: 162: Hoare quadruple {13085#false} {13085#false} #77#return; {13085#false} is VALID [2018-11-14 17:07:30,253 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 17:07:30,253 INFO L273 TraceCheckUtils]: 164: Hoare triple {13085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13085#false} is VALID [2018-11-14 17:07:30,253 INFO L273 TraceCheckUtils]: 165: Hoare triple {13085#false} assume !false; {13085#false} is VALID [2018-11-14 17:07:30,263 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 17:07:30,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:30,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 28 [2018-11-14 17:07:30,284 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 166 [2018-11-14 17:07:30,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:30,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 17:07:30,453 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 17:07:30,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 17:07:30,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 17:07:30,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=483, Unknown=0, NotChecked=0, Total=756 [2018-11-14 17:07:30,454 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 28 states. [2018-11-14 17:07:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:31,101 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2018-11-14 17:07:31,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 17:07:31,101 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 166 [2018-11-14 17:07:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:31,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:07:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 133 transitions. [2018-11-14 17:07:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:07:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 133 transitions. [2018-11-14 17:07:31,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 133 transitions. [2018-11-14 17:07:31,310 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 17:07:31,313 INFO L225 Difference]: With dead ends: 174 [2018-11-14 17:07:31,313 INFO L226 Difference]: Without dead ends: 123 [2018-11-14 17:07:31,314 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 17:07:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-14 17:07:31,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-11-14 17:07:31,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:31,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 122 states. [2018-11-14 17:07:31,356 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 122 states. [2018-11-14 17:07:31,356 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 122 states. [2018-11-14 17:07:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:31,359 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-14 17:07:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-14 17:07:31,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:31,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:31,359 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 123 states. [2018-11-14 17:07:31,360 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 123 states. [2018-11-14 17:07:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:31,362 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-14 17:07:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-14 17:07:31,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:31,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:31,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:31,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 17:07:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-11-14 17:07:31,365 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 166 [2018-11-14 17:07:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:31,365 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-11-14 17:07:31,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 17:07:31,366 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-11-14 17:07:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-14 17:07:31,367 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:31,367 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 17:07:31,367 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:31,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:31,368 INFO L82 PathProgramCache]: Analyzing trace with hash 862428551, now seen corresponding path program 19 times [2018-11-14 17:07:31,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:31,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:31,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:31,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:31,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:31,742 INFO L256 TraceCheckUtils]: 0: Hoare triple {14264#true} call ULTIMATE.init(); {14264#true} is VALID [2018-11-14 17:07:31,743 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 17:07:31,743 INFO L273 TraceCheckUtils]: 2: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,743 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14264#true} {14264#true} #69#return; {14264#true} is VALID [2018-11-14 17:07:31,743 INFO L256 TraceCheckUtils]: 4: Hoare triple {14264#true} call #t~ret13 := main(); {14264#true} is VALID [2018-11-14 17:07:31,743 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 17:07:31,744 INFO L273 TraceCheckUtils]: 6: Hoare triple {14266#(= main_~i~1 0)} assume true; {14266#(= main_~i~1 0)} is VALID [2018-11-14 17:07:31,744 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 17:07:31,745 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 17:07:31,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {14267#(<= main_~i~1 1)} assume true; {14267#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:31,745 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 17:07:31,746 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 17:07:31,746 INFO L273 TraceCheckUtils]: 12: Hoare triple {14268#(<= main_~i~1 2)} assume true; {14268#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:31,746 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 17:07:31,747 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 17:07:31,747 INFO L273 TraceCheckUtils]: 15: Hoare triple {14269#(<= main_~i~1 3)} assume true; {14269#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:31,747 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 17:07:31,748 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 17:07:31,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {14270#(<= main_~i~1 4)} assume true; {14270#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:31,749 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 17:07:31,750 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 17:07:31,750 INFO L273 TraceCheckUtils]: 21: Hoare triple {14271#(<= main_~i~1 5)} assume true; {14271#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:31,751 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 17:07:31,751 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 17:07:31,752 INFO L273 TraceCheckUtils]: 24: Hoare triple {14272#(<= main_~i~1 6)} assume true; {14272#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:31,752 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 17:07:31,753 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 17:07:31,753 INFO L273 TraceCheckUtils]: 27: Hoare triple {14273#(<= main_~i~1 7)} assume true; {14273#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:31,754 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 17:07:31,755 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 17:07:31,755 INFO L273 TraceCheckUtils]: 30: Hoare triple {14274#(<= main_~i~1 8)} assume true; {14274#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:31,756 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 17:07:31,756 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 17:07:31,757 INFO L273 TraceCheckUtils]: 33: Hoare triple {14275#(<= main_~i~1 9)} assume true; {14275#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:31,757 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 17:07:31,758 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 17:07:31,758 INFO L273 TraceCheckUtils]: 36: Hoare triple {14276#(<= main_~i~1 10)} assume true; {14276#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:31,759 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 17:07:31,759 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 17:07:31,760 INFO L273 TraceCheckUtils]: 39: Hoare triple {14277#(<= main_~i~1 11)} assume true; {14277#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:31,760 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 17:07:31,761 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 17:07:31,762 INFO L273 TraceCheckUtils]: 42: Hoare triple {14278#(<= main_~i~1 12)} assume true; {14278#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:31,762 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 17:07:31,763 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 17:07:31,763 INFO L273 TraceCheckUtils]: 45: Hoare triple {14279#(<= main_~i~1 13)} assume true; {14279#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:31,768 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 17:07:31,768 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 17:07:31,769 INFO L273 TraceCheckUtils]: 48: Hoare triple {14280#(<= main_~i~1 14)} assume true; {14280#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:31,769 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 17:07:31,769 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 17:07:31,770 INFO L273 TraceCheckUtils]: 51: Hoare triple {14281#(<= main_~i~1 15)} assume true; {14281#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:31,770 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 17:07:31,770 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 17:07:31,771 INFO L273 TraceCheckUtils]: 54: Hoare triple {14282#(<= main_~i~1 16)} assume true; {14282#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:31,771 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 17:07:31,772 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 17:07:31,772 INFO L273 TraceCheckUtils]: 57: Hoare triple {14283#(<= main_~i~1 17)} assume true; {14283#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:31,773 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 17:07:31,773 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 17:07:31,774 INFO L273 TraceCheckUtils]: 60: Hoare triple {14284#(<= main_~i~1 18)} assume true; {14284#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:31,774 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 17:07:31,775 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 17:07:31,775 INFO L273 TraceCheckUtils]: 63: Hoare triple {14285#(<= main_~i~1 19)} assume true; {14285#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:31,776 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 17:07:31,776 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 17:07:31,777 INFO L273 TraceCheckUtils]: 66: Hoare triple {14286#(<= main_~i~1 20)} assume true; {14286#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:31,778 INFO L273 TraceCheckUtils]: 67: Hoare triple {14286#(<= main_~i~1 20)} assume !(~i~1 < 10000); {14265#false} is VALID [2018-11-14 17:07:31,778 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 17:07:31,778 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 17:07:31,778 INFO L273 TraceCheckUtils]: 70: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,778 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 17:07:31,779 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 17:07:31,779 INFO L273 TraceCheckUtils]: 73: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,779 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 17:07:31,779 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 17:07:31,779 INFO L273 TraceCheckUtils]: 76: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,779 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 17:07:31,780 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 17:07:31,780 INFO L273 TraceCheckUtils]: 79: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,780 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 17:07:31,780 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 17:07:31,780 INFO L273 TraceCheckUtils]: 82: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,780 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 17:07:31,781 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 17:07:31,781 INFO L273 TraceCheckUtils]: 85: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,781 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 17:07:31,781 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 17:07:31,781 INFO L273 TraceCheckUtils]: 88: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,781 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 17:07:31,782 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 17:07:31,782 INFO L273 TraceCheckUtils]: 91: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,782 INFO L273 TraceCheckUtils]: 92: Hoare triple {14264#true} assume !(~i~0 < 10000); {14264#true} is VALID [2018-11-14 17:07:31,782 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 17:07:31,782 INFO L273 TraceCheckUtils]: 94: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,782 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {14264#true} {14265#false} #73#return; {14265#false} is VALID [2018-11-14 17:07:31,782 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 17:07:31,782 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 17:07:31,783 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 17:07:31,783 INFO L273 TraceCheckUtils]: 99: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,783 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 17:07:31,783 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 17:07:31,783 INFO L273 TraceCheckUtils]: 102: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,783 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 17:07:31,783 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 17:07:31,783 INFO L273 TraceCheckUtils]: 105: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,783 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 17:07:31,784 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 17:07:31,784 INFO L273 TraceCheckUtils]: 108: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,784 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 17:07:31,784 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 17:07:31,784 INFO L273 TraceCheckUtils]: 111: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,784 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 17:07:31,784 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 17:07:31,784 INFO L273 TraceCheckUtils]: 114: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,784 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 17:07:31,784 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 17:07:31,785 INFO L273 TraceCheckUtils]: 117: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,785 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 17:07:31,785 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 17:07:31,785 INFO L273 TraceCheckUtils]: 120: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,785 INFO L273 TraceCheckUtils]: 121: Hoare triple {14264#true} assume !(~i~0 < 10000); {14264#true} is VALID [2018-11-14 17:07:31,785 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 17:07:31,785 INFO L273 TraceCheckUtils]: 123: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,785 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {14264#true} {14265#false} #75#return; {14265#false} is VALID [2018-11-14 17:07:31,785 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 17:07:31,785 INFO L273 TraceCheckUtils]: 126: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:31,786 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 17:07:31,786 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 17:07:31,786 INFO L273 TraceCheckUtils]: 129: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:31,786 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 17:07:31,786 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 17:07:31,786 INFO L273 TraceCheckUtils]: 132: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:31,786 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 17:07:31,786 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 17:07:31,786 INFO L273 TraceCheckUtils]: 135: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:31,787 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 17:07:31,787 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 17:07:31,787 INFO L273 TraceCheckUtils]: 138: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:31,787 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 17:07:31,787 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 17:07:31,787 INFO L273 TraceCheckUtils]: 141: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:31,787 INFO L273 TraceCheckUtils]: 142: Hoare triple {14265#false} assume !(~i~2 < 9999); {14265#false} is VALID [2018-11-14 17:07:31,787 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 17:07:31,787 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 17:07:31,787 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 17:07:31,788 INFO L273 TraceCheckUtils]: 146: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,788 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 17:07:31,788 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 17:07:31,788 INFO L273 TraceCheckUtils]: 149: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,788 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 17:07:31,788 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 17:07:31,788 INFO L273 TraceCheckUtils]: 152: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,788 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 17:07:31,788 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 17:07:31,788 INFO L273 TraceCheckUtils]: 155: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,789 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 17:07:31,789 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 17:07:31,789 INFO L273 TraceCheckUtils]: 158: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,789 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 17:07:31,789 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 17:07:31,789 INFO L273 TraceCheckUtils]: 161: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,789 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 17:07:31,789 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 17:07:31,789 INFO L273 TraceCheckUtils]: 164: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,790 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 17:07:31,790 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 17:07:31,790 INFO L273 TraceCheckUtils]: 167: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,790 INFO L273 TraceCheckUtils]: 168: Hoare triple {14264#true} assume !(~i~0 < 10000); {14264#true} is VALID [2018-11-14 17:07:31,790 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 17:07:31,790 INFO L273 TraceCheckUtils]: 170: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:31,790 INFO L268 TraceCheckUtils]: 171: Hoare quadruple {14264#true} {14265#false} #77#return; {14265#false} is VALID [2018-11-14 17:07:31,790 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 17:07:31,790 INFO L273 TraceCheckUtils]: 173: Hoare triple {14265#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14265#false} is VALID [2018-11-14 17:07:31,790 INFO L273 TraceCheckUtils]: 174: Hoare triple {14265#false} assume !false; {14265#false} is VALID [2018-11-14 17:07:31,804 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 17:07:31,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:31,804 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 17:07:31,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:31,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:32,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {14264#true} call ULTIMATE.init(); {14264#true} is VALID [2018-11-14 17:07:32,229 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 17:07:32,229 INFO L273 TraceCheckUtils]: 2: Hoare triple {14264#true} assume true; {14264#true} is VALID [2018-11-14 17:07:32,229 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14264#true} {14264#true} #69#return; {14264#true} is VALID [2018-11-14 17:07:32,229 INFO L256 TraceCheckUtils]: 4: Hoare triple {14264#true} call #t~ret13 := main(); {14264#true} is VALID [2018-11-14 17:07:32,230 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 17:07:32,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {14305#(<= main_~i~1 0)} assume true; {14305#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:32,231 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 17:07:32,231 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 17:07:32,232 INFO L273 TraceCheckUtils]: 9: Hoare triple {14267#(<= main_~i~1 1)} assume true; {14267#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:32,232 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 17:07:32,232 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 17:07:32,233 INFO L273 TraceCheckUtils]: 12: Hoare triple {14268#(<= main_~i~1 2)} assume true; {14268#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:32,233 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 17:07:32,234 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 17:07:32,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {14269#(<= main_~i~1 3)} assume true; {14269#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:32,235 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 17:07:32,236 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 17:07:32,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {14270#(<= main_~i~1 4)} assume true; {14270#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:32,237 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 17:07:32,237 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 17:07:32,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {14271#(<= main_~i~1 5)} assume true; {14271#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:32,238 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 17:07:32,239 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 17:07:32,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {14272#(<= main_~i~1 6)} assume true; {14272#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:32,240 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 17:07:32,240 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 17:07:32,241 INFO L273 TraceCheckUtils]: 27: Hoare triple {14273#(<= main_~i~1 7)} assume true; {14273#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:32,241 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 17:07:32,242 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 17:07:32,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {14274#(<= main_~i~1 8)} assume true; {14274#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:32,243 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 17:07:32,244 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 17:07:32,244 INFO L273 TraceCheckUtils]: 33: Hoare triple {14275#(<= main_~i~1 9)} assume true; {14275#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:32,245 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 17:07:32,245 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 17:07:32,246 INFO L273 TraceCheckUtils]: 36: Hoare triple {14276#(<= main_~i~1 10)} assume true; {14276#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:32,246 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 17:07:32,247 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 17:07:32,248 INFO L273 TraceCheckUtils]: 39: Hoare triple {14277#(<= main_~i~1 11)} assume true; {14277#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:32,248 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 17:07:32,249 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 17:07:32,249 INFO L273 TraceCheckUtils]: 42: Hoare triple {14278#(<= main_~i~1 12)} assume true; {14278#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:32,250 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 17:07:32,251 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 17:07:32,251 INFO L273 TraceCheckUtils]: 45: Hoare triple {14279#(<= main_~i~1 13)} assume true; {14279#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:32,252 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 17:07:32,252 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 17:07:32,253 INFO L273 TraceCheckUtils]: 48: Hoare triple {14280#(<= main_~i~1 14)} assume true; {14280#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:32,253 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 17:07:32,254 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 17:07:32,255 INFO L273 TraceCheckUtils]: 51: Hoare triple {14281#(<= main_~i~1 15)} assume true; {14281#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:32,255 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 17:07:32,256 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 17:07:32,256 INFO L273 TraceCheckUtils]: 54: Hoare triple {14282#(<= main_~i~1 16)} assume true; {14282#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:32,257 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 17:07:32,258 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 17:07:32,258 INFO L273 TraceCheckUtils]: 57: Hoare triple {14283#(<= main_~i~1 17)} assume true; {14283#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:32,259 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 17:07:32,259 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 17:07:32,260 INFO L273 TraceCheckUtils]: 60: Hoare triple {14284#(<= main_~i~1 18)} assume true; {14284#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:32,260 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 17:07:32,261 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 17:07:32,262 INFO L273 TraceCheckUtils]: 63: Hoare triple {14285#(<= main_~i~1 19)} assume true; {14285#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:32,262 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 17:07:32,263 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 17:07:32,263 INFO L273 TraceCheckUtils]: 66: Hoare triple {14286#(<= main_~i~1 20)} assume true; {14286#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:32,264 INFO L273 TraceCheckUtils]: 67: Hoare triple {14286#(<= main_~i~1 20)} assume !(~i~1 < 10000); {14265#false} is VALID [2018-11-14 17:07:32,264 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 17:07:32,264 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 17:07:32,264 INFO L273 TraceCheckUtils]: 70: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,265 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 17:07:32,265 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 17:07:32,265 INFO L273 TraceCheckUtils]: 73: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,265 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 17:07:32,265 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 17:07:32,265 INFO L273 TraceCheckUtils]: 76: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,266 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 17:07:32,266 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 17:07:32,266 INFO L273 TraceCheckUtils]: 79: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,266 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 17:07:32,266 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 17:07:32,266 INFO L273 TraceCheckUtils]: 82: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,267 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 17:07:32,267 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 17:07:32,267 INFO L273 TraceCheckUtils]: 85: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,267 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 17:07:32,267 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 17:07:32,267 INFO L273 TraceCheckUtils]: 88: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,267 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 17:07:32,267 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 17:07:32,268 INFO L273 TraceCheckUtils]: 91: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,268 INFO L273 TraceCheckUtils]: 92: Hoare triple {14265#false} assume !(~i~0 < 10000); {14265#false} is VALID [2018-11-14 17:07:32,268 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 17:07:32,268 INFO L273 TraceCheckUtils]: 94: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,268 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {14265#false} {14265#false} #73#return; {14265#false} is VALID [2018-11-14 17:07:32,268 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 17:07:32,268 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 17:07:32,268 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 17:07:32,268 INFO L273 TraceCheckUtils]: 99: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,268 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 17:07:32,269 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 17:07:32,269 INFO L273 TraceCheckUtils]: 102: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,269 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 17:07:32,269 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 17:07:32,269 INFO L273 TraceCheckUtils]: 105: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,269 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 17:07:32,269 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 17:07:32,269 INFO L273 TraceCheckUtils]: 108: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,269 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 17:07:32,269 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 17:07:32,270 INFO L273 TraceCheckUtils]: 111: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,270 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 17:07:32,270 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 17:07:32,270 INFO L273 TraceCheckUtils]: 114: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,270 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 17:07:32,270 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 17:07:32,270 INFO L273 TraceCheckUtils]: 117: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,270 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 17:07:32,270 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 17:07:32,270 INFO L273 TraceCheckUtils]: 120: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,271 INFO L273 TraceCheckUtils]: 121: Hoare triple {14265#false} assume !(~i~0 < 10000); {14265#false} is VALID [2018-11-14 17:07:32,271 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 17:07:32,271 INFO L273 TraceCheckUtils]: 123: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,271 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {14265#false} {14265#false} #75#return; {14265#false} is VALID [2018-11-14 17:07:32,271 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 17:07:32,271 INFO L273 TraceCheckUtils]: 126: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,271 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 17:07:32,271 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 17:07:32,271 INFO L273 TraceCheckUtils]: 129: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,272 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 17:07:32,272 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 17:07:32,272 INFO L273 TraceCheckUtils]: 132: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,272 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 17:07:32,272 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 17:07:32,272 INFO L273 TraceCheckUtils]: 135: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,272 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 17:07:32,272 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 17:07:32,272 INFO L273 TraceCheckUtils]: 138: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,272 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 17:07:32,273 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 17:07:32,273 INFO L273 TraceCheckUtils]: 141: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,273 INFO L273 TraceCheckUtils]: 142: Hoare triple {14265#false} assume !(~i~2 < 9999); {14265#false} is VALID [2018-11-14 17:07:32,273 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 17:07:32,273 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 17:07:32,273 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 17:07:32,273 INFO L273 TraceCheckUtils]: 146: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,273 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 17:07:32,273 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 17:07:32,273 INFO L273 TraceCheckUtils]: 149: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,274 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 17:07:32,274 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 17:07:32,274 INFO L273 TraceCheckUtils]: 152: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,274 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 17:07:32,274 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 17:07:32,274 INFO L273 TraceCheckUtils]: 155: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,274 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 17:07:32,274 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 17:07:32,274 INFO L273 TraceCheckUtils]: 158: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,274 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 17:07:32,275 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 17:07:32,275 INFO L273 TraceCheckUtils]: 161: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,275 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 17:07:32,275 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 17:07:32,275 INFO L273 TraceCheckUtils]: 164: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,275 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 17:07:32,275 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 17:07:32,275 INFO L273 TraceCheckUtils]: 167: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,275 INFO L273 TraceCheckUtils]: 168: Hoare triple {14265#false} assume !(~i~0 < 10000); {14265#false} is VALID [2018-11-14 17:07:32,276 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 17:07:32,276 INFO L273 TraceCheckUtils]: 170: Hoare triple {14265#false} assume true; {14265#false} is VALID [2018-11-14 17:07:32,276 INFO L268 TraceCheckUtils]: 171: Hoare quadruple {14265#false} {14265#false} #77#return; {14265#false} is VALID [2018-11-14 17:07:32,276 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 17:07:32,276 INFO L273 TraceCheckUtils]: 173: Hoare triple {14265#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14265#false} is VALID [2018-11-14 17:07:32,276 INFO L273 TraceCheckUtils]: 174: Hoare triple {14265#false} assume !false; {14265#false} is VALID [2018-11-14 17:07:32,290 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 17:07:32,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:32,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-14 17:07:32,312 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-14 17:07:32,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:32,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 17:07:32,407 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 17:07:32,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 17:07:32,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 17:07:32,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:07:32,408 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 24 states. [2018-11-14 17:07:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:33,301 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-14 17:07:33,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 17:07:33,301 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-14 17:07:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:07:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 120 transitions. [2018-11-14 17:07:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:07:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 120 transitions. [2018-11-14 17:07:33,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 120 transitions. [2018-11-14 17:07:33,406 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 17:07:33,408 INFO L225 Difference]: With dead ends: 180 [2018-11-14 17:07:33,409 INFO L226 Difference]: Without dead ends: 126 [2018-11-14 17:07:33,409 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:07:33,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-14 17:07:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-14 17:07:33,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:33,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-14 17:07:33,484 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-14 17:07:33,484 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-14 17:07:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:33,487 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-14 17:07:33,487 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-14 17:07:33,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:33,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:33,488 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-14 17:07:33,488 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-14 17:07:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:33,490 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-14 17:07:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-14 17:07:33,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:33,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:33,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:33,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:33,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-14 17:07:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-14 17:07:33,493 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 175 [2018-11-14 17:07:33,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:33,494 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-14 17:07:33,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 17:07:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-14 17:07:33,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-14 17:07:33,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:33,495 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 17:07:33,495 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:33,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:33,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1950415411, now seen corresponding path program 20 times [2018-11-14 17:07:33,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:33,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:33,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:33,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:33,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:33,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {15475#true} call ULTIMATE.init(); {15475#true} is VALID [2018-11-14 17:07:33,961 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 17:07:33,961 INFO L273 TraceCheckUtils]: 2: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:33,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15475#true} {15475#true} #69#return; {15475#true} is VALID [2018-11-14 17:07:33,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {15475#true} call #t~ret13 := main(); {15475#true} is VALID [2018-11-14 17:07:33,962 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 17:07:33,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {15477#(= main_~i~1 0)} assume true; {15477#(= main_~i~1 0)} is VALID [2018-11-14 17:07:33,962 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 17:07:33,963 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 17:07:33,963 INFO L273 TraceCheckUtils]: 9: Hoare triple {15478#(<= main_~i~1 1)} assume true; {15478#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:33,963 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 17:07:33,964 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 17:07:33,964 INFO L273 TraceCheckUtils]: 12: Hoare triple {15479#(<= main_~i~1 2)} assume true; {15479#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:33,964 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 17:07:33,965 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 17:07:33,965 INFO L273 TraceCheckUtils]: 15: Hoare triple {15480#(<= main_~i~1 3)} assume true; {15480#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:33,966 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 17:07:33,967 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 17:07:33,967 INFO L273 TraceCheckUtils]: 18: Hoare triple {15481#(<= main_~i~1 4)} assume true; {15481#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:33,968 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 17:07:33,968 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 17:07:33,969 INFO L273 TraceCheckUtils]: 21: Hoare triple {15482#(<= main_~i~1 5)} assume true; {15482#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:33,969 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 17:07:33,970 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 17:07:33,971 INFO L273 TraceCheckUtils]: 24: Hoare triple {15483#(<= main_~i~1 6)} assume true; {15483#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:33,971 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 17:07:33,972 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 17:07:33,972 INFO L273 TraceCheckUtils]: 27: Hoare triple {15484#(<= main_~i~1 7)} assume true; {15484#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:33,973 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 17:07:33,974 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 17:07:33,974 INFO L273 TraceCheckUtils]: 30: Hoare triple {15485#(<= main_~i~1 8)} assume true; {15485#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:33,975 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 17:07:33,975 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 17:07:33,976 INFO L273 TraceCheckUtils]: 33: Hoare triple {15486#(<= main_~i~1 9)} assume true; {15486#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:33,976 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 17:07:33,977 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 17:07:33,977 INFO L273 TraceCheckUtils]: 36: Hoare triple {15487#(<= main_~i~1 10)} assume true; {15487#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:33,978 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 17:07:33,979 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 17:07:33,979 INFO L273 TraceCheckUtils]: 39: Hoare triple {15488#(<= main_~i~1 11)} assume true; {15488#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:33,980 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 17:07:33,980 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 17:07:33,981 INFO L273 TraceCheckUtils]: 42: Hoare triple {15489#(<= main_~i~1 12)} assume true; {15489#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:33,981 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 17:07:33,982 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 17:07:33,983 INFO L273 TraceCheckUtils]: 45: Hoare triple {15490#(<= main_~i~1 13)} assume true; {15490#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:33,983 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 17:07:33,984 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 17:07:33,984 INFO L273 TraceCheckUtils]: 48: Hoare triple {15491#(<= main_~i~1 14)} assume true; {15491#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:33,985 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 17:07:33,986 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 17:07:33,986 INFO L273 TraceCheckUtils]: 51: Hoare triple {15492#(<= main_~i~1 15)} assume true; {15492#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:33,987 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 17:07:33,987 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 17:07:33,988 INFO L273 TraceCheckUtils]: 54: Hoare triple {15493#(<= main_~i~1 16)} assume true; {15493#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:33,988 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 17:07:33,989 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 17:07:33,990 INFO L273 TraceCheckUtils]: 57: Hoare triple {15494#(<= main_~i~1 17)} assume true; {15494#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:33,990 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 17:07:33,991 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 17:07:33,991 INFO L273 TraceCheckUtils]: 60: Hoare triple {15495#(<= main_~i~1 18)} assume true; {15495#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:33,992 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 17:07:33,993 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 17:07:33,993 INFO L273 TraceCheckUtils]: 63: Hoare triple {15496#(<= main_~i~1 19)} assume true; {15496#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:33,994 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 17:07:33,994 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 17:07:33,995 INFO L273 TraceCheckUtils]: 66: Hoare triple {15497#(<= main_~i~1 20)} assume true; {15497#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:33,995 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 17:07:33,996 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 17:07:33,997 INFO L273 TraceCheckUtils]: 69: Hoare triple {15498#(<= main_~i~1 21)} assume true; {15498#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:33,997 INFO L273 TraceCheckUtils]: 70: Hoare triple {15498#(<= main_~i~1 21)} assume !(~i~1 < 10000); {15476#false} is VALID [2018-11-14 17:07:33,997 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 17:07:33,998 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 17:07:33,998 INFO L273 TraceCheckUtils]: 73: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:33,998 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 17:07:33,998 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 17:07:33,998 INFO L273 TraceCheckUtils]: 76: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:33,999 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 17:07:33,999 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 17:07:33,999 INFO L273 TraceCheckUtils]: 79: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:33,999 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 17:07:33,999 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 17:07:33,999 INFO L273 TraceCheckUtils]: 82: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,000 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 17:07:34,000 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 17:07:34,000 INFO L273 TraceCheckUtils]: 85: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,000 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 17:07:34,000 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 17:07:34,001 INFO L273 TraceCheckUtils]: 88: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,001 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 17:07:34,001 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 17:07:34,001 INFO L273 TraceCheckUtils]: 91: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,001 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 17:07:34,001 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 17:07:34,002 INFO L273 TraceCheckUtils]: 94: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,002 INFO L273 TraceCheckUtils]: 95: Hoare triple {15475#true} assume !(~i~0 < 10000); {15475#true} is VALID [2018-11-14 17:07:34,002 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 17:07:34,002 INFO L273 TraceCheckUtils]: 97: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,002 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {15475#true} {15476#false} #73#return; {15476#false} is VALID [2018-11-14 17:07:34,002 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 17:07:34,002 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 17:07:34,003 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 17:07:34,003 INFO L273 TraceCheckUtils]: 102: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,003 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 17:07:34,003 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 17:07:34,003 INFO L273 TraceCheckUtils]: 105: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,003 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 17:07:34,003 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 17:07:34,003 INFO L273 TraceCheckUtils]: 108: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,003 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 17:07:34,003 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 17:07:34,004 INFO L273 TraceCheckUtils]: 111: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,004 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 17:07:34,004 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 17:07:34,004 INFO L273 TraceCheckUtils]: 114: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,004 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 17:07:34,004 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 17:07:34,004 INFO L273 TraceCheckUtils]: 117: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,004 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 17:07:34,004 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 17:07:34,005 INFO L273 TraceCheckUtils]: 120: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,005 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 17:07:34,005 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 17:07:34,005 INFO L273 TraceCheckUtils]: 123: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,005 INFO L273 TraceCheckUtils]: 124: Hoare triple {15475#true} assume !(~i~0 < 10000); {15475#true} is VALID [2018-11-14 17:07:34,005 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 17:07:34,005 INFO L273 TraceCheckUtils]: 126: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,005 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {15475#true} {15476#false} #75#return; {15476#false} is VALID [2018-11-14 17:07:34,005 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 17:07:34,005 INFO L273 TraceCheckUtils]: 129: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:34,006 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 17:07:34,006 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 17:07:34,006 INFO L273 TraceCheckUtils]: 132: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:34,006 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 17:07:34,006 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 17:07:34,006 INFO L273 TraceCheckUtils]: 135: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:34,006 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 17:07:34,006 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 17:07:34,006 INFO L273 TraceCheckUtils]: 138: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:34,006 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 17:07:34,007 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 17:07:34,007 INFO L273 TraceCheckUtils]: 141: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:34,007 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 17:07:34,007 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 17:07:34,007 INFO L273 TraceCheckUtils]: 144: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:34,007 INFO L273 TraceCheckUtils]: 145: Hoare triple {15476#false} assume !(~i~2 < 9999); {15476#false} is VALID [2018-11-14 17:07:34,007 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 17:07:34,007 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 17:07:34,007 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 17:07:34,008 INFO L273 TraceCheckUtils]: 149: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,008 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 17:07:34,008 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 17:07:34,008 INFO L273 TraceCheckUtils]: 152: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,008 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 17:07:34,008 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 17:07:34,008 INFO L273 TraceCheckUtils]: 155: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,008 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 17:07:34,008 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 17:07:34,008 INFO L273 TraceCheckUtils]: 158: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,009 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 17:07:34,009 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 17:07:34,009 INFO L273 TraceCheckUtils]: 161: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,009 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 17:07:34,009 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 17:07:34,009 INFO L273 TraceCheckUtils]: 164: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,009 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 17:07:34,009 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 17:07:34,009 INFO L273 TraceCheckUtils]: 167: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,009 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 17:07:34,010 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 17:07:34,010 INFO L273 TraceCheckUtils]: 170: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,010 INFO L273 TraceCheckUtils]: 171: Hoare triple {15475#true} assume !(~i~0 < 10000); {15475#true} is VALID [2018-11-14 17:07:34,010 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 17:07:34,010 INFO L273 TraceCheckUtils]: 173: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:34,010 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {15475#true} {15476#false} #77#return; {15476#false} is VALID [2018-11-14 17:07:34,010 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 17:07:34,010 INFO L273 TraceCheckUtils]: 176: Hoare triple {15476#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15476#false} is VALID [2018-11-14 17:07:34,010 INFO L273 TraceCheckUtils]: 177: Hoare triple {15476#false} assume !false; {15476#false} is VALID [2018-11-14 17:07:34,024 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 17:07:34,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:34,025 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 17:07:34,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:07:34,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:07:34,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:34,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:35,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {15475#true} call ULTIMATE.init(); {15475#true} is VALID [2018-11-14 17:07:35,398 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 17:07:35,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-14 17:07:35,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15475#true} {15475#true} #69#return; {15475#true} is VALID [2018-11-14 17:07:35,399 INFO L256 TraceCheckUtils]: 4: Hoare triple {15475#true} call #t~ret13 := main(); {15475#true} is VALID [2018-11-14 17:07:35,400 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 17:07:35,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {15517#(<= main_~i~1 0)} assume true; {15517#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:35,400 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 17:07:35,401 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 17:07:35,401 INFO L273 TraceCheckUtils]: 9: Hoare triple {15478#(<= main_~i~1 1)} assume true; {15478#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:35,401 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 17:07:35,402 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 17:07:35,402 INFO L273 TraceCheckUtils]: 12: Hoare triple {15479#(<= main_~i~1 2)} assume true; {15479#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:35,402 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 17:07:35,403 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 17:07:35,403 INFO L273 TraceCheckUtils]: 15: Hoare triple {15480#(<= main_~i~1 3)} assume true; {15480#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:35,404 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 17:07:35,405 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 17:07:35,405 INFO L273 TraceCheckUtils]: 18: Hoare triple {15481#(<= main_~i~1 4)} assume true; {15481#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:35,406 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 17:07:35,406 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 17:07:35,407 INFO L273 TraceCheckUtils]: 21: Hoare triple {15482#(<= main_~i~1 5)} assume true; {15482#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:35,407 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 17:07:35,408 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 17:07:35,409 INFO L273 TraceCheckUtils]: 24: Hoare triple {15483#(<= main_~i~1 6)} assume true; {15483#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:35,409 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 17:07:35,410 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 17:07:35,410 INFO L273 TraceCheckUtils]: 27: Hoare triple {15484#(<= main_~i~1 7)} assume true; {15484#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:35,411 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 17:07:35,412 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 17:07:35,412 INFO L273 TraceCheckUtils]: 30: Hoare triple {15485#(<= main_~i~1 8)} assume true; {15485#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:35,413 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 17:07:35,413 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 17:07:35,414 INFO L273 TraceCheckUtils]: 33: Hoare triple {15486#(<= main_~i~1 9)} assume true; {15486#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:35,414 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 17:07:35,415 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 17:07:35,415 INFO L273 TraceCheckUtils]: 36: Hoare triple {15487#(<= main_~i~1 10)} assume true; {15487#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:35,416 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 17:07:35,417 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 17:07:35,417 INFO L273 TraceCheckUtils]: 39: Hoare triple {15488#(<= main_~i~1 11)} assume true; {15488#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:35,418 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 17:07:35,418 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 17:07:35,419 INFO L273 TraceCheckUtils]: 42: Hoare triple {15489#(<= main_~i~1 12)} assume true; {15489#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:35,419 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 17:07:35,420 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 17:07:35,421 INFO L273 TraceCheckUtils]: 45: Hoare triple {15490#(<= main_~i~1 13)} assume true; {15490#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:35,421 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 17:07:35,422 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 17:07:35,422 INFO L273 TraceCheckUtils]: 48: Hoare triple {15491#(<= main_~i~1 14)} assume true; {15491#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:35,423 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 17:07:35,424 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 17:07:35,424 INFO L273 TraceCheckUtils]: 51: Hoare triple {15492#(<= main_~i~1 15)} assume true; {15492#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:35,425 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 17:07:35,425 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 17:07:35,426 INFO L273 TraceCheckUtils]: 54: Hoare triple {15493#(<= main_~i~1 16)} assume true; {15493#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:35,426 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 17:07:35,427 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 17:07:35,428 INFO L273 TraceCheckUtils]: 57: Hoare triple {15494#(<= main_~i~1 17)} assume true; {15494#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:35,428 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 17:07:35,429 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 17:07:35,429 INFO L273 TraceCheckUtils]: 60: Hoare triple {15495#(<= main_~i~1 18)} assume true; {15495#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:35,430 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 17:07:35,431 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 17:07:35,431 INFO L273 TraceCheckUtils]: 63: Hoare triple {15496#(<= main_~i~1 19)} assume true; {15496#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:35,432 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 17:07:35,432 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 17:07:35,433 INFO L273 TraceCheckUtils]: 66: Hoare triple {15497#(<= main_~i~1 20)} assume true; {15497#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:35,433 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 17:07:35,434 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 17:07:35,435 INFO L273 TraceCheckUtils]: 69: Hoare triple {15498#(<= main_~i~1 21)} assume true; {15498#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:35,435 INFO L273 TraceCheckUtils]: 70: Hoare triple {15498#(<= main_~i~1 21)} assume !(~i~1 < 10000); {15476#false} is VALID [2018-11-14 17:07:35,435 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 17:07:35,436 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 17:07:35,436 INFO L273 TraceCheckUtils]: 73: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,436 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 17:07:35,436 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 17:07:35,436 INFO L273 TraceCheckUtils]: 76: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,436 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 17:07:35,437 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 17:07:35,437 INFO L273 TraceCheckUtils]: 79: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,437 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 17:07:35,437 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 17:07:35,437 INFO L273 TraceCheckUtils]: 82: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,438 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 17:07:35,438 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 17:07:35,438 INFO L273 TraceCheckUtils]: 85: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,438 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 17:07:35,438 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 17:07:35,438 INFO L273 TraceCheckUtils]: 88: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,438 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 17:07:35,438 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 17:07:35,438 INFO L273 TraceCheckUtils]: 91: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,439 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 17:07:35,439 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 17:07:35,439 INFO L273 TraceCheckUtils]: 94: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,439 INFO L273 TraceCheckUtils]: 95: Hoare triple {15476#false} assume !(~i~0 < 10000); {15476#false} is VALID [2018-11-14 17:07:35,439 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 17:07:35,439 INFO L273 TraceCheckUtils]: 97: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,439 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {15476#false} {15476#false} #73#return; {15476#false} is VALID [2018-11-14 17:07:35,439 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 17:07:35,439 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 17:07:35,439 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 17:07:35,440 INFO L273 TraceCheckUtils]: 102: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,440 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 17:07:35,440 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 17:07:35,440 INFO L273 TraceCheckUtils]: 105: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,440 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 17:07:35,440 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 17:07:35,440 INFO L273 TraceCheckUtils]: 108: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,440 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 17:07:35,440 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 17:07:35,440 INFO L273 TraceCheckUtils]: 111: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,441 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 17:07:35,441 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 17:07:35,441 INFO L273 TraceCheckUtils]: 114: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,441 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 17:07:35,441 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 17:07:35,441 INFO L273 TraceCheckUtils]: 117: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,441 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 17:07:35,442 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 17:07:35,442 INFO L273 TraceCheckUtils]: 120: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,442 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 17:07:35,442 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 17:07:35,442 INFO L273 TraceCheckUtils]: 123: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,442 INFO L273 TraceCheckUtils]: 124: Hoare triple {15476#false} assume !(~i~0 < 10000); {15476#false} is VALID [2018-11-14 17:07:35,442 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 17:07:35,442 INFO L273 TraceCheckUtils]: 126: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,442 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {15476#false} {15476#false} #75#return; {15476#false} is VALID [2018-11-14 17:07:35,442 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 17:07:35,443 INFO L273 TraceCheckUtils]: 129: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,443 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 17:07:35,443 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 17:07:35,443 INFO L273 TraceCheckUtils]: 132: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,443 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 17:07:35,443 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 17:07:35,443 INFO L273 TraceCheckUtils]: 135: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,443 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 17:07:35,443 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 17:07:35,443 INFO L273 TraceCheckUtils]: 138: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,444 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 17:07:35,444 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 17:07:35,444 INFO L273 TraceCheckUtils]: 141: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,444 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 17:07:35,444 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 17:07:35,444 INFO L273 TraceCheckUtils]: 144: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,444 INFO L273 TraceCheckUtils]: 145: Hoare triple {15476#false} assume !(~i~2 < 9999); {15476#false} is VALID [2018-11-14 17:07:35,444 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 17:07:35,444 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 17:07:35,444 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 17:07:35,445 INFO L273 TraceCheckUtils]: 149: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,445 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 17:07:35,445 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 17:07:35,445 INFO L273 TraceCheckUtils]: 152: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,445 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 17:07:35,445 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 17:07:35,445 INFO L273 TraceCheckUtils]: 155: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,445 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 17:07:35,445 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 17:07:35,446 INFO L273 TraceCheckUtils]: 158: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,446 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 17:07:35,446 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 17:07:35,446 INFO L273 TraceCheckUtils]: 161: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,446 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 17:07:35,446 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 17:07:35,446 INFO L273 TraceCheckUtils]: 164: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,446 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 17:07:35,446 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 17:07:35,446 INFO L273 TraceCheckUtils]: 167: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,447 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 17:07:35,447 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 17:07:35,447 INFO L273 TraceCheckUtils]: 170: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,447 INFO L273 TraceCheckUtils]: 171: Hoare triple {15476#false} assume !(~i~0 < 10000); {15476#false} is VALID [2018-11-14 17:07:35,447 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 17:07:35,447 INFO L273 TraceCheckUtils]: 173: Hoare triple {15476#false} assume true; {15476#false} is VALID [2018-11-14 17:07:35,447 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {15476#false} {15476#false} #77#return; {15476#false} is VALID [2018-11-14 17:07:35,447 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 17:07:35,447 INFO L273 TraceCheckUtils]: 176: Hoare triple {15476#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15476#false} is VALID [2018-11-14 17:07:35,447 INFO L273 TraceCheckUtils]: 177: Hoare triple {15476#false} assume !false; {15476#false} is VALID [2018-11-14 17:07:35,481 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 17:07:35,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:35,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-14 17:07:35,502 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 178 [2018-11-14 17:07:35,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:35,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 17:07:35,607 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 17:07:35,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 17:07:35,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 17:07:35,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:07:35,609 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 25 states. [2018-11-14 17:07:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:36,220 INFO L93 Difference]: Finished difference Result 183 states and 191 transitions. [2018-11-14 17:07:36,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 17:07:36,220 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 178 [2018-11-14 17:07:36,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:07:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 123 transitions. [2018-11-14 17:07:36,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:07:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 123 transitions. [2018-11-14 17:07:36,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 123 transitions. [2018-11-14 17:07:36,326 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 17:07:36,329 INFO L225 Difference]: With dead ends: 183 [2018-11-14 17:07:36,329 INFO L226 Difference]: Without dead ends: 129 [2018-11-14 17:07:36,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:07:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-14 17:07:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-11-14 17:07:36,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:36,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 128 states. [2018-11-14 17:07:36,373 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 128 states. [2018-11-14 17:07:36,373 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 128 states. [2018-11-14 17:07:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:36,376 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-11-14 17:07:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2018-11-14 17:07:36,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:36,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:36,377 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 129 states. [2018-11-14 17:07:36,377 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 129 states. [2018-11-14 17:07:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:36,379 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-11-14 17:07:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2018-11-14 17:07:36,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:36,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:36,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:36,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-14 17:07:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2018-11-14 17:07:36,382 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 178 [2018-11-14 17:07:36,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:36,383 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2018-11-14 17:07:36,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 17:07:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-14 17:07:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-14 17:07:36,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:36,384 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 17:07:36,385 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:36,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:36,385 INFO L82 PathProgramCache]: Analyzing trace with hash -277975097, now seen corresponding path program 21 times [2018-11-14 17:07:36,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:36,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:36,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:36,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:36,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:37,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {16710#true} call ULTIMATE.init(); {16710#true} is VALID [2018-11-14 17:07:37,349 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 17:07:37,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16710#true} {16710#true} #69#return; {16710#true} is VALID [2018-11-14 17:07:37,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {16710#true} call #t~ret13 := main(); {16710#true} is VALID [2018-11-14 17:07:37,349 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 17:07:37,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {16712#(= main_~i~1 0)} assume true; {16712#(= main_~i~1 0)} is VALID [2018-11-14 17:07:37,371 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 17:07:37,388 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 17:07:37,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {16713#(<= main_~i~1 1)} assume true; {16713#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:37,390 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 17:07:37,391 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 17:07:37,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {16714#(<= main_~i~1 2)} assume true; {16714#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:37,391 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 17:07:37,392 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 17:07:37,392 INFO L273 TraceCheckUtils]: 15: Hoare triple {16715#(<= main_~i~1 3)} assume true; {16715#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:37,392 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 17:07:37,393 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 17:07:37,393 INFO L273 TraceCheckUtils]: 18: Hoare triple {16716#(<= main_~i~1 4)} assume true; {16716#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:37,393 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 17:07:37,394 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 17:07:37,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {16717#(<= main_~i~1 5)} assume true; {16717#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:37,395 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 17:07:37,396 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 17:07:37,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {16718#(<= main_~i~1 6)} assume true; {16718#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:37,397 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 17:07:37,397 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 17:07:37,398 INFO L273 TraceCheckUtils]: 27: Hoare triple {16719#(<= main_~i~1 7)} assume true; {16719#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:37,398 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 17:07:37,399 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 17:07:37,400 INFO L273 TraceCheckUtils]: 30: Hoare triple {16720#(<= main_~i~1 8)} assume true; {16720#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:37,400 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 17:07:37,401 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 17:07:37,401 INFO L273 TraceCheckUtils]: 33: Hoare triple {16721#(<= main_~i~1 9)} assume true; {16721#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:37,402 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 17:07:37,403 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 17:07:37,403 INFO L273 TraceCheckUtils]: 36: Hoare triple {16722#(<= main_~i~1 10)} assume true; {16722#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:37,404 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 17:07:37,404 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 17:07:37,405 INFO L273 TraceCheckUtils]: 39: Hoare triple {16723#(<= main_~i~1 11)} assume true; {16723#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:37,405 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 17:07:37,406 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 17:07:37,406 INFO L273 TraceCheckUtils]: 42: Hoare triple {16724#(<= main_~i~1 12)} assume true; {16724#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:37,407 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 17:07:37,408 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 17:07:37,408 INFO L273 TraceCheckUtils]: 45: Hoare triple {16725#(<= main_~i~1 13)} assume true; {16725#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:37,409 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 17:07:37,409 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 17:07:37,410 INFO L273 TraceCheckUtils]: 48: Hoare triple {16726#(<= main_~i~1 14)} assume true; {16726#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:37,410 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 17:07:37,411 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 17:07:37,412 INFO L273 TraceCheckUtils]: 51: Hoare triple {16727#(<= main_~i~1 15)} assume true; {16727#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:37,412 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 17:07:37,413 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 17:07:37,413 INFO L273 TraceCheckUtils]: 54: Hoare triple {16728#(<= main_~i~1 16)} assume true; {16728#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:37,414 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 17:07:37,415 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 17:07:37,415 INFO L273 TraceCheckUtils]: 57: Hoare triple {16729#(<= main_~i~1 17)} assume true; {16729#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:37,416 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 17:07:37,416 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 17:07:37,417 INFO L273 TraceCheckUtils]: 60: Hoare triple {16730#(<= main_~i~1 18)} assume true; {16730#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:37,417 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 17:07:37,418 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 17:07:37,419 INFO L273 TraceCheckUtils]: 63: Hoare triple {16731#(<= main_~i~1 19)} assume true; {16731#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:37,419 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 17:07:37,420 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 17:07:37,420 INFO L273 TraceCheckUtils]: 66: Hoare triple {16732#(<= main_~i~1 20)} assume true; {16732#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:37,421 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 17:07:37,421 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 17:07:37,422 INFO L273 TraceCheckUtils]: 69: Hoare triple {16733#(<= main_~i~1 21)} assume true; {16733#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:37,422 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 17:07:37,423 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 17:07:37,424 INFO L273 TraceCheckUtils]: 72: Hoare triple {16734#(<= main_~i~1 22)} assume true; {16734#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:37,424 INFO L273 TraceCheckUtils]: 73: Hoare triple {16734#(<= main_~i~1 22)} assume !(~i~1 < 10000); {16711#false} is VALID [2018-11-14 17:07:37,425 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 17:07:37,425 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 17:07:37,425 INFO L273 TraceCheckUtils]: 76: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,425 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 17:07:37,425 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 17:07:37,425 INFO L273 TraceCheckUtils]: 79: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,426 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 17:07:37,426 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 17:07:37,426 INFO L273 TraceCheckUtils]: 82: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,426 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 17:07:37,426 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 17:07:37,427 INFO L273 TraceCheckUtils]: 85: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,427 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 17:07:37,427 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 17:07:37,427 INFO L273 TraceCheckUtils]: 88: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,427 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 17:07:37,427 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 17:07:37,427 INFO L273 TraceCheckUtils]: 91: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,427 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 17:07:37,427 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 17:07:37,427 INFO L273 TraceCheckUtils]: 94: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,428 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 17:07:37,428 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 17:07:37,428 INFO L273 TraceCheckUtils]: 97: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,428 INFO L273 TraceCheckUtils]: 98: Hoare triple {16710#true} assume !(~i~0 < 10000); {16710#true} is VALID [2018-11-14 17:07:37,428 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 17:07:37,428 INFO L273 TraceCheckUtils]: 100: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,428 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16710#true} {16711#false} #73#return; {16711#false} is VALID [2018-11-14 17:07:37,428 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 17:07:37,428 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 17:07:37,428 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 17:07:37,429 INFO L273 TraceCheckUtils]: 105: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,429 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 17:07:37,429 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 17:07:37,429 INFO L273 TraceCheckUtils]: 108: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,429 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 17:07:37,429 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 17:07:37,429 INFO L273 TraceCheckUtils]: 111: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,429 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 17:07:37,429 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 17:07:37,430 INFO L273 TraceCheckUtils]: 114: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,430 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 17:07:37,430 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 17:07:37,430 INFO L273 TraceCheckUtils]: 117: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,430 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 17:07:37,430 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 17:07:37,430 INFO L273 TraceCheckUtils]: 120: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,430 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 17:07:37,430 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 17:07:37,430 INFO L273 TraceCheckUtils]: 123: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,431 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 17:07:37,431 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 17:07:37,431 INFO L273 TraceCheckUtils]: 126: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,431 INFO L273 TraceCheckUtils]: 127: Hoare triple {16710#true} assume !(~i~0 < 10000); {16710#true} is VALID [2018-11-14 17:07:37,431 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 17:07:37,431 INFO L273 TraceCheckUtils]: 129: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,431 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {16710#true} {16711#false} #75#return; {16711#false} is VALID [2018-11-14 17:07:37,431 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 17:07:37,432 INFO L273 TraceCheckUtils]: 132: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 17:07:37,432 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 17:07:37,432 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 17:07:37,432 INFO L273 TraceCheckUtils]: 135: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 17:07:37,432 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 17:07:37,432 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 17:07:37,432 INFO L273 TraceCheckUtils]: 138: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 17:07:37,432 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 17:07:37,433 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 17:07:37,433 INFO L273 TraceCheckUtils]: 141: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 17:07:37,433 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 17:07:37,433 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 17:07:37,433 INFO L273 TraceCheckUtils]: 144: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 17:07:37,433 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 17:07:37,433 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 17:07:37,433 INFO L273 TraceCheckUtils]: 147: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 17:07:37,433 INFO L273 TraceCheckUtils]: 148: Hoare triple {16711#false} assume !(~i~2 < 9999); {16711#false} is VALID [2018-11-14 17:07:37,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 17:07:37,434 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 17:07:37,434 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 17:07:37,434 INFO L273 TraceCheckUtils]: 152: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,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 17:07:37,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 17:07:37,434 INFO L273 TraceCheckUtils]: 155: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,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 17:07:37,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 17:07:37,434 INFO L273 TraceCheckUtils]: 158: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,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 17:07:37,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 17:07:37,435 INFO L273 TraceCheckUtils]: 161: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,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 17:07:37,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 17:07:37,435 INFO L273 TraceCheckUtils]: 164: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,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 17:07:37,435 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 17:07:37,435 INFO L273 TraceCheckUtils]: 167: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,435 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 17:07:37,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 17:07:37,436 INFO L273 TraceCheckUtils]: 170: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,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 17:07:37,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 17:07:37,436 INFO L273 TraceCheckUtils]: 173: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,436 INFO L273 TraceCheckUtils]: 174: Hoare triple {16710#true} assume !(~i~0 < 10000); {16710#true} is VALID [2018-11-14 17:07:37,436 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 17:07:37,436 INFO L273 TraceCheckUtils]: 176: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,436 INFO L268 TraceCheckUtils]: 177: Hoare quadruple {16710#true} {16711#false} #77#return; {16711#false} is VALID [2018-11-14 17:07:37,436 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 17:07:37,437 INFO L273 TraceCheckUtils]: 179: Hoare triple {16711#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16711#false} is VALID [2018-11-14 17:07:37,437 INFO L273 TraceCheckUtils]: 180: Hoare triple {16711#false} assume !false; {16711#false} is VALID [2018-11-14 17:07:37,451 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 17:07:37,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:37,451 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 17:07:37,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:07:37,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-14 17:07:37,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:37,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:37,883 INFO L256 TraceCheckUtils]: 0: Hoare triple {16710#true} call ULTIMATE.init(); {16710#true} is VALID [2018-11-14 17:07:37,884 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 17:07:37,884 INFO L273 TraceCheckUtils]: 2: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,884 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16710#true} {16710#true} #69#return; {16710#true} is VALID [2018-11-14 17:07:37,884 INFO L256 TraceCheckUtils]: 4: Hoare triple {16710#true} call #t~ret13 := main(); {16710#true} is VALID [2018-11-14 17:07:37,884 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 17:07:37,885 INFO L273 TraceCheckUtils]: 6: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,885 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 17:07:37,885 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 17:07:37,885 INFO L273 TraceCheckUtils]: 9: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,885 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 17:07:37,885 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 17:07:37,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,886 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 17:07:37,886 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 17:07:37,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,886 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 17:07:37,886 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 17:07:37,886 INFO L273 TraceCheckUtils]: 18: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,886 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 17:07:37,886 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 17:07:37,886 INFO L273 TraceCheckUtils]: 21: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,887 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 17:07:37,887 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 17:07:37,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,887 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 17:07:37,887 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 17:07:37,887 INFO L273 TraceCheckUtils]: 27: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,887 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 17:07:37,887 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 17:07:37,887 INFO L273 TraceCheckUtils]: 30: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,887 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 17:07:37,888 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 17:07:37,888 INFO L273 TraceCheckUtils]: 33: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,888 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 17:07:37,888 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 17:07:37,888 INFO L273 TraceCheckUtils]: 36: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,888 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 17:07:37,888 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 17:07:37,888 INFO L273 TraceCheckUtils]: 39: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,888 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 17:07:37,889 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 17:07:37,889 INFO L273 TraceCheckUtils]: 42: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,889 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 17:07:37,889 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 17:07:37,889 INFO L273 TraceCheckUtils]: 45: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,889 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 17:07:37,889 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 17:07:37,889 INFO L273 TraceCheckUtils]: 48: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,889 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 17:07:37,889 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 17:07:37,890 INFO L273 TraceCheckUtils]: 51: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,890 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 17:07:37,890 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 17:07:37,890 INFO L273 TraceCheckUtils]: 54: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,890 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 17:07:37,890 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 17:07:37,890 INFO L273 TraceCheckUtils]: 57: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,890 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 17:07:37,890 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 17:07:37,890 INFO L273 TraceCheckUtils]: 60: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,891 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 17:07:37,891 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 17:07:37,891 INFO L273 TraceCheckUtils]: 63: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,891 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 17:07:37,891 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 17:07:37,891 INFO L273 TraceCheckUtils]: 66: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,891 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 17:07:37,891 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 17:07:37,891 INFO L273 TraceCheckUtils]: 69: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,891 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 17:07:37,892 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 17:07:37,892 INFO L273 TraceCheckUtils]: 72: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,892 INFO L273 TraceCheckUtils]: 73: Hoare triple {16710#true} assume !(~i~1 < 10000); {16710#true} is VALID [2018-11-14 17:07:37,892 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 17:07:37,892 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 17:07:37,892 INFO L273 TraceCheckUtils]: 76: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,892 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 17:07:37,892 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 17:07:37,892 INFO L273 TraceCheckUtils]: 79: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,892 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 17:07:37,893 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 17:07:37,893 INFO L273 TraceCheckUtils]: 82: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,893 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 17:07:37,893 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 17:07:37,893 INFO L273 TraceCheckUtils]: 85: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,893 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 17:07:37,893 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 17:07:37,893 INFO L273 TraceCheckUtils]: 88: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,893 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 17:07:37,894 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 17:07:37,894 INFO L273 TraceCheckUtils]: 91: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,894 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 17:07:37,894 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 17:07:37,894 INFO L273 TraceCheckUtils]: 94: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,894 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 17:07:37,894 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 17:07:37,894 INFO L273 TraceCheckUtils]: 97: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,894 INFO L273 TraceCheckUtils]: 98: Hoare triple {16710#true} assume !(~i~0 < 10000); {16710#true} is VALID [2018-11-14 17:07:37,894 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 17:07:37,895 INFO L273 TraceCheckUtils]: 100: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,895 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16710#true} {16710#true} #73#return; {16710#true} is VALID [2018-11-14 17:07:37,895 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 17:07:37,895 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 17:07:37,895 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 17:07:37,895 INFO L273 TraceCheckUtils]: 105: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,895 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 17:07:37,895 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 17:07:37,895 INFO L273 TraceCheckUtils]: 108: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,896 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 17:07:37,896 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 17:07:37,896 INFO L273 TraceCheckUtils]: 111: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,896 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 17:07:37,896 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 17:07:37,896 INFO L273 TraceCheckUtils]: 114: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,896 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 17:07:37,896 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 17:07:37,896 INFO L273 TraceCheckUtils]: 117: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,896 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 17:07:37,897 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 17:07:37,897 INFO L273 TraceCheckUtils]: 120: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,897 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 17:07:37,897 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 17:07:37,897 INFO L273 TraceCheckUtils]: 123: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,897 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 17:07:37,897 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 17:07:37,897 INFO L273 TraceCheckUtils]: 126: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,897 INFO L273 TraceCheckUtils]: 127: Hoare triple {16710#true} assume !(~i~0 < 10000); {16710#true} is VALID [2018-11-14 17:07:37,897 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 17:07:37,898 INFO L273 TraceCheckUtils]: 129: Hoare triple {16710#true} assume true; {16710#true} is VALID [2018-11-14 17:07:37,898 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {16710#true} {16710#true} #75#return; {16710#true} is VALID [2018-11-14 17:07:37,898 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 17:07:37,899 INFO L273 TraceCheckUtils]: 132: Hoare triple {17131#(<= main_~i~2 0)} assume true; {17131#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:37,899 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 17:07:37,899 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 17:07:37,900 INFO L273 TraceCheckUtils]: 135: Hoare triple {17141#(<= main_~i~2 1)} assume true; {17141#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:37,900 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 17:07:37,900 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 17:07:37,901 INFO L273 TraceCheckUtils]: 138: Hoare triple {17151#(<= main_~i~2 2)} assume true; {17151#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:37,901 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 17:07:37,902 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 17:07:37,903 INFO L273 TraceCheckUtils]: 141: Hoare triple {17161#(<= main_~i~2 3)} assume true; {17161#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:37,903 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 17:07:37,904 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 17:07:37,904 INFO L273 TraceCheckUtils]: 144: Hoare triple {17171#(<= main_~i~2 4)} assume true; {17171#(<= main_~i~2 4)} is VALID [2018-11-14 17:07:37,905 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 17:07:37,906 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 17:07:37,906 INFO L273 TraceCheckUtils]: 147: Hoare triple {17181#(<= main_~i~2 5)} assume true; {17181#(<= main_~i~2 5)} is VALID [2018-11-14 17:07:37,907 INFO L273 TraceCheckUtils]: 148: Hoare triple {17181#(<= main_~i~2 5)} assume !(~i~2 < 9999); {16711#false} is VALID [2018-11-14 17:07:37,907 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 17:07:37,907 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 17:07:37,907 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 17:07:37,907 INFO L273 TraceCheckUtils]: 152: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 17:07:37,908 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 17:07:37,908 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 17:07:37,908 INFO L273 TraceCheckUtils]: 155: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 17:07:37,908 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 17:07:37,908 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 17:07:37,909 INFO L273 TraceCheckUtils]: 158: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 17:07:37,909 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 17:07:37,909 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 17:07:37,909 INFO L273 TraceCheckUtils]: 161: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 17:07:37,909 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 17:07:37,909 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 17:07:37,910 INFO L273 TraceCheckUtils]: 164: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 17:07:37,910 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 17:07:37,910 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 17:07:37,910 INFO L273 TraceCheckUtils]: 167: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 17:07:37,910 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 17:07:37,910 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 17:07:37,910 INFO L273 TraceCheckUtils]: 170: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 17:07:37,910 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 17:07:37,910 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 17:07:37,910 INFO L273 TraceCheckUtils]: 173: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 17:07:37,911 INFO L273 TraceCheckUtils]: 174: Hoare triple {16711#false} assume !(~i~0 < 10000); {16711#false} is VALID [2018-11-14 17:07:37,911 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 17:07:37,911 INFO L273 TraceCheckUtils]: 176: Hoare triple {16711#false} assume true; {16711#false} is VALID [2018-11-14 17:07:37,911 INFO L268 TraceCheckUtils]: 177: Hoare quadruple {16711#false} {16711#false} #77#return; {16711#false} is VALID [2018-11-14 17:07:37,911 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 17:07:37,911 INFO L273 TraceCheckUtils]: 179: Hoare triple {16711#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16711#false} is VALID [2018-11-14 17:07:37,911 INFO L273 TraceCheckUtils]: 180: Hoare triple {16711#false} assume !false; {16711#false} is VALID [2018-11-14 17:07:37,923 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 17:07:37,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:37,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 8] total 31 [2018-11-14 17:07:37,944 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 181 [2018-11-14 17:07:37,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:37,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 17:07:38,062 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 17:07:38,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 17:07:38,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 17:07:38,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2018-11-14 17:07:38,064 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand 31 states. [2018-11-14 17:07:39,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:39,557 INFO L93 Difference]: Finished difference Result 190 states and 199 transitions. [2018-11-14 17:07:39,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 17:07:39,558 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 181 [2018-11-14 17:07:39,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:07:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 145 transitions. [2018-11-14 17:07:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:07:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 145 transitions. [2018-11-14 17:07:39,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 145 transitions. [2018-11-14 17:07:39,690 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 17:07:39,693 INFO L225 Difference]: With dead ends: 190 [2018-11-14 17:07:39,693 INFO L226 Difference]: Without dead ends: 136 [2018-11-14 17:07:39,694 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2018-11-14 17:07:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-14 17:07:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-11-14 17:07:39,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:39,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 134 states. [2018-11-14 17:07:39,746 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 134 states. [2018-11-14 17:07:39,746 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 134 states. [2018-11-14 17:07:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:39,749 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2018-11-14 17:07:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2018-11-14 17:07:39,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:39,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:39,749 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 136 states. [2018-11-14 17:07:39,749 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 136 states. [2018-11-14 17:07:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:39,751 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2018-11-14 17:07:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2018-11-14 17:07:39,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:39,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:39,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:39,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-14 17:07:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2018-11-14 17:07:39,754 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 181 [2018-11-14 17:07:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:39,754 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2018-11-14 17:07:39,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 17:07:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2018-11-14 17:07:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-14 17:07:39,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:39,756 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 17:07:39,756 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:39,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:39,756 INFO L82 PathProgramCache]: Analyzing trace with hash 644913055, now seen corresponding path program 22 times [2018-11-14 17:07:39,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:39,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:39,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:39,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:40,796 INFO L256 TraceCheckUtils]: 0: Hoare triple {17991#true} call ULTIMATE.init(); {17991#true} is VALID [2018-11-14 17:07:40,796 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 17:07:40,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,797 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17991#true} {17991#true} #69#return; {17991#true} is VALID [2018-11-14 17:07:40,797 INFO L256 TraceCheckUtils]: 4: Hoare triple {17991#true} call #t~ret13 := main(); {17991#true} is VALID [2018-11-14 17:07:40,797 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 17:07:40,798 INFO L273 TraceCheckUtils]: 6: Hoare triple {17993#(= main_~i~1 0)} assume true; {17993#(= main_~i~1 0)} is VALID [2018-11-14 17:07:40,798 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 17:07:40,799 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 17:07:40,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {17994#(<= main_~i~1 1)} assume true; {17994#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:40,799 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 17:07:40,800 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 17:07:40,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {17995#(<= main_~i~1 2)} assume true; {17995#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:40,800 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 17:07:40,801 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 17:07:40,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {17996#(<= main_~i~1 3)} assume true; {17996#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:40,802 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 17:07:40,802 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 17:07:40,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {17997#(<= main_~i~1 4)} assume true; {17997#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:40,803 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 17:07:40,804 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 17:07:40,805 INFO L273 TraceCheckUtils]: 21: Hoare triple {17998#(<= main_~i~1 5)} assume true; {17998#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:40,805 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 17:07:40,806 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 17:07:40,806 INFO L273 TraceCheckUtils]: 24: Hoare triple {17999#(<= main_~i~1 6)} assume true; {17999#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:40,807 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 17:07:40,807 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 17:07:40,808 INFO L273 TraceCheckUtils]: 27: Hoare triple {18000#(<= main_~i~1 7)} assume true; {18000#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:40,808 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 17:07:40,809 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 17:07:40,810 INFO L273 TraceCheckUtils]: 30: Hoare triple {18001#(<= main_~i~1 8)} assume true; {18001#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:40,810 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 17:07:40,811 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 17:07:40,811 INFO L273 TraceCheckUtils]: 33: Hoare triple {18002#(<= main_~i~1 9)} assume true; {18002#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:40,812 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 17:07:40,813 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 17:07:40,813 INFO L273 TraceCheckUtils]: 36: Hoare triple {18003#(<= main_~i~1 10)} assume true; {18003#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:40,814 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 17:07:40,814 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 17:07:40,815 INFO L273 TraceCheckUtils]: 39: Hoare triple {18004#(<= main_~i~1 11)} assume true; {18004#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:40,815 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 17:07:40,816 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 17:07:40,817 INFO L273 TraceCheckUtils]: 42: Hoare triple {18005#(<= main_~i~1 12)} assume true; {18005#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:40,817 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 17:07:40,818 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 17:07:40,818 INFO L273 TraceCheckUtils]: 45: Hoare triple {18006#(<= main_~i~1 13)} assume true; {18006#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:40,819 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 17:07:40,820 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 17:07:40,820 INFO L273 TraceCheckUtils]: 48: Hoare triple {18007#(<= main_~i~1 14)} assume true; {18007#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:40,821 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 17:07:40,821 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 17:07:40,822 INFO L273 TraceCheckUtils]: 51: Hoare triple {18008#(<= main_~i~1 15)} assume true; {18008#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:40,822 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 17:07:40,823 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 17:07:40,823 INFO L273 TraceCheckUtils]: 54: Hoare triple {18009#(<= main_~i~1 16)} assume true; {18009#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:40,824 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 17:07:40,825 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 17:07:40,825 INFO L273 TraceCheckUtils]: 57: Hoare triple {18010#(<= main_~i~1 17)} assume true; {18010#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:40,826 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 17:07:40,826 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 17:07:40,827 INFO L273 TraceCheckUtils]: 60: Hoare triple {18011#(<= main_~i~1 18)} assume true; {18011#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:40,827 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 17:07:40,828 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 17:07:40,829 INFO L273 TraceCheckUtils]: 63: Hoare triple {18012#(<= main_~i~1 19)} assume true; {18012#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:40,829 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 17:07:40,830 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 17:07:40,830 INFO L273 TraceCheckUtils]: 66: Hoare triple {18013#(<= main_~i~1 20)} assume true; {18013#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:40,831 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 17:07:40,831 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 17:07:40,832 INFO L273 TraceCheckUtils]: 69: Hoare triple {18014#(<= main_~i~1 21)} assume true; {18014#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:40,833 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 17:07:40,833 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 17:07:40,834 INFO L273 TraceCheckUtils]: 72: Hoare triple {18015#(<= main_~i~1 22)} assume true; {18015#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:40,834 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 17:07:40,835 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 17:07:40,835 INFO L273 TraceCheckUtils]: 75: Hoare triple {18016#(<= main_~i~1 23)} assume true; {18016#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:40,836 INFO L273 TraceCheckUtils]: 76: Hoare triple {18016#(<= main_~i~1 23)} assume !(~i~1 < 10000); {17992#false} is VALID [2018-11-14 17:07:40,836 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 17:07:40,837 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 17:07:40,837 INFO L273 TraceCheckUtils]: 79: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,837 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 17:07:40,837 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 17:07:40,837 INFO L273 TraceCheckUtils]: 82: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,837 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 17:07:40,838 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 17:07:40,838 INFO L273 TraceCheckUtils]: 85: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,838 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 17:07:40,838 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 17:07:40,838 INFO L273 TraceCheckUtils]: 88: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,838 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 17:07:40,839 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 17:07:40,839 INFO L273 TraceCheckUtils]: 91: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,839 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 17:07:40,839 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 17:07:40,839 INFO L273 TraceCheckUtils]: 94: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,839 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 17:07:40,839 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 17:07:40,839 INFO L273 TraceCheckUtils]: 97: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,840 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 17:07:40,840 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 17:07:40,840 INFO L273 TraceCheckUtils]: 100: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,840 INFO L273 TraceCheckUtils]: 101: Hoare triple {17991#true} assume !(~i~0 < 10000); {17991#true} is VALID [2018-11-14 17:07:40,840 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 17:07:40,840 INFO L273 TraceCheckUtils]: 103: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,840 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {17991#true} {17992#false} #73#return; {17992#false} is VALID [2018-11-14 17:07:40,840 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 17:07:40,840 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 17:07:40,841 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 17:07:40,841 INFO L273 TraceCheckUtils]: 108: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,841 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 17:07:40,841 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 17:07:40,841 INFO L273 TraceCheckUtils]: 111: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,841 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 17:07:40,841 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 17:07:40,841 INFO L273 TraceCheckUtils]: 114: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,841 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 17:07:40,841 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 17:07:40,842 INFO L273 TraceCheckUtils]: 117: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,842 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 17:07:40,842 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 17:07:40,842 INFO L273 TraceCheckUtils]: 120: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,842 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 17:07:40,842 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 17:07:40,842 INFO L273 TraceCheckUtils]: 123: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,842 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 17:07:40,842 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 17:07:40,842 INFO L273 TraceCheckUtils]: 126: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,843 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 17:07:40,843 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 17:07:40,843 INFO L273 TraceCheckUtils]: 129: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,843 INFO L273 TraceCheckUtils]: 130: Hoare triple {17991#true} assume !(~i~0 < 10000); {17991#true} is VALID [2018-11-14 17:07:40,843 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 17:07:40,843 INFO L273 TraceCheckUtils]: 132: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,843 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {17991#true} {17992#false} #75#return; {17992#false} is VALID [2018-11-14 17:07:40,843 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 17:07:40,843 INFO L273 TraceCheckUtils]: 135: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:40,844 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 17:07:40,844 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 17:07:40,844 INFO L273 TraceCheckUtils]: 138: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:40,844 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 17:07:40,844 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 17:07:40,844 INFO L273 TraceCheckUtils]: 141: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:40,844 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 17:07:40,844 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 17:07:40,844 INFO L273 TraceCheckUtils]: 144: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:40,844 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 17:07:40,845 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 17:07:40,845 INFO L273 TraceCheckUtils]: 147: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:40,845 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 17:07:40,845 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 17:07:40,845 INFO L273 TraceCheckUtils]: 150: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:40,845 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 17:07:40,845 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 17:07:40,845 INFO L273 TraceCheckUtils]: 153: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:40,845 INFO L273 TraceCheckUtils]: 154: Hoare triple {17992#false} assume !(~i~2 < 9999); {17992#false} is VALID [2018-11-14 17:07:40,845 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 17:07:40,846 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 17:07:40,846 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 17:07:40,846 INFO L273 TraceCheckUtils]: 158: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,846 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 17:07:40,846 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 17:07:40,846 INFO L273 TraceCheckUtils]: 161: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,846 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 17:07:40,846 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 17:07:40,846 INFO L273 TraceCheckUtils]: 164: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,846 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 17:07:40,847 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 17:07:40,847 INFO L273 TraceCheckUtils]: 167: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,847 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 17:07:40,847 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 17:07:40,847 INFO L273 TraceCheckUtils]: 170: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,847 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 17:07:40,847 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 17:07:40,847 INFO L273 TraceCheckUtils]: 173: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,847 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 17:07:40,847 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 17:07:40,848 INFO L273 TraceCheckUtils]: 176: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,848 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 17:07:40,848 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 17:07:40,848 INFO L273 TraceCheckUtils]: 179: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,848 INFO L273 TraceCheckUtils]: 180: Hoare triple {17991#true} assume !(~i~0 < 10000); {17991#true} is VALID [2018-11-14 17:07:40,848 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 17:07:40,848 INFO L273 TraceCheckUtils]: 182: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:40,848 INFO L268 TraceCheckUtils]: 183: Hoare quadruple {17991#true} {17992#false} #77#return; {17992#false} is VALID [2018-11-14 17:07:40,848 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 17:07:40,848 INFO L273 TraceCheckUtils]: 185: Hoare triple {17992#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17992#false} is VALID [2018-11-14 17:07:40,849 INFO L273 TraceCheckUtils]: 186: Hoare triple {17992#false} assume !false; {17992#false} is VALID [2018-11-14 17:07:40,864 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 17:07:40,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:40,864 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 17:07:40,873 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:07:40,947 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:07:40,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:40,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:41,283 INFO L256 TraceCheckUtils]: 0: Hoare triple {17991#true} call ULTIMATE.init(); {17991#true} is VALID [2018-11-14 17:07:41,283 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 17:07:41,283 INFO L273 TraceCheckUtils]: 2: Hoare triple {17991#true} assume true; {17991#true} is VALID [2018-11-14 17:07:41,283 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17991#true} {17991#true} #69#return; {17991#true} is VALID [2018-11-14 17:07:41,283 INFO L256 TraceCheckUtils]: 4: Hoare triple {17991#true} call #t~ret13 := main(); {17991#true} is VALID [2018-11-14 17:07:41,284 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 17:07:41,285 INFO L273 TraceCheckUtils]: 6: Hoare triple {18035#(<= main_~i~1 0)} assume true; {18035#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:41,285 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 17:07:41,285 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 17:07:41,286 INFO L273 TraceCheckUtils]: 9: Hoare triple {17994#(<= main_~i~1 1)} assume true; {17994#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:41,286 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 17:07:41,286 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 17:07:41,287 INFO L273 TraceCheckUtils]: 12: Hoare triple {17995#(<= main_~i~1 2)} assume true; {17995#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:41,287 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 17:07:41,288 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 17:07:41,288 INFO L273 TraceCheckUtils]: 15: Hoare triple {17996#(<= main_~i~1 3)} assume true; {17996#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:41,289 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 17:07:41,290 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 17:07:41,290 INFO L273 TraceCheckUtils]: 18: Hoare triple {17997#(<= main_~i~1 4)} assume true; {17997#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:41,290 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 17:07:41,291 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 17:07:41,292 INFO L273 TraceCheckUtils]: 21: Hoare triple {17998#(<= main_~i~1 5)} assume true; {17998#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:41,292 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 17:07:41,293 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 17:07:41,293 INFO L273 TraceCheckUtils]: 24: Hoare triple {17999#(<= main_~i~1 6)} assume true; {17999#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:41,294 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 17:07:41,294 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 17:07:41,295 INFO L273 TraceCheckUtils]: 27: Hoare triple {18000#(<= main_~i~1 7)} assume true; {18000#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:41,295 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 17:07:41,296 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 17:07:41,296 INFO L273 TraceCheckUtils]: 30: Hoare triple {18001#(<= main_~i~1 8)} assume true; {18001#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:41,297 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 17:07:41,298 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 17:07:41,298 INFO L273 TraceCheckUtils]: 33: Hoare triple {18002#(<= main_~i~1 9)} assume true; {18002#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:41,299 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 17:07:41,299 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 17:07:41,300 INFO L273 TraceCheckUtils]: 36: Hoare triple {18003#(<= main_~i~1 10)} assume true; {18003#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:41,300 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 17:07:41,301 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 17:07:41,301 INFO L273 TraceCheckUtils]: 39: Hoare triple {18004#(<= main_~i~1 11)} assume true; {18004#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:41,302 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 17:07:41,302 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 17:07:41,303 INFO L273 TraceCheckUtils]: 42: Hoare triple {18005#(<= main_~i~1 12)} assume true; {18005#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:41,303 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 17:07:41,304 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 17:07:41,304 INFO L273 TraceCheckUtils]: 45: Hoare triple {18006#(<= main_~i~1 13)} assume true; {18006#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:41,305 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 17:07:41,306 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 17:07:41,306 INFO L273 TraceCheckUtils]: 48: Hoare triple {18007#(<= main_~i~1 14)} assume true; {18007#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:41,307 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 17:07:41,307 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 17:07:41,308 INFO L273 TraceCheckUtils]: 51: Hoare triple {18008#(<= main_~i~1 15)} assume true; {18008#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:41,308 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 17:07:41,309 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 17:07:41,309 INFO L273 TraceCheckUtils]: 54: Hoare triple {18009#(<= main_~i~1 16)} assume true; {18009#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:41,310 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 17:07:41,310 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 17:07:41,311 INFO L273 TraceCheckUtils]: 57: Hoare triple {18010#(<= main_~i~1 17)} assume true; {18010#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:41,311 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 17:07:41,312 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 17:07:41,313 INFO L273 TraceCheckUtils]: 60: Hoare triple {18011#(<= main_~i~1 18)} assume true; {18011#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:41,313 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 17:07:41,314 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 17:07:41,314 INFO L273 TraceCheckUtils]: 63: Hoare triple {18012#(<= main_~i~1 19)} assume true; {18012#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:41,315 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 17:07:41,315 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 17:07:41,316 INFO L273 TraceCheckUtils]: 66: Hoare triple {18013#(<= main_~i~1 20)} assume true; {18013#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:41,316 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 17:07:41,317 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 17:07:41,317 INFO L273 TraceCheckUtils]: 69: Hoare triple {18014#(<= main_~i~1 21)} assume true; {18014#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:41,318 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 17:07:41,319 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 17:07:41,319 INFO L273 TraceCheckUtils]: 72: Hoare triple {18015#(<= main_~i~1 22)} assume true; {18015#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:41,319 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 17:07:41,320 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 17:07:41,321 INFO L273 TraceCheckUtils]: 75: Hoare triple {18016#(<= main_~i~1 23)} assume true; {18016#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:41,321 INFO L273 TraceCheckUtils]: 76: Hoare triple {18016#(<= main_~i~1 23)} assume !(~i~1 < 10000); {17992#false} is VALID [2018-11-14 17:07:41,321 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 17:07:41,322 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 17:07:41,322 INFO L273 TraceCheckUtils]: 79: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,322 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 17:07:41,322 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 17:07:41,322 INFO L273 TraceCheckUtils]: 82: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,322 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 17:07:41,323 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 17:07:41,323 INFO L273 TraceCheckUtils]: 85: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,323 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 17:07:41,323 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 17:07:41,323 INFO L273 TraceCheckUtils]: 88: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,323 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 17:07:41,324 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 17:07:41,324 INFO L273 TraceCheckUtils]: 91: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,324 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 17:07:41,324 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 17:07:41,324 INFO L273 TraceCheckUtils]: 94: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,324 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 17:07:41,324 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 17:07:41,324 INFO L273 TraceCheckUtils]: 97: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,325 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 17:07:41,325 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 17:07:41,325 INFO L273 TraceCheckUtils]: 100: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,325 INFO L273 TraceCheckUtils]: 101: Hoare triple {17992#false} assume !(~i~0 < 10000); {17992#false} is VALID [2018-11-14 17:07:41,325 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 17:07:41,325 INFO L273 TraceCheckUtils]: 103: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,325 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {17992#false} {17992#false} #73#return; {17992#false} is VALID [2018-11-14 17:07:41,325 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 17:07:41,325 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 17:07:41,325 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 17:07:41,326 INFO L273 TraceCheckUtils]: 108: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,326 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 17:07:41,326 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 17:07:41,326 INFO L273 TraceCheckUtils]: 111: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,326 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 17:07:41,326 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 17:07:41,326 INFO L273 TraceCheckUtils]: 114: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,326 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 17:07:41,326 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 17:07:41,327 INFO L273 TraceCheckUtils]: 117: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,327 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 17:07:41,327 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 17:07:41,327 INFO L273 TraceCheckUtils]: 120: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,327 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 17:07:41,327 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 17:07:41,327 INFO L273 TraceCheckUtils]: 123: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,327 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 17:07:41,327 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 17:07:41,327 INFO L273 TraceCheckUtils]: 126: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,328 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 17:07:41,328 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 17:07:41,328 INFO L273 TraceCheckUtils]: 129: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,328 INFO L273 TraceCheckUtils]: 130: Hoare triple {17992#false} assume !(~i~0 < 10000); {17992#false} is VALID [2018-11-14 17:07:41,328 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 17:07:41,328 INFO L273 TraceCheckUtils]: 132: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,328 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {17992#false} {17992#false} #75#return; {17992#false} is VALID [2018-11-14 17:07:41,328 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 17:07:41,328 INFO L273 TraceCheckUtils]: 135: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,328 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 17:07:41,329 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 17:07:41,329 INFO L273 TraceCheckUtils]: 138: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,329 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 17:07:41,329 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 17:07:41,329 INFO L273 TraceCheckUtils]: 141: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,329 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 17:07:41,329 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 17:07:41,329 INFO L273 TraceCheckUtils]: 144: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,329 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 17:07:41,329 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 17:07:41,330 INFO L273 TraceCheckUtils]: 147: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,330 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 17:07:41,330 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 17:07:41,330 INFO L273 TraceCheckUtils]: 150: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,330 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 17:07:41,330 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 17:07:41,330 INFO L273 TraceCheckUtils]: 153: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,330 INFO L273 TraceCheckUtils]: 154: Hoare triple {17992#false} assume !(~i~2 < 9999); {17992#false} is VALID [2018-11-14 17:07:41,330 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 17:07:41,331 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 17:07:41,331 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 17:07:41,331 INFO L273 TraceCheckUtils]: 158: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,331 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 17:07:41,331 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 17:07:41,331 INFO L273 TraceCheckUtils]: 161: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,331 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 17:07:41,331 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 17:07:41,331 INFO L273 TraceCheckUtils]: 164: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,331 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 17:07:41,332 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 17:07:41,332 INFO L273 TraceCheckUtils]: 167: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,332 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 17:07:41,332 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 17:07:41,332 INFO L273 TraceCheckUtils]: 170: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,332 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 17:07:41,332 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 17:07:41,332 INFO L273 TraceCheckUtils]: 173: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,332 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 17:07:41,332 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 17:07:41,333 INFO L273 TraceCheckUtils]: 176: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,333 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 17:07:41,333 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 17:07:41,333 INFO L273 TraceCheckUtils]: 179: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,333 INFO L273 TraceCheckUtils]: 180: Hoare triple {17992#false} assume !(~i~0 < 10000); {17992#false} is VALID [2018-11-14 17:07:41,333 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 17:07:41,333 INFO L273 TraceCheckUtils]: 182: Hoare triple {17992#false} assume true; {17992#false} is VALID [2018-11-14 17:07:41,333 INFO L268 TraceCheckUtils]: 183: Hoare quadruple {17992#false} {17992#false} #77#return; {17992#false} is VALID [2018-11-14 17:07:41,333 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 17:07:41,333 INFO L273 TraceCheckUtils]: 185: Hoare triple {17992#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17992#false} is VALID [2018-11-14 17:07:41,334 INFO L273 TraceCheckUtils]: 186: Hoare triple {17992#false} assume !false; {17992#false} is VALID [2018-11-14 17:07:41,350 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 17:07:41,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:41,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-14 17:07:41,370 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 187 [2018-11-14 17:07:41,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:41,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 17:07:41,472 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 17:07:41,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 17:07:41,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 17:07:41,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:07:41,473 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand 27 states. [2018-11-14 17:07:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:43,122 INFO L93 Difference]: Finished difference Result 195 states and 203 transitions. [2018-11-14 17:07:43,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 17:07:43,122 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 187 [2018-11-14 17:07:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:07:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 129 transitions. [2018-11-14 17:07:43,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:07:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 129 transitions. [2018-11-14 17:07:43,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 129 transitions. [2018-11-14 17:07:43,240 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 17:07:43,243 INFO L225 Difference]: With dead ends: 195 [2018-11-14 17:07:43,243 INFO L226 Difference]: Without dead ends: 138 [2018-11-14 17:07:43,244 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 17:07:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-14 17:07:43,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-11-14 17:07:43,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:43,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 137 states. [2018-11-14 17:07:43,291 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 137 states. [2018-11-14 17:07:43,291 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 137 states. [2018-11-14 17:07:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:43,293 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-11-14 17:07:43,293 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2018-11-14 17:07:43,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:43,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:43,294 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 138 states. [2018-11-14 17:07:43,294 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 138 states. [2018-11-14 17:07:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:43,296 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-11-14 17:07:43,297 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2018-11-14 17:07:43,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:43,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:43,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:43,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:43,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-14 17:07:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-11-14 17:07:43,300 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 187 [2018-11-14 17:07:43,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:43,300 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-11-14 17:07:43,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 17:07:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-14 17:07:43,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-14 17:07:43,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:43,302 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 17:07:43,302 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:43,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:43,302 INFO L82 PathProgramCache]: Analyzing trace with hash 650102501, now seen corresponding path program 23 times [2018-11-14 17:07:43,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:43,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:43,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:43,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:43,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:44,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {19301#true} call ULTIMATE.init(); {19301#true} is VALID [2018-11-14 17:07:44,308 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 17:07:44,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,308 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19301#true} {19301#true} #69#return; {19301#true} is VALID [2018-11-14 17:07:44,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {19301#true} call #t~ret13 := main(); {19301#true} is VALID [2018-11-14 17:07:44,309 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 17:07:44,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {19303#(= main_~i~1 0)} assume true; {19303#(= main_~i~1 0)} is VALID [2018-11-14 17:07:44,310 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 17:07:44,310 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 17:07:44,311 INFO L273 TraceCheckUtils]: 9: Hoare triple {19304#(<= main_~i~1 1)} assume true; {19304#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:44,311 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 17:07:44,311 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 17:07:44,312 INFO L273 TraceCheckUtils]: 12: Hoare triple {19305#(<= main_~i~1 2)} assume true; {19305#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:44,312 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 17:07:44,313 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 17:07:44,313 INFO L273 TraceCheckUtils]: 15: Hoare triple {19306#(<= main_~i~1 3)} assume true; {19306#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:44,314 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 17:07:44,315 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 17:07:44,315 INFO L273 TraceCheckUtils]: 18: Hoare triple {19307#(<= main_~i~1 4)} assume true; {19307#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:44,316 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 17:07:44,316 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 17:07:44,317 INFO L273 TraceCheckUtils]: 21: Hoare triple {19308#(<= main_~i~1 5)} assume true; {19308#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:44,317 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 17:07:44,318 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 17:07:44,319 INFO L273 TraceCheckUtils]: 24: Hoare triple {19309#(<= main_~i~1 6)} assume true; {19309#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:44,319 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 17:07:44,320 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 17:07:44,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {19310#(<= main_~i~1 7)} assume true; {19310#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:44,321 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 17:07:44,322 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 17:07:44,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {19311#(<= main_~i~1 8)} assume true; {19311#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:44,323 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 17:07:44,323 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 17:07:44,324 INFO L273 TraceCheckUtils]: 33: Hoare triple {19312#(<= main_~i~1 9)} assume true; {19312#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:44,324 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 17:07:44,325 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 17:07:44,325 INFO L273 TraceCheckUtils]: 36: Hoare triple {19313#(<= main_~i~1 10)} assume true; {19313#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:44,326 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 17:07:44,327 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 17:07:44,327 INFO L273 TraceCheckUtils]: 39: Hoare triple {19314#(<= main_~i~1 11)} assume true; {19314#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:44,328 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 17:07:44,328 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 17:07:44,329 INFO L273 TraceCheckUtils]: 42: Hoare triple {19315#(<= main_~i~1 12)} assume true; {19315#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:44,329 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 17:07:44,330 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 17:07:44,331 INFO L273 TraceCheckUtils]: 45: Hoare triple {19316#(<= main_~i~1 13)} assume true; {19316#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:44,331 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 17:07:44,332 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 17:07:44,332 INFO L273 TraceCheckUtils]: 48: Hoare triple {19317#(<= main_~i~1 14)} assume true; {19317#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:44,333 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 17:07:44,334 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 17:07:44,334 INFO L273 TraceCheckUtils]: 51: Hoare triple {19318#(<= main_~i~1 15)} assume true; {19318#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:44,335 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 17:07:44,335 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 17:07:44,336 INFO L273 TraceCheckUtils]: 54: Hoare triple {19319#(<= main_~i~1 16)} assume true; {19319#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:44,336 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 17:07:44,337 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 17:07:44,337 INFO L273 TraceCheckUtils]: 57: Hoare triple {19320#(<= main_~i~1 17)} assume true; {19320#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:44,338 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 17:07:44,339 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 17:07:44,339 INFO L273 TraceCheckUtils]: 60: Hoare triple {19321#(<= main_~i~1 18)} assume true; {19321#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:44,340 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 17:07:44,340 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 17:07:44,341 INFO L273 TraceCheckUtils]: 63: Hoare triple {19322#(<= main_~i~1 19)} assume true; {19322#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:44,341 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 17:07:44,342 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 17:07:44,343 INFO L273 TraceCheckUtils]: 66: Hoare triple {19323#(<= main_~i~1 20)} assume true; {19323#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:44,343 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 17:07:44,344 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 17:07:44,344 INFO L273 TraceCheckUtils]: 69: Hoare triple {19324#(<= main_~i~1 21)} assume true; {19324#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:44,345 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 17:07:44,346 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 17:07:44,346 INFO L273 TraceCheckUtils]: 72: Hoare triple {19325#(<= main_~i~1 22)} assume true; {19325#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:44,347 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 17:07:44,347 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 17:07:44,348 INFO L273 TraceCheckUtils]: 75: Hoare triple {19326#(<= main_~i~1 23)} assume true; {19326#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:44,348 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 17:07:44,349 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 17:07:44,350 INFO L273 TraceCheckUtils]: 78: Hoare triple {19327#(<= main_~i~1 24)} assume true; {19327#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:44,350 INFO L273 TraceCheckUtils]: 79: Hoare triple {19327#(<= main_~i~1 24)} assume !(~i~1 < 10000); {19302#false} is VALID [2018-11-14 17:07:44,350 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 17:07:44,351 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 17:07:44,351 INFO L273 TraceCheckUtils]: 82: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,351 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 17:07:44,351 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 17:07:44,351 INFO L273 TraceCheckUtils]: 85: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,352 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 17:07:44,352 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 17:07:44,352 INFO L273 TraceCheckUtils]: 88: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,352 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 17:07:44,352 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 17:07:44,352 INFO L273 TraceCheckUtils]: 91: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,353 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 17:07:44,353 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 17:07:44,353 INFO L273 TraceCheckUtils]: 94: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,353 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 17:07:44,353 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 17:07:44,354 INFO L273 TraceCheckUtils]: 97: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,354 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 17:07:44,354 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 17:07:44,354 INFO L273 TraceCheckUtils]: 100: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,354 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 17:07:44,354 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 17:07:44,355 INFO L273 TraceCheckUtils]: 103: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,355 INFO L273 TraceCheckUtils]: 104: Hoare triple {19301#true} assume !(~i~0 < 10000); {19301#true} is VALID [2018-11-14 17:07:44,355 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 17:07:44,355 INFO L273 TraceCheckUtils]: 106: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,355 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {19301#true} {19302#false} #73#return; {19302#false} is VALID [2018-11-14 17:07:44,356 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 17:07:44,356 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 17:07:44,356 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 17:07:44,356 INFO L273 TraceCheckUtils]: 111: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,356 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 17:07:44,356 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 17:07:44,356 INFO L273 TraceCheckUtils]: 114: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,357 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 17:07:44,357 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 17:07:44,357 INFO L273 TraceCheckUtils]: 117: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,357 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 17:07:44,357 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 17:07:44,357 INFO L273 TraceCheckUtils]: 120: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,358 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 17:07:44,358 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 17:07:44,358 INFO L273 TraceCheckUtils]: 123: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,358 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 17:07:44,358 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 17:07:44,358 INFO L273 TraceCheckUtils]: 126: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,359 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 17:07:44,359 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 17:07:44,359 INFO L273 TraceCheckUtils]: 129: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,359 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 17:07:44,359 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 17:07:44,359 INFO L273 TraceCheckUtils]: 132: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,360 INFO L273 TraceCheckUtils]: 133: Hoare triple {19301#true} assume !(~i~0 < 10000); {19301#true} is VALID [2018-11-14 17:07:44,360 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 17:07:44,360 INFO L273 TraceCheckUtils]: 135: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,360 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {19301#true} {19302#false} #75#return; {19302#false} is VALID [2018-11-14 17:07:44,360 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 17:07:44,360 INFO L273 TraceCheckUtils]: 138: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:44,360 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 17:07:44,361 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 17:07:44,361 INFO L273 TraceCheckUtils]: 141: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:44,361 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 17:07:44,361 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 17:07:44,361 INFO L273 TraceCheckUtils]: 144: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:44,361 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 17:07:44,362 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 17:07:44,362 INFO L273 TraceCheckUtils]: 147: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:44,362 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 17:07:44,362 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 17:07:44,362 INFO L273 TraceCheckUtils]: 150: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:44,362 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 17:07:44,363 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 17:07:44,363 INFO L273 TraceCheckUtils]: 153: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:44,363 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 17:07:44,363 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 17:07:44,363 INFO L273 TraceCheckUtils]: 156: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:44,363 INFO L273 TraceCheckUtils]: 157: Hoare triple {19302#false} assume !(~i~2 < 9999); {19302#false} is VALID [2018-11-14 17:07:44,364 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 17:07:44,364 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 17:07:44,364 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 17:07:44,364 INFO L273 TraceCheckUtils]: 161: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,364 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 17:07:44,364 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 17:07:44,365 INFO L273 TraceCheckUtils]: 164: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,365 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 17:07:44,365 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 17:07:44,365 INFO L273 TraceCheckUtils]: 167: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,365 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 17:07:44,365 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 17:07:44,366 INFO L273 TraceCheckUtils]: 170: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,366 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 17:07:44,366 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 17:07:44,366 INFO L273 TraceCheckUtils]: 173: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,366 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 17:07:44,366 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 17:07:44,367 INFO L273 TraceCheckUtils]: 176: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,367 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 17:07:44,367 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 17:07:44,367 INFO L273 TraceCheckUtils]: 179: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,367 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 17:07:44,367 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 17:07:44,367 INFO L273 TraceCheckUtils]: 182: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,368 INFO L273 TraceCheckUtils]: 183: Hoare triple {19301#true} assume !(~i~0 < 10000); {19301#true} is VALID [2018-11-14 17:07:44,368 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 17:07:44,368 INFO L273 TraceCheckUtils]: 185: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:44,368 INFO L268 TraceCheckUtils]: 186: Hoare quadruple {19301#true} {19302#false} #77#return; {19302#false} is VALID [2018-11-14 17:07:44,368 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 17:07:44,368 INFO L273 TraceCheckUtils]: 188: Hoare triple {19302#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19302#false} is VALID [2018-11-14 17:07:44,369 INFO L273 TraceCheckUtils]: 189: Hoare triple {19302#false} assume !false; {19302#false} is VALID [2018-11-14 17:07:44,390 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 17:07:44,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:44,391 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 17:07:44,407 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:07:53,239 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-14 17:07:53,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:53,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:53,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {19301#true} call ULTIMATE.init(); {19301#true} is VALID [2018-11-14 17:07:53,567 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 17:07:53,567 INFO L273 TraceCheckUtils]: 2: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,568 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19301#true} {19301#true} #69#return; {19301#true} is VALID [2018-11-14 17:07:53,568 INFO L256 TraceCheckUtils]: 4: Hoare triple {19301#true} call #t~ret13 := main(); {19301#true} is VALID [2018-11-14 17:07:53,568 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 17:07:53,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,568 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 17:07:53,568 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 17:07:53,568 INFO L273 TraceCheckUtils]: 9: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,569 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 17:07:53,569 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 17:07:53,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,569 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 17:07:53,569 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 17:07:53,569 INFO L273 TraceCheckUtils]: 15: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,569 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 17:07:53,569 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 17:07:53,569 INFO L273 TraceCheckUtils]: 18: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,570 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 17:07:53,570 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 17:07:53,570 INFO L273 TraceCheckUtils]: 21: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,570 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 17:07:53,570 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 17:07:53,570 INFO L273 TraceCheckUtils]: 24: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,570 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 17:07:53,570 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 17:07:53,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,570 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 17:07:53,571 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 17:07:53,571 INFO L273 TraceCheckUtils]: 30: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,571 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 17:07:53,571 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 17:07:53,571 INFO L273 TraceCheckUtils]: 33: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,571 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 17:07:53,571 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 17:07:53,571 INFO L273 TraceCheckUtils]: 36: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,571 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 17:07:53,571 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 17:07:53,572 INFO L273 TraceCheckUtils]: 39: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,572 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 17:07:53,572 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 17:07:53,572 INFO L273 TraceCheckUtils]: 42: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,572 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 17:07:53,572 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 17:07:53,573 INFO L273 TraceCheckUtils]: 45: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,573 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 17:07:53,573 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 17:07:53,573 INFO L273 TraceCheckUtils]: 48: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,573 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 17:07:53,573 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 17:07:53,573 INFO L273 TraceCheckUtils]: 51: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,573 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 17:07:53,573 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 17:07:53,574 INFO L273 TraceCheckUtils]: 54: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,574 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 17:07:53,574 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 17:07:53,574 INFO L273 TraceCheckUtils]: 57: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,574 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 17:07:53,574 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 17:07:53,574 INFO L273 TraceCheckUtils]: 60: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,574 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 17:07:53,574 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 17:07:53,574 INFO L273 TraceCheckUtils]: 63: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,575 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 17:07:53,575 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 17:07:53,575 INFO L273 TraceCheckUtils]: 66: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,575 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 17:07:53,575 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 17:07:53,575 INFO L273 TraceCheckUtils]: 69: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,575 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 17:07:53,575 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 17:07:53,575 INFO L273 TraceCheckUtils]: 72: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,575 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 17:07:53,576 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 17:07:53,576 INFO L273 TraceCheckUtils]: 75: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,576 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 17:07:53,576 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 17:07:53,576 INFO L273 TraceCheckUtils]: 78: Hoare triple {19301#true} assume true; {19301#true} is VALID [2018-11-14 17:07:53,576 INFO L273 TraceCheckUtils]: 79: Hoare triple {19301#true} assume !(~i~1 < 10000); {19301#true} is VALID [2018-11-14 17:07:53,577 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 17:07:53,578 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 17:07:53,579 INFO L273 TraceCheckUtils]: 82: Hoare triple {19574#(<= bAnd_~i~0 1)} assume true; {19574#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:53,579 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 17:07:53,580 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 17:07:53,580 INFO L273 TraceCheckUtils]: 85: Hoare triple {19584#(<= bAnd_~i~0 2)} assume true; {19584#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:53,580 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 17:07:53,581 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 17:07:53,581 INFO L273 TraceCheckUtils]: 88: Hoare triple {19594#(<= bAnd_~i~0 3)} assume true; {19594#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:53,581 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 17:07:53,582 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 17:07:53,582 INFO L273 TraceCheckUtils]: 91: Hoare triple {19604#(<= bAnd_~i~0 4)} assume true; {19604#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:53,582 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 17:07:53,583 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 17:07:53,584 INFO L273 TraceCheckUtils]: 94: Hoare triple {19614#(<= bAnd_~i~0 5)} assume true; {19614#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:07:53,584 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 17:07:53,585 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 17:07:53,585 INFO L273 TraceCheckUtils]: 97: Hoare triple {19624#(<= bAnd_~i~0 6)} assume true; {19624#(<= bAnd_~i~0 6)} is VALID [2018-11-14 17:07:53,586 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 17:07:53,586 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 17:07:53,587 INFO L273 TraceCheckUtils]: 100: Hoare triple {19634#(<= bAnd_~i~0 7)} assume true; {19634#(<= bAnd_~i~0 7)} is VALID [2018-11-14 17:07:53,588 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 17:07:53,588 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 17:07:53,589 INFO L273 TraceCheckUtils]: 103: Hoare triple {19644#(<= bAnd_~i~0 8)} assume true; {19644#(<= bAnd_~i~0 8)} is VALID [2018-11-14 17:07:53,589 INFO L273 TraceCheckUtils]: 104: Hoare triple {19644#(<= bAnd_~i~0 8)} assume !(~i~0 < 10000); {19302#false} is VALID [2018-11-14 17:07:53,590 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 17:07:53,590 INFO L273 TraceCheckUtils]: 106: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,590 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {19302#false} {19301#true} #73#return; {19302#false} is VALID [2018-11-14 17:07:53,590 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 17:07:53,590 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 17:07:53,591 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 17:07:53,591 INFO L273 TraceCheckUtils]: 111: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,591 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 17:07:53,591 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 17:07:53,591 INFO L273 TraceCheckUtils]: 114: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,591 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 17:07:53,592 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 17:07:53,592 INFO L273 TraceCheckUtils]: 117: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,592 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 17:07:53,592 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 17:07:53,592 INFO L273 TraceCheckUtils]: 120: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,592 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 17:07:53,592 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 17:07:53,593 INFO L273 TraceCheckUtils]: 123: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,593 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 17:07:53,593 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 17:07:53,593 INFO L273 TraceCheckUtils]: 126: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,593 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 17:07:53,593 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 17:07:53,593 INFO L273 TraceCheckUtils]: 129: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,593 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 17:07:53,593 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 17:07:53,593 INFO L273 TraceCheckUtils]: 132: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,594 INFO L273 TraceCheckUtils]: 133: Hoare triple {19302#false} assume !(~i~0 < 10000); {19302#false} is VALID [2018-11-14 17:07:53,594 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 17:07:53,594 INFO L273 TraceCheckUtils]: 135: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,594 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {19302#false} {19302#false} #75#return; {19302#false} is VALID [2018-11-14 17:07:53,594 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 17:07:53,594 INFO L273 TraceCheckUtils]: 138: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,594 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 17:07:53,594 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 17:07:53,594 INFO L273 TraceCheckUtils]: 141: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,594 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 17:07:53,595 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 17:07:53,595 INFO L273 TraceCheckUtils]: 144: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,595 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 17:07:53,595 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 17:07:53,595 INFO L273 TraceCheckUtils]: 147: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,595 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 17:07:53,595 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 17:07:53,595 INFO L273 TraceCheckUtils]: 150: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,595 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 17:07:53,596 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 17:07:53,596 INFO L273 TraceCheckUtils]: 153: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,596 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 17:07:53,596 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 17:07:53,596 INFO L273 TraceCheckUtils]: 156: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,596 INFO L273 TraceCheckUtils]: 157: Hoare triple {19302#false} assume !(~i~2 < 9999); {19302#false} is VALID [2018-11-14 17:07:53,596 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 17:07:53,596 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 17:07:53,596 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 17:07:53,596 INFO L273 TraceCheckUtils]: 161: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,597 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 17:07:53,597 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 17:07:53,597 INFO L273 TraceCheckUtils]: 164: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,597 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 17:07:53,597 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 17:07:53,597 INFO L273 TraceCheckUtils]: 167: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,597 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 17:07:53,597 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 17:07:53,597 INFO L273 TraceCheckUtils]: 170: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,597 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 17:07:53,598 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 17:07:53,598 INFO L273 TraceCheckUtils]: 173: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,598 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 17:07:53,598 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 17:07:53,598 INFO L273 TraceCheckUtils]: 176: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,598 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 17:07:53,598 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 17:07:53,598 INFO L273 TraceCheckUtils]: 179: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,598 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 17:07:53,599 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 17:07:53,599 INFO L273 TraceCheckUtils]: 182: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,599 INFO L273 TraceCheckUtils]: 183: Hoare triple {19302#false} assume !(~i~0 < 10000); {19302#false} is VALID [2018-11-14 17:07:53,599 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 17:07:53,599 INFO L273 TraceCheckUtils]: 185: Hoare triple {19302#false} assume true; {19302#false} is VALID [2018-11-14 17:07:53,599 INFO L268 TraceCheckUtils]: 186: Hoare quadruple {19302#false} {19302#false} #77#return; {19302#false} is VALID [2018-11-14 17:07:53,599 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 17:07:53,599 INFO L273 TraceCheckUtils]: 188: Hoare triple {19302#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19302#false} is VALID [2018-11-14 17:07:53,599 INFO L273 TraceCheckUtils]: 189: Hoare triple {19302#false} assume !false; {19302#false} is VALID [2018-11-14 17:07:53,613 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 17:07:53,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:53,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 10] total 35 [2018-11-14 17:07:53,637 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 190 [2018-11-14 17:07:53,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:53,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-14 17:07:54,008 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 17:07:54,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-14 17:07:54,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-14 17:07:54,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 17:07:54,010 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 35 states. [2018-11-14 17:07:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:55,752 INFO L93 Difference]: Finished difference Result 202 states and 214 transitions. [2018-11-14 17:07:55,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 17:07:55,752 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 190 [2018-11-14 17:07:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:07:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 160 transitions. [2018-11-14 17:07:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:07:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 160 transitions. [2018-11-14 17:07:55,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 160 transitions. [2018-11-14 17:07:55,899 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 17:07:55,903 INFO L225 Difference]: With dead ends: 202 [2018-11-14 17:07:55,903 INFO L226 Difference]: Without dead ends: 145 [2018-11-14 17:07:55,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 17:07:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-14 17:07:55,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-14 17:07:55,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:55,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-14 17:07:55,956 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-14 17:07:55,956 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-14 17:07:55,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:55,959 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-14 17:07:55,959 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-14 17:07:55,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:55,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:55,960 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-14 17:07:55,960 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-14 17:07:55,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:55,962 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-14 17:07:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-14 17:07:55,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:55,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:55,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:55,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-14 17:07:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-11-14 17:07:55,966 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 190 [2018-11-14 17:07:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:55,966 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-11-14 17:07:55,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-14 17:07:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-14 17:07:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-14 17:07:55,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:55,968 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 17:07:55,968 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:55,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash 309486297, now seen corresponding path program 24 times [2018-11-14 17:07:55,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:55,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:55,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:55,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:55,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:57,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {20659#true} call ULTIMATE.init(); {20659#true} is VALID [2018-11-14 17:07:57,054 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 17:07:57,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,055 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20659#true} {20659#true} #69#return; {20659#true} is VALID [2018-11-14 17:07:57,055 INFO L256 TraceCheckUtils]: 4: Hoare triple {20659#true} call #t~ret13 := main(); {20659#true} is VALID [2018-11-14 17:07:57,060 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 17:07:57,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {20661#(= main_~i~1 0)} assume true; {20661#(= main_~i~1 0)} is VALID [2018-11-14 17:07:57,061 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 17:07:57,061 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 17:07:57,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {20662#(<= main_~i~1 1)} assume true; {20662#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:57,062 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 17:07:57,062 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 17:07:57,063 INFO L273 TraceCheckUtils]: 12: Hoare triple {20663#(<= main_~i~1 2)} assume true; {20663#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:57,063 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 17:07:57,064 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 17:07:57,064 INFO L273 TraceCheckUtils]: 15: Hoare triple {20664#(<= main_~i~1 3)} assume true; {20664#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:57,065 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 17:07:57,065 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 17:07:57,066 INFO L273 TraceCheckUtils]: 18: Hoare triple {20665#(<= main_~i~1 4)} assume true; {20665#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:57,067 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 17:07:57,067 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 17:07:57,068 INFO L273 TraceCheckUtils]: 21: Hoare triple {20666#(<= main_~i~1 5)} assume true; {20666#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:57,068 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 17:07:57,069 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 17:07:57,069 INFO L273 TraceCheckUtils]: 24: Hoare triple {20667#(<= main_~i~1 6)} assume true; {20667#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:57,070 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 17:07:57,071 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 17:07:57,071 INFO L273 TraceCheckUtils]: 27: Hoare triple {20668#(<= main_~i~1 7)} assume true; {20668#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:57,072 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 17:07:57,072 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 17:07:57,073 INFO L273 TraceCheckUtils]: 30: Hoare triple {20669#(<= main_~i~1 8)} assume true; {20669#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:57,073 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 17:07:57,074 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 17:07:57,075 INFO L273 TraceCheckUtils]: 33: Hoare triple {20670#(<= main_~i~1 9)} assume true; {20670#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:57,075 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 17:07:57,076 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 17:07:57,076 INFO L273 TraceCheckUtils]: 36: Hoare triple {20671#(<= main_~i~1 10)} assume true; {20671#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:57,077 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 17:07:57,077 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 17:07:57,078 INFO L273 TraceCheckUtils]: 39: Hoare triple {20672#(<= main_~i~1 11)} assume true; {20672#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:57,078 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 17:07:57,079 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 17:07:57,079 INFO L273 TraceCheckUtils]: 42: Hoare triple {20673#(<= main_~i~1 12)} assume true; {20673#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:57,080 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 17:07:57,081 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 17:07:57,081 INFO L273 TraceCheckUtils]: 45: Hoare triple {20674#(<= main_~i~1 13)} assume true; {20674#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:57,082 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 17:07:57,082 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 17:07:57,083 INFO L273 TraceCheckUtils]: 48: Hoare triple {20675#(<= main_~i~1 14)} assume true; {20675#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:57,083 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 17:07:57,084 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 17:07:57,084 INFO L273 TraceCheckUtils]: 51: Hoare triple {20676#(<= main_~i~1 15)} assume true; {20676#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:57,085 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 17:07:57,085 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 17:07:57,086 INFO L273 TraceCheckUtils]: 54: Hoare triple {20677#(<= main_~i~1 16)} assume true; {20677#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:57,086 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 17:07:57,088 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 17:07:57,089 INFO L273 TraceCheckUtils]: 57: Hoare triple {20678#(<= main_~i~1 17)} assume true; {20678#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:57,090 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 17:07:57,091 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 17:07:57,091 INFO L273 TraceCheckUtils]: 60: Hoare triple {20679#(<= main_~i~1 18)} assume true; {20679#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:57,092 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 17:07:57,092 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 17:07:57,093 INFO L273 TraceCheckUtils]: 63: Hoare triple {20680#(<= main_~i~1 19)} assume true; {20680#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:57,093 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 17:07:57,094 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 17:07:57,094 INFO L273 TraceCheckUtils]: 66: Hoare triple {20681#(<= main_~i~1 20)} assume true; {20681#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:57,095 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 17:07:57,095 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 17:07:57,096 INFO L273 TraceCheckUtils]: 69: Hoare triple {20682#(<= main_~i~1 21)} assume true; {20682#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:57,096 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 17:07:57,097 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 17:07:57,097 INFO L273 TraceCheckUtils]: 72: Hoare triple {20683#(<= main_~i~1 22)} assume true; {20683#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:57,098 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 17:07:57,099 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 17:07:57,099 INFO L273 TraceCheckUtils]: 75: Hoare triple {20684#(<= main_~i~1 23)} assume true; {20684#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:57,100 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 17:07:57,100 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 17:07:57,101 INFO L273 TraceCheckUtils]: 78: Hoare triple {20685#(<= main_~i~1 24)} assume true; {20685#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:57,101 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 17:07:57,102 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 17:07:57,103 INFO L273 TraceCheckUtils]: 81: Hoare triple {20686#(<= main_~i~1 25)} assume true; {20686#(<= main_~i~1 25)} is VALID [2018-11-14 17:07:57,103 INFO L273 TraceCheckUtils]: 82: Hoare triple {20686#(<= main_~i~1 25)} assume !(~i~1 < 10000); {20660#false} is VALID [2018-11-14 17:07:57,103 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 17:07:57,104 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 17:07:57,104 INFO L273 TraceCheckUtils]: 85: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,104 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 17:07:57,104 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 17:07:57,104 INFO L273 TraceCheckUtils]: 88: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,105 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 17:07:57,105 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 17:07:57,105 INFO L273 TraceCheckUtils]: 91: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,105 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 17:07:57,105 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 17:07:57,105 INFO L273 TraceCheckUtils]: 94: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,106 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 17:07:57,106 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 17:07:57,106 INFO L273 TraceCheckUtils]: 97: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,106 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 17:07:57,106 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 17:07:57,106 INFO L273 TraceCheckUtils]: 100: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,106 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 17:07:57,106 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 17:07:57,106 INFO L273 TraceCheckUtils]: 103: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,107 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 17:07:57,107 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 17:07:57,107 INFO L273 TraceCheckUtils]: 106: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,107 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 17:07:57,107 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 17:07:57,107 INFO L273 TraceCheckUtils]: 109: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,107 INFO L273 TraceCheckUtils]: 110: Hoare triple {20659#true} assume !(~i~0 < 10000); {20659#true} is VALID [2018-11-14 17:07:57,107 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 17:07:57,107 INFO L273 TraceCheckUtils]: 112: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,107 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {20659#true} {20660#false} #73#return; {20660#false} is VALID [2018-11-14 17:07:57,108 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 17:07:57,108 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 17:07:57,108 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 17:07:57,108 INFO L273 TraceCheckUtils]: 117: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,108 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 17:07:57,108 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 17:07:57,108 INFO L273 TraceCheckUtils]: 120: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,108 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 17:07:57,108 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 17:07:57,109 INFO L273 TraceCheckUtils]: 123: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,109 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 17:07:57,109 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 17:07:57,109 INFO L273 TraceCheckUtils]: 126: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,109 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 17:07:57,109 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 17:07:57,109 INFO L273 TraceCheckUtils]: 129: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,109 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 17:07:57,109 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 17:07:57,109 INFO L273 TraceCheckUtils]: 132: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,110 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 17:07:57,110 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 17:07:57,110 INFO L273 TraceCheckUtils]: 135: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,110 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 17:07:57,110 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 17:07:57,110 INFO L273 TraceCheckUtils]: 138: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,110 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 17:07:57,110 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 17:07:57,110 INFO L273 TraceCheckUtils]: 141: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,110 INFO L273 TraceCheckUtils]: 142: Hoare triple {20659#true} assume !(~i~0 < 10000); {20659#true} is VALID [2018-11-14 17:07:57,111 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 17:07:57,111 INFO L273 TraceCheckUtils]: 144: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,111 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {20659#true} {20660#false} #75#return; {20660#false} is VALID [2018-11-14 17:07:57,111 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 17:07:57,111 INFO L273 TraceCheckUtils]: 147: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:57,111 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 17:07:57,111 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 17:07:57,111 INFO L273 TraceCheckUtils]: 150: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:57,111 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 17:07:57,112 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 17:07:57,112 INFO L273 TraceCheckUtils]: 153: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:57,112 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 17:07:57,112 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 17:07:57,112 INFO L273 TraceCheckUtils]: 156: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:57,112 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 17:07:57,112 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 17:07:57,112 INFO L273 TraceCheckUtils]: 159: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:57,112 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 17:07:57,112 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 17:07:57,113 INFO L273 TraceCheckUtils]: 162: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:57,113 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 17:07:57,113 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 17:07:57,113 INFO L273 TraceCheckUtils]: 165: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:57,113 INFO L273 TraceCheckUtils]: 166: Hoare triple {20660#false} assume !(~i~2 < 9999); {20660#false} is VALID [2018-11-14 17:07:57,113 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 17:07:57,113 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 17:07:57,113 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 17:07:57,113 INFO L273 TraceCheckUtils]: 170: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,113 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 17:07:57,114 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 17:07:57,114 INFO L273 TraceCheckUtils]: 173: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,114 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 17:07:57,114 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 17:07:57,114 INFO L273 TraceCheckUtils]: 176: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,114 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 17:07:57,114 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 17:07:57,114 INFO L273 TraceCheckUtils]: 179: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,114 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 17:07:57,114 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 17:07:57,115 INFO L273 TraceCheckUtils]: 182: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,115 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 17:07:57,115 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 17:07:57,115 INFO L273 TraceCheckUtils]: 185: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,115 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 17:07:57,115 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 17:07:57,115 INFO L273 TraceCheckUtils]: 188: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,115 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 17:07:57,115 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 17:07:57,115 INFO L273 TraceCheckUtils]: 191: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,116 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 17:07:57,116 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 17:07:57,116 INFO L273 TraceCheckUtils]: 194: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,116 INFO L273 TraceCheckUtils]: 195: Hoare triple {20659#true} assume !(~i~0 < 10000); {20659#true} is VALID [2018-11-14 17:07:57,116 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 17:07:57,116 INFO L273 TraceCheckUtils]: 197: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:57,116 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {20659#true} {20660#false} #77#return; {20660#false} is VALID [2018-11-14 17:07:57,116 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 17:07:57,116 INFO L273 TraceCheckUtils]: 200: Hoare triple {20660#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20660#false} is VALID [2018-11-14 17:07:57,116 INFO L273 TraceCheckUtils]: 201: Hoare triple {20660#false} assume !false; {20660#false} is VALID [2018-11-14 17:07:57,135 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 17:07:57,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:57,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 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 17:07:57,144 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:07:58,336 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-14 17:07:58,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:58,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:58,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {20659#true} call ULTIMATE.init(); {20659#true} is VALID [2018-11-14 17:07:58,758 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 17:07:58,758 INFO L273 TraceCheckUtils]: 2: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,758 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20659#true} {20659#true} #69#return; {20659#true} is VALID [2018-11-14 17:07:58,759 INFO L256 TraceCheckUtils]: 4: Hoare triple {20659#true} call #t~ret13 := main(); {20659#true} is VALID [2018-11-14 17:07:58,759 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 17:07:58,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,759 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 17:07:58,759 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 17:07:58,760 INFO L273 TraceCheckUtils]: 9: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,760 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 17:07:58,760 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 17:07:58,760 INFO L273 TraceCheckUtils]: 12: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,760 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 17:07:58,760 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 17:07:58,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,760 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 17:07:58,760 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 17:07:58,761 INFO L273 TraceCheckUtils]: 18: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,761 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 17:07:58,761 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 17:07:58,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,761 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 17:07:58,761 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 17:07:58,761 INFO L273 TraceCheckUtils]: 24: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,761 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 17:07:58,761 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 17:07:58,762 INFO L273 TraceCheckUtils]: 27: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,762 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 17:07:58,762 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 17:07:58,762 INFO L273 TraceCheckUtils]: 30: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,762 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 17:07:58,762 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 17:07:58,762 INFO L273 TraceCheckUtils]: 33: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,762 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 17:07:58,762 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 17:07:58,762 INFO L273 TraceCheckUtils]: 36: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,763 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 17:07:58,763 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 17:07:58,763 INFO L273 TraceCheckUtils]: 39: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,763 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 17:07:58,763 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 17:07:58,763 INFO L273 TraceCheckUtils]: 42: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,763 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 17:07:58,763 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 17:07:58,763 INFO L273 TraceCheckUtils]: 45: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,763 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 17:07:58,764 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 17:07:58,764 INFO L273 TraceCheckUtils]: 48: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,764 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 17:07:58,764 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 17:07:58,764 INFO L273 TraceCheckUtils]: 51: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,764 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 17:07:58,764 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 17:07:58,764 INFO L273 TraceCheckUtils]: 54: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,764 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 17:07:58,764 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 17:07:58,765 INFO L273 TraceCheckUtils]: 57: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,765 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 17:07:58,765 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 17:07:58,765 INFO L273 TraceCheckUtils]: 60: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,765 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 17:07:58,765 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 17:07:58,765 INFO L273 TraceCheckUtils]: 63: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,765 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 17:07:58,765 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 17:07:58,766 INFO L273 TraceCheckUtils]: 66: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,766 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 17:07:58,766 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 17:07:58,766 INFO L273 TraceCheckUtils]: 69: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,766 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 17:07:58,766 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 17:07:58,766 INFO L273 TraceCheckUtils]: 72: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,766 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 17:07:58,766 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 17:07:58,766 INFO L273 TraceCheckUtils]: 75: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,767 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 17:07:58,767 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 17:07:58,767 INFO L273 TraceCheckUtils]: 78: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,767 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 17:07:58,768 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 17:07:58,768 INFO L273 TraceCheckUtils]: 81: Hoare triple {20931#(<= main_~i~1 10000)} assume true; {20931#(<= main_~i~1 10000)} is VALID [2018-11-14 17:07:58,768 INFO L273 TraceCheckUtils]: 82: Hoare triple {20931#(<= main_~i~1 10000)} assume !(~i~1 < 10000); {20659#true} is VALID [2018-11-14 17:07:58,768 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 17:07:58,768 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 17:07:58,768 INFO L273 TraceCheckUtils]: 85: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,769 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 17:07:58,769 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 17:07:58,769 INFO L273 TraceCheckUtils]: 88: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,769 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 17:07:58,769 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 17:07:58,769 INFO L273 TraceCheckUtils]: 91: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,769 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 17:07:58,769 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 17:07:58,769 INFO L273 TraceCheckUtils]: 94: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,769 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 17:07:58,770 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 17:07:58,770 INFO L273 TraceCheckUtils]: 97: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,770 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 17:07:58,770 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 17:07:58,770 INFO L273 TraceCheckUtils]: 100: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,770 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 17:07:58,770 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 17:07:58,770 INFO L273 TraceCheckUtils]: 103: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,770 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 17:07:58,770 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 17:07:58,771 INFO L273 TraceCheckUtils]: 106: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,771 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 17:07:58,771 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 17:07:58,771 INFO L273 TraceCheckUtils]: 109: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,771 INFO L273 TraceCheckUtils]: 110: Hoare triple {20659#true} assume !(~i~0 < 10000); {20659#true} is VALID [2018-11-14 17:07:58,771 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 17:07:58,771 INFO L273 TraceCheckUtils]: 112: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,771 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {20659#true} {20659#true} #73#return; {20659#true} is VALID [2018-11-14 17:07:58,771 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 17:07:58,771 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 17:07:58,772 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 17:07:58,772 INFO L273 TraceCheckUtils]: 117: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,772 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 17:07:58,772 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 17:07:58,772 INFO L273 TraceCheckUtils]: 120: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,772 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 17:07:58,772 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 17:07:58,772 INFO L273 TraceCheckUtils]: 123: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,772 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 17:07:58,772 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 17:07:58,773 INFO L273 TraceCheckUtils]: 126: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,773 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 17:07:58,773 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 17:07:58,773 INFO L273 TraceCheckUtils]: 129: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,773 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 17:07:58,773 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 17:07:58,773 INFO L273 TraceCheckUtils]: 132: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,773 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 17:07:58,773 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 17:07:58,774 INFO L273 TraceCheckUtils]: 135: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,774 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 17:07:58,774 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 17:07:58,774 INFO L273 TraceCheckUtils]: 138: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,774 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 17:07:58,774 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 17:07:58,774 INFO L273 TraceCheckUtils]: 141: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,774 INFO L273 TraceCheckUtils]: 142: Hoare triple {20659#true} assume !(~i~0 < 10000); {20659#true} is VALID [2018-11-14 17:07:58,774 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 17:07:58,774 INFO L273 TraceCheckUtils]: 144: Hoare triple {20659#true} assume true; {20659#true} is VALID [2018-11-14 17:07:58,775 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {20659#true} {20659#true} #75#return; {20659#true} is VALID [2018-11-14 17:07:58,775 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 17:07:58,775 INFO L273 TraceCheckUtils]: 147: Hoare triple {21130#(<= main_~i~2 0)} assume true; {21130#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:58,776 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 17:07:58,776 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 17:07:58,776 INFO L273 TraceCheckUtils]: 150: Hoare triple {21140#(<= main_~i~2 1)} assume true; {21140#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:58,777 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 17:07:58,777 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 17:07:58,777 INFO L273 TraceCheckUtils]: 153: Hoare triple {21150#(<= main_~i~2 2)} assume true; {21150#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:58,778 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 17:07:58,778 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 17:07:58,779 INFO L273 TraceCheckUtils]: 156: Hoare triple {21160#(<= main_~i~2 3)} assume true; {21160#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:58,779 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 17:07:58,780 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 17:07:58,780 INFO L273 TraceCheckUtils]: 159: Hoare triple {21170#(<= main_~i~2 4)} assume true; {21170#(<= main_~i~2 4)} is VALID [2018-11-14 17:07:58,781 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 17:07:58,782 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 17:07:58,782 INFO L273 TraceCheckUtils]: 162: Hoare triple {21180#(<= main_~i~2 5)} assume true; {21180#(<= main_~i~2 5)} is VALID [2018-11-14 17:07:58,783 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 17:07:58,783 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 17:07:58,784 INFO L273 TraceCheckUtils]: 165: Hoare triple {21190#(<= main_~i~2 6)} assume true; {21190#(<= main_~i~2 6)} is VALID [2018-11-14 17:07:58,784 INFO L273 TraceCheckUtils]: 166: Hoare triple {21190#(<= main_~i~2 6)} assume !(~i~2 < 9999); {20660#false} is VALID [2018-11-14 17:07:58,785 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 17:07:58,785 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 17:07:58,785 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 17:07:58,785 INFO L273 TraceCheckUtils]: 170: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:58,785 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 17:07:58,786 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 17:07:58,786 INFO L273 TraceCheckUtils]: 173: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:58,786 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 17:07:58,786 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 17:07:58,786 INFO L273 TraceCheckUtils]: 176: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:58,786 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 17:07:58,787 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 17:07:58,787 INFO L273 TraceCheckUtils]: 179: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:58,787 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 17:07:58,787 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 17:07:58,787 INFO L273 TraceCheckUtils]: 182: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:58,787 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 17:07:58,788 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 17:07:58,788 INFO L273 TraceCheckUtils]: 185: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:58,788 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 17:07:58,788 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 17:07:58,788 INFO L273 TraceCheckUtils]: 188: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:58,788 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 17:07:58,788 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 17:07:58,788 INFO L273 TraceCheckUtils]: 191: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:58,789 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 17:07:58,789 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 17:07:58,789 INFO L273 TraceCheckUtils]: 194: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:58,789 INFO L273 TraceCheckUtils]: 195: Hoare triple {20660#false} assume !(~i~0 < 10000); {20660#false} is VALID [2018-11-14 17:07:58,789 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 17:07:58,789 INFO L273 TraceCheckUtils]: 197: Hoare triple {20660#false} assume true; {20660#false} is VALID [2018-11-14 17:07:58,789 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {20660#false} {20660#false} #77#return; {20660#false} is VALID [2018-11-14 17:07:58,789 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 17:07:58,789 INFO L273 TraceCheckUtils]: 200: Hoare triple {20660#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20660#false} is VALID [2018-11-14 17:07:58,789 INFO L273 TraceCheckUtils]: 201: Hoare triple {20660#false} assume !false; {20660#false} is VALID [2018-11-14 17:07:58,804 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 17:07:58,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:58,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 11] total 37 [2018-11-14 17:07:58,826 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 202 [2018-11-14 17:07:58,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:58,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-14 17:07:58,963 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 17:07:58,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-14 17:07:58,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-14 17:07:58,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=862, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 17:07:58,964 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 37 states. [2018-11-14 17:07:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:59,885 INFO L93 Difference]: Finished difference Result 213 states and 223 transitions. [2018-11-14 17:07:59,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-14 17:07:59,885 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 202 [2018-11-14 17:07:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:07:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 160 transitions. [2018-11-14 17:07:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:07:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 160 transitions. [2018-11-14 17:07:59,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 160 transitions. [2018-11-14 17:08:00,052 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 17:08:00,056 INFO L225 Difference]: With dead ends: 213 [2018-11-14 17:08:00,056 INFO L226 Difference]: Without dead ends: 153 [2018-11-14 17:08:00,057 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=540, Invalid=1352, Unknown=0, NotChecked=0, Total=1892 [2018-11-14 17:08:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-14 17:08:00,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-11-14 17:08:00,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:00,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 152 states. [2018-11-14 17:08:00,103 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 152 states. [2018-11-14 17:08:00,103 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 152 states. [2018-11-14 17:08:00,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:00,107 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-14 17:08:00,108 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-14 17:08:00,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:00,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:00,109 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 153 states. [2018-11-14 17:08:00,109 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 153 states. [2018-11-14 17:08:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:00,111 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-14 17:08:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-14 17:08:00,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:00,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:00,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:00,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-14 17:08:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2018-11-14 17:08:00,115 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 202 [2018-11-14 17:08:00,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:00,115 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2018-11-14 17:08:00,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-14 17:08:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2018-11-14 17:08:00,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-14 17:08:00,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:00,117 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 17:08:00,117 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:00,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2120318193, now seen corresponding path program 25 times [2018-11-14 17:08:00,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:00,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:00,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:00,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:00,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:00,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {22112#true} call ULTIMATE.init(); {22112#true} is VALID [2018-11-14 17:08:00,908 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 17:08:00,908 INFO L273 TraceCheckUtils]: 2: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,908 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22112#true} {22112#true} #69#return; {22112#true} is VALID [2018-11-14 17:08:00,909 INFO L256 TraceCheckUtils]: 4: Hoare triple {22112#true} call #t~ret13 := main(); {22112#true} is VALID [2018-11-14 17:08:00,909 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 17:08:00,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {22114#(= main_~i~1 0)} assume true; {22114#(= main_~i~1 0)} is VALID [2018-11-14 17:08:00,910 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 17:08:00,911 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 17:08:00,911 INFO L273 TraceCheckUtils]: 9: Hoare triple {22115#(<= main_~i~1 1)} assume true; {22115#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:00,912 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 17:08:00,912 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 17:08:00,913 INFO L273 TraceCheckUtils]: 12: Hoare triple {22116#(<= main_~i~1 2)} assume true; {22116#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:00,913 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 17:08:00,914 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 17:08:00,914 INFO L273 TraceCheckUtils]: 15: Hoare triple {22117#(<= main_~i~1 3)} assume true; {22117#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:00,915 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 17:08:00,916 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 17:08:00,916 INFO L273 TraceCheckUtils]: 18: Hoare triple {22118#(<= main_~i~1 4)} assume true; {22118#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:00,917 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 17:08:00,917 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 17:08:00,918 INFO L273 TraceCheckUtils]: 21: Hoare triple {22119#(<= main_~i~1 5)} assume true; {22119#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:00,918 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 17:08:00,919 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 17:08:00,920 INFO L273 TraceCheckUtils]: 24: Hoare triple {22120#(<= main_~i~1 6)} assume true; {22120#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:00,920 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 17:08:00,921 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 17:08:00,921 INFO L273 TraceCheckUtils]: 27: Hoare triple {22121#(<= main_~i~1 7)} assume true; {22121#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:00,922 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 17:08:00,922 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 17:08:00,923 INFO L273 TraceCheckUtils]: 30: Hoare triple {22122#(<= main_~i~1 8)} assume true; {22122#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:00,923 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 17:08:00,924 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 17:08:00,925 INFO L273 TraceCheckUtils]: 33: Hoare triple {22123#(<= main_~i~1 9)} assume true; {22123#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:00,925 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 17:08:00,926 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 17:08:00,926 INFO L273 TraceCheckUtils]: 36: Hoare triple {22124#(<= main_~i~1 10)} assume true; {22124#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:00,927 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 17:08:00,928 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 17:08:00,928 INFO L273 TraceCheckUtils]: 39: Hoare triple {22125#(<= main_~i~1 11)} assume true; {22125#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:00,929 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 17:08:00,929 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 17:08:00,930 INFO L273 TraceCheckUtils]: 42: Hoare triple {22126#(<= main_~i~1 12)} assume true; {22126#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:00,930 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 17:08:00,931 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 17:08:00,932 INFO L273 TraceCheckUtils]: 45: Hoare triple {22127#(<= main_~i~1 13)} assume true; {22127#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:00,932 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 17:08:00,933 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 17:08:00,933 INFO L273 TraceCheckUtils]: 48: Hoare triple {22128#(<= main_~i~1 14)} assume true; {22128#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:00,934 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 17:08:00,935 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 17:08:00,935 INFO L273 TraceCheckUtils]: 51: Hoare triple {22129#(<= main_~i~1 15)} assume true; {22129#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:00,936 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 17:08:00,936 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 17:08:00,937 INFO L273 TraceCheckUtils]: 54: Hoare triple {22130#(<= main_~i~1 16)} assume true; {22130#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:00,937 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 17:08:00,938 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 17:08:00,939 INFO L273 TraceCheckUtils]: 57: Hoare triple {22131#(<= main_~i~1 17)} assume true; {22131#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:00,939 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 17:08:00,940 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 17:08:00,940 INFO L273 TraceCheckUtils]: 60: Hoare triple {22132#(<= main_~i~1 18)} assume true; {22132#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:00,941 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 17:08:00,942 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 17:08:00,942 INFO L273 TraceCheckUtils]: 63: Hoare triple {22133#(<= main_~i~1 19)} assume true; {22133#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:00,943 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 17:08:00,943 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 17:08:00,944 INFO L273 TraceCheckUtils]: 66: Hoare triple {22134#(<= main_~i~1 20)} assume true; {22134#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:00,944 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 17:08:00,945 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 17:08:00,945 INFO L273 TraceCheckUtils]: 69: Hoare triple {22135#(<= main_~i~1 21)} assume true; {22135#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:00,946 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 17:08:00,947 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 17:08:00,947 INFO L273 TraceCheckUtils]: 72: Hoare triple {22136#(<= main_~i~1 22)} assume true; {22136#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:00,948 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 17:08:00,948 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 17:08:00,949 INFO L273 TraceCheckUtils]: 75: Hoare triple {22137#(<= main_~i~1 23)} assume true; {22137#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:00,949 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 17:08:00,950 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 17:08:00,951 INFO L273 TraceCheckUtils]: 78: Hoare triple {22138#(<= main_~i~1 24)} assume true; {22138#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:00,951 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 17:08:00,952 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 17:08:00,952 INFO L273 TraceCheckUtils]: 81: Hoare triple {22139#(<= main_~i~1 25)} assume true; {22139#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:00,953 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 17:08:00,954 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 17:08:00,954 INFO L273 TraceCheckUtils]: 84: Hoare triple {22140#(<= main_~i~1 26)} assume true; {22140#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:00,955 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 17:08:00,955 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 17:08:00,956 INFO L273 TraceCheckUtils]: 87: Hoare triple {22141#(<= main_~i~1 27)} assume true; {22141#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:00,956 INFO L273 TraceCheckUtils]: 88: Hoare triple {22141#(<= main_~i~1 27)} assume !(~i~1 < 10000); {22113#false} is VALID [2018-11-14 17:08:00,957 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 17:08:00,957 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 17:08:00,957 INFO L273 TraceCheckUtils]: 91: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,957 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 17:08:00,957 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 17:08:00,957 INFO L273 TraceCheckUtils]: 94: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,958 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 17:08:00,958 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 17:08:00,958 INFO L273 TraceCheckUtils]: 97: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,958 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 17:08:00,958 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 17:08:00,959 INFO L273 TraceCheckUtils]: 100: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,959 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 17:08:00,959 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 17:08:00,959 INFO L273 TraceCheckUtils]: 103: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,959 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 17:08:00,959 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 17:08:00,960 INFO L273 TraceCheckUtils]: 106: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,960 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 17:08:00,960 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 17:08:00,960 INFO L273 TraceCheckUtils]: 109: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,960 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 17:08:00,960 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 17:08:00,961 INFO L273 TraceCheckUtils]: 112: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,961 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 17:08:00,961 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 17:08:00,961 INFO L273 TraceCheckUtils]: 115: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,961 INFO L273 TraceCheckUtils]: 116: Hoare triple {22112#true} assume !(~i~0 < 10000); {22112#true} is VALID [2018-11-14 17:08:00,961 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 17:08:00,961 INFO L273 TraceCheckUtils]: 118: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,961 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22112#true} {22113#false} #73#return; {22113#false} is VALID [2018-11-14 17:08:00,962 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 17:08:00,962 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 17:08:00,962 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 17:08:00,962 INFO L273 TraceCheckUtils]: 123: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,962 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 17:08:00,962 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 17:08:00,962 INFO L273 TraceCheckUtils]: 126: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,962 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 17:08:00,962 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 17:08:00,963 INFO L273 TraceCheckUtils]: 129: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,963 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 17:08:00,963 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 17:08:00,963 INFO L273 TraceCheckUtils]: 132: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,963 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 17:08:00,963 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 17:08:00,963 INFO L273 TraceCheckUtils]: 135: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,963 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 17:08:00,963 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 17:08:00,963 INFO L273 TraceCheckUtils]: 138: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,964 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 17:08:00,964 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 17:08:00,964 INFO L273 TraceCheckUtils]: 141: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,964 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 17:08:00,964 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 17:08:00,964 INFO L273 TraceCheckUtils]: 144: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,964 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 17:08:00,964 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 17:08:00,964 INFO L273 TraceCheckUtils]: 147: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,965 INFO L273 TraceCheckUtils]: 148: Hoare triple {22112#true} assume !(~i~0 < 10000); {22112#true} is VALID [2018-11-14 17:08:00,965 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 17:08:00,965 INFO L273 TraceCheckUtils]: 150: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,965 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {22112#true} {22113#false} #75#return; {22113#false} is VALID [2018-11-14 17:08:00,965 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 17:08:00,965 INFO L273 TraceCheckUtils]: 153: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:00,965 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 17:08:00,965 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 17:08:00,965 INFO L273 TraceCheckUtils]: 156: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:00,965 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 17:08:00,966 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 17:08:00,966 INFO L273 TraceCheckUtils]: 159: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:00,966 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 17:08:00,966 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 17:08:00,966 INFO L273 TraceCheckUtils]: 162: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:00,966 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 17:08:00,966 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 17:08:00,966 INFO L273 TraceCheckUtils]: 165: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:00,966 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 17:08:00,966 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 17:08:00,967 INFO L273 TraceCheckUtils]: 168: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:00,967 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 17:08:00,967 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 17:08:00,967 INFO L273 TraceCheckUtils]: 171: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:00,967 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 17:08:00,967 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 17:08:00,967 INFO L273 TraceCheckUtils]: 174: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:00,967 INFO L273 TraceCheckUtils]: 175: Hoare triple {22113#false} assume !(~i~2 < 9999); {22113#false} is VALID [2018-11-14 17:08:00,967 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 17:08:00,967 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 17:08:00,968 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 17:08:00,968 INFO L273 TraceCheckUtils]: 179: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,968 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 17:08:00,968 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 17:08:00,968 INFO L273 TraceCheckUtils]: 182: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,968 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 17:08:00,968 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 17:08:00,968 INFO L273 TraceCheckUtils]: 185: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,968 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 17:08:00,968 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 17:08:00,969 INFO L273 TraceCheckUtils]: 188: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,969 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 17:08:00,969 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 17:08:00,969 INFO L273 TraceCheckUtils]: 191: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,969 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 17:08:00,969 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 17:08:00,969 INFO L273 TraceCheckUtils]: 194: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,969 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 17:08:00,969 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 17:08:00,969 INFO L273 TraceCheckUtils]: 197: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,970 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 17:08:00,970 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 17:08:00,970 INFO L273 TraceCheckUtils]: 200: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,970 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 17:08:00,970 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 17:08:00,970 INFO L273 TraceCheckUtils]: 203: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,970 INFO L273 TraceCheckUtils]: 204: Hoare triple {22112#true} assume !(~i~0 < 10000); {22112#true} is VALID [2018-11-14 17:08:00,970 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 17:08:00,970 INFO L273 TraceCheckUtils]: 206: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:00,970 INFO L268 TraceCheckUtils]: 207: Hoare quadruple {22112#true} {22113#false} #77#return; {22113#false} is VALID [2018-11-14 17:08:00,971 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 17:08:00,971 INFO L273 TraceCheckUtils]: 209: Hoare triple {22113#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {22113#false} is VALID [2018-11-14 17:08:00,971 INFO L273 TraceCheckUtils]: 210: Hoare triple {22113#false} assume !false; {22113#false} is VALID [2018-11-14 17:08:00,991 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 17:08:00,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:00,991 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 17:08:01,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:01,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:01,502 INFO L256 TraceCheckUtils]: 0: Hoare triple {22112#true} call ULTIMATE.init(); {22112#true} is VALID [2018-11-14 17:08:01,502 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 17:08:01,502 INFO L273 TraceCheckUtils]: 2: Hoare triple {22112#true} assume true; {22112#true} is VALID [2018-11-14 17:08:01,502 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22112#true} {22112#true} #69#return; {22112#true} is VALID [2018-11-14 17:08:01,503 INFO L256 TraceCheckUtils]: 4: Hoare triple {22112#true} call #t~ret13 := main(); {22112#true} is VALID [2018-11-14 17:08:01,503 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 17:08:01,504 INFO L273 TraceCheckUtils]: 6: Hoare triple {22160#(<= main_~i~1 0)} assume true; {22160#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:01,504 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 17:08:01,505 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 17:08:01,505 INFO L273 TraceCheckUtils]: 9: Hoare triple {22115#(<= main_~i~1 1)} assume true; {22115#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:01,506 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 17:08:01,506 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 17:08:01,507 INFO L273 TraceCheckUtils]: 12: Hoare triple {22116#(<= main_~i~1 2)} assume true; {22116#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:01,507 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 17:08:01,508 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 17:08:01,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {22117#(<= main_~i~1 3)} assume true; {22117#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:01,509 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 17:08:01,518 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 17:08:01,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {22118#(<= main_~i~1 4)} assume true; {22118#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:01,519 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 17:08:01,519 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 17:08:01,520 INFO L273 TraceCheckUtils]: 21: Hoare triple {22119#(<= main_~i~1 5)} assume true; {22119#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:01,520 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 17:08:01,520 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 17:08:01,521 INFO L273 TraceCheckUtils]: 24: Hoare triple {22120#(<= main_~i~1 6)} assume true; {22120#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:01,521 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 17:08:01,521 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 17:08:01,522 INFO L273 TraceCheckUtils]: 27: Hoare triple {22121#(<= main_~i~1 7)} assume true; {22121#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:01,522 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 17:08:01,523 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 17:08:01,523 INFO L273 TraceCheckUtils]: 30: Hoare triple {22122#(<= main_~i~1 8)} assume true; {22122#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:01,524 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 17:08:01,524 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 17:08:01,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {22123#(<= main_~i~1 9)} assume true; {22123#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:01,525 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 17:08:01,526 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 17:08:01,526 INFO L273 TraceCheckUtils]: 36: Hoare triple {22124#(<= main_~i~1 10)} assume true; {22124#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:01,527 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 17:08:01,527 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 17:08:01,528 INFO L273 TraceCheckUtils]: 39: Hoare triple {22125#(<= main_~i~1 11)} assume true; {22125#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:01,528 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 17:08:01,529 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 17:08:01,530 INFO L273 TraceCheckUtils]: 42: Hoare triple {22126#(<= main_~i~1 12)} assume true; {22126#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:01,530 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 17:08:01,531 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 17:08:01,531 INFO L273 TraceCheckUtils]: 45: Hoare triple {22127#(<= main_~i~1 13)} assume true; {22127#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:01,532 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 17:08:01,532 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 17:08:01,533 INFO L273 TraceCheckUtils]: 48: Hoare triple {22128#(<= main_~i~1 14)} assume true; {22128#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:01,533 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 17:08:01,534 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 17:08:01,534 INFO L273 TraceCheckUtils]: 51: Hoare triple {22129#(<= main_~i~1 15)} assume true; {22129#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:01,535 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 17:08:01,536 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 17:08:01,536 INFO L273 TraceCheckUtils]: 54: Hoare triple {22130#(<= main_~i~1 16)} assume true; {22130#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:01,536 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 17:08:01,537 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 17:08:01,538 INFO L273 TraceCheckUtils]: 57: Hoare triple {22131#(<= main_~i~1 17)} assume true; {22131#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:01,538 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 17:08:01,539 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 17:08:01,539 INFO L273 TraceCheckUtils]: 60: Hoare triple {22132#(<= main_~i~1 18)} assume true; {22132#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:01,540 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 17:08:01,540 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 17:08:01,541 INFO L273 TraceCheckUtils]: 63: Hoare triple {22133#(<= main_~i~1 19)} assume true; {22133#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:01,541 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 17:08:01,542 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 17:08:01,542 INFO L273 TraceCheckUtils]: 66: Hoare triple {22134#(<= main_~i~1 20)} assume true; {22134#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:01,543 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 17:08:01,544 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 17:08:01,544 INFO L273 TraceCheckUtils]: 69: Hoare triple {22135#(<= main_~i~1 21)} assume true; {22135#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:01,545 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 17:08:01,545 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 17:08:01,546 INFO L273 TraceCheckUtils]: 72: Hoare triple {22136#(<= main_~i~1 22)} assume true; {22136#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:01,546 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 17:08:01,547 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 17:08:01,547 INFO L273 TraceCheckUtils]: 75: Hoare triple {22137#(<= main_~i~1 23)} assume true; {22137#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:01,548 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 17:08:01,548 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 17:08:01,549 INFO L273 TraceCheckUtils]: 78: Hoare triple {22138#(<= main_~i~1 24)} assume true; {22138#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:01,549 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 17:08:01,550 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 17:08:01,550 INFO L273 TraceCheckUtils]: 81: Hoare triple {22139#(<= main_~i~1 25)} assume true; {22139#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:01,551 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 17:08:01,552 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 17:08:01,552 INFO L273 TraceCheckUtils]: 84: Hoare triple {22140#(<= main_~i~1 26)} assume true; {22140#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:01,553 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 17:08:01,553 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 17:08:01,554 INFO L273 TraceCheckUtils]: 87: Hoare triple {22141#(<= main_~i~1 27)} assume true; {22141#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:01,554 INFO L273 TraceCheckUtils]: 88: Hoare triple {22141#(<= main_~i~1 27)} assume !(~i~1 < 10000); {22113#false} is VALID [2018-11-14 17:08:01,555 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 17:08:01,555 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 17:08:01,555 INFO L273 TraceCheckUtils]: 91: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,555 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 17:08:01,555 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 17:08:01,555 INFO L273 TraceCheckUtils]: 94: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,556 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 17:08:01,556 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 17:08:01,556 INFO L273 TraceCheckUtils]: 97: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,556 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 17:08:01,556 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 17:08:01,556 INFO L273 TraceCheckUtils]: 100: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,556 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 17:08:01,556 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 17:08:01,557 INFO L273 TraceCheckUtils]: 103: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,557 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 17:08:01,557 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 17:08:01,557 INFO L273 TraceCheckUtils]: 106: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,557 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 17:08:01,557 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 17:08:01,557 INFO L273 TraceCheckUtils]: 109: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,557 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 17:08:01,557 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 17:08:01,557 INFO L273 TraceCheckUtils]: 112: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,558 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 17:08:01,558 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 17:08:01,558 INFO L273 TraceCheckUtils]: 115: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,558 INFO L273 TraceCheckUtils]: 116: Hoare triple {22113#false} assume !(~i~0 < 10000); {22113#false} is VALID [2018-11-14 17:08:01,558 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 17:08:01,558 INFO L273 TraceCheckUtils]: 118: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,558 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22113#false} {22113#false} #73#return; {22113#false} is VALID [2018-11-14 17:08:01,558 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 17:08:01,558 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 17:08:01,559 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 17:08:01,559 INFO L273 TraceCheckUtils]: 123: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,559 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 17:08:01,559 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 17:08:01,559 INFO L273 TraceCheckUtils]: 126: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,559 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 17:08:01,559 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 17:08:01,559 INFO L273 TraceCheckUtils]: 129: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,559 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 17:08:01,559 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 17:08:01,560 INFO L273 TraceCheckUtils]: 132: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,560 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 17:08:01,560 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 17:08:01,560 INFO L273 TraceCheckUtils]: 135: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,560 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 17:08:01,560 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 17:08:01,560 INFO L273 TraceCheckUtils]: 138: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,560 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 17:08:01,560 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 17:08:01,560 INFO L273 TraceCheckUtils]: 141: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,561 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 17:08:01,561 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 17:08:01,561 INFO L273 TraceCheckUtils]: 144: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,561 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 17:08:01,561 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 17:08:01,561 INFO L273 TraceCheckUtils]: 147: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,561 INFO L273 TraceCheckUtils]: 148: Hoare triple {22113#false} assume !(~i~0 < 10000); {22113#false} is VALID [2018-11-14 17:08:01,561 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 17:08:01,561 INFO L273 TraceCheckUtils]: 150: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,561 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {22113#false} {22113#false} #75#return; {22113#false} is VALID [2018-11-14 17:08:01,562 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 17:08:01,562 INFO L273 TraceCheckUtils]: 153: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,562 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 17:08:01,562 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 17:08:01,562 INFO L273 TraceCheckUtils]: 156: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,562 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 17:08:01,562 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 17:08:01,562 INFO L273 TraceCheckUtils]: 159: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,562 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 17:08:01,563 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 17:08:01,563 INFO L273 TraceCheckUtils]: 162: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,563 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 17:08:01,563 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 17:08:01,563 INFO L273 TraceCheckUtils]: 165: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,563 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 17:08:01,563 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 17:08:01,563 INFO L273 TraceCheckUtils]: 168: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,563 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 17:08:01,563 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 17:08:01,564 INFO L273 TraceCheckUtils]: 171: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,564 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 17:08:01,564 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 17:08:01,564 INFO L273 TraceCheckUtils]: 174: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,564 INFO L273 TraceCheckUtils]: 175: Hoare triple {22113#false} assume !(~i~2 < 9999); {22113#false} is VALID [2018-11-14 17:08:01,564 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 17:08:01,564 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 17:08:01,564 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 17:08:01,564 INFO L273 TraceCheckUtils]: 179: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,564 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 17:08:01,565 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 17:08:01,565 INFO L273 TraceCheckUtils]: 182: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,565 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 17:08:01,565 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 17:08:01,565 INFO L273 TraceCheckUtils]: 185: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,565 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 17:08:01,565 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 17:08:01,565 INFO L273 TraceCheckUtils]: 188: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,565 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 17:08:01,565 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 17:08:01,566 INFO L273 TraceCheckUtils]: 191: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,566 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 17:08:01,566 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 17:08:01,566 INFO L273 TraceCheckUtils]: 194: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,566 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 17:08:01,566 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 17:08:01,566 INFO L273 TraceCheckUtils]: 197: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,566 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 17:08:01,566 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 17:08:01,566 INFO L273 TraceCheckUtils]: 200: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,567 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 17:08:01,567 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 17:08:01,567 INFO L273 TraceCheckUtils]: 203: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,567 INFO L273 TraceCheckUtils]: 204: Hoare triple {22113#false} assume !(~i~0 < 10000); {22113#false} is VALID [2018-11-14 17:08:01,567 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 17:08:01,567 INFO L273 TraceCheckUtils]: 206: Hoare triple {22113#false} assume true; {22113#false} is VALID [2018-11-14 17:08:01,567 INFO L268 TraceCheckUtils]: 207: Hoare quadruple {22113#false} {22113#false} #77#return; {22113#false} is VALID [2018-11-14 17:08:01,567 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 17:08:01,567 INFO L273 TraceCheckUtils]: 209: Hoare triple {22113#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {22113#false} is VALID [2018-11-14 17:08:01,567 INFO L273 TraceCheckUtils]: 210: Hoare triple {22113#false} assume !false; {22113#false} is VALID [2018-11-14 17:08:01,587 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 17:08:01,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:01,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-14 17:08:01,609 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 211 [2018-11-14 17:08:01,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:01,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 17:08:01,721 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 17:08:01,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 17:08:01,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 17:08:01,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 17:08:01,723 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 31 states. [2018-11-14 17:08:02,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:02,555 INFO L93 Difference]: Finished difference Result 219 states and 227 transitions. [2018-11-14 17:08:02,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 17:08:02,555 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 211 [2018-11-14 17:08:02,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:08:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 141 transitions. [2018-11-14 17:08:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:08:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 141 transitions. [2018-11-14 17:08:02,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 141 transitions. [2018-11-14 17:08:02,684 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 17:08:02,687 INFO L225 Difference]: With dead ends: 219 [2018-11-14 17:08:02,687 INFO L226 Difference]: Without dead ends: 156 [2018-11-14 17:08:02,688 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 17:08:02,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-14 17:08:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-11-14 17:08:02,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:02,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 155 states. [2018-11-14 17:08:02,749 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 155 states. [2018-11-14 17:08:02,749 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 155 states. [2018-11-14 17:08:02,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:02,752 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2018-11-14 17:08:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2018-11-14 17:08:02,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:02,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:02,752 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 156 states. [2018-11-14 17:08:02,752 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 156 states. [2018-11-14 17:08:02,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:02,755 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2018-11-14 17:08:02,755 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2018-11-14 17:08:02,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:02,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:02,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:02,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-14 17:08:02,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2018-11-14 17:08:02,758 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 211 [2018-11-14 17:08:02,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:02,758 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2018-11-14 17:08:02,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 17:08:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2018-11-14 17:08:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-14 17:08:02,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:02,759 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 17:08:02,760 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:02,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:02,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1212530773, now seen corresponding path program 26 times [2018-11-14 17:08:02,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:02,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:02,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:02,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:02,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:04,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {23590#true} call ULTIMATE.init(); {23590#true} is VALID [2018-11-14 17:08:04,323 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 17:08:04,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23590#true} {23590#true} #69#return; {23590#true} is VALID [2018-11-14 17:08:04,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {23590#true} call #t~ret13 := main(); {23590#true} is VALID [2018-11-14 17:08:04,324 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 17:08:04,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {23592#(= main_~i~1 0)} assume true; {23592#(= main_~i~1 0)} is VALID [2018-11-14 17:08:04,325 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 17:08:04,325 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 17:08:04,326 INFO L273 TraceCheckUtils]: 9: Hoare triple {23593#(<= main_~i~1 1)} assume true; {23593#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:04,326 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 17:08:04,326 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 17:08:04,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {23594#(<= main_~i~1 2)} assume true; {23594#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:04,327 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 17:08:04,327 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 17:08:04,328 INFO L273 TraceCheckUtils]: 15: Hoare triple {23595#(<= main_~i~1 3)} assume true; {23595#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:04,328 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 17:08:04,329 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 17:08:04,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {23596#(<= main_~i~1 4)} assume true; {23596#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:04,330 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 17:08:04,331 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 17:08:04,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {23597#(<= main_~i~1 5)} assume true; {23597#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:04,332 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 17:08:04,332 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 17:08:04,333 INFO L273 TraceCheckUtils]: 24: Hoare triple {23598#(<= main_~i~1 6)} assume true; {23598#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:04,333 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 17:08:04,334 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 17:08:04,334 INFO L273 TraceCheckUtils]: 27: Hoare triple {23599#(<= main_~i~1 7)} assume true; {23599#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:04,335 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 17:08:04,336 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 17:08:04,336 INFO L273 TraceCheckUtils]: 30: Hoare triple {23600#(<= main_~i~1 8)} assume true; {23600#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:04,337 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 17:08:04,337 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 17:08:04,338 INFO L273 TraceCheckUtils]: 33: Hoare triple {23601#(<= main_~i~1 9)} assume true; {23601#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:04,338 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 17:08:04,339 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 17:08:04,339 INFO L273 TraceCheckUtils]: 36: Hoare triple {23602#(<= main_~i~1 10)} assume true; {23602#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:04,340 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 17:08:04,340 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 17:08:04,341 INFO L273 TraceCheckUtils]: 39: Hoare triple {23603#(<= main_~i~1 11)} assume true; {23603#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:04,341 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 17:08:04,342 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 17:08:04,342 INFO L273 TraceCheckUtils]: 42: Hoare triple {23604#(<= main_~i~1 12)} assume true; {23604#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:04,343 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 17:08:04,344 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 17:08:04,344 INFO L273 TraceCheckUtils]: 45: Hoare triple {23605#(<= main_~i~1 13)} assume true; {23605#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:04,345 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 17:08:04,345 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 17:08:04,364 INFO L273 TraceCheckUtils]: 48: Hoare triple {23606#(<= main_~i~1 14)} assume true; {23606#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:04,379 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 17:08:04,387 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 17:08:04,397 INFO L273 TraceCheckUtils]: 51: Hoare triple {23607#(<= main_~i~1 15)} assume true; {23607#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:04,397 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 17:08:04,397 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 17:08:04,398 INFO L273 TraceCheckUtils]: 54: Hoare triple {23608#(<= main_~i~1 16)} assume true; {23608#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:04,398 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 17:08:04,398 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 17:08:04,399 INFO L273 TraceCheckUtils]: 57: Hoare triple {23609#(<= main_~i~1 17)} assume true; {23609#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:04,399 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 17:08:04,399 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 17:08:04,400 INFO L273 TraceCheckUtils]: 60: Hoare triple {23610#(<= main_~i~1 18)} assume true; {23610#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:04,400 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 17:08:04,401 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 17:08:04,401 INFO L273 TraceCheckUtils]: 63: Hoare triple {23611#(<= main_~i~1 19)} assume true; {23611#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:04,401 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 17:08:04,402 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 17:08:04,403 INFO L273 TraceCheckUtils]: 66: Hoare triple {23612#(<= main_~i~1 20)} assume true; {23612#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:04,403 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 17:08:04,404 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 17:08:04,404 INFO L273 TraceCheckUtils]: 69: Hoare triple {23613#(<= main_~i~1 21)} assume true; {23613#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:04,405 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 17:08:04,405 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 17:08:04,406 INFO L273 TraceCheckUtils]: 72: Hoare triple {23614#(<= main_~i~1 22)} assume true; {23614#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:04,406 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 17:08:04,407 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 17:08:04,407 INFO L273 TraceCheckUtils]: 75: Hoare triple {23615#(<= main_~i~1 23)} assume true; {23615#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:04,408 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 17:08:04,409 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 17:08:04,409 INFO L273 TraceCheckUtils]: 78: Hoare triple {23616#(<= main_~i~1 24)} assume true; {23616#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:04,409 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 17:08:04,410 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 17:08:04,411 INFO L273 TraceCheckUtils]: 81: Hoare triple {23617#(<= main_~i~1 25)} assume true; {23617#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:04,411 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 17:08:04,412 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 17:08:04,412 INFO L273 TraceCheckUtils]: 84: Hoare triple {23618#(<= main_~i~1 26)} assume true; {23618#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:04,413 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 17:08:04,413 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 17:08:04,414 INFO L273 TraceCheckUtils]: 87: Hoare triple {23619#(<= main_~i~1 27)} assume true; {23619#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:04,414 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 17:08:04,415 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 17:08:04,415 INFO L273 TraceCheckUtils]: 90: Hoare triple {23620#(<= main_~i~1 28)} assume true; {23620#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:04,416 INFO L273 TraceCheckUtils]: 91: Hoare triple {23620#(<= main_~i~1 28)} assume !(~i~1 < 10000); {23591#false} is VALID [2018-11-14 17:08:04,416 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 17:08:04,416 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 17:08:04,417 INFO L273 TraceCheckUtils]: 94: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,417 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 17:08:04,417 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 17:08:04,417 INFO L273 TraceCheckUtils]: 97: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,417 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 17:08:04,417 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 17:08:04,418 INFO L273 TraceCheckUtils]: 100: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,418 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 17:08:04,418 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 17:08:04,418 INFO L273 TraceCheckUtils]: 103: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,418 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 17:08:04,418 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 17:08:04,419 INFO L273 TraceCheckUtils]: 106: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,419 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 17:08:04,419 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 17:08:04,419 INFO L273 TraceCheckUtils]: 109: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,419 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 17:08:04,419 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 17:08:04,419 INFO L273 TraceCheckUtils]: 112: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,419 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 17:08:04,419 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 17:08:04,419 INFO L273 TraceCheckUtils]: 115: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,420 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 17:08:04,420 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 17:08:04,420 INFO L273 TraceCheckUtils]: 118: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,420 INFO L273 TraceCheckUtils]: 119: Hoare triple {23590#true} assume !(~i~0 < 10000); {23590#true} is VALID [2018-11-14 17:08:04,420 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 17:08:04,420 INFO L273 TraceCheckUtils]: 121: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,420 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {23590#true} {23591#false} #73#return; {23591#false} is VALID [2018-11-14 17:08:04,420 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 17:08:04,420 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 17:08:04,420 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 17:08:04,421 INFO L273 TraceCheckUtils]: 126: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,421 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 17:08:04,421 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 17:08:04,421 INFO L273 TraceCheckUtils]: 129: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,421 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 17:08:04,421 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 17:08:04,421 INFO L273 TraceCheckUtils]: 132: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,421 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 17:08:04,421 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 17:08:04,421 INFO L273 TraceCheckUtils]: 135: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,422 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 17:08:04,422 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 17:08:04,422 INFO L273 TraceCheckUtils]: 138: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,422 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 17:08:04,422 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 17:08:04,422 INFO L273 TraceCheckUtils]: 141: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,422 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 17:08:04,422 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 17:08:04,422 INFO L273 TraceCheckUtils]: 144: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,422 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 17:08:04,423 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 17:08:04,423 INFO L273 TraceCheckUtils]: 147: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,423 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 17:08:04,423 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 17:08:04,423 INFO L273 TraceCheckUtils]: 150: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,423 INFO L273 TraceCheckUtils]: 151: Hoare triple {23590#true} assume !(~i~0 < 10000); {23590#true} is VALID [2018-11-14 17:08:04,423 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 17:08:04,423 INFO L273 TraceCheckUtils]: 153: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,423 INFO L268 TraceCheckUtils]: 154: Hoare quadruple {23590#true} {23591#false} #75#return; {23591#false} is VALID [2018-11-14 17:08:04,423 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 17:08:04,424 INFO L273 TraceCheckUtils]: 156: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:04,424 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 17:08:04,424 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 17:08:04,424 INFO L273 TraceCheckUtils]: 159: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:04,424 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 17:08:04,424 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 17:08:04,424 INFO L273 TraceCheckUtils]: 162: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:04,424 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 17:08:04,424 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 17:08:04,425 INFO L273 TraceCheckUtils]: 165: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:04,425 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 17:08:04,425 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 17:08:04,425 INFO L273 TraceCheckUtils]: 168: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:04,425 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 17:08:04,425 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 17:08:04,425 INFO L273 TraceCheckUtils]: 171: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:04,425 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 17:08:04,425 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 17:08:04,425 INFO L273 TraceCheckUtils]: 174: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:04,426 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 17:08:04,426 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 17:08:04,426 INFO L273 TraceCheckUtils]: 177: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:04,426 INFO L273 TraceCheckUtils]: 178: Hoare triple {23591#false} assume !(~i~2 < 9999); {23591#false} is VALID [2018-11-14 17:08:04,426 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 17:08:04,426 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 17:08:04,426 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 17:08:04,426 INFO L273 TraceCheckUtils]: 182: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,426 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 17:08:04,426 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 17:08:04,427 INFO L273 TraceCheckUtils]: 185: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,427 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 17:08:04,427 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 17:08:04,427 INFO L273 TraceCheckUtils]: 188: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,427 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 17:08:04,427 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 17:08:04,427 INFO L273 TraceCheckUtils]: 191: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,427 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 17:08:04,427 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 17:08:04,427 INFO L273 TraceCheckUtils]: 194: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,428 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 17:08:04,428 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 17:08:04,428 INFO L273 TraceCheckUtils]: 197: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,428 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 17:08:04,428 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 17:08:04,428 INFO L273 TraceCheckUtils]: 200: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,428 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 17:08:04,428 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 17:08:04,428 INFO L273 TraceCheckUtils]: 203: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,428 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 17:08:04,429 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 17:08:04,429 INFO L273 TraceCheckUtils]: 206: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,429 INFO L273 TraceCheckUtils]: 207: Hoare triple {23590#true} assume !(~i~0 < 10000); {23590#true} is VALID [2018-11-14 17:08:04,429 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 17:08:04,429 INFO L273 TraceCheckUtils]: 209: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:04,429 INFO L268 TraceCheckUtils]: 210: Hoare quadruple {23590#true} {23591#false} #77#return; {23591#false} is VALID [2018-11-14 17:08:04,429 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 17:08:04,429 INFO L273 TraceCheckUtils]: 212: Hoare triple {23591#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23591#false} is VALID [2018-11-14 17:08:04,429 INFO L273 TraceCheckUtils]: 213: Hoare triple {23591#false} assume !false; {23591#false} is VALID [2018-11-14 17:08:04,450 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 17:08:04,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:04,450 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 17:08:04,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:08:04,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:08:04,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:04,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:05,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {23590#true} call ULTIMATE.init(); {23590#true} is VALID [2018-11-14 17:08:05,043 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 17:08:05,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {23590#true} assume true; {23590#true} is VALID [2018-11-14 17:08:05,044 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23590#true} {23590#true} #69#return; {23590#true} is VALID [2018-11-14 17:08:05,044 INFO L256 TraceCheckUtils]: 4: Hoare triple {23590#true} call #t~ret13 := main(); {23590#true} is VALID [2018-11-14 17:08:05,045 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 17:08:05,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {23639#(<= main_~i~1 0)} assume true; {23639#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:05,046 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 17:08:05,046 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 17:08:05,046 INFO L273 TraceCheckUtils]: 9: Hoare triple {23593#(<= main_~i~1 1)} assume true; {23593#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:05,047 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 17:08:05,047 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 17:08:05,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {23594#(<= main_~i~1 2)} assume true; {23594#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:05,048 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 17:08:05,048 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 17:08:05,049 INFO L273 TraceCheckUtils]: 15: Hoare triple {23595#(<= main_~i~1 3)} assume true; {23595#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:05,049 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 17:08:05,050 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 17:08:05,051 INFO L273 TraceCheckUtils]: 18: Hoare triple {23596#(<= main_~i~1 4)} assume true; {23596#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:05,051 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 17:08:05,052 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 17:08:05,052 INFO L273 TraceCheckUtils]: 21: Hoare triple {23597#(<= main_~i~1 5)} assume true; {23597#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:05,053 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 17:08:05,054 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 17:08:05,054 INFO L273 TraceCheckUtils]: 24: Hoare triple {23598#(<= main_~i~1 6)} assume true; {23598#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:05,055 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 17:08:05,055 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 17:08:05,056 INFO L273 TraceCheckUtils]: 27: Hoare triple {23599#(<= main_~i~1 7)} assume true; {23599#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:05,056 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 17:08:05,057 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 17:08:05,057 INFO L273 TraceCheckUtils]: 30: Hoare triple {23600#(<= main_~i~1 8)} assume true; {23600#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:05,058 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 17:08:05,058 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 17:08:05,059 INFO L273 TraceCheckUtils]: 33: Hoare triple {23601#(<= main_~i~1 9)} assume true; {23601#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:05,059 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 17:08:05,060 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 17:08:05,061 INFO L273 TraceCheckUtils]: 36: Hoare triple {23602#(<= main_~i~1 10)} assume true; {23602#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:05,061 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 17:08:05,062 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 17:08:05,062 INFO L273 TraceCheckUtils]: 39: Hoare triple {23603#(<= main_~i~1 11)} assume true; {23603#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:05,063 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 17:08:05,063 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 17:08:05,064 INFO L273 TraceCheckUtils]: 42: Hoare triple {23604#(<= main_~i~1 12)} assume true; {23604#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:05,064 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 17:08:05,065 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 17:08:05,065 INFO L273 TraceCheckUtils]: 45: Hoare triple {23605#(<= main_~i~1 13)} assume true; {23605#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:05,066 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 17:08:05,067 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 17:08:05,067 INFO L273 TraceCheckUtils]: 48: Hoare triple {23606#(<= main_~i~1 14)} assume true; {23606#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:05,068 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 17:08:05,068 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 17:08:05,069 INFO L273 TraceCheckUtils]: 51: Hoare triple {23607#(<= main_~i~1 15)} assume true; {23607#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:05,069 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 17:08:05,070 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 17:08:05,071 INFO L273 TraceCheckUtils]: 54: Hoare triple {23608#(<= main_~i~1 16)} assume true; {23608#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:05,071 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 17:08:05,072 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 17:08:05,072 INFO L273 TraceCheckUtils]: 57: Hoare triple {23609#(<= main_~i~1 17)} assume true; {23609#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:05,073 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 17:08:05,073 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 17:08:05,074 INFO L273 TraceCheckUtils]: 60: Hoare triple {23610#(<= main_~i~1 18)} assume true; {23610#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:05,074 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 17:08:05,075 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 17:08:05,076 INFO L273 TraceCheckUtils]: 63: Hoare triple {23611#(<= main_~i~1 19)} assume true; {23611#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:05,076 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 17:08:05,077 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 17:08:05,077 INFO L273 TraceCheckUtils]: 66: Hoare triple {23612#(<= main_~i~1 20)} assume true; {23612#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:05,078 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 17:08:05,078 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 17:08:05,079 INFO L273 TraceCheckUtils]: 69: Hoare triple {23613#(<= main_~i~1 21)} assume true; {23613#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:05,079 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 17:08:05,080 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 17:08:05,080 INFO L273 TraceCheckUtils]: 72: Hoare triple {23614#(<= main_~i~1 22)} assume true; {23614#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:05,081 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 17:08:05,082 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 17:08:05,082 INFO L273 TraceCheckUtils]: 75: Hoare triple {23615#(<= main_~i~1 23)} assume true; {23615#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:05,082 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 17:08:05,083 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 17:08:05,084 INFO L273 TraceCheckUtils]: 78: Hoare triple {23616#(<= main_~i~1 24)} assume true; {23616#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:05,084 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 17:08:05,085 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 17:08:05,085 INFO L273 TraceCheckUtils]: 81: Hoare triple {23617#(<= main_~i~1 25)} assume true; {23617#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:05,086 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 17:08:05,087 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 17:08:05,087 INFO L273 TraceCheckUtils]: 84: Hoare triple {23618#(<= main_~i~1 26)} assume true; {23618#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:05,088 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 17:08:05,088 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 17:08:05,089 INFO L273 TraceCheckUtils]: 87: Hoare triple {23619#(<= main_~i~1 27)} assume true; {23619#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:05,089 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 17:08:05,090 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 17:08:05,090 INFO L273 TraceCheckUtils]: 90: Hoare triple {23620#(<= main_~i~1 28)} assume true; {23620#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:05,091 INFO L273 TraceCheckUtils]: 91: Hoare triple {23620#(<= main_~i~1 28)} assume !(~i~1 < 10000); {23591#false} is VALID [2018-11-14 17:08:05,091 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 17:08:05,091 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 17:08:05,092 INFO L273 TraceCheckUtils]: 94: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,092 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 17:08:05,092 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 17:08:05,092 INFO L273 TraceCheckUtils]: 97: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,092 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 17:08:05,092 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 17:08:05,093 INFO L273 TraceCheckUtils]: 100: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,093 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 17:08:05,093 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 17:08:05,093 INFO L273 TraceCheckUtils]: 103: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,093 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 17:08:05,093 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 17:08:05,093 INFO L273 TraceCheckUtils]: 106: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,094 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 17:08:05,094 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 17:08:05,094 INFO L273 TraceCheckUtils]: 109: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,094 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 17:08:05,094 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 17:08:05,094 INFO L273 TraceCheckUtils]: 112: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,095 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 17:08:05,095 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 17:08:05,095 INFO L273 TraceCheckUtils]: 115: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,095 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 17:08:05,095 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 17:08:05,095 INFO L273 TraceCheckUtils]: 118: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,096 INFO L273 TraceCheckUtils]: 119: Hoare triple {23591#false} assume !(~i~0 < 10000); {23591#false} is VALID [2018-11-14 17:08:05,096 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 17:08:05,096 INFO L273 TraceCheckUtils]: 121: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,096 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {23591#false} {23591#false} #73#return; {23591#false} is VALID [2018-11-14 17:08:05,096 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 17:08:05,096 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 17:08:05,096 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 17:08:05,096 INFO L273 TraceCheckUtils]: 126: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,096 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 17:08:05,097 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 17:08:05,097 INFO L273 TraceCheckUtils]: 129: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,097 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 17:08:05,097 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 17:08:05,097 INFO L273 TraceCheckUtils]: 132: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,097 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 17:08:05,097 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 17:08:05,097 INFO L273 TraceCheckUtils]: 135: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,097 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 17:08:05,097 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 17:08:05,098 INFO L273 TraceCheckUtils]: 138: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,098 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 17:08:05,098 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 17:08:05,098 INFO L273 TraceCheckUtils]: 141: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,098 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 17:08:05,098 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 17:08:05,098 INFO L273 TraceCheckUtils]: 144: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,098 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 17:08:05,098 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 17:08:05,098 INFO L273 TraceCheckUtils]: 147: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,099 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 17:08:05,099 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 17:08:05,099 INFO L273 TraceCheckUtils]: 150: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,099 INFO L273 TraceCheckUtils]: 151: Hoare triple {23591#false} assume !(~i~0 < 10000); {23591#false} is VALID [2018-11-14 17:08:05,099 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 17:08:05,099 INFO L273 TraceCheckUtils]: 153: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,099 INFO L268 TraceCheckUtils]: 154: Hoare quadruple {23591#false} {23591#false} #75#return; {23591#false} is VALID [2018-11-14 17:08:05,099 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 17:08:05,099 INFO L273 TraceCheckUtils]: 156: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,099 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 17:08:05,100 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 17:08:05,100 INFO L273 TraceCheckUtils]: 159: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,100 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 17:08:05,100 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 17:08:05,100 INFO L273 TraceCheckUtils]: 162: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,100 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 17:08:05,100 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 17:08:05,100 INFO L273 TraceCheckUtils]: 165: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,100 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 17:08:05,100 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 17:08:05,101 INFO L273 TraceCheckUtils]: 168: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,101 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 17:08:05,101 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 17:08:05,101 INFO L273 TraceCheckUtils]: 171: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,101 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 17:08:05,101 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 17:08:05,101 INFO L273 TraceCheckUtils]: 174: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,101 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 17:08:05,101 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 17:08:05,101 INFO L273 TraceCheckUtils]: 177: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,102 INFO L273 TraceCheckUtils]: 178: Hoare triple {23591#false} assume !(~i~2 < 9999); {23591#false} is VALID [2018-11-14 17:08:05,102 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 17:08:05,102 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 17:08:05,102 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 17:08:05,102 INFO L273 TraceCheckUtils]: 182: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,102 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 17:08:05,102 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 17:08:05,102 INFO L273 TraceCheckUtils]: 185: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,102 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 17:08:05,102 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 17:08:05,103 INFO L273 TraceCheckUtils]: 188: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,103 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 17:08:05,103 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 17:08:05,103 INFO L273 TraceCheckUtils]: 191: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,103 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 17:08:05,103 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 17:08:05,103 INFO L273 TraceCheckUtils]: 194: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,103 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 17:08:05,103 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 17:08:05,103 INFO L273 TraceCheckUtils]: 197: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,104 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 17:08:05,104 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 17:08:05,104 INFO L273 TraceCheckUtils]: 200: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,104 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 17:08:05,104 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 17:08:05,104 INFO L273 TraceCheckUtils]: 203: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,104 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 17:08:05,104 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 17:08:05,104 INFO L273 TraceCheckUtils]: 206: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,104 INFO L273 TraceCheckUtils]: 207: Hoare triple {23591#false} assume !(~i~0 < 10000); {23591#false} is VALID [2018-11-14 17:08:05,105 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 17:08:05,105 INFO L273 TraceCheckUtils]: 209: Hoare triple {23591#false} assume true; {23591#false} is VALID [2018-11-14 17:08:05,105 INFO L268 TraceCheckUtils]: 210: Hoare quadruple {23591#false} {23591#false} #77#return; {23591#false} is VALID [2018-11-14 17:08:05,105 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 17:08:05,105 INFO L273 TraceCheckUtils]: 212: Hoare triple {23591#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23591#false} is VALID [2018-11-14 17:08:05,105 INFO L273 TraceCheckUtils]: 213: Hoare triple {23591#false} assume !false; {23591#false} is VALID [2018-11-14 17:08:05,135 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 17:08:05,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:05,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-14 17:08:05,156 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 214 [2018-11-14 17:08:05,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:05,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 17:08:05,304 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 17:08:05,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 17:08:05,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 17:08:05,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:08:05,306 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 32 states. [2018-11-14 17:08:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:05,814 INFO L93 Difference]: Finished difference Result 222 states and 230 transitions. [2018-11-14 17:08:05,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 17:08:05,814 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 214 [2018-11-14 17:08:05,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:08:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 144 transitions. [2018-11-14 17:08:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:08:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 144 transitions. [2018-11-14 17:08:05,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 144 transitions. [2018-11-14 17:08:05,941 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 17:08:05,944 INFO L225 Difference]: With dead ends: 222 [2018-11-14 17:08:05,944 INFO L226 Difference]: Without dead ends: 159 [2018-11-14 17:08:05,945 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:08:05,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-14 17:08:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-11-14 17:08:05,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:05,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 158 states. [2018-11-14 17:08:05,993 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 158 states. [2018-11-14 17:08:05,993 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 158 states. [2018-11-14 17:08:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:05,995 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2018-11-14 17:08:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2018-11-14 17:08:05,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:05,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:05,996 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 159 states. [2018-11-14 17:08:05,996 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 159 states. [2018-11-14 17:08:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:05,999 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2018-11-14 17:08:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2018-11-14 17:08:05,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:05,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:06,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:06,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-14 17:08:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 162 transitions. [2018-11-14 17:08:06,002 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 162 transitions. Word has length 214 [2018-11-14 17:08:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:06,003 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 162 transitions. [2018-11-14 17:08:06,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 17:08:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2018-11-14 17:08:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-14 17:08:06,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:06,004 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 17:08:06,005 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:06,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:06,005 INFO L82 PathProgramCache]: Analyzing trace with hash -937872049, now seen corresponding path program 27 times [2018-11-14 17:08:06,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:06,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:06,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:06,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:06,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:06,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {25092#true} call ULTIMATE.init(); {25092#true} is VALID [2018-11-14 17:08:06,914 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 17:08:06,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,914 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25092#true} {25092#true} #69#return; {25092#true} is VALID [2018-11-14 17:08:06,914 INFO L256 TraceCheckUtils]: 4: Hoare triple {25092#true} call #t~ret13 := main(); {25092#true} is VALID [2018-11-14 17:08:06,915 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 17:08:06,915 INFO L273 TraceCheckUtils]: 6: Hoare triple {25094#(= main_~i~1 0)} assume true; {25094#(= main_~i~1 0)} is VALID [2018-11-14 17:08:06,915 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 17:08:06,916 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 17:08:06,916 INFO L273 TraceCheckUtils]: 9: Hoare triple {25095#(<= main_~i~1 1)} assume true; {25095#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:06,916 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 17:08:06,917 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 17:08:06,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {25096#(<= main_~i~1 2)} assume true; {25096#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:06,918 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 17:08:06,919 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 17:08:06,919 INFO L273 TraceCheckUtils]: 15: Hoare triple {25097#(<= main_~i~1 3)} assume true; {25097#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:06,920 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 17:08:06,921 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 17:08:06,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {25098#(<= main_~i~1 4)} assume true; {25098#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:06,922 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 17:08:06,922 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 17:08:06,923 INFO L273 TraceCheckUtils]: 21: Hoare triple {25099#(<= main_~i~1 5)} assume true; {25099#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:06,923 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 17:08:06,924 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 17:08:06,924 INFO L273 TraceCheckUtils]: 24: Hoare triple {25100#(<= main_~i~1 6)} assume true; {25100#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:06,925 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 17:08:06,926 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 17:08:06,926 INFO L273 TraceCheckUtils]: 27: Hoare triple {25101#(<= main_~i~1 7)} assume true; {25101#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:06,927 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 17:08:06,927 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 17:08:06,928 INFO L273 TraceCheckUtils]: 30: Hoare triple {25102#(<= main_~i~1 8)} assume true; {25102#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:06,928 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 17:08:06,929 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 17:08:06,930 INFO L273 TraceCheckUtils]: 33: Hoare triple {25103#(<= main_~i~1 9)} assume true; {25103#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:06,930 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 17:08:06,931 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 17:08:06,931 INFO L273 TraceCheckUtils]: 36: Hoare triple {25104#(<= main_~i~1 10)} assume true; {25104#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:06,932 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 17:08:06,932 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 17:08:06,933 INFO L273 TraceCheckUtils]: 39: Hoare triple {25105#(<= main_~i~1 11)} assume true; {25105#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:06,933 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 17:08:06,934 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 17:08:06,935 INFO L273 TraceCheckUtils]: 42: Hoare triple {25106#(<= main_~i~1 12)} assume true; {25106#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:06,935 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 17:08:06,936 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 17:08:06,936 INFO L273 TraceCheckUtils]: 45: Hoare triple {25107#(<= main_~i~1 13)} assume true; {25107#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:06,937 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 17:08:06,938 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 17:08:06,938 INFO L273 TraceCheckUtils]: 48: Hoare triple {25108#(<= main_~i~1 14)} assume true; {25108#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:06,939 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 17:08:06,939 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 17:08:06,940 INFO L273 TraceCheckUtils]: 51: Hoare triple {25109#(<= main_~i~1 15)} assume true; {25109#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:06,940 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 17:08:06,941 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 17:08:06,941 INFO L273 TraceCheckUtils]: 54: Hoare triple {25110#(<= main_~i~1 16)} assume true; {25110#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:06,942 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 17:08:06,943 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 17:08:06,943 INFO L273 TraceCheckUtils]: 57: Hoare triple {25111#(<= main_~i~1 17)} assume true; {25111#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:06,944 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 17:08:06,944 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 17:08:06,945 INFO L273 TraceCheckUtils]: 60: Hoare triple {25112#(<= main_~i~1 18)} assume true; {25112#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:06,945 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 17:08:06,946 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 17:08:06,947 INFO L273 TraceCheckUtils]: 63: Hoare triple {25113#(<= main_~i~1 19)} assume true; {25113#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:06,947 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 17:08:06,948 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 17:08:06,948 INFO L273 TraceCheckUtils]: 66: Hoare triple {25114#(<= main_~i~1 20)} assume true; {25114#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:06,949 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 17:08:06,950 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 17:08:06,950 INFO L273 TraceCheckUtils]: 69: Hoare triple {25115#(<= main_~i~1 21)} assume true; {25115#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:06,951 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 17:08:06,951 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 17:08:06,952 INFO L273 TraceCheckUtils]: 72: Hoare triple {25116#(<= main_~i~1 22)} assume true; {25116#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:06,952 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 17:08:06,953 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 17:08:06,953 INFO L273 TraceCheckUtils]: 75: Hoare triple {25117#(<= main_~i~1 23)} assume true; {25117#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:06,954 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 17:08:06,955 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 17:08:06,955 INFO L273 TraceCheckUtils]: 78: Hoare triple {25118#(<= main_~i~1 24)} assume true; {25118#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:06,956 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 17:08:06,956 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 17:08:06,957 INFO L273 TraceCheckUtils]: 81: Hoare triple {25119#(<= main_~i~1 25)} assume true; {25119#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:06,957 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 17:08:06,958 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 17:08:06,959 INFO L273 TraceCheckUtils]: 84: Hoare triple {25120#(<= main_~i~1 26)} assume true; {25120#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:06,959 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 17:08:06,960 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 17:08:06,960 INFO L273 TraceCheckUtils]: 87: Hoare triple {25121#(<= main_~i~1 27)} assume true; {25121#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:06,961 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 17:08:06,962 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 17:08:06,962 INFO L273 TraceCheckUtils]: 90: Hoare triple {25122#(<= main_~i~1 28)} assume true; {25122#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:06,963 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 17:08:06,963 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 17:08:06,964 INFO L273 TraceCheckUtils]: 93: Hoare triple {25123#(<= main_~i~1 29)} assume true; {25123#(<= main_~i~1 29)} is VALID [2018-11-14 17:08:06,964 INFO L273 TraceCheckUtils]: 94: Hoare triple {25123#(<= main_~i~1 29)} assume !(~i~1 < 10000); {25093#false} is VALID [2018-11-14 17:08:06,965 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 17:08:06,965 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 17:08:06,965 INFO L273 TraceCheckUtils]: 97: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,965 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 17:08:06,965 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 17:08:06,965 INFO L273 TraceCheckUtils]: 100: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,966 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 17:08:06,966 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 17:08:06,966 INFO L273 TraceCheckUtils]: 103: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,966 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 17:08:06,966 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 17:08:06,967 INFO L273 TraceCheckUtils]: 106: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,967 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 17:08:06,967 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 17:08:06,967 INFO L273 TraceCheckUtils]: 109: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,967 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 17:08:06,967 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 17:08:06,968 INFO L273 TraceCheckUtils]: 112: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,968 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 17:08:06,968 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 17:08:06,968 INFO L273 TraceCheckUtils]: 115: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,968 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 17:08:06,968 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 17:08:06,969 INFO L273 TraceCheckUtils]: 118: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,969 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 17:08:06,969 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 17:08:06,969 INFO L273 TraceCheckUtils]: 121: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,969 INFO L273 TraceCheckUtils]: 122: Hoare triple {25092#true} assume !(~i~0 < 10000); {25092#true} is VALID [2018-11-14 17:08:06,969 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 17:08:06,970 INFO L273 TraceCheckUtils]: 124: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,970 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {25092#true} {25093#false} #73#return; {25093#false} is VALID [2018-11-14 17:08:06,970 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 17:08:06,970 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 17:08:06,970 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 17:08:06,970 INFO L273 TraceCheckUtils]: 129: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,970 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 17:08:06,970 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 17:08:06,970 INFO L273 TraceCheckUtils]: 132: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,970 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 17:08:06,971 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 17:08:06,971 INFO L273 TraceCheckUtils]: 135: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,971 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 17:08:06,971 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 17:08:06,971 INFO L273 TraceCheckUtils]: 138: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,971 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 17:08:06,971 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 17:08:06,971 INFO L273 TraceCheckUtils]: 141: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,971 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 17:08:06,971 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 17:08:06,972 INFO L273 TraceCheckUtils]: 144: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,972 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 17:08:06,972 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 17:08:06,972 INFO L273 TraceCheckUtils]: 147: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,972 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 17:08:06,972 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 17:08:06,972 INFO L273 TraceCheckUtils]: 150: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,972 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 17:08:06,972 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 17:08:06,972 INFO L273 TraceCheckUtils]: 153: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,973 INFO L273 TraceCheckUtils]: 154: Hoare triple {25092#true} assume !(~i~0 < 10000); {25092#true} is VALID [2018-11-14 17:08:06,973 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 17:08:06,973 INFO L273 TraceCheckUtils]: 156: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,973 INFO L268 TraceCheckUtils]: 157: Hoare quadruple {25092#true} {25093#false} #75#return; {25093#false} is VALID [2018-11-14 17:08:06,973 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 17:08:06,973 INFO L273 TraceCheckUtils]: 159: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 17:08:06,973 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 17:08:06,973 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 17:08:06,973 INFO L273 TraceCheckUtils]: 162: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 17:08:06,973 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 17:08:06,974 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 17:08:06,974 INFO L273 TraceCheckUtils]: 165: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 17:08:06,974 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 17:08:06,974 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 17:08:06,974 INFO L273 TraceCheckUtils]: 168: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 17:08:06,974 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 17:08:06,974 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 17:08:06,974 INFO L273 TraceCheckUtils]: 171: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 17:08:06,974 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 17:08:06,975 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 17:08:06,975 INFO L273 TraceCheckUtils]: 174: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 17:08:06,975 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 17:08:06,975 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 17:08:06,975 INFO L273 TraceCheckUtils]: 177: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 17:08:06,975 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 17:08:06,975 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 17:08:06,975 INFO L273 TraceCheckUtils]: 180: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 17:08:06,975 INFO L273 TraceCheckUtils]: 181: Hoare triple {25093#false} assume !(~i~2 < 9999); {25093#false} is VALID [2018-11-14 17:08:06,975 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 17:08:06,975 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 17:08:06,976 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 17:08:06,976 INFO L273 TraceCheckUtils]: 185: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,976 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 17:08:06,976 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 17:08:06,976 INFO L273 TraceCheckUtils]: 188: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,976 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 17:08:06,976 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 17:08:06,976 INFO L273 TraceCheckUtils]: 191: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,976 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 17:08:06,976 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 17:08:06,977 INFO L273 TraceCheckUtils]: 194: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,977 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 17:08:06,977 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 17:08:06,977 INFO L273 TraceCheckUtils]: 197: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,977 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 17:08:06,977 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 17:08:06,977 INFO L273 TraceCheckUtils]: 200: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,977 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 17:08:06,977 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 17:08:06,977 INFO L273 TraceCheckUtils]: 203: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,978 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 17:08:06,978 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 17:08:06,978 INFO L273 TraceCheckUtils]: 206: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,978 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 17:08:06,978 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 17:08:06,978 INFO L273 TraceCheckUtils]: 209: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,978 INFO L273 TraceCheckUtils]: 210: Hoare triple {25092#true} assume !(~i~0 < 10000); {25092#true} is VALID [2018-11-14 17:08:06,978 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 17:08:06,978 INFO L273 TraceCheckUtils]: 212: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:06,979 INFO L268 TraceCheckUtils]: 213: Hoare quadruple {25092#true} {25093#false} #77#return; {25093#false} is VALID [2018-11-14 17:08:06,979 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 17:08:06,979 INFO L273 TraceCheckUtils]: 215: Hoare triple {25093#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {25093#false} is VALID [2018-11-14 17:08:06,979 INFO L273 TraceCheckUtils]: 216: Hoare triple {25093#false} assume !false; {25093#false} is VALID [2018-11-14 17:08:07,000 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 17:08:07,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:07,001 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 17:08:07,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:08:07,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-14 17:08:07,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:07,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:07,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {25092#true} call ULTIMATE.init(); {25092#true} is VALID [2018-11-14 17:08:07,630 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 17:08:07,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,631 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25092#true} {25092#true} #69#return; {25092#true} is VALID [2018-11-14 17:08:07,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {25092#true} call #t~ret13 := main(); {25092#true} is VALID [2018-11-14 17:08:07,631 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 17:08:07,631 INFO L273 TraceCheckUtils]: 6: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,631 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 17:08:07,631 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 17:08:07,632 INFO L273 TraceCheckUtils]: 9: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,632 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 17:08:07,632 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 17:08:07,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,632 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 17:08:07,633 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 17:08:07,633 INFO L273 TraceCheckUtils]: 15: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,633 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 17:08:07,633 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 17:08:07,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,633 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 17:08:07,633 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 17:08:07,633 INFO L273 TraceCheckUtils]: 21: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,633 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 17:08:07,633 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 17:08:07,634 INFO L273 TraceCheckUtils]: 24: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,634 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 17:08:07,634 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 17:08:07,634 INFO L273 TraceCheckUtils]: 27: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,634 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 17:08:07,634 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 17:08:07,634 INFO L273 TraceCheckUtils]: 30: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,634 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 17:08:07,634 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 17:08:07,634 INFO L273 TraceCheckUtils]: 33: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,635 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 17:08:07,635 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 17:08:07,635 INFO L273 TraceCheckUtils]: 36: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,635 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 17:08:07,635 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 17:08:07,635 INFO L273 TraceCheckUtils]: 39: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,635 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 17:08:07,635 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 17:08:07,635 INFO L273 TraceCheckUtils]: 42: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,635 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 17:08:07,636 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 17:08:07,636 INFO L273 TraceCheckUtils]: 45: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,636 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 17:08:07,636 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 17:08:07,636 INFO L273 TraceCheckUtils]: 48: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,636 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 17:08:07,636 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 17:08:07,636 INFO L273 TraceCheckUtils]: 51: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,636 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 17:08:07,636 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 17:08:07,637 INFO L273 TraceCheckUtils]: 54: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,637 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 17:08:07,637 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 17:08:07,637 INFO L273 TraceCheckUtils]: 57: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,637 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 17:08:07,637 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 17:08:07,637 INFO L273 TraceCheckUtils]: 60: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,637 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 17:08:07,637 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 17:08:07,637 INFO L273 TraceCheckUtils]: 63: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,638 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 17:08:07,638 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 17:08:07,638 INFO L273 TraceCheckUtils]: 66: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,638 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 17:08:07,638 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 17:08:07,638 INFO L273 TraceCheckUtils]: 69: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,638 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 17:08:07,638 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 17:08:07,638 INFO L273 TraceCheckUtils]: 72: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,638 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 17:08:07,639 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 17:08:07,639 INFO L273 TraceCheckUtils]: 75: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,639 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 17:08:07,639 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 17:08:07,639 INFO L273 TraceCheckUtils]: 78: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,639 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 17:08:07,639 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 17:08:07,639 INFO L273 TraceCheckUtils]: 81: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,639 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 17:08:07,639 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 17:08:07,640 INFO L273 TraceCheckUtils]: 84: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,640 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 17:08:07,640 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 17:08:07,640 INFO L273 TraceCheckUtils]: 87: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,640 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 17:08:07,640 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 17:08:07,640 INFO L273 TraceCheckUtils]: 90: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,640 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 17:08:07,640 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 17:08:07,640 INFO L273 TraceCheckUtils]: 93: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,641 INFO L273 TraceCheckUtils]: 94: Hoare triple {25092#true} assume !(~i~1 < 10000); {25092#true} is VALID [2018-11-14 17:08:07,641 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 17:08:07,641 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 17:08:07,641 INFO L273 TraceCheckUtils]: 97: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,641 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 17:08:07,641 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 17:08:07,641 INFO L273 TraceCheckUtils]: 100: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,641 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 17:08:07,641 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 17:08:07,641 INFO L273 TraceCheckUtils]: 103: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,642 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 17:08:07,642 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 17:08:07,642 INFO L273 TraceCheckUtils]: 106: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,642 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 17:08:07,642 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 17:08:07,642 INFO L273 TraceCheckUtils]: 109: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,642 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 17:08:07,642 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 17:08:07,642 INFO L273 TraceCheckUtils]: 112: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,642 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 17:08:07,643 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 17:08:07,643 INFO L273 TraceCheckUtils]: 115: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,643 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 17:08:07,643 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 17:08:07,643 INFO L273 TraceCheckUtils]: 118: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,643 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 17:08:07,643 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 17:08:07,643 INFO L273 TraceCheckUtils]: 121: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,643 INFO L273 TraceCheckUtils]: 122: Hoare triple {25092#true} assume !(~i~0 < 10000); {25092#true} is VALID [2018-11-14 17:08:07,643 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 17:08:07,644 INFO L273 TraceCheckUtils]: 124: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,644 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {25092#true} {25092#true} #73#return; {25092#true} is VALID [2018-11-14 17:08:07,644 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 17:08:07,644 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 17:08:07,644 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 17:08:07,644 INFO L273 TraceCheckUtils]: 129: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,644 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 17:08:07,644 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 17:08:07,644 INFO L273 TraceCheckUtils]: 132: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,644 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 17:08:07,645 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 17:08:07,645 INFO L273 TraceCheckUtils]: 135: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,645 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 17:08:07,645 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 17:08:07,645 INFO L273 TraceCheckUtils]: 138: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,645 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 17:08:07,645 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 17:08:07,645 INFO L273 TraceCheckUtils]: 141: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,645 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 17:08:07,645 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 17:08:07,646 INFO L273 TraceCheckUtils]: 144: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,646 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 17:08:07,646 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 17:08:07,646 INFO L273 TraceCheckUtils]: 147: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,646 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 17:08:07,646 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 17:08:07,646 INFO L273 TraceCheckUtils]: 150: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,646 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 17:08:07,646 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 17:08:07,646 INFO L273 TraceCheckUtils]: 153: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,647 INFO L273 TraceCheckUtils]: 154: Hoare triple {25092#true} assume !(~i~0 < 10000); {25092#true} is VALID [2018-11-14 17:08:07,647 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 17:08:07,647 INFO L273 TraceCheckUtils]: 156: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,647 INFO L268 TraceCheckUtils]: 157: Hoare quadruple {25092#true} {25092#true} #75#return; {25092#true} is VALID [2018-11-14 17:08:07,647 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 17:08:07,647 INFO L273 TraceCheckUtils]: 159: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,647 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 17:08:07,647 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 17:08:07,647 INFO L273 TraceCheckUtils]: 162: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,647 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 17:08:07,648 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 17:08:07,648 INFO L273 TraceCheckUtils]: 165: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,648 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 17:08:07,648 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 17:08:07,648 INFO L273 TraceCheckUtils]: 168: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,648 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 17:08:07,648 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 17:08:07,648 INFO L273 TraceCheckUtils]: 171: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,648 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 17:08:07,648 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 17:08:07,649 INFO L273 TraceCheckUtils]: 174: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,649 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 17:08:07,649 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 17:08:07,649 INFO L273 TraceCheckUtils]: 177: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,649 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 17:08:07,649 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 17:08:07,649 INFO L273 TraceCheckUtils]: 180: Hoare triple {25092#true} assume true; {25092#true} is VALID [2018-11-14 17:08:07,649 INFO L273 TraceCheckUtils]: 181: Hoare triple {25092#true} assume !(~i~2 < 9999); {25092#true} is VALID [2018-11-14 17:08:07,649 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 17:08:07,649 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 17:08:07,650 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 17:08:07,650 INFO L273 TraceCheckUtils]: 185: Hoare triple {25679#(<= bAnd_~i~0 1)} assume true; {25679#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:08:07,651 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 17:08:07,651 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 17:08:07,651 INFO L273 TraceCheckUtils]: 188: Hoare triple {25689#(<= bAnd_~i~0 2)} assume true; {25689#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:08:07,652 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 17:08:07,652 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 17:08:07,652 INFO L273 TraceCheckUtils]: 191: Hoare triple {25699#(<= bAnd_~i~0 3)} assume true; {25699#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:08:07,653 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 17:08:07,653 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 17:08:07,653 INFO L273 TraceCheckUtils]: 194: Hoare triple {25709#(<= bAnd_~i~0 4)} assume true; {25709#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:08:07,654 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 17:08:07,654 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 17:08:07,655 INFO L273 TraceCheckUtils]: 197: Hoare triple {25719#(<= bAnd_~i~0 5)} assume true; {25719#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:08:07,655 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 17:08:07,656 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 17:08:07,656 INFO L273 TraceCheckUtils]: 200: Hoare triple {25729#(<= bAnd_~i~0 6)} assume true; {25729#(<= bAnd_~i~0 6)} is VALID [2018-11-14 17:08:07,657 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 17:08:07,658 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 17:08:07,658 INFO L273 TraceCheckUtils]: 203: Hoare triple {25739#(<= bAnd_~i~0 7)} assume true; {25739#(<= bAnd_~i~0 7)} is VALID [2018-11-14 17:08:07,659 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 17:08:07,659 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 17:08:07,660 INFO L273 TraceCheckUtils]: 206: Hoare triple {25749#(<= bAnd_~i~0 8)} assume true; {25749#(<= bAnd_~i~0 8)} is VALID [2018-11-14 17:08:07,660 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 17:08:07,661 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 17:08:07,662 INFO L273 TraceCheckUtils]: 209: Hoare triple {25759#(<= bAnd_~i~0 9)} assume true; {25759#(<= bAnd_~i~0 9)} is VALID [2018-11-14 17:08:07,662 INFO L273 TraceCheckUtils]: 210: Hoare triple {25759#(<= bAnd_~i~0 9)} assume !(~i~0 < 10000); {25093#false} is VALID [2018-11-14 17:08:07,662 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 17:08:07,663 INFO L273 TraceCheckUtils]: 212: Hoare triple {25093#false} assume true; {25093#false} is VALID [2018-11-14 17:08:07,663 INFO L268 TraceCheckUtils]: 213: Hoare quadruple {25093#false} {25092#true} #77#return; {25093#false} is VALID [2018-11-14 17:08:07,663 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 17:08:07,663 INFO L273 TraceCheckUtils]: 215: Hoare triple {25093#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {25093#false} is VALID [2018-11-14 17:08:07,663 INFO L273 TraceCheckUtils]: 216: Hoare triple {25093#false} assume !false; {25093#false} is VALID [2018-11-14 17:08:07,681 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 17:08:07,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:07,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 11] total 41 [2018-11-14 17:08:07,702 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 217 [2018-11-14 17:08:07,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:07,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-14 17:08:07,866 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 17:08:07,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-14 17:08:07,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-14 17:08:07,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2018-11-14 17:08:07,868 INFO L87 Difference]: Start difference. First operand 158 states and 162 transitions. Second operand 41 states. [2018-11-14 17:08:08,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:08,944 INFO L93 Difference]: Finished difference Result 229 states and 241 transitions. [2018-11-14 17:08:08,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-14 17:08:08,945 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 217 [2018-11-14 17:08:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:08:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 178 transitions. [2018-11-14 17:08:08,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:08:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 178 transitions. [2018-11-14 17:08:08,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 178 transitions. [2018-11-14 17:08:09,100 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 17:08:09,103 INFO L225 Difference]: With dead ends: 229 [2018-11-14 17:08:09,103 INFO L226 Difference]: Without dead ends: 166 [2018-11-14 17:08:09,104 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2018-11-14 17:08:09,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-14 17:08:09,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-11-14 17:08:09,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:09,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 164 states. [2018-11-14 17:08:09,250 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 164 states. [2018-11-14 17:08:09,250 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 164 states. [2018-11-14 17:08:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:09,253 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2018-11-14 17:08:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2018-11-14 17:08:09,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:09,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:09,254 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 166 states. [2018-11-14 17:08:09,254 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 166 states. [2018-11-14 17:08:09,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:09,257 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2018-11-14 17:08:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2018-11-14 17:08:09,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:09,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:09,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:09,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-14 17:08:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2018-11-14 17:08:09,260 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 217 [2018-11-14 17:08:09,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:09,261 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2018-11-14 17:08:09,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-14 17:08:09,261 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2018-11-14 17:08:09,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-14 17:08:09,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:09,263 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 17:08:09,263 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:09,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:09,263 INFO L82 PathProgramCache]: Analyzing trace with hash -569773369, now seen corresponding path program 28 times [2018-11-14 17:08:09,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:09,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:09,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:09,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:09,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:10,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {26643#true} call ULTIMATE.init(); {26643#true} is VALID [2018-11-14 17:08:10,111 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 17:08:10,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26643#true} {26643#true} #69#return; {26643#true} is VALID [2018-11-14 17:08:10,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {26643#true} call #t~ret13 := main(); {26643#true} is VALID [2018-11-14 17:08:10,112 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 17:08:10,112 INFO L273 TraceCheckUtils]: 6: Hoare triple {26645#(= main_~i~1 0)} assume true; {26645#(= main_~i~1 0)} is VALID [2018-11-14 17:08:10,113 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 17:08:10,113 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 17:08:10,114 INFO L273 TraceCheckUtils]: 9: Hoare triple {26646#(<= main_~i~1 1)} assume true; {26646#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:10,114 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 17:08:10,114 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 17:08:10,115 INFO L273 TraceCheckUtils]: 12: Hoare triple {26647#(<= main_~i~1 2)} assume true; {26647#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:10,115 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 17:08:10,115 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 17:08:10,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {26648#(<= main_~i~1 3)} assume true; {26648#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:10,116 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 17:08:10,117 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 17:08:10,118 INFO L273 TraceCheckUtils]: 18: Hoare triple {26649#(<= main_~i~1 4)} assume true; {26649#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:10,118 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 17:08:10,119 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 17:08:10,119 INFO L273 TraceCheckUtils]: 21: Hoare triple {26650#(<= main_~i~1 5)} assume true; {26650#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:10,120 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 17:08:10,121 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 17:08:10,121 INFO L273 TraceCheckUtils]: 24: Hoare triple {26651#(<= main_~i~1 6)} assume true; {26651#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:10,122 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 17:08:10,122 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 17:08:10,123 INFO L273 TraceCheckUtils]: 27: Hoare triple {26652#(<= main_~i~1 7)} assume true; {26652#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:10,123 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 17:08:10,124 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 17:08:10,125 INFO L273 TraceCheckUtils]: 30: Hoare triple {26653#(<= main_~i~1 8)} assume true; {26653#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:10,125 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 17:08:10,126 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 17:08:10,126 INFO L273 TraceCheckUtils]: 33: Hoare triple {26654#(<= main_~i~1 9)} assume true; {26654#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:10,127 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 17:08:10,127 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 17:08:10,128 INFO L273 TraceCheckUtils]: 36: Hoare triple {26655#(<= main_~i~1 10)} assume true; {26655#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:10,128 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 17:08:10,129 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 17:08:10,130 INFO L273 TraceCheckUtils]: 39: Hoare triple {26656#(<= main_~i~1 11)} assume true; {26656#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:10,130 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 17:08:10,131 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 17:08:10,131 INFO L273 TraceCheckUtils]: 42: Hoare triple {26657#(<= main_~i~1 12)} assume true; {26657#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:10,132 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 17:08:10,133 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 17:08:10,133 INFO L273 TraceCheckUtils]: 45: Hoare triple {26658#(<= main_~i~1 13)} assume true; {26658#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:10,134 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 17:08:10,134 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 17:08:10,135 INFO L273 TraceCheckUtils]: 48: Hoare triple {26659#(<= main_~i~1 14)} assume true; {26659#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:10,135 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 17:08:10,136 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 17:08:10,137 INFO L273 TraceCheckUtils]: 51: Hoare triple {26660#(<= main_~i~1 15)} assume true; {26660#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:10,137 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 17:08:10,138 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 17:08:10,138 INFO L273 TraceCheckUtils]: 54: Hoare triple {26661#(<= main_~i~1 16)} assume true; {26661#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:10,139 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 17:08:10,140 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 17:08:10,140 INFO L273 TraceCheckUtils]: 57: Hoare triple {26662#(<= main_~i~1 17)} assume true; {26662#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:10,141 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 17:08:10,141 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 17:08:10,142 INFO L273 TraceCheckUtils]: 60: Hoare triple {26663#(<= main_~i~1 18)} assume true; {26663#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:10,142 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 17:08:10,143 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 17:08:10,144 INFO L273 TraceCheckUtils]: 63: Hoare triple {26664#(<= main_~i~1 19)} assume true; {26664#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:10,144 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 17:08:10,145 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 17:08:10,145 INFO L273 TraceCheckUtils]: 66: Hoare triple {26665#(<= main_~i~1 20)} assume true; {26665#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:10,146 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 17:08:10,147 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 17:08:10,147 INFO L273 TraceCheckUtils]: 69: Hoare triple {26666#(<= main_~i~1 21)} assume true; {26666#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:10,148 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 17:08:10,148 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 17:08:10,149 INFO L273 TraceCheckUtils]: 72: Hoare triple {26667#(<= main_~i~1 22)} assume true; {26667#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:10,149 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 17:08:10,150 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 17:08:10,151 INFO L273 TraceCheckUtils]: 75: Hoare triple {26668#(<= main_~i~1 23)} assume true; {26668#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:10,151 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 17:08:10,152 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 17:08:10,152 INFO L273 TraceCheckUtils]: 78: Hoare triple {26669#(<= main_~i~1 24)} assume true; {26669#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:10,153 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 17:08:10,153 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 17:08:10,154 INFO L273 TraceCheckUtils]: 81: Hoare triple {26670#(<= main_~i~1 25)} assume true; {26670#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:10,155 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 17:08:10,155 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 17:08:10,156 INFO L273 TraceCheckUtils]: 84: Hoare triple {26671#(<= main_~i~1 26)} assume true; {26671#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:10,156 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 17:08:10,157 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 17:08:10,158 INFO L273 TraceCheckUtils]: 87: Hoare triple {26672#(<= main_~i~1 27)} assume true; {26672#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:10,158 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 17:08:10,159 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 17:08:10,159 INFO L273 TraceCheckUtils]: 90: Hoare triple {26673#(<= main_~i~1 28)} assume true; {26673#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:10,160 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 17:08:10,160 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 17:08:10,161 INFO L273 TraceCheckUtils]: 93: Hoare triple {26674#(<= main_~i~1 29)} assume true; {26674#(<= main_~i~1 29)} is VALID [2018-11-14 17:08:10,162 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 17:08:10,162 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 17:08:10,163 INFO L273 TraceCheckUtils]: 96: Hoare triple {26675#(<= main_~i~1 30)} assume true; {26675#(<= main_~i~1 30)} is VALID [2018-11-14 17:08:10,163 INFO L273 TraceCheckUtils]: 97: Hoare triple {26675#(<= main_~i~1 30)} assume !(~i~1 < 10000); {26644#false} is VALID [2018-11-14 17:08:10,164 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 17:08:10,164 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 17:08:10,164 INFO L273 TraceCheckUtils]: 100: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,164 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 17:08:10,164 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 17:08:10,164 INFO L273 TraceCheckUtils]: 103: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,165 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 17:08:10,165 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 17:08:10,165 INFO L273 TraceCheckUtils]: 106: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,165 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 17:08:10,165 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 17:08:10,166 INFO L273 TraceCheckUtils]: 109: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,166 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 17:08:10,166 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 17:08:10,166 INFO L273 TraceCheckUtils]: 112: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,166 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 17:08:10,166 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 17:08:10,167 INFO L273 TraceCheckUtils]: 115: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,167 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 17:08:10,167 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 17:08:10,167 INFO L273 TraceCheckUtils]: 118: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,167 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 17:08:10,167 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 17:08:10,168 INFO L273 TraceCheckUtils]: 121: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,168 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 17:08:10,168 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 17:08:10,168 INFO L273 TraceCheckUtils]: 124: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,168 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 17:08:10,168 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 17:08:10,168 INFO L273 TraceCheckUtils]: 127: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,168 INFO L273 TraceCheckUtils]: 128: Hoare triple {26643#true} assume !(~i~0 < 10000); {26643#true} is VALID [2018-11-14 17:08:10,168 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 17:08:10,168 INFO L273 TraceCheckUtils]: 130: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,169 INFO L268 TraceCheckUtils]: 131: Hoare quadruple {26643#true} {26644#false} #73#return; {26644#false} is VALID [2018-11-14 17:08:10,169 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 17:08:10,169 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 17:08:10,169 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 17:08:10,169 INFO L273 TraceCheckUtils]: 135: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,169 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 17:08:10,169 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 17:08:10,169 INFO L273 TraceCheckUtils]: 138: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,169 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 17:08:10,169 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 17:08:10,170 INFO L273 TraceCheckUtils]: 141: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,170 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 17:08:10,170 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 17:08:10,170 INFO L273 TraceCheckUtils]: 144: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,170 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 17:08:10,170 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 17:08:10,170 INFO L273 TraceCheckUtils]: 147: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,170 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 17:08:10,170 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 17:08:10,170 INFO L273 TraceCheckUtils]: 150: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,171 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 17:08:10,171 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 17:08:10,171 INFO L273 TraceCheckUtils]: 153: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,171 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 17:08:10,171 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 17:08:10,171 INFO L273 TraceCheckUtils]: 156: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,171 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 17:08:10,171 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 17:08:10,171 INFO L273 TraceCheckUtils]: 159: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,171 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 17:08:10,172 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 17:08:10,172 INFO L273 TraceCheckUtils]: 162: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,172 INFO L273 TraceCheckUtils]: 163: Hoare triple {26643#true} assume !(~i~0 < 10000); {26643#true} is VALID [2018-11-14 17:08:10,172 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 17:08:10,172 INFO L273 TraceCheckUtils]: 165: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,172 INFO L268 TraceCheckUtils]: 166: Hoare quadruple {26643#true} {26644#false} #75#return; {26644#false} is VALID [2018-11-14 17:08:10,172 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 17:08:10,172 INFO L273 TraceCheckUtils]: 168: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:10,172 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 17:08:10,172 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 17:08:10,173 INFO L273 TraceCheckUtils]: 171: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:10,173 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 17:08:10,173 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 17:08:10,173 INFO L273 TraceCheckUtils]: 174: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:10,173 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 17:08:10,173 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 17:08:10,173 INFO L273 TraceCheckUtils]: 177: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:10,173 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 17:08:10,173 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 17:08:10,174 INFO L273 TraceCheckUtils]: 180: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:10,174 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 17:08:10,174 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 17:08:10,174 INFO L273 TraceCheckUtils]: 183: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:10,174 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 17:08:10,174 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 17:08:10,174 INFO L273 TraceCheckUtils]: 186: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:10,174 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 17:08:10,174 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 17:08:10,174 INFO L273 TraceCheckUtils]: 189: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:10,175 INFO L273 TraceCheckUtils]: 190: Hoare triple {26644#false} assume !(~i~2 < 9999); {26644#false} is VALID [2018-11-14 17:08:10,175 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 17:08:10,175 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 17:08:10,175 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 17:08:10,175 INFO L273 TraceCheckUtils]: 194: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,175 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 17:08:10,175 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 17:08:10,175 INFO L273 TraceCheckUtils]: 197: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,175 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 17:08:10,175 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 17:08:10,176 INFO L273 TraceCheckUtils]: 200: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,176 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 17:08:10,176 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 17:08:10,176 INFO L273 TraceCheckUtils]: 203: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,176 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 17:08:10,176 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 17:08:10,176 INFO L273 TraceCheckUtils]: 206: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,176 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 17:08:10,176 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 17:08:10,176 INFO L273 TraceCheckUtils]: 209: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,177 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 17:08:10,177 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 17:08:10,177 INFO L273 TraceCheckUtils]: 212: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,177 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 17:08:10,177 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 17:08:10,177 INFO L273 TraceCheckUtils]: 215: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,177 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 17:08:10,177 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 17:08:10,177 INFO L273 TraceCheckUtils]: 218: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,177 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 17:08:10,178 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 17:08:10,178 INFO L273 TraceCheckUtils]: 221: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,178 INFO L273 TraceCheckUtils]: 222: Hoare triple {26643#true} assume !(~i~0 < 10000); {26643#true} is VALID [2018-11-14 17:08:10,178 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 17:08:10,178 INFO L273 TraceCheckUtils]: 224: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,178 INFO L268 TraceCheckUtils]: 225: Hoare quadruple {26643#true} {26644#false} #77#return; {26644#false} is VALID [2018-11-14 17:08:10,178 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 17:08:10,178 INFO L273 TraceCheckUtils]: 227: Hoare triple {26644#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26644#false} is VALID [2018-11-14 17:08:10,178 INFO L273 TraceCheckUtils]: 228: Hoare triple {26644#false} assume !false; {26644#false} is VALID [2018-11-14 17:08:10,202 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 17:08:10,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:10,203 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 17:08:10,213 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:08:10,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:08:10,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:10,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:10,958 INFO L256 TraceCheckUtils]: 0: Hoare triple {26643#true} call ULTIMATE.init(); {26643#true} is VALID [2018-11-14 17:08:10,958 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 17:08:10,958 INFO L273 TraceCheckUtils]: 2: Hoare triple {26643#true} assume true; {26643#true} is VALID [2018-11-14 17:08:10,959 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26643#true} {26643#true} #69#return; {26643#true} is VALID [2018-11-14 17:08:10,959 INFO L256 TraceCheckUtils]: 4: Hoare triple {26643#true} call #t~ret13 := main(); {26643#true} is VALID [2018-11-14 17:08:10,959 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 17:08:10,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {26694#(<= main_~i~1 0)} assume true; {26694#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:10,960 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 17:08:10,961 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 17:08:10,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {26646#(<= main_~i~1 1)} assume true; {26646#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:10,962 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 17:08:10,962 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 17:08:10,962 INFO L273 TraceCheckUtils]: 12: Hoare triple {26647#(<= main_~i~1 2)} assume true; {26647#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:10,963 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 17:08:10,963 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 17:08:10,964 INFO L273 TraceCheckUtils]: 15: Hoare triple {26648#(<= main_~i~1 3)} assume true; {26648#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:10,964 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 17:08:10,965 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 17:08:10,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {26649#(<= main_~i~1 4)} assume true; {26649#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:10,966 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 17:08:10,967 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 17:08:10,967 INFO L273 TraceCheckUtils]: 21: Hoare triple {26650#(<= main_~i~1 5)} assume true; {26650#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:10,967 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 17:08:10,968 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 17:08:10,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {26651#(<= main_~i~1 6)} assume true; {26651#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:10,969 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 17:08:10,970 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 17:08:10,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {26652#(<= main_~i~1 7)} assume true; {26652#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:10,971 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 17:08:10,972 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 17:08:10,972 INFO L273 TraceCheckUtils]: 30: Hoare triple {26653#(<= main_~i~1 8)} assume true; {26653#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:10,973 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 17:08:10,973 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 17:08:10,974 INFO L273 TraceCheckUtils]: 33: Hoare triple {26654#(<= main_~i~1 9)} assume true; {26654#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:10,974 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 17:08:10,975 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 17:08:10,976 INFO L273 TraceCheckUtils]: 36: Hoare triple {26655#(<= main_~i~1 10)} assume true; {26655#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:10,976 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 17:08:10,977 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 17:08:10,977 INFO L273 TraceCheckUtils]: 39: Hoare triple {26656#(<= main_~i~1 11)} assume true; {26656#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:10,978 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 17:08:10,978 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 17:08:10,979 INFO L273 TraceCheckUtils]: 42: Hoare triple {26657#(<= main_~i~1 12)} assume true; {26657#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:10,979 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 17:08:10,980 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 17:08:10,980 INFO L273 TraceCheckUtils]: 45: Hoare triple {26658#(<= main_~i~1 13)} assume true; {26658#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:10,981 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 17:08:10,982 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 17:08:10,982 INFO L273 TraceCheckUtils]: 48: Hoare triple {26659#(<= main_~i~1 14)} assume true; {26659#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:10,983 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 17:08:10,983 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 17:08:10,984 INFO L273 TraceCheckUtils]: 51: Hoare triple {26660#(<= main_~i~1 15)} assume true; {26660#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:10,984 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 17:08:10,985 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 17:08:10,985 INFO L273 TraceCheckUtils]: 54: Hoare triple {26661#(<= main_~i~1 16)} assume true; {26661#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:10,986 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 17:08:10,987 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 17:08:10,987 INFO L273 TraceCheckUtils]: 57: Hoare triple {26662#(<= main_~i~1 17)} assume true; {26662#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:10,988 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 17:08:10,988 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 17:08:10,989 INFO L273 TraceCheckUtils]: 60: Hoare triple {26663#(<= main_~i~1 18)} assume true; {26663#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:10,989 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 17:08:10,990 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 17:08:10,990 INFO L273 TraceCheckUtils]: 63: Hoare triple {26664#(<= main_~i~1 19)} assume true; {26664#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:10,991 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 17:08:10,992 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 17:08:10,992 INFO L273 TraceCheckUtils]: 66: Hoare triple {26665#(<= main_~i~1 20)} assume true; {26665#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:10,992 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 17:08:10,993 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 17:08:10,994 INFO L273 TraceCheckUtils]: 69: Hoare triple {26666#(<= main_~i~1 21)} assume true; {26666#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:10,994 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 17:08:10,995 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 17:08:10,995 INFO L273 TraceCheckUtils]: 72: Hoare triple {26667#(<= main_~i~1 22)} assume true; {26667#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:10,996 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 17:08:10,996 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 17:08:10,997 INFO L273 TraceCheckUtils]: 75: Hoare triple {26668#(<= main_~i~1 23)} assume true; {26668#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:10,997 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 17:08:10,998 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 17:08:10,999 INFO L273 TraceCheckUtils]: 78: Hoare triple {26669#(<= main_~i~1 24)} assume true; {26669#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:10,999 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 17:08:11,000 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 17:08:11,000 INFO L273 TraceCheckUtils]: 81: Hoare triple {26670#(<= main_~i~1 25)} assume true; {26670#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:11,001 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 17:08:11,001 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 17:08:11,002 INFO L273 TraceCheckUtils]: 84: Hoare triple {26671#(<= main_~i~1 26)} assume true; {26671#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:11,002 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 17:08:11,003 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 17:08:11,003 INFO L273 TraceCheckUtils]: 87: Hoare triple {26672#(<= main_~i~1 27)} assume true; {26672#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:11,004 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 17:08:11,005 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 17:08:11,005 INFO L273 TraceCheckUtils]: 90: Hoare triple {26673#(<= main_~i~1 28)} assume true; {26673#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:11,006 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 17:08:11,006 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 17:08:11,007 INFO L273 TraceCheckUtils]: 93: Hoare triple {26674#(<= main_~i~1 29)} assume true; {26674#(<= main_~i~1 29)} is VALID [2018-11-14 17:08:11,007 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 17:08:11,008 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 17:08:11,008 INFO L273 TraceCheckUtils]: 96: Hoare triple {26675#(<= main_~i~1 30)} assume true; {26675#(<= main_~i~1 30)} is VALID [2018-11-14 17:08:11,009 INFO L273 TraceCheckUtils]: 97: Hoare triple {26675#(<= main_~i~1 30)} assume !(~i~1 < 10000); {26644#false} is VALID [2018-11-14 17:08:11,009 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 17:08:11,009 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 17:08:11,010 INFO L273 TraceCheckUtils]: 100: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,010 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 17:08:11,010 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 17:08:11,010 INFO L273 TraceCheckUtils]: 103: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,010 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 17:08:11,010 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 17:08:11,011 INFO L273 TraceCheckUtils]: 106: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,011 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 17:08:11,011 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 17:08:11,011 INFO L273 TraceCheckUtils]: 109: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,011 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 17:08:11,011 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 17:08:11,012 INFO L273 TraceCheckUtils]: 112: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,012 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 17:08:11,012 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 17:08:11,012 INFO L273 TraceCheckUtils]: 115: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,012 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 17:08:11,012 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 17:08:11,012 INFO L273 TraceCheckUtils]: 118: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,012 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 17:08:11,013 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 17:08:11,013 INFO L273 TraceCheckUtils]: 121: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,013 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 17:08:11,013 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 17:08:11,013 INFO L273 TraceCheckUtils]: 124: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,013 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 17:08:11,013 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 17:08:11,013 INFO L273 TraceCheckUtils]: 127: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,013 INFO L273 TraceCheckUtils]: 128: Hoare triple {26644#false} assume !(~i~0 < 10000); {26644#false} is VALID [2018-11-14 17:08:11,013 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 17:08:11,014 INFO L273 TraceCheckUtils]: 130: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,014 INFO L268 TraceCheckUtils]: 131: Hoare quadruple {26644#false} {26644#false} #73#return; {26644#false} is VALID [2018-11-14 17:08:11,014 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 17:08:11,014 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 17:08:11,014 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 17:08:11,014 INFO L273 TraceCheckUtils]: 135: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,014 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 17:08:11,014 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 17:08:11,014 INFO L273 TraceCheckUtils]: 138: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,015 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 17:08:11,015 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 17:08:11,015 INFO L273 TraceCheckUtils]: 141: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,015 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 17:08:11,015 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 17:08:11,015 INFO L273 TraceCheckUtils]: 144: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,015 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 17:08:11,015 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 17:08:11,015 INFO L273 TraceCheckUtils]: 147: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,015 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 17:08:11,016 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 17:08:11,016 INFO L273 TraceCheckUtils]: 150: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,016 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 17:08:11,016 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 17:08:11,016 INFO L273 TraceCheckUtils]: 153: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,016 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 17:08:11,016 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 17:08:11,016 INFO L273 TraceCheckUtils]: 156: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,016 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 17:08:11,016 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 17:08:11,017 INFO L273 TraceCheckUtils]: 159: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,017 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 17:08:11,017 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 17:08:11,017 INFO L273 TraceCheckUtils]: 162: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,017 INFO L273 TraceCheckUtils]: 163: Hoare triple {26644#false} assume !(~i~0 < 10000); {26644#false} is VALID [2018-11-14 17:08:11,017 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 17:08:11,017 INFO L273 TraceCheckUtils]: 165: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,017 INFO L268 TraceCheckUtils]: 166: Hoare quadruple {26644#false} {26644#false} #75#return; {26644#false} is VALID [2018-11-14 17:08:11,017 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 17:08:11,017 INFO L273 TraceCheckUtils]: 168: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,018 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 17:08:11,018 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 17:08:11,018 INFO L273 TraceCheckUtils]: 171: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,018 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 17:08:11,018 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 17:08:11,018 INFO L273 TraceCheckUtils]: 174: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,018 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 17:08:11,018 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 17:08:11,018 INFO L273 TraceCheckUtils]: 177: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,018 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 17:08:11,019 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 17:08:11,019 INFO L273 TraceCheckUtils]: 180: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,019 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 17:08:11,019 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 17:08:11,019 INFO L273 TraceCheckUtils]: 183: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,019 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 17:08:11,019 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 17:08:11,019 INFO L273 TraceCheckUtils]: 186: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,019 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 17:08:11,019 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 17:08:11,020 INFO L273 TraceCheckUtils]: 189: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,020 INFO L273 TraceCheckUtils]: 190: Hoare triple {26644#false} assume !(~i~2 < 9999); {26644#false} is VALID [2018-11-14 17:08:11,020 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 17:08:11,020 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 17:08:11,020 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 17:08:11,020 INFO L273 TraceCheckUtils]: 194: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,020 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 17:08:11,020 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 17:08:11,020 INFO L273 TraceCheckUtils]: 197: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,020 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 17:08:11,021 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 17:08:11,021 INFO L273 TraceCheckUtils]: 200: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,021 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 17:08:11,021 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 17:08:11,021 INFO L273 TraceCheckUtils]: 203: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,021 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 17:08:11,021 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 17:08:11,021 INFO L273 TraceCheckUtils]: 206: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,021 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 17:08:11,021 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 17:08:11,022 INFO L273 TraceCheckUtils]: 209: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,022 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 17:08:11,022 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 17:08:11,022 INFO L273 TraceCheckUtils]: 212: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,022 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 17:08:11,022 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 17:08:11,022 INFO L273 TraceCheckUtils]: 215: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,022 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 17:08:11,022 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 17:08:11,022 INFO L273 TraceCheckUtils]: 218: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,023 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 17:08:11,023 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 17:08:11,023 INFO L273 TraceCheckUtils]: 221: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,023 INFO L273 TraceCheckUtils]: 222: Hoare triple {26644#false} assume !(~i~0 < 10000); {26644#false} is VALID [2018-11-14 17:08:11,023 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 17:08:11,023 INFO L273 TraceCheckUtils]: 224: Hoare triple {26644#false} assume true; {26644#false} is VALID [2018-11-14 17:08:11,023 INFO L268 TraceCheckUtils]: 225: Hoare quadruple {26644#false} {26644#false} #77#return; {26644#false} is VALID [2018-11-14 17:08:11,023 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 17:08:11,023 INFO L273 TraceCheckUtils]: 227: Hoare triple {26644#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26644#false} is VALID [2018-11-14 17:08:11,023 INFO L273 TraceCheckUtils]: 228: Hoare triple {26644#false} assume !false; {26644#false} is VALID [2018-11-14 17:08:11,047 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 17:08:11,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:11,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-14 17:08:11,068 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 229 [2018-11-14 17:08:11,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:11,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 17:08:11,193 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 17:08:11,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 17:08:11,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 17:08:11,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:08:11,195 INFO L87 Difference]: Start difference. First operand 164 states and 168 transitions. Second operand 34 states. [2018-11-14 17:08:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:12,465 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2018-11-14 17:08:12,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-14 17:08:12,465 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 229 [2018-11-14 17:08:12,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:08:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 150 transitions. [2018-11-14 17:08:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:08:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 150 transitions. [2018-11-14 17:08:12,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 150 transitions. [2018-11-14 17:08:12,633 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 17:08:12,636 INFO L225 Difference]: With dead ends: 234 [2018-11-14 17:08:12,636 INFO L226 Difference]: Without dead ends: 168 [2018-11-14 17:08:12,637 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 17:08:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-14 17:08:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-11-14 17:08:12,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:12,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand 167 states. [2018-11-14 17:08:12,693 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 167 states. [2018-11-14 17:08:12,693 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 167 states. [2018-11-14 17:08:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:12,697 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2018-11-14 17:08:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2018-11-14 17:08:12,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:12,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:12,698 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 168 states. [2018-11-14 17:08:12,698 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 168 states. [2018-11-14 17:08:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:12,701 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2018-11-14 17:08:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2018-11-14 17:08:12,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:12,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:12,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:12,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-14 17:08:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2018-11-14 17:08:12,705 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 229 [2018-11-14 17:08:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:12,706 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2018-11-14 17:08:12,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 17:08:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2018-11-14 17:08:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-14 17:08:12,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:12,707 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 17:08:12,708 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:12,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:12,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1093490035, now seen corresponding path program 29 times [2018-11-14 17:08:12,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:12,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:12,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:12,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:12,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat